Near-optimal discrete optimization for experimental design: a regret minimization approach

2020/01/10 by Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh +1 · 41 citations
Computer Science · Engineering · Mathematics · #Applied mathematics #Combinatorics #Computer science #Machine Learning and Algorithms #Mathematical analysis #Mathematical optimization #Mathematics #Minification #Optimal design #Polynomial #Regret #Selection (genetic algorithm) #Sparse and Compressive Sensing Techniques #Statistics #Stochastic Gradient Optimization Techniques

paper · doi:10.1007/s10107-019-01464-2

published in Mathematical Programming 186(1-2), 439-478 (Springer Science+Business Media)

openalex publication_date 2020/01/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Citations

• Fast projection onto the simplex and the \pmb l_\mathbf 1 l 1 ball

Cited by

• Efficient Network Reconfiguration by Randomized Switching
• Representation-Based Exploration for Language Models: From Test-Time to Post-Training
• Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
• An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits
• Subset selection for matrices in spectral norm
• Regret-based spectral sensor scheduling for multi-agent estimation
• Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design
• Pure Exploration in Kernel and Neural Bandits
• Collaborative Pure Exploration in Kernel Bandit
• Near Instance Optimal Model Selection for Pure Exploration Linear Bandits
• Active Regression via Linear-Sample Sparsification
• Optimal Online Probe Allocation for Classical and Quantum Network Tomography
• Hardness of A/E-Design under Partition Constraints