Imagen de Portada

An Asynchronous Decentralised Optimisation Algorithm for Nonconvex Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mafakheri, Behnam, Manton, Jonathan H., Shames, Iman
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm
por: Farzin, Amir Ali, et al.
Publicado: (2025)

On the Stability Connection Between Discrete-Time Algorithms and Their Resolution ODEs: Applications to Min-Max Optimisation
por: Farzin, Amir Ali, et al.
Publicado: (2026)

Online Non-Stationary Stochastic Quasar-Convex Optimization
por: Pun, Yuen-Man, et al.
Publicado: (2024)

Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles
por: Farzin, Amir Ali, et al.
Publicado: (2024)

From Cursed to Competitive: Closing the ZO-FO Gap via Input-to-State Stability
por: Farzin, Amir Ali, et al.
Publicado: (2026)

Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings
por: Markou, Evan, et al.
Publicado: (2025)

Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise
por: Wu, Yidong, et al.
Publicado: (2026)

Completely Parameter-Free Single-Loop Algorithms for Nonconvex-Concave Minimax Problems
por: Yang, Junnan, et al.
Publicado: (2024)

Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems
por: Xu, Zi, et al.
Publicado: (2021)

Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
por: Farzin, Amir Ali, et al.
Publicado: (2026)

A PAC-Bayes Approach for Controlling Unknown Linear Discrete-time Systems
por: Luo, Yujia, et al.
Publicado: (2026)

ZORMS-LfD: Learning from Demonstrations with Zeroth-Order Random Matrix Search
por: Dry, Olivia, et al.
Publicado: (2025)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
por: Zhang, Jiawei, et al.
Publicado: (2020)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
por: Lin, Tianyi, et al.
Publicado: (2019)

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints
por: Zhang, Huiling, et al.
Publicado: (2024)

Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations
por: Tyurin, Alexander, et al.
Publicado: (2024)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
por: Chen, Lesi, et al.
Publicado: (2023)

An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
por: Chen, Lesi, et al.
Publicado: (2022)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
por: Lin, Tianyi, et al.
Publicado: (2024)

Minimisation of Submodular Functions Using Gaussian Zeroth-Order Random Oracles
por: Farzin, Amir Ali, et al.
Publicado: (2025)

Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
por: Huang, Ruichuan, et al.
Publicado: (2025)

TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization
por: Li, Xiang, et al.
Publicado: (2022)

An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization
por: Kornowski, Guy, et al.
Publicado: (2023)

Towards An Efficient Approach for the Nonconvex $\ell_p$ Ball Projection: Algorithm and Analysis
por: Yang, Xiangyu, et al.
Publicado: (2021)

A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
por: Tyurin, Alexander, et al.
Publicado: (2022)

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
por: Alacaoglu, Ahmet, et al.
Publicado: (2024)

Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles
por: Farzin, Amir Ali, et al.
Publicado: (2025)

Global Convergence of a Line-Search Filter Differential Dynamic Programming Method
por: Xu, Ming, et al.
Publicado: (2026)

Deterministic Nonsmooth Nonconvex Optimization
por: Jordan, Michael I., et al.
Publicado: (2023)

Decentralized Sum-of-Nonconvex Optimization
por: Liu, Zhuanghua, et al.
Publicado: (2024)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
por: Tran-Dinh, Quoc, et al.
Publicado: (2024)

Joint State and Noise Covariance Estimation
por: Khosoussi, Kasra, et al.
Publicado: (2025)

Proximal Operators of Sorted Nonconvex Penalties
por: Gagneux, Anne, et al.
Publicado: (2025)

Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization
por: Huang, Feihu, et al.
Publicado: (2023)

A Fundamental Convergence Rate Bound for Gradient Based Online Optimization Algorithms with Exact Tracking
por: Wu, Alex Xinting, et al.
Publicado: (2025)

Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective
por: Srinivasan, Vishwak, et al.
Publicado: (2025)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
por: Zhou, Dongruo, et al.
Publicado: (2018)

Online Nonconvex Bilevel Optimization with Bregman Divergences
por: Bohne, Jason, et al.
Publicado: (2024)

A Learned Proximal Alternating Minimization Algorithm and Its Induced Network for a Class of Two-block Nonconvex and Nonsmooth Optimization
por: Chen, Yunmei, et al.
Publicado: (2024)

Modular Distributed Nonconvex Learning with Error Feedback
por: Carnevale, Guido, et al.
Publicado: (2025)