Information theory. From coding to learning (to appear)

MaRDI QIDQ6579859zbMATH OpenFDO

Authors Yury Polyanskiy, Yihong Wu

Publication date 29 July 2024

zbMATH Keywords

\(f\)-divergencesentropic upper bounds for statistical estimationKolmogorov's metric entropyPAC Bayes and variational principlestatistical learningstrong data processing inequalities

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Learning and adaptive systems in artificial intelligence (68T05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• Elements of Information Theory
• An introduction to single-user information theory
• Information theory. Coding theorems for discrete memoryless systems
• Information theory and coding by example
• Probability and Information

Cited in

(18)

• Exercises in applied mathematics. With a view toward information theory, machine learning, wavelets, and statistical physics
• Dualizing Le Cam's method for functional estimation. I: General theory
• Concentration inequalities for log-concave sequences
• Wasserstein gradient flows for Moreau envelopes of f-divergences in reproducing kernel Hilbert spaces
• Bayesian design principles for frequentist sequential learning
• Spectral estimators for structured generalized linear models via approximate message passing
• Constructive approximate transport maps with normalizing flows
• Information-theoretic generalization bounds for transductive learning and its applications
• Channel simulation: theory and applications to lossy compression and differential privacy
• Maximizing entropy with an expectation constraint and one-parameter exponential families of distributions: a reexamination
• A case study on the long-time behavior of the Gaussian local-field equation
• Estimation of discrete distributions in relative entropy, and the deviations of the missing mass
• Algorithmic randomness and the weak merging of computable probability measures
• Attainability of two-point testing rates for finite-sample location estimation
• Approximate independence of permutation mixtures
• Geometric planted matchings beyond the Gaussian model
• Tighter bit-security bounds in quantum key search via the Chebyshev distance
• On circuit private, multikey and threshold approximate homomorphic encryption

This page was built for publication: Information theory. From coding to learning (to appear)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579859)