Parikshit Shah
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Parikshit Shah has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Amine Allouah
MyCustomAI, Santa Clara, USA
1 shared publication - Anil Dania
Meta, Menlo Park, CA, USA
1 shared publication Badri Narayan Bhaskar
University of Wisconsin - Madison
1 shared publication- Caner Gocmen
Meta Platforms Inc
1 shared publication - Christian Kroer
Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027
1 shared publication - Gautam Dasarathy
Arizona State University Tempe AZ USA
1 shared publication
Latest Publications
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 25-35
Fair Allocation Over Time, with Applications to Content Moderation
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 25-35
Open AccessFair Allocation Over Time, with Applications to Content Moderation
- Open Access
- 1 March 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Conic geometric programming
This invited submission summarizes recent work by the authors on conic geometric programs (CGPs), which are convex optimization problems obtained by blending geometric programs (GPs) and conic optimization problems such as semidefinite programs (SDPs). GPs and SDPs are two prominent families of structured convex programs that each generalize linear programs (LPs) in different ways, and that are both employed in a broad range of applications. This submission provides a summary of a unified mathematical and algorithmic treatment of GPs and SDPs under the framework of CGPs. Although CGPs contain GPs and SDPs as special instances, computing global optima of CGPs is not much harder than solving GPs and SDPs. More broadly, the CGP framework facilitates a range of new applications - permanent maximization, hitting-time estimation in dynamical systems, the computation of the capacity of channels transmitting quantum information, and robust optimization formulations of GPs - that fall outside the scope of SDPs and GPs alone.
- 1 March 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Open AccessConic geometric programming
This invited submission summarizes recent work by the authors on conic geometric programs (CGPs), which are convex optimization problems obtained by blending geometric programs (GPs) and conic optimization problems such as semidefinite programs (SDPs). GPs and SDPs are two prominent families of structured convex programs that each generalize linear programs (LPs) in different ways, and that are both employed in a broad range of applications. This submission provides a summary of a unified mathematical and algorithmic treatment of GPs and SDPs under the framework of CGPs. Although CGPs contain GPs and SDPs as special instances, computing global optima of CGPs is not much harder than solving GPs and SDPs. More broadly, the CGP framework facilitates a range of new applications - permanent maximization, hitting-time estimation in dynamical systems, the computation of the capacity of channels transmitting quantum information, and robust optimization formulations of GPs - that fall outside the scope of SDPs and GPs alone.
- 1 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1026-1033
Covariance sketching
Learning covariance matrices from high-dimensional data is an important problem that has received a lot of attention recently. We are particularly interested in the high-dimensional setting, where the number of samples one has access to is fewer than the number of variates. Fortunately, in many applications of interest, the underlying covariance matrix is sparse and hence has limited degrees of freedom. In most existing work however, it is assumed that one can obtain samples of all the variates simultaneously. This could be very expensive or physically infeasible in some applications. As a means of overcoming this limitation, we propose a new procedure that “pools” the covariates into a small number of groups and then samples each pooled group. We show that in certain cases it is possible to recover the covariance matrix from the pooled samples using an efficient convex optimization program, and so we call the procedure “covariance sketching”.
- 1 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1026-1033
Covariance sketching
Learning covariance matrices from high-dimensional data is an important problem that has received a lot of attention recently. We are particularly interested in the high-dimensional setting, where the number of samples one has access to is fewer than the number of variates. Fortunately, in many applications of interest, the underlying covariance matrix is sparse and hence has limited degrees of freedom. In most existing work however, it is assumed that one can obtain samples of all the variates simultaneously. This could be very expensive or physically infeasible in some applications. As a means of overcoming this limitation, we propose a new procedure that “pools” the covariates into a small number of groups and then samples each pooled group. We show that in certain cases it is possible to recover the covariance matrix from the pooled samples using an efficient convex optimization program, and so we call the procedure “covariance sketching”.