Pages that link to "Item:Q4637044"
From MaRDI portal
The following pages link to Probabilistic Line Searches for Stochastic Optimization (Q4637044):
Displaying 15 items.
- Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches (Q2022225) (← links)
- Data-driven algorithm selection and tuning in optimization and signal processing (Q2043447) (← links)
- Accelerating mini-batch SARAH by step size rules (Q2127094) (← links)
- An empirical study into finding optima in stochastic optimization of neural networks (Q2127118) (← links)
- Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments (Q2234294) (← links)
- A modern retrospective on probabilistic numerics (Q2302460) (← links)
- Stochastic quasi-Newton with line-search regularisation (Q2664231) (← links)
- Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions (Q2693789) (← links)
- Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities (Q4620417) (← links)
- (Q4637023) (← links)
- Probabilistic Line Searches for Stochastic Optimization (Q4637044) (← links)
- A Stochastic Line Search Method with Expected Complexity Analysis (Q5215517) (← links)
- Improved variance reduction extragradient method with line search for stochastic variational inequalities (Q6064028) (← links)
- An overview of stochastic quasi-Newton methods for large-scale machine learning (Q6097379) (← links)
- Adaptive step size rules for stochastic optimization in large-scale learning (Q6116586) (← links)