The following pages link to AdaGrad (Q33997):
Displayed 50 items.
- On data preconditioning for regularized loss minimization (Q285940) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- Adaptive regularization of weight vectors (Q374184) (← links)
- Weighted last-step min-max algorithm with improved sub-logarithmic regret (Q465257) (← links)
- A generalized online mirror descent with applications to classification and regression (Q493737) (← links)
- Minimizing finite sums with the stochastic average gradient (Q517295) (← links)
- Weak adversarial networks for high-dimensional partial differential equations (Q777606) (← links)
- Learning probabilistic termination proofs (Q832245) (← links)
- Feature-aware regularization for sparse online learning (Q893629) (← links)
- On better training the infinite restricted Boltzmann machines (Q1621866) (← links)
- Background information of deep learning for structural engineering (Q1639595) (← links)
- Stochastic optimization using a trust-region method and random models (Q1646570) (← links)
- Inexact proximal stochastic gradient method for convex composite optimization (Q1694394) (← links)
- The mechanism of additive composition (Q1697927) (← links)
- A machine learning approach for efficient uncertainty quantification using multiscale methods (Q1700748) (← links)
- Gaussian variational approximation with sparse precision matrices (Q1702005) (← links)
- Scale-free online learning (Q1704560) (← links)
- Ensemble clustering for efficient robust optimization of naturally fractured reservoirs (Q1710311) (← links)
- A unified framework for stochastic optimization (Q1719609) (← links)
- Hyperlink regression via Bregman divergence (Q1980417) (← links)
- Stochastic gradient descent with Polyak's learning rate (Q1983178) (← links)
- Machine learning in cardiovascular flows modeling: predicting arterial blood pressure from non-invasive 4D flow MRI data using physics-informed neural networks (Q1989082) (← links)
- An online-learning-based evolutionary many-objective algorithm (Q1999048) (← links)
- Deep UQ: learning deep neural network surrogate models for high dimensional uncertainty quantification (Q2002273) (← links)
- Selection dynamics for deep neural networks (Q2003969) (← links)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
- PPINN: parareal physics-informed neural network for time-dependent PDEs (Q2020276) (← links)
- A physics-informed deep learning framework for inversion and surrogate modeling in solid mechanics (Q2021893) (← links)
- Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches (Q2022225) (← links)
- A selective overview of deep learning (Q2038303) (← links)
- p-kernel Stein variational gradient descent for data assimilation and history matching (Q2040686) (← links)
- Data-driven algorithm selection and tuning in optimization and signal processing (Q2043447) (← links)
- Incremental without replacement sampling in nonconvex optimization (Q2046568) (← links)
- Synthetic-aperture radar image based positioning in GPS-denied environments using deep cosine similarity neural networks (Q2047287) (← links)
- Material optimization of tri-directional functionally graded plates by using deep neural network and isogeometric multimesh design approach (Q2049828) (← links)
- Machine learning to approximate free-surface Green's function and its application in wave-body interactions (Q2058093) (← links)
- Sequential convergence of AdaGrad algorithm for smooth convex optimization (Q2060570) (← links)
- Learning context-dependent choice functions (Q2069057) (← links)
- Adaptive optimization with periodic dither signals (Q2070015) (← links)
- Fast selection of nonlinear mixed effect models using penalized likelihood (Q2072413) (← links)
- Stochastic Markov gradient descent and training low-bit neural networks (Q2073135) (← links)
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning (Q2073715) (← links)
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization (Q2077960) (← links)
- An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
- SRKCD: a stabilized Runge-Kutta method for stochastic optimization (Q2088772) (← links)
- Reinforcement learning for the knapsack problem (Q2089607) (← links)
- Quantifying scrambling in quantum neural networks (Q2090812) (← links)
- An application of the splitting-up method for the computation of a neural network representation for the solution for the filtering equations (Q2093308) (← links)
- SABRINA: a stochastic subspace majorization-minimization algorithm (Q2095568) (← links)
- Constructing unbiased gradient estimators with finite variance for conditional stochastic optimization (Q2095692) (← links)