AI & ML
Beyond Hypercontractivity: Stronger Communication Converses via R\'enyi Contraction
arXiv math.IT0 views
arXiv:2610.13030v1 Announce Type: new Abstract: We study the relationship between strong data-processing inequalities for R\'enyi divergences and hypercontractivity. For R\'enyi divergences of order greater than one, we characterize the contraction of R\'enyi divergences through a property of the dual Markov operator that we name power contraction. Using the contraction coefficient, we derive an upper bound on rectangle probabilities in terms of their marginals that is at least as strong as the corresponding bound obtained via hypercontractivity. Combining this result with inversion of the binary R\'enyi divergence, we derive communication lower bounds for one-way communication-assisted agreement distillation. Examples involving binary symmetric and rare-event Z-channels illustrate the improvements over standard hypercontractive converses.
Source:https://arxiv.org/abs/2610.13030PreviousLow-Complexity SVD-Based Precoding over Zero-Padded ISI ChannelsNextA Ray-Traced Digital Twin for 5G NR Positioning with OpenAirInterface
Related posts
How I Diagnose a Slow, Loud, or Overheating PC: A Practical Checklist
0dev.to Beginners
You Did Great for Three Days. Then Life Happened. Here Is a Habit System That Survives That.
0dev.to Beginners
Building an Agent Evaluation CI/CD Pipeline: Architecture, Budgets, and Regression Gates
0dev.to Testing
Truncado silencioso: cuando un verificador de LLM da el mismo puntaje a una respuesta correcta y a una incorrecta
0dev.to Testing
Your CI is red because of code you didn't write
0dev.to OpenSource
Summer 2026 Internships: 8 New Openings This Week (Nov 2)
0dev.to Programming