Tight L infinity Sample Complexity for Low-Degree and Sparse Boolean Polynomials

arXiv:2606.17319 · stat.ML, cs.LG, math.CO, math.ST · Submitted 2026-06-15 · Read on arXiv

Jasper van Doornmalen, Mathieu Molina, Victor Verdugo, José Verschae

stat.ML, cs.LG, math.CO, math.ST

Submitted: 2026-06-15

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

Terminology

• Sample Complexity — 22× in this paper · explained in 20 episodes
• Trace — 11× in this paper · explained in 2 episodes
• Bayesian Optimization — 6× in this paper · explained in 3 episodes
• Editor — 5× in this paper · explained in 2 episodes
• Lasso — 5× in this paper · explained in 2 episodes
• Hamming Distance — 3× in this paper · explained in 2 episodes
• Papers — 3× in this paper · explained in 3 episodes
• Sparsity — 3× in this paper · explained in 5 episodes
• Annual ACM-SIAM Symposium on Discrete Algorithms — 2× in this paper
• Benchmark — 2× in this paper · explained in 2 episodes
• Core — 2× in this paper · explained in 2 episodes
• Regret — 2× in this paper · explained in 4 episodes
• Adam — 1× in this paper · explained in 3 episodes
• Bayesian Optimization (BO) — 1× in this paper · explained in 5 episodes
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Monotonicity — 1× in this paper · explained in 2 episodes
• Objective Function — 1× in this paper · explained in 2 episodes
• Sample Complexity Bounds — 1× in this paper · explained in 4 episodes

Sources

• High-Dimensional Statistics

Related papers

• Behavior of prediction performance metrics with rare events
• Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
• A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
• Scalable Posterior Uncertainty for Flexible Density-Based Clustering
• A Transport Geometry of Benign Overfitting
• Efficient quadratic entropy with distance sketches