AI & ML
Exact Second-Order Asymptotics for the Discrete Wyner--Ziv Problem
arXiv math.IT0 views
arXiv:2610.11998v1 Announce Type: new Abstract: We revisit the discrete Wyner--Ziv problem and establish exact second-order asymptotics. Our main contribution is a second-order converse bound, which is derived using posterior decomposition, concentration inequalities, and a conditional Gaussian approximation for martingales. Furthermore, we extend the previous best known achievability result of Li and Li (arXiv 2025) by allowing the test channel to depend on the type of the observed source sequence. Exact second-order asymptotics are established by combining our achievability and converse bounds. In particular, we show that the achievability bound of Li and Li (arXiv 2025) is not optimal in general. Specifically, we provide two numerical examples to illustrate our results: a binary asymmetric source and a quaternary source. For the first example, the achievability bound of Li and Li (arXiv 2025) achieves the optimal second-order asymptotics. However, in the second example, we show that our achievability result is optimal, which reduces the second-order coding rate of Li and Li (arXiv 2025) by $10.77\%$ at the excess-distortion probability of $0.1$ and by $21.35\%$ at the excess-distortion probability of $0.2$.
Source:https://arxiv.org/abs/2610.11998PreviousEstimation with Quantized Parameter Side-InformationNextThresholds for Local Coordinate-Wise Linear Properties of Random One-Point AG Codes
Related posts

Here’s how to listen live to Apple’s Q4 2026 earnings call
09to5Mac
Can AI Write CAD? Testing LLM-Generated 3D Models for Manufacturability
0HackerNoon
Guardz Integrates Palo Alto Networks Prisma Browser Protection to Address Growing Workspace Security
0HackerNoon

LinearB Launches Agentic Studio to Steer AI Coding Agents in a $127 Billion Market by 2032
0HackerNoon
We Built a Test to Catch Contact Forms That Lie. It Lied to Us Five Times First
0HackerNoon

The TechBeat: Why Knowledge Graphs and Ontologies Are Making a Comeback in the Age of AI (11/2/2026)
0HackerNoon