Copertina

Universal Architectures for the Learning of Polyhedral Norms and Convex Regularizers

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Unser, Michael, Ducotterd, Stanislas
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Controlled Learning of Pointwise Nonlinearities in Neural-Network-Like Architectures
di: Unser, Michael, et al.
Pubblicazione: (2024)

Parseval Convolution Operators and Neural Networks
di: Unser, Michael, et al.
Pubblicazione: (2024)

Multivariate Fields of Experts for Convergent Image Reconstruction
di: Ducotterd, Stanislas, et al.
Pubblicazione: (2025)

SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions
di: Liu, Kang, et al.
Pubblicazione: (2026)

Small Gradient Norm Regret for Online Convex Optimization
di: Gao, Wenzhi, et al.
Pubblicazione: (2026)

Learning of Patch-Based Smooth-Plus-Sparse Models for Image Reconstruction
di: Ducotterd, Stanislas, et al.
Pubblicazione: (2024)

Learning Regularization Functionals for Inverse Problems: A Comparative Study
di: Hertrich, Johannes, et al.
Pubblicazione: (2025)

When Deep Learning Meets Polyhedral Theory: A Survey
di: Huchette, Joey, et al.
Pubblicazione: (2023)

Piecewise Linearity of Min-Norm Solution Map of a Nonconvexly Regularized Convex Sparse Model
di: Zhang, Yi, et al.
Pubblicazione: (2023)

Differentiable Convex Optimization Layers in Neural Architectures: Foundations and Perspectives
di: Katyal, Calder
Pubblicazione: (2024)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
di: Zhao, Peng, et al.
Pubblicazione: (2025)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
di: Zhan, Jingxin, et al.
Pubblicazione: (2025)

Undersampled Phase Retrieval with Image Priors
di: Ducotterd, Stanislas, et al.
Pubblicazione: (2025)

Universal Online Convex Optimization with $1$ Projection per Round
di: Yang, Wenhao, et al.
Pubblicazione: (2024)

Universal Online Convex Optimization Meets Second-order Bounds
di: Zhang, Lijun, et al.
Pubblicazione: (2021)

Training Deep Learning Models with Norm-Constrained LMOs
di: Pethick, Thomas, et al.
Pubblicazione: (2025)

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

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

Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed
di: Chezhegov, Savelii, et al.
Pubblicazione: (2024)

Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems
di: Shen, Weiping, et al.
Pubblicazione: (2026)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
di: Lekeufack, Jordan, et al.
Pubblicazione: (2024)

Deep Reinforcement Learning: A Convex Optimization Approach
di: Gattami, Ather
Pubblicazione: (2024)

Learning Algorithm Hyperparameters for Fast Parametric Convex Optimization
di: Sambharya, Rajiv, et al.
Pubblicazione: (2024)

Learning-Augmented Decentralized Online Convex Optimization in Networks
di: Li, Pengfei, et al.
Pubblicazione: (2023)

Online (Non-)Convex Learning via Tempered Optimism
di: Haddouche, Maxime, et al.
Pubblicazione: (2023)

Sparse Transformer Architectures via Regularized Wasserstein Proximal Operator with $L_1$ Prior
di: Han, Fuqun, et al.
Pubblicazione: (2025)

Regularization for Adversarial Robust Learning
di: Wang, Jie, et al.
Pubblicazione: (2024)

Muon Does Not Converge on Convex Lipschitz Functions
di: Parshakova, Tetiana, et al.
Pubblicazione: (2026)

Old Optimizer, New Norm: An Anthology
di: Bernstein, Jeremy, et al.
Pubblicazione: (2024)

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

Learning Spatially Adaptive $\ell_1$-Norms Weights for Convolutional Synthesis Regularization
di: Kofler, Andreas, et al.
Pubblicazione: (2025)

Learning Difference-of-Convex Regularizers for Inverse Problems: A Flexible Framework with Theoretical Guarantees
di: Zhang, Yasi, et al.
Pubblicazione: (2025)

Muon Optimizes Under Spectral Norm Constraints
di: Chen, Lizhang, et al.
Pubblicazione: (2025)

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

Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning
di: Palenzuela, Karlo, et al.
Pubblicazione: (2025)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
di: Sarkar, Dhruv, et al.
Pubblicazione: (2025)

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

LyAm: Robust Non-Convex Optimization for Stable Learning in Noisy Environments
di: Mirzabeigi, Elmira, et al.
Pubblicazione: (2025)

Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data
di: Qiu, Pu, et al.
Pubblicazione: (2026)

CRONOS: Enhancing Deep Learning with Scalable GPU Accelerated Convex Neural Networks
di: Feng, Miria, et al.
Pubblicazione: (2024)