arXiv Machine Learning

First-order Constrained Trilevel Optimization Over Distributed Networks for Robust Coreset Selection

arXiv:2607. 27632v1 Announce Type: new Abstract: With the rapid advancement of the Internet of Things (IoT), massive amounts of data are generated across distributed edge networks.

Hugging Face Trending Papers
Aug 2

Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap

In recent years, the prevalence of large-scale data-sets and the demand for sophisti-cated learning models have necessitated the development of efficient distributed ma-chine learning (ML) solutions. Convergence speed is a critical factor influencing the practicality and effectiveness of these distributed frameworks.

arXiv Machine Learning
Aug 4

Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap

arXiv:2608. 01220v1 Announce Type: cross Abstract: In recent years, the prevalence of large-scale data-sets and the demand for sophisti-cated learning models have necessitated the development of efficient distributed ma-chine learning (ML) solutions.

By Mohammadreza Doostmohammadian, Amir Ahmad Ghods, Alireza Aghasi, Zulfiya R. Gabidullina, Hamid R. Rabiee
arXiv Machine Learning
Jul 16

Power Homotopy for Zeroth-Order Non-Convex Optimizations

arXiv:2511. 13592v2 Announce Type: replace-cross Abstract: The existing method of GS-PowerOpt solves the non-convex optimization problem of the form $\max_{\boldsymbol{x} \in \mathbb{R}^d} f(\boldsymbol{x})$ through maximizing a Gaussian-smoothed surrogate $F_{N,\sigma}(\boldsymbol{\mu}) = \mathbb{E}_{\boldsymbol{x}\sim\mathcal{N}(\boldsymbol{\mu},\sigma^2 I_d)}[e^{N f(\boldsymbol{x})}]$.

By Chen Xu