Bilevel Optimization of Regularization Hyperparameters in Machine Learning

DOI10.1007/978-3-030-52119-6_6MaRDI QIDQ5014628zbMATH OpenOpenAlexFDO

Authors Takayuki Okuno, Akiko Takeda

Publication date 8 December 2021

Published in Bilevel Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-52119-6_6

zbMATH Keywords

hyperparameter optimizationmachine learningsparse regularizer\( \ell_q\)-regularizernonsmooth bilevel optimization

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 5305393 (Why is no real title available?)
• scientific article; zbMATH DE number 3612796 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• scientific article; zbMATH DE number 6276119 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A Statistical View of Some Chemometrics Regression Tools
• A bilevel optimization approach for parameter learning in variational models
• Advanced Lectures on Machine Learning
• Bi-level path following for cross validated solution of kernel quantile regression
• Bilevel optimization with nonsmooth lower level problems
• Classification model selection via bilevel programming
• Lower bound theory of nonzero entries in solutions of _2-_p minimization
• Mathematical Programs with Equilibrium Constraints
• Model selection for primal SVM
• Nearly unbiased variable selection under minimax concave penalty
• On $l_q$ Optimization and Matrix Completion
• Optimality and complexity for constrained optimization problems with nonconvex regularization
• Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
• Regularization and Variable Selection Via the Elastic Net
• Smooth minimization of non-smooth functions
• Smoothing and first order methods: a unified framework
• Smoothing methods for nonsmooth, nonconvex minimization
• Sparsity and Smoothness Via the Fused Lasso
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Variational Analysis

Cited in

(2)

• Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
• On the complexity of inverse bivariate multi-unit assignment valuation problems

This page was built for publication: Bilevel Optimization of Regularization Hyperparameters in Machine Learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014628)