Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. A Computational Framework for Multivariate Convex Regression and Its Variants

A Computational Framework for Multivariate Convex Regression and Its Variants

Thumbnail Image
Download
Name

1509.08165.pdf

Size

1.1 MB

Format

Adobe PDF

Checksum (MD5)

e65c5ebf11656fe7116b55897ce286bc

Download all files submitted through automated deposit
sword-2019-02-25.original.zip (955.55 KB)
Author(s)
Choudhury, Arkopal
•
Iyengar, Garud
•
Sen, Bodhisattva
•
Mazumder, Rahul
Date Issued
August 2018
Journal
Journal of the American Statistical Association
Publisher
Taylor & Francis
Citation
Mazumder, Rahul et al. “A Computational Framework for Multivariate Convex Regression and Its Variants.” Journal of the American Statistical Association (January 2018): 1–14 © 2018 American Statistical Association
Version
Original manuscript
Abstract
We study the nonparametric least squares estimator (LSE) of a multivariate convex regression function. The LSE, given as the solution to a quadratic program with O(n²) linear constraints (n being the sample size), is difficult to compute for large problems. Exploiting problem specific structure, we propose a scalable algorithmic framework based on the augmented Lagrangian method to compute the LSE. We develop a novel approach to obtain smooth convex approximations to the fitted (piecewise affine) convex LSE and provide formal bounds on the quality of approximation. When the number of samples is not too large compared to the dimension of the predictor, we propose a regularization scheme—Lipschitz convex regression—where we constrain the norm of the subgradients, and study the rates of convergence of the obtained LSE. Our algorithmic framework is simple and flexible and can be easily adapted to handle variants: estimation of a nondecreasing/nonincreasing convex/concave (with or without a Lipschitz bound) function. We perform numerical studies illustrating the scalability of the proposed algorithm—on some instances our proposal leads to more than a 10,000-fold improvement in runtime when compared to off-the-shelf interior point solvers for problems with n = 500. Keywords: Augmented Lagrangian method; Lipschitz convex regression; Non parametric least squares estimator; Scalable quadratic programming; Smooth convex regression
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/120818
DOI of Published Version
https://doi.org/10.1080/01621459.2017.1407771
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.