Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
From MaRDI portal
Publication:662292
DOI10.1007/S10107-010-0350-1zbMATH Open1246.90120arXiv0904.0691OpenAlexW2152726866MaRDI QIDQ662292FDOQ662292
Zhaosong Lu, Ming Yuan, Renato D. C. Monteiro
Publication date: 22 February 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Abstract: In this paper, we study convex optimization methods for computing the trace norm regularized least squares estimate in multivariate linear regression. The so-called factor estimation and selection (FES) method, recently proposed by Yuan et al. [22], conducts parameter estimation and factor selection simultaneously and have been shown to enjoy nice properties in both large and finite samples. To compute the estimates, however, can be very challenging in practice because of the high dimensionality and the trace norm constraint. In this paper, we explore a variant of Nesterov's smooth method [20] and interior point methods for computing the penalized least squares estimate. The performance of these methods is then compared using a set of randomly generated instances. We show that the variant of Nesterov's smooth method [20] generally outperforms the interior point method implemented in SDPT3 version 4.0 (beta) [19] substantially . Moreover, the former method is much more memory efficient.
Full work available at URL: https://arxiv.org/abs/0904.0691
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heuristics of instability and stabilization in model selection
- Smooth minimization of non-smooth functions
- RELATIONS BETWEEN TWO SETS OF VARIATES
- Reduced-rank regression for the multivariate linear model
- Multivariate reduced-rank regression
- Estimating Linear Restrictions on Regression Coefficients for Multivariate Normal Distributions
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Smooth Optimization Approach for Sparse Covariance Selection
- Joint Continuum Regression for Multiple Predictands
Cited In (23)
- Low rank multivariate regression
- An implementable proximal point algorithmic framework for nuclear norm minimization
- High-dimensional dynamic systems identification with additional constraints
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- An optimal method for stochastic composite optimization
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
- A new approximation of the matrix rank function and its application to matrix rank minimization
- Supervised Learning by Support Vector Machines
- Double fused Lasso regularized regression with both matrix and vector valued predictors
- Variable selection in multivariate linear regression with random predictors
- A two-level method for constructing linear regressions using optimal convex combinations
- Robust reduced rank regression in a distributed setting
- Regularization parameter selection for the low rank matrix recovery
- Dimension reduction of multivariate linear systems under \(H^ \infty\) constraints
- An acceleration procedure for optimal first-order methods
- Low-rank elastic-net regularized multivariate Huber regression model
- A framework of regularized low-rank matrix models for regression and classification
- Leveraging mixed and incomplete outcomes via reduced-rank modeling
- Penalty decomposition methods for rank minimization
- Optimal selection of reduced rank estimators of high-dimensional matrices
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
- Title not available (Why is that?)
- A Bayesian perspective of statistical machine learning for big data
Uses Software
This page was built for publication: Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662292)