Provably Data-driven Multiple Hyper-parameter Tuning with Structured Loss Function
QUOC TUNG LE, Anh Nguyen, Viet Anh Nguyen
摘要
Data-driven algorithm design automates hyperparameter tuning, but its statistical foundations remain limited because model performance can depend on hyperparameters in implicit and highly non-smooth ways. Existing guarantees focus on the simple case of a one-dimensional (scalar) hyperparameter. This leaves the practically important, multi-dimensional hyperparameter tuning setting unresolved. We address this open question by establishing the first general framework for establishing generalization guarantees for tuning multi-dimensional hyperparameters in data-driven settings. Our approach strengthens the generalization guarantee framework for semi-algebraic function classes by exploiting tools from real algebraic geometry, yielding sharper, more broadly applicable guarantees. For completeness, we also instantiate the first lower bound for this general setting. We further extend the analysis to hyperparameter tuning using the validation loss under minimal assumptions, and derive improved bounds when additional structure is available. Finally, we demonstrate the scope of the framework with new learnability results, including data-driven weighted group lasso and weighted fused lasso.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper8
- Sample Complexity of Tree Search Configuration: Cutting Planes and BeyondMaria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen VitercikNeurIPS 2021 · 被引用 54 次
- New Bounds for Hyperparameter Tuning of Regression Problems Across InstancesMaria-Florina Balcan, Anh Nguyen, Dravyansh SharmaNeurIPS 2023 · 被引用 19 次
- Sample complexity of data-driven tuning of model hyperparameters in neural networks with structured parameter-dependent dual functionMaria-Florina Balcan, Anh Nguyen, Dravyansh SharmaNeurIPS 2025 · 被引用 14 次
- Generalization Bound and Learning Methods for Data-Driven Projections in Linear ProgrammingShinsaku Sakaue, Taihei OkiNeurIPS 2024 · 被引用 13 次
- Generalization Guarantees for Learning Score-Based Branch-and-Cut Policies in Integer ProgrammingHongyu Cheng, Amitabh BasuNeurIPS 2025 · 被引用 6 次
相关 Paper
- How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm designMaria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford 等STOC 2021 · 被引用 3 次
- Learning Configurations for Data-Driven Multi-Objective OptimizationZhiyang Chen, Hailong Yao, Xia YinICML 2025
- Provably tuning the ElasticNet across instancesMaria-Florina Balcan, Misha Khodak, Dravyansh Sharma, Ameet TalwalkarNeurIPS 2022 · 被引用 28 次
- Stability and Generalization of Bilevel Programming in Hyperparameter OptimizationFan Bao, Guoqiang Wu, Chongxuan Li, Jun Zhu 等NeurIPS 2021 · 被引用 53 次
- Safeguarded Learned Convex OptimizationHoward Heaton, Xiaohan Chen, Zhangyang Wang, Wotao YinAAAI 2023 · 被引用 33 次
