Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.06342v1

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.06342v1 (cs)
[Submitted on 7 Oct 2025 ]

Title: A doubly composite Chernoff-Stein lemma and its applications

Title: 一个双重复合Chernoff-Stein引理及其应用

Authors:Ludovico Lami
Abstract: Given a sequence of random variables $X^n=X_1,\ldots, X_n$, discriminating between two hypotheses on the underlying probability distribution is a key task in statistics and information theory. Of interest here is the Stein exponent, i.e. the largest rate of decay (in $n$) of the type II error probability for a vanishingly small type I error probability. When the hypotheses are simple and i.i.d., the Chernoff-Stein lemma states that this is given by the relative entropy between the single-copy probability distributions. Generalisations of this result exist in the case of composite hypotheses, but mostly to settings where the probability distribution of $X^n$ is not genuinely correlated, but rather, e.g., a convex combination of product distributions with components taken from a base set. Here, we establish a general Chernoff-Stein lemma that applies to the setting where both hypotheses are composite and genuinely correlated, satisfying only generic assumptions such as convexity (on both hypotheses) and some weak form of permutational symmetry (on either hypothesis). Our result, which strictly subsumes most prior work, is proved using a refinement of the blurring technique developed in the context of the generalised quantum Stein's lemma [Lami, IEEE Trans. Inf. Theory 2025]. In this refined form, blurring is applied symbol by symbol, which makes it both stronger and applicable also in the absence of permutational symmetry. The second part of the work is devoted to applications: we provide a single-letter formula for the Stein exponent characterising the discrimination of broad families of null hypotheses vs a composite i.i.d. or an arbitrarily varying alternative hypothesis, and establish a 'constrained de Finetti reduction' statement that covers a wide family of convex constraints. Applications to quantum hypothesis testing are explored in a related paper [Lami, arXiv:today].
Abstract: 给定一个随机变量序列$X^n=X_1,\ldots, X_n$,在基础概率分布上区分两个假设是统计学和信息论中的关键任务。 此处关注的是Stein指数,即当类型I错误概率趋于零时,类型II错误概率在$n$方面的最大衰减率。 当假设是简单且独立同分布时,Chernoff-Stein引理指出,这由单个副本概率分布之间的相对熵给出。 在复合假设的情况下,这一结果存在推广,但主要适用于$X^n$的概率分布并非真正相关,而是例如从基本集合中选取的乘积分布的凸组合的情况。 在此工作中,我们建立了一个一般的Chernoff-Stein引理,适用于两个假设都是复合且真正相关的场景,仅需满足一些通用假设,如凸性(在两个假设上)以及某种弱形式的排列对称性(在一个假设上)。 我们的结果严格涵盖了大多数先前的工作,其证明使用了在广义量子Stein引理背景下开发的模糊技术的改进版本[Lami, IEEE Trans. Inf. Theory 2025]。 在这种改进形式下,模糊技术逐个符号应用,使其更强,并且在没有排列对称性的条件下也适用。 工作的第二部分致力于应用:我们提供了一个单字母公式,用于表征区分广泛的零假设与复合独立同分布或任意变化的替代假设的Stein指数,并建立了一个“受限的de Finetti约简”陈述,涵盖了一大类凸约束。 在相关论文[Lami, arXiv:today]中探讨了量子假设检验的应用。
Comments: 50+4 pages
Subjects: Information Theory (cs.IT) ; Mathematical Physics (math-ph); Quantum Physics (quant-ph)
Cite as: arXiv:2510.06342 [cs.IT]
  (or arXiv:2510.06342v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.06342
arXiv-issued DOI via DataCite

Submission history

From: Ludovico Lami [view email]
[v1] Tue, 7 Oct 2025 18:06:30 UTC (57 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math-ph
math.IT
math.MP
quant-ph

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号