NDLI: Randomized Sketches of Convex Programs With Sharp Guarantees

Content Provider	IEEE Xplore Digital Library
Author	Pilanci, M. Wainwright, M.J.
Copyright Year	1963
Abstract	Random projection (RP) is a classical technique for reducing storage and computational costs. We analyze RP-based approximations of convex programs, in which the original optimization problem is approximated by solving a lower dimensional problem. Such dimensionality reduction is essential in computation-limited settings, since the complexity of general convex programming can be quite high (e.g., cubic for quadratic programs, and substantially higher for semidefinite programs). In addition to computational savings, RP is also useful for reducing memory usage, and has useful properties for privacy-preserving optimization. We prove that the approximation ratio of this procedure can be bounded in terms of the geometry of the constraint set. For a broad class of RPs, including those based on various sub-Gaussian distributions as well as randomized Hadamard and Fourier transforms, the data matrix defining the cost function can be projected to a dimension proportional to the squared Gaussian width of the tangent cone of the constraint set at the original solution. This effective dimension of the convex program is often substantially smaller than the original dimension. We illustrate consequences of our theory for various cases, including unconstrained and L₁-constrained least squares, support vector machines, low-rank matrix estimation, and discuss implications for privacy-preserving optimization, as well as connections with denoising and compressed sensing.
Sponsorship	IEEE Information Theory Society
Starting Page	5096
Ending Page	5115
Page Count	20
File Size	722564
File Format	PDF
ISSN	00189448
Volume Number	61
Issue Number	9
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Least squares approximations Optimization Complexity theory Compressed sensing Context Mutual information randomized algorithms Random projection convex optimization compressed sensing sparsity 1- regularization low-rank matrix recovery privacy $\ell_{1}$ -regularization
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Compressed and Privacy-Sensitive Sparse Regression

Corrupted Sensing: Novel Guarantees for Separating Structured Signals

Iterative Reweighted $ell_{2}/ell_{1}$ Recovery Algorithms for Compressed Sensing of Block Sparse Signals

Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices

Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

On Recovery of Sparse Signals Via $ell _{1}$ Minimization

$ell_{2}/ell_{1}$ -Optimization in Block-Sparse Compressed Sensing and Its Strong Thresholds

Efficient Algorithms for Robust Recovery of Images From Compressed Data

Sparse Recovery From Combined Fusion Frame Measurements

Randomized Sketches of Convex Programs With Sharp Guarantees

Similar Documents

Compressed and Privacy-Sensitive Sparse Regression

Corrupted Sensing: Novel Guarantees for Separating Structured Signals

Iterative Reweighted $ell_{2}/ell_{1}$ Recovery Algorithms for Compressed Sensing of Block Sparse Signals

Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices

Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

On Recovery of Sparse Signals Via $ell _{1}$ Minimization

$ell_{2}/ell_{1}$ -Optimization in Block-Sparse Compressed Sensing and Its Strong Thresholds

Efficient Algorithms for Robust Recovery of Images From Compressed Data

Sparse Recovery From Combined Fusion Frame Measurements

Randomized Sketches of Convex Programs With Sharp Guarantees