activity
20152026
most citedInformation-theoretic analysis of generalization capability of learning algorithms

199 citations · 208 across the 10 of their papers we have counts for

collaborators
Showing cs.ITShow all

6 papers · 1 filter

cs.IT2026

Minimum Distortion Quantization with Specified Output Distribution

Aolin Xu

We derive the optimal quantizer of a real-valued random variable with distribution such that 1) the distribution of the quantization output that can take values f…

cs.IT2026

Optimal Feedback Communication with Information Maximization and Distortion Minimization

Aolin Xu

We study the problem of optimally sending a real-valued source through multiple uses of a channel with feedback. First, we state a set of conditions that are sufficient for an enco…

cs.IT2021

Anytime Decoding by Monte-Carlo Tree Search

Aolin Xu

An anytime decoding algorithm for tree codes using Monte-Carlo tree search is proposed. The meaning of anytime decoding here is twofold: 1) the decoding algorithm is an anytime alg…

cs.IT2016

Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation

Aolin Xu, Maxim Raginsky

We derive lower bounds on the Bayes risk in decentralized estimation, where the estimator does not have direct access to the random samples generated conditionally on the random pa…

cs.IT2015★ 1 cited

Information-theoretic lower bounds for distributed function computation

Aolin Xu, Maxim Raginsky

We derive information-theoretic converses (i.e., lower bounds) for the minimum time required by any algorithm for distributed function computation over a network of point-to-point…

cs.IT2015★ 3 cited

Converses for distributed estimation via strong data processing inequalities

Aolin Xu, Maxim Raginsky

We consider the problem of distributed estimation, where local processors observe independent samples conditioned on a common random parameter of interest, map the observations to…