Mutual Information Constrained Chernoff Bottleneck

arXiv:2609.37994 · cs.IT, cs.LG, math.IT, math.OC, math.ST, stat.ML, stat.TH · Submitted 2026-09-29 · Read on arXiv

cs.IT, cs.LG, math.IT, math.OC, math.ST, stat.ML, stat.TH

Submitted: 2026-09-29

Updated: 2026-09-29

Terminology

• Representation Learning — 4× in this paper · explained in 2 episodes
• Accuracy — 3× in this paper · explained in 1 episode
• Alternating Optimization Algorithm — 3× in this paper · explained in 1 episode
• Contrastive Learning — 3× in this paper · explained in 5 episodes
• Downstream Tasks — 1× in this paper · explained in 2 episodes
• Edge Devices — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• International Conference on Machine Learning — 1× in this paper
• Quantization — 1× in this paper · explained in 12 episodes
• Regret — 1× in this paper · explained in 3 episodes
• Self-Supervised Learning — 1× in this paper · explained in 8 episodes

Sources

• DINOv3
• Sharp Regret Bounds and a Task-Covariance Correction for Spectral Representation Learning
• Opening the Black Box of Deep Neural Networks via Information

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions