.png){kind=icon}
返回
Learning Convex Optimization Models
.png){kind=icon}
OA
AI
DOI：10.1109/JAS.2021.1004075.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Predictive models
Convex functions
Numerical models
Logistics
Convex optimization
differentiable optimization
machine learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
19.2
论文数:
1.4K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
查看更多内容