:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Chayti, El Mahdi, Jaggi, Martin
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Optimization and Control
Acceso en línea:	https://arxiv.org/abs/2409.03682
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Split-Client Approach to Second-Order Optimization
por: Chayti, El Mahdi, et al.
Publicado: (2025)

Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods
por: Chayti, El Mahdi, et al.
Publicado: (2023)

Stochastic Difference-of-Convex Optimization with Momentum
por: Chayti, El Mahdi, et al.
Publicado: (2025)

Improving Stochastic Cubic Newton with Momentum
por: Chayti, El Mahdi, et al.
Publicado: (2024)

RanSOM: Second-Order Momentum with Randomized Scaling for Constrained and Unconstrained Optimization
por: Chayti, El Mahdi
Publicado: (2026)

Stochastic Optimization with Random Search
por: Chayti, El Mahdi, et al.
Publicado: (2025)

Stochastic Compositional Optimization via Hybrid Momentum Frank--Wolfe
por: Chayti, El Mahdi
Publicado: (2026)

Optimization with Access to Auxiliary Information
por: Chayti, El Mahdi, et al.
Publicado: (2022)

Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization
por: Chen, Lesi, et al.
Publicado: (2025)

Memory-Reduced Meta-Learning with Guaranteed Convergence
por: Yang, Honglin, et al.
Publicado: (2024)

Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
por: Li, Yuchen, et al.
Publicado: (2024)

Nonsmooth Optimization with Zeroth Order Comparison Feedback
por: Bakkali, Taha El, et al.
Publicado: (2026)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
por: Koloskova, Anastasia, et al.
Publicado: (2023)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
por: Sherman, Uri, et al.
Publicado: (2025)

Shuffling Heuristic in Variational Inequalities: Establishing New Convergence Guarantees
por: Medyakov, Daniil, et al.
Publicado: (2025)

Learning Over-Relaxation Policies for ADMM with Convergence Guarantees
por: Lin, Junan, et al.
Publicado: (2026)

Stochastic Zeroth-Order Optimization Under Heavy-Tailed Noise
por: Bakkali, Taha El, et al.
Publicado: (2026)

Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
por: Agafonov, Artem, et al.
Publicado: (2025)

Gradient-Normalized Smoothness for Optimization with Approximate Hessians
por: Semenov, Andrei, et al.
Publicado: (2025)

Biased Stochastic First-Order Methods for Conditional Stochastic Optimization and Applications in Meta Learning
por: Hu, Yifan, et al.
Publicado: (2020)

QLABGrad: a Hyperparameter-Free and Convergence-Guaranteed Scheme for Deep Learning
por: Fu, Minghan, et al.
Publicado: (2023)

Greedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guarantees
por: Chen, Chuyan, et al.
Publicado: (2025)

MAP Estimation with Denoisers: Convergence Rates and Guarantees
por: Pesme, Scott, et al.
Publicado: (2025)

Fully First-Order Algorithms for Online Bilevel Optimization
por: Jia, Tingkai, et al.
Publicado: (2026)

Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees
por: Deng, Yuyang, et al.
Publicado: (2024)

Subspace Optimization for Large Language Models with Convergence Guarantees
por: He, Yutong, et al.
Publicado: (2024)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
por: Xiao, Nachuan, et al.
Publicado: (2023)

Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation
por: Ding, Shihong, et al.
Publicado: (2026)

Optimal Local Convergence Rates of Stochastic First-Order Methods under Local $α$-PL
por: Masiha, Saeed, et al.
Publicado: (2024)

Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence
por: Jiao, Yang, et al.
Publicado: (2024)

Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis
por: Hao, Jie, et al.
Publicado: (2024)

Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance
por: Oikonomou, Dimitris, et al.
Publicado: (2024)

Over-parameterised Shallow Neural Networks with Asymmetrical Node Scaling: Global Convergence Guarantees and Feature Learning
por: Caron, Francois, et al.
Publicado: (2023)

High-Probability Convergence Guarantees of Decentralized SGD
por: Armacki, Aleksandar, et al.
Publicado: (2025)

Modified K-means Algorithm with Local Optimality Guarantees
por: Li, Mingyi, et al.
Publicado: (2025)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
por: Gruntkowska, Kaja, et al.
Publicado: (2025)

Stochastic Regret Guarantees for Online Zeroth- and First-Order Bilevel Optimization
por: Nazari, Parvin, et al.
Publicado: (2025)

Variance-Reduced $(\varepsilon,δ)-$Unlearning using Forget Set Gradients
por: Van Waerebeke, Martin, et al.
Publicado: (2026)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
por: Zhang, Liang, et al.
Publicado: (2023)

First Provable Guarantees for Practical Private FL: Beyond Restrictive Assumptions
por: Shulgin, Egor, et al.
Publicado: (2025)