Copertina

SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Kang, Hu, Jianchen, Peng, Wei
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

Exact Dual Geometry of SOC-ICNN Value Functions
di: Liu, Kang, et al.
Pubblicazione: (2026)

Learning based convex approximation for constrained parametric optimization
di: Liu, Kang, et al.
Pubblicazione: (2025)

Budget-aware Auto Optimizer Configurator
di: Liu, Kang, et al.
Pubblicazione: (2026)

Universal Architectures for the Learning of Polyhedral Norms and Convex Regularizers
di: Unser, Michael, et al.
Pubblicazione: (2025)

ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programming
di: Liu, Yu, et al.
Pubblicazione: (2025)

Parametric Nonconvex Optimization via Convex Surrogates
di: Wang, Renzi, et al.
Pubblicazione: (2026)

Dual Lagrangian Learning for Conic Optimization
di: Tanneau, Mathieu, et al.
Pubblicazione: (2024)

Natural Geometry of Robust Data Attribution: From Convex Models to Deep Networks
di: Li, Shihao, et al.
Pubblicazione: (2025)

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

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
di: Lee, Wei-Cheng, et al.
Pubblicazione: (2025)

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

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
di: Hu, Quanqi, et al.
Pubblicazione: (2024)

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

Dual Conic Proxies for AC Optimal Power Flow
di: Qiu, Guancheng, et al.
Pubblicazione: (2023)

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

New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results
di: Orabona, Francesco, et al.
Pubblicazione: (2025)

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

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
di: Koloskova, Anastasia, et al.
Pubblicazione: (2023)

Dual Conic Proxy for Semidefinite Relaxation of AC Optimal Power Flow
di: Qiu, Guancheng, et al.
Pubblicazione: (2025)

Adaptive Learning-based Surrogate Method for Stochastic Programs with Implicitly Decision-dependent Uncertainty
di: Shen, Boyang, et al.
Pubblicazione: (2025)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
di: Zhang, Huaqing, et al.
Pubblicazione: (2024)

Online Convex Optimization with Memory and Limited Predictions
di: Wang, Zhengmiao, et al.
Pubblicazione: (2024)

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

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

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

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

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)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
di: Huang, Minhui, et al.
Pubblicazione: (2021)

Solving Hidden Monotone Variational Inequalities with Surrogate Losses
di: D'Orazio, Ryan, et al.
Pubblicazione: (2024)

Fair Supervised Learning Through Constraints on Smooth Nonconvex Unfairness-Measure Surrogates
di: Khatti, Zahra, et al.
Pubblicazione: (2025)

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

Feature-Based Interpretable Surrogates for Optimization
di: Goerigk, Marc, et al.
Pubblicazione: (2024)

Towards Robust Interpretable Surrogates for Optimization
di: Goerigk, Marc, et al.
Pubblicazione: (2024)

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

Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback
di: Liu, Shanqi, et al.
Pubblicazione: (2024)

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
di: Bao, Lingchan, et al.
Pubblicazione: (2025)

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