Harshal Kaushik

On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds

We study the expressibility and learnability of solution functions of convex optimization and their multi-layer architectural extension. The main results are: (1) the class of solution functions of linear programming (LP) and quadratic programming (QP) is a universal approximant for the smooth model…