Universal Feature Selection with Noisy Observations and Weak Symmetry Conditions

arXiv:2605.09396 · cs.IT, cs.LG, math.IT, math.ST, stat.ML, stat.TH · Submitted 2026-05-10 · Read on arXiv

cs.IT, cs.LG, math.IT, math.ST, stat.ML, stat.TH

Submitted: 2026-05-10

Updated: 2026-09-15

Comments: 6 pages, 0 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Feature Selection — 17× in this paper · explained in 4 episodes
• Error Exponents — 4× in this paper · explained in 2 episodes
• Fisher Information — 3× in this paper · explained in 3 episodes
• Representation Learning — 2× in this paper · explained in 2 episodes
• Robustness — 2× in this paper · explained in 5 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Explainability — 1× in this paper · explained in 3 episodes
• Score Function — 1× in this paper · explained in 4 episodes

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions