Extensions of the Regret-Minimization Algorithm for Optimal Design
SIAM Journal on Matrix Analysis and Applications · 30.06.2026 · 47 (2) · 976-1027
DOI: 10.1137/25m1753097 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Matrix Analysis and Applications, online erschienen am 24.06.2026. Verfasst von Youguang Chen und 1 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Gefördert von: National Science Foundation, Simons Foundation, U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Applied Mathematics program, Mathematical Multifaceted Integrat….
Abstract (Originalsprache)
We consider the problem of selecting a subset of points from a dataset of [Formula: see text] unlabeled examples for labeling, with the goal of training a multiclass classifier. To address this, we build upon the regret minimization framework introduced by Allen-Zhu et al. [ Near-optimal design of experiments via regret minimization, in Proceedings of the 34th International Conference on Machine Learning, PMLR 70, 2017, pp. 126–135]. We propose an alternative regularization scheme within this framework, which leads to a new sample selection objective along with a provable sample complexity bound that guarantees a [Formula: see text]-approximate solution. Additionally, we extend the regret minimization approach to handle experimental design in the ridge regression setting. We evaluate the selected samples using logistic regression and compare performance against several state-of-the-art methods. Our empirical results on MNIST, CIFAR-10, and a 50-class subset of ImageNet demonstrate that our method consistently outperforms competing approaches across most scenarios.
Förderung
- National Science Foundation
- Simons Foundation
- U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Applied Mathematics program, Mathematical Multifaceted Integrat…
- U.S. Department of Energy, National Nuclear Security Administration
- U.S. National Institute on Aging
Zitieren
APA
Chen, Y., & Biros, G. (2026). Extensions of the Regret-Minimization Algorithm for Optimal Design. SIAM Journal on Matrix Analysis and Applications, 47(2), 976-1027. https://doi.org/10.1137/25m1753097
Vancouver
Chen Y, Biros G. Extensions of the Regret-Minimization Algorithm for Optimal Design. SIAM Journal on Matrix Analysis and Applications. 2026;47(2):976-1027. doi:10.1137/25m1753097
BibTeX
@article{Chen2026,
author = {Chen, Youguang and Biros, George},
title = {Extensions of the Regret-Minimization Algorithm for Optimal Design},
journal = {SIAM Journal on Matrix Analysis and Applications},
year = {2026},
volume = {47},
number = {2},
pages = {976--1027},
doi = {10.1137/25m1753097}
}
EUVIMED