paper-with-me

홈 › Papers

slimTrain -- A Stochastic Approximation Method for Training Separable Deep Neural Networks

2021-09-28 · Elizabeth Newman, Julianne Chung, Matthias Chung, Lars Ruthotto

Deep neural networks (DNNs) have shown their success as high-dimensional function approximators in many applications; however, training DNNs can be challenging in general. DNN training is commonly phrased as a stochastic optimization problem whose challenges include non-convexity, non-smoothness, insufficient regularization, and complicated data distributions. Hence, the performance of DNNs on a given task depends crucially on tuning hyperparameters, especially learning rates and regularization parameters. In the absence of theoretical guidelines or prior experience on similar tasks, this requires solving many training problems, which can be time-consuming and demanding on computational resources. This can limit the applicability of DNNs to problems with non-standard, complex, and scarce datasets, e.g., those arising in many scientific applications. To remedy the challenges of DNN training, we propose slimTrain, a stochastic optimization method for training DNNs with reduced sensitivity to the choice hyperparameters and fast initial convergence. The central idea of slimTrain is to exploit the separability inherent in many DNN architectures; that is, we separate the DNN into a nonlinear feature extractor followed by a linear model. This separability allows us to leverage recent advances made for solving large-scale, linear, ill-posed inverse problems. Crucially, for the linear weights, slimTrain does not require a learning rate and automatically adapts the regularization parameter. Since our method operates on mini-batches, its computational overhead per iteration is modest. In our numerical experiments, slimTrain outperforms existing DNN training methods with the recommended hyperparameter settings and reduces the sensitivity of DNN training to the remaining hyperparameters.

📄 PDF Abstract BibTeX arXiv:2109.14002

Code (1)

xtractopen/meganet.m 공식 구현

Tasks

SensitivityStochastic Optimization

Similar Papers 제목 키워드 기반

Online Learning Under A Separable Stochastic Approximation Framework

2023-05-12 · Min Gan, Xiang-xiang Su, Guang-Yong Chen, Jing Chen

We propose an online learning algorithm for a class of machine learning models under a separable stochastic approximation framework. The essence of our idea lies in the observation that certain parameters in the models a…

HAMSI: A Parallel Incremental Optimization Algorithm Using Quadratic Approximations for Solving Partially Separable Problems

2015-09-05 · Kamer Kaya, Figen Öztoprak, Ş. İlker Birbil, A. Taylan Cemgil 외

We propose HAMSI (Hessian Approximated Multiple Subsets Iteration), which is a provably convergent, second order incremental algorithm for solving large-scale partially separable optimization problems. The algorithm is b…

Optimal variance-reduced stochastic approximation in Banach spaces

2022-01-21 · Wenlong Mou, Koulik Khamaru, Martin J. Wainwright, Peter L. Bartlett 외

We study the problem of estimating the fixed point of a contractive operator defined on a separable Banach space. Focusing on a stochastic query model that provides noisy evaluations of the operator, we analyze a varianc…

Q-Learning

Deep Learning for Mean Field Games with non-separable Hamiltonians

2023-01-07 · Mouhcine Assouli, Badr Missaoui

This paper introduces a new method based on Deep Galerkin Methods (DGMs) for solving high-dimensional stochastic Mean Field Games (MFGs). We achieve this by using two neural networks to approximate the unknown solutions …

Deep Learning

Time-adaptive SympNets for separable Hamiltonian systems

2025-09-19 · Konrad Janik, Peter Benner arxiv

Measurement data is often sampled irregularly i.e. not on equidistant time grids. This is also true for Hamiltonian systems. However, existing machine learning methods, which learn symplectic integrators, such as SympNet…