Copertina

CLASP: An online learning algorithm for Convex Losses And Squared Penalties

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ferreira, Ricardo N., Xavier, João, Soares, Cláudia
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimal Bounds for Adversarial Constrained Online Convex Optimization
di: Ferreira, Ricardo N., et al.
Pubblicazione: (2025)

Online Learning for Dynamic Constellation Topologies
di: Norberto, João, et al.
Pubblicazione: (2026)

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

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

On Penalty-based Bilevel Gradient Descent Method
di: Shen, Han, et al.
Pubblicazione: (2023)

Probability of Collision of satellites and space debris for short-term encounters: Rederivation and fast-to-compute upper and lower bounds
di: Ferreira, Ricardo, et al.
Pubblicazione: (2023)

Input Convex Kolmogorov Arnold Networks
di: Deschatre, Thomas, et al.
Pubblicazione: (2025)

A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage
di: Bach, Francis
Pubblicazione: (2025)

Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
di: Zheng, Yuping, et al.
Pubblicazione: (2025)

Position: Adopt Constraints Over Fixed Penalties in Deep Learning
di: Ramirez, Juan, et al.
Pubblicazione: (2025)

Self-Supervised Penalty-Based Learning for Robust Constrained Optimization
di: Benslimane, Wyame, et al.
Pubblicazione: (2025)

Principled Penalty-based Methods for Bilevel Reinforcement Learning and RLHF
di: Shen, Han, et al.
Pubblicazione: (2024)

Are Convex Optimization Curves Convex?
di: Barzilai, Guy, et al.
Pubblicazione: (2025)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
di: Barakat, Anas, et al.
Pubblicazione: (2026)

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
di: Kümmerle, Christian, et al.
Pubblicazione: (2023)

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
di: Kwon, Jeongyeol, et al.
Pubblicazione: (2023)

A Penalty Approach for Differentiation Through Black-Box Quadratic Programming Solvers
di: Linghu, Yuxuan, et al.
Pubblicazione: (2026)

A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints
di: Jiang, Liuyuan, et al.
Pubblicazione: (2024)

Generalizing Trilateration: Approximate Maximum Likelihood Estimator for Initial Orbit Determination in Low-Earth Orbit
di: Ferreira, Ricardo, et al.
Pubblicazione: (2024)

Efficient Penalty-Based Bilevel Methods: Improved Analysis, Novel Updates, and Flatness Condition
di: Jiang, Liuyuan, et al.
Pubblicazione: (2025)

Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces
di: Kamoutsi, Angeliki, et al.
Pubblicazione: (2024)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
di: Shen, Yiyang, et al.
Pubblicazione: (2026)

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

Accelerated Gradient Methods for Sparse Statistical Learning with Nonconvex Penalties
di: Yang, Kai, et al.
Pubblicazione: (2020)

Bandit Convex Optimisation
di: Lattimore, Tor
Pubblicazione: (2024)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
di: Dahal, Hari, et al.
Pubblicazione: (2023)

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

A note on continuous-time online learning
di: Ying, Lexing
Pubblicazione: (2024)

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

Robust Least-Squares Optimization for Data-Driven Predictive Control: A Geometric Approach
di: Bharadwaj, Shreyas, et al.
Pubblicazione: (2025)

Early predicting of hospital admission using machine learning algorithms: Priority queues approach
di: Antczak, Jakub, et al.
Pubblicazione: (2026)

Convex Dominance in Deep Learning I: A Scaling Law of Loss and Learning Rate
di: Bu, Zhiqi, et al.
Pubblicazione: (2026)

Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses
di: Lowy, Andrew, et al.
Pubblicazione: (2021)

Ultra-fast feature learning for the training of two-layer neural networks in the two-timescale regime
di: Barboni, Raphaël, et al.
Pubblicazione: (2025)

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

The Price of Adaptivity in Stochastic Convex Optimization
di: Carmon, Yair, et al.
Pubblicazione: (2024)

Online Convex Optimization with Unbounded Memory
di: Kumar, Raunak, et al.
Pubblicazione: (2022)

Astral Space: Convex Analysis at Infinity
di: Dudík, Miroslav, et al.
Pubblicazione: (2022)

Smooth Quasar-Convex Optimization with Constraints
di: Martínez-Rubio, David
Pubblicazione: (2025)

Unconstrained Robust Online Convex Optimization
di: Zhang, Jiujia, et al.
Pubblicazione: (2025)