mlsanityData to 7 Oct 2026

Learning Convex Optimization Models

arXiv 2006.04248 ↗First posted 7 Jun 2020cs.LG stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

A convex optimization model predicts an output from an input by solving a convex optimization problem. The class of convex optimization models is large, and includes as special cases many well-known models like linear and logistic regression. We propose a heuristic for learning the parameters in a convex optimization model given a dataset of input-output pairs, using recently developed methods for differentiating the solution of a convex optimization problem with respect to its parameters. We describe three general classes of convex optimization models, maximum a posteriori (MAP) models, utility maximization models, and agent models, and present a numerical experiment for each.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 4; 2025: 5; 2026: 2.

16 papers.

Sort:

By area: