:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autore principale:	Alecsa, Cristian Daniel
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Optimization and Control Machine Learning
Accesso online:	https://arxiv.org/abs/2110.08531
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Convergence rates of stochastic gradient method with independent sequences of step-size and momentum weight
di: Hwang, Wen-Liang
Pubblicazione: (2024)

Instance-optimal stochastic convex optimization: Can we improve upon sample-average and robust stochastic approximation?
di: Jiang, Liwei, et al.
Pubblicazione: (2026)

Primal-dual algorithm for contextual stochastic combinatorial optimization
di: Bouvier, Louis, et al.
Pubblicazione: (2025)

Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
di: Godichon-Baggioni, Antoine, et al.
Pubblicazione: (2024)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
di: Vernimmen, Pierre, et al.
Pubblicazione: (2025)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
di: Zhang, Huiling, et al.
Pubblicazione: (2023)

A framework for bilevel optimization that enables stochastic and global variance reduction algorithms
di: Dagréou, Mathieu, et al.
Pubblicazione: (2022)

Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration
di: Guo, Luyao, et al.
Pubblicazione: (2026)

Cubic regularized subspace Newton for non-convex optimization
di: Zhao, Jim, et al.
Pubblicazione: (2024)

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
di: Lu, Zhaosong, et al.
Pubblicazione: (2025)

Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
di: Mohammadi, Hesameddin, et al.
Pubblicazione: (2022)

On the SAGA algorithm with decreasing step
di: Fredes, Luis, et al.
Pubblicazione: (2024)

New logarithmic step size for stochastic gradient descent
di: Shamaee, M. Soheil, et al.
Pubblicazione: (2024)

Convergence of empirical subgradients for optimal transport-based objectives
di: Le, Tam
Pubblicazione: (2026)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
di: Lauga, Guillaume
Pubblicazione: (2026)

A simple uniformly optimal method without line search for convex optimization
di: Li, Tianjiao, et al.
Pubblicazione: (2023)

Non-geodesically-convex optimization in the Wasserstein space
di: Luu, Hoang Phuc Hau, et al.
Pubblicazione: (2024)

A simple and improved algorithm for noisy, convex, zeroth-order optimisation
di: Carpentier, Alexandra
Pubblicazione: (2024)

A stochastic gradient method for trilevel optimization
di: Giovannelli, Tommaso, et al.
Pubblicazione: (2025)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
di: Lan, Guanghui, et al.
Pubblicazione: (2024)

Learning based convex approximation for constrained parametric optimization
di: Liu, Kang, et al.
Pubblicazione: (2025)

Reinforcement learning for adaptive interior point methods in convex quadratic programming
di: Bertoncini, Jeremy, et al.
Pubblicazione: (2025)

Nesterov acceleration in benignly non-convex landscapes
di: Gupta, Kanan, et al.
Pubblicazione: (2024)

Variance reduction techniques for stochastic proximal point algorithms
di: Traoré, Cheik, et al.
Pubblicazione: (2023)

Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation
di: Qiao, Tianqi, et al.
Pubblicazione: (2025)

A new use of the Kurdyka-Lojasiewicz property to study asymptotic behaviours of some stochastic optimization algorithms in a non-convex differentiable framework
di: Fest, Jean-Baptiste
Pubblicazione: (2023)

Fast sparse optimization via adaptive shrinkage
di: Cerone, Vito, et al.
Pubblicazione: (2025)

Glocal Smoothness: Line search and adaptive step sizes can help in theory too!
di: Fox, Curtis, et al.
Pubblicazione: (2025)

Dealing with unbounded gradients in stochastic saddle-point optimization
di: Neu, Gergely, et al.
Pubblicazione: (2024)

A stochastic gradient descent algorithm with random search directions
di: Gbaguidi, Eméric
Pubblicazione: (2025)

A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity
di: Davis, Damek, et al.
Pubblicazione: (2026)

Langevin dynamics based algorithm e-TH$\varepsilon$O POULA for stochastic optimization problems with discontinuous stochastic gradient
di: Lim, Dong-Young, et al.
Pubblicazione: (2022)

Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffer
di: Nakul, Milind, et al.
Pubblicazione: (2026)

Fuzzy hyperparameters update in a second order optimization
di: Bensadok, Abdelaziz, et al.
Pubblicazione: (2024)

ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programming
di: Liu, Yu, et al.
Pubblicazione: (2025)

A new perspective on low-rank optimization
di: Bertsimas, Dimitris, et al.
Pubblicazione: (2021)

Unregularized limit of stochastic gradient method for Wasserstein distributionally robust optimization
di: Le, Tam
Pubblicazione: (2025)

A learning-based approach to stochastic optimal control under reach-avoid constraint
di: Ni, Tingting, et al.
Pubblicazione: (2024)

Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise
di: Dorn, Yuriy, et al.
Pubblicazione: (2024)

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
di: Martin, Andrea, et al.
Pubblicazione: (2025)