Copertina

Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	de Vazelhes, William, Yuan, Xiao-Tong, Gu, Bin
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Iterative Regularization with k-support Norm: An Important Complement to Sparse Recovery
di: de Vazelhes, William, et al.
Pubblicazione: (2023)

Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity
di: de Vazelhes, William, et al.
Pubblicazione: (2022)

Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control
di: Feng, Lechen, et al.
Pubblicazione: (2024)

Unlocking Global Optimality in Bilevel Optimization: A Pilot Study
di: Xiao, Quan, et al.
Pubblicazione: (2024)

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

Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogate
di: Pham, Hung, et al.
Pubblicazione: (2025)

Projection-free Online Learning over Strongly Convex Sets
di: Wan, Yuanyu, et al.
Pubblicazione: (2020)

A Recovery Guarantee for Sparse Neural Networks
di: Fridovich-Keil, Sara, et al.
Pubblicazione: (2025)

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Penalty Approach
di: Feng, Lechen, et al.
Pubblicazione: (2025)

Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization
di: Xiao, Nachuan, et al.
Pubblicazione: (2023)

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Non-Penalty Approach
di: Feng, Lechen, et al.
Pubblicazione: (2025)

A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
di: Zhou, Yuhao, et al.
Pubblicazione: (2025)

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

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

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

Optimal Projection-Free Adaptive SGD for Matrix Optimization
di: Kovalev, Dmitry
Pubblicazione: (2026)

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

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
di: Wang, Lei, et al.
Pubblicazione: (2025)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
di: Chen, Hao, et al.
Pubblicazione: (2026)

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

Approximate FW Algorithm with a novel DMO method over Graph-structured Support Set
di: Pan, Yijian, et al.
Pubblicazione: (2024)

Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneity
di: Shi, Qiankun, et al.
Pubblicazione: (2025)

From PowerSGD to PowerSGD+: Low-Rank Gradient Compression for Distributed Optimization with Convergence Guarantees
di: Xie, Shengping, et al.
Pubblicazione: (2025)

Towards Robust Learning to Optimize with Theoretical Guarantees
di: Song, Qingyu, et al.
Pubblicazione: (2025)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
di: Maran, Davide, et al.
Pubblicazione: (2026)

Collaborative Pareto Set Learning in Multiple Multi-Objective Optimization Problems
di: Shang, Chikai, et al.
Pubblicazione: (2024)

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

Learning Neural Contracting Dynamics: Extended Linearization and Global Guarantees
di: Jaffe, Sean, et al.
Pubblicazione: (2024)

Data-driven Reachable Set Estimation with Tunable Adversarial and Wasserstein Distributional Guarantees
di: Pantazis, Georgios, et al.
Pubblicazione: (2026)

FedSGM: A Unified Framework for Constraint Aware, Bidirectionally Compressed, Multi-Step Federated Optimization
di: Upadhyay, Antesh, et al.
Pubblicazione: (2026)

Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance
di: Chen, Lisha, et al.
Pubblicazione: (2025)

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

Data-Driven Performance Guarantees for Classical and Learned Optimizers
di: Sambharya, Rajiv, et al.
Pubblicazione: (2024)

On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization
di: Kornowski, Guy, et al.
Pubblicazione: (2024)

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

Quantization through Piecewise-Affine Regularization: Optimization and Statistical Guarantees
di: Ma, Jianhao, et al.
Pubblicazione: (2025)

A Guaranteed-Stable Neural Network Approach for Optimal Control of Nonlinear Systems
di: Li, Anran, et al.
Pubblicazione: (2025)

Learning-Based Optimal Control with Performance Guarantees for Unknown Systems with Latent States
di: Lefringhausen, Robert, et al.
Pubblicazione: (2023)

Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime
di: Zhang, Richard Y.
Pubblicazione: (2021)

Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization
di: Zhang, Richard Y.
Pubblicazione: (2022)