Feedback Coding for Active Learning
Not on the map. Why?
Abstract (arXiv)
The iterative selection of examples for labeling in active machine learning is conceptually similar to feedback channel coding in information theory: in both tasks, the objective is to seek a minimal sequence of actions to encode information in the presence of noise. While this high-level overlap has been previously noted, there remain open questions on how to best formulate active learning as a communications system to leverage existing analysis and algorithms in feedback coding. In this work, we formally identify and leverage the structural commonalities between the two problems, including the characterization of encoder and noisy channel components, to design a new algorithm. Specifically, we develop an optimal transport-based feedback coding scheme called Approximate Posterior Matching (APM) for the task of active example selection and explore its application to Bayesian logistic regression, a popular model in active learning. We evaluate APM on a variety of datasets and demonstrate learning performance comparable to existing active learning methods, at a reduced computational cost. These results demonstrate the potential of directly deploying concepts from feedback channel coding to design efficient active learning strategies.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 53 references that are in the map. First posted on arXiv 28 Feb 2021.
Builds on
11 of 53 references.
References · 11
- 2017Deep Bayesian Active Learning with Image Datacited by 812
- 2017Wasserstein GANcited by 635
- 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 602
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 428
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
- 2019Variational Adversarial Active Learningcited by 284
- 2021On Statistical Bias In Active Learning: How and When To Fix Itcited by 72
- 2019Bayesian Batch Active Learning as Sparse Subset Approximationcited by 68
- 2016A Benchmark and Comparison of Active Learning for Logistic Regressioncited by 36
- 2020Efficient active learning of sparse halfspaces with arbitrary bounded noisecited by 29
- 2018Teacher Improves Learning by Selecting a Training Subsetcited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.