collaborators

7 papers

cs.IT2026

Capacity regimes for Boolean function computation via channels

Jingge Zhu, Matthias Frey

Consider a point-to-point communication system in which the transmitter holds a binary message of length and transmits a corresponding codeword of length . The receiver's go…

cs.IT2026

Universal Denoising without Channel Knowledge

Matthias Frey, Jonathan H. Manton, Jingge Zhu

Inspired by a classical algorithm for online prediction, we propose a novel denoising scheme which is universal for families of probability distributions both in terms of the sourc…

cs.IT2026

On Unified and Sharpened CMI Bounds for Generalization Errors

Yang Lu, Matthias Frey, Margreta Kuijper +1

We present a new family of information-theoretic generalization bounds within the framework of conditional mutual information (CMI). Most of our results are established based on th…

cs.IT2026

Beyond Identification: Computing Boolean Functions via Channels

Jingge Zhu, Matthias Frey

Consider a point-to-point communication system in which the transmitter holds a binary message of length and transmits a corresponding codeword of length . The receiver's go…

cs.LG2026

Online Prediction of Stochastic Sequences with High Probability Regret Bounds

Matthias Frey, Jonathan H. Manton, Jingge Zhu

We revisit the classical problem of universal prediction of stochastic sequences with a finite time horizon known to the learner. The question we investigate is whether it is p…

cs.LG2026

Block-Sample MAC-Bayes Generalization Bounds

Matthias Frey, Jingge Zhu, Michael C. Gastpar

We present a family of novel block-sample MAC-Bayes bounds (mean approximately correct). While PAC-Bayes bounds (probably approximately correct) typically give bounds for the gener…