PSParikshit Shah

Parikshit Shah

*This is an algorithmically generated author record based on publicly available information.

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


Parikshit Shah has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Fair Allocation Over Time, with Applications to Content Moderation

    by Amine Allouah, Christian Kroer, Xuan Zhang, Vashist Avadhanula, Nona Bohanon, Anil Dania, Caner Gocmen, Sergey Pupyrev, Parikshit Shah, Nicolas Stier-Moses, et al.

  • Open Access

    Conic geometric programming

    by Venkat Chandrasekaran, Parikshit Shah

    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.


  • Covariance sketching

    by Gautam Dasarathy, Parikshit Shah, Badri Narayan Bhaskar, Robert Nowak

    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”.