3 citations · 3 across the 2 of their papers we have counts for
4 papers
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…
Information-theoretic analysis of generalization capability of learning algorithms
Aolin Xu, Maxim Raginsky
We derive upper bounds on the generalization error of a learning algorithm in terms of the mutual information between its input and output. The bounds provide an information-theore…
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…
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…