:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Carpentier, Alexandra
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning
Online Access:	https://arxiv.org/abs/2406.18672
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Convergence of zeroth-order proximal point algorithms in the high-temperature regime
by: Naldi, Emanuele, et al.
Published: (2026)

CACTO-SL: Using Sobolev Learning to improve Continuous Actor-Critic with Trajectory Optimization
by: Alboni, Elisa, et al.
Published: (2023)

A naive aggregation algorithm for improving generalization in a class of learning problems
by: Befekadu, Getachew K
Published: (2024)

Multi-objective optimisation via the R2 utilities
by: Tu, Ben, et al.
Published: (2023)

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
by: Alecsa, Cristian Daniel
Published: (2021)

Scalarisation-based risk concepts for robust multi-objective optimisation
by: Tu, Ben, et al.
Published: (2024)

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

On the convergence rate of noisy Bayesian Optimization with Expected Improvement
by: Wang, Jingyi, et al.
Published: (2025)

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

Classification under strategic adversary manipulation using pessimistic bilevel optimisation
by: Benfield, David, et al.
Published: (2024)

Meta-learning for sample-efficient Bayesian optimisation of fed-batch processes
by: Langdon, Becky, et al.
Published: (2026)

FastPart: Over-Parameterized Stochastic Gradient Descent for Sparse optimisation on Measures
by: De Castro, Yohann, et al.
Published: (2023)

Online Non-convex Optimization with Long-term Non-convex Constraints
by: Pan, Shijie, et al.
Published: (2023)

The power of small initialization in noisy low-tubal-rank tensor recovery
by: Liu, ZHiyu, et al.
Published: (2026)

Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
by: Li, Bowen, et al.
Published: (2023)

Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
by: Carrasco, Pablo, et al.
Published: (2024)

Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
by: Cutkosky, Ashok, et al.
Published: (2023)

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

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

Nesterov acceleration despite very noisy gradients
by: Gupta, Kanan, et al.
Published: (2023)

Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
by: Andrews, Roland, et al.
Published: (2025)

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

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

Non-convex Stochastic Composite Optimization with Polyak Momentum
by: Gao, Yuan, et al.
Published: (2024)

Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance
by: Chen, Hongxu, et al.
Published: (2026)

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

Random Scaling and Momentum for Non-smooth Non-convex Optimization
by: Zhang, Qinzi, et al.
Published: (2024)

Retraction-Free Decentralized Non-convex Optimization with Orthogonal Constraints
by: Sun, Youbang, et al.
Published: (2024)

A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
by: Sun, Zhenyu, et al.
Published: (2024)

Subdifferentially polynomially bounded functions and Gaussian smoothing-based zeroth-order optimization
by: Lei, Ming, et al.
Published: (2024)

High-probability zeroth-order online convex optimisation beyond Euclidean geometry
by: Janz, David, et al.
Published: (2025)

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

Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
by: Smith, Chandler, et al.
Published: (2024)

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

P-split formulations: A class of intermediate formulations between big-M and convex hull for disjunctive constraints
by: Kronqvist, Jan, et al.
Published: (2022)

Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
by: Zhang, Qi, et al.
Published: (2024)

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

A constrained optimization approach to improve robustness of neural networks
by: Zhao, Shudian, et al.
Published: (2024)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
by: Pedramfar, Mohammad, et al.
Published: (2024)