Bilevel optimization for learning hyperparameters: Application to solving PDEs and inverse problems with Gaussian processes
Methods for solving scientific computing and inference problems, such as kernel- and neural network-based approaches for partial differential equations (PDEs), inverse problems, and supervised learning tasks, depend crucially on the choice of hyperparameters. Specifically, the efficacy of such methods, and in particular their accuracy, stability, and generalization properties, strongly depends on the choice of hyperparameters. While bilevel optimization offers a principled framework for hyperparameter tuning, its nested optimization structure can be computationally demanding, especially in PDE-constrained contexts. In this paper, we propose an efficient strategy for hyperparameter optimization within the bilevel framework by employing a Gauss-Newton linearization of the inner optimization step. Our approach provides closed-form updates, eliminating the need for repeated costly PDE solves. As a result, each iteration of the outer loop reduces to a single linearized PDE solve, followed by explicit gradient-based hyperparameter updates. We demonstrate the effectiveness of the proposed method through Gaussian process models applied to nonlinear PDEs and to PDE inverse problems. Extensive numerical experiments highlight substantial improvements in accuracy and robustness compared to conventional random hyperparameter initialization. In particular, experiments with additive kernels and neural network-parameterized deep kernels demonstrate the method's scalability and effectiveness for high-dimensional hyperparameter optimization.
Code (0)
등록된 구현이 없습니다.
Tasks
Hyperparameter OptimizationBilevel OptimizationGaussian ProcessesSimilar Papers 제목 키워드 기반
A Globally Convergent Gradient-based Bilevel Hyperparameter Optimization Method
Hyperparameter optimization in machine learning is often achieved using naive techniques that only lead to an approximate set of hyperparameters. Although techniques such as Bayesian optimization perform an intelligent s…
Bayesian OptimizationBilevel OptimizationHyperparameter OptimizationA Gradient-based Bilevel Optimization Approach for Tuning Hyperparameters in Machine Learning
Hyperparameter tuning is an active area of research in machine learning, where the aim is to identify the optimal hyperparameters that provide the best performance on the validation set. Hyperparameter tuning is often ac…
Bayesian OptimizationBIG-bench Machine LearningBilevel OptimizationHyperparameter OptimizationBiLO: Bilevel Local Operator Learning for PDE inverse problems
We propose a new neural network based method for solving inverse problems for partial differential equations (PDEs) by formulating the PDE inverse problem as a bilevel optimization problem. At the upper level, we minimiz…
Bilevel OptimizationOperator learningValue Function Based Difference-of-Convex Algorithm for Bilevel Hyperparameter Selection Problems
Gradient-based optimization methods for hyperparameter tuning guarantee theoretical convergence to stationary solutions when for fixed upper-level variable values, the lower level of the bilevel program is strongly conve…
Optimizing Hyperparameters in CNNs using Bilevel Programming in Time Series Data
Hyperparameter optimization has remained a central topic within the machine learning community due to its ability to produce state-of-the-art results. With the recent interest growing in the usage of CNNs for time series…
BIG-bench Machine LearningHyperparameter OptimizationPositionPrediction+3