Efficient Support Recovery of Mixtures of Sparse Linear Classifiers with Fewer Measurements

arXiv:2609.32176 · cs.LG, cs.DS, cs.IT, math.IT · Submitted 2026-09-26 · Read on arXiv

cs.LG, cs.DS, cs.IT, math.IT

Submitted: 2026-09-26

Updated: 2026-10-02

Terminology

• Adaptivity — 6× in this paper · explained in 1 episode
• Clustering — 6× in this paper · explained in 2 episodes
• Adaptive Algorithm — 3× in this paper · explained in 1 episode
• Sparsity — 3× in this paper · explained in 4 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Aggregation — 1× in this paper · explained in 1 episode
• Decode — 1× in this paper · explained in 2 episodes
• IEEE International Symposium on Information Theory — 1× in this paper
• Query Complexity — 1× in this paper · explained in 2 episodes
• Sample Complexity — 1× in this paper · explained in 15 episodes

Sources

• Learning Partitions with Optimal Query and Round Complexities
• Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
• A Fast Binary Splitting Approach to Non-Adaptive Group Testing

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks