Convex optimization with an interpolation-based projection and its application to deep learning
From MaRDI portal
Publication:2071365
DOI10.1007/s10994-021-06037-zOpenAlexW3185407613MaRDI QIDQ2071365
Riad Akrour, Jan Peters, Asma Atamna
Publication date: 28 January 2022
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.07016
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Conditional subgradient optimization -- theory and applications
- Coercing machine learning to output physically accurate results
- Compatible natural gradient policy search
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Approximate policy iteration: a survey and some new methods
- Graph Implementations for Nonsmooth Convex Programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Regularization Methods for Semidefinite Programming
- COCO: a platform for comparing continuous optimizers in a black-box setting
This page was built for publication: Convex optimization with an interpolation-based projection and its application to deep learning