Search Results for author: Parikshit Shah

Found 7 papers, 1 papers with code

QUEST: Queue Simulation for Content Moderation at Scale

no code implementations31 Mar 2021 Rahul Makhijani, Parikshit Shah, Vashist Avadhanula, Caner Gocmen, Nicolás E. Stier-Moses, Julián Mestre

Moderating content in social media platforms is a formidable challenge due to the unprecedented scale of such systems, which typically handle billions of posts per day.

BIG-bench Machine Learning

Learning Exponential Family Graphical Models with Latent Variables using Regularized Conditional Likelihood

no code implementations19 Oct 2020 Armeen Taeb, Parikshit Shah, Venkat Chandrasekaran

Fitting a graphical model to a collection of random variables given sample observations is a challenging task if the observed variables are influenced by latent variables, which can induce significant confounding statistical dependencies among the observed variables.

Sparse and Low-Rank Tensor Decomposition

no code implementations NeurIPS 2015 Parikshit Shah, Nikhil Rao, Gongguo Tang

Our method relies on a reduction of the problem to sparse and low-rank matrix decomposition via the notion of tensor contraction.

Tensor Decomposition

Optimal Low-Rank Tensor Recovery from Separable Measurements: Four Contractions Suffice

no code implementations15 May 2015 Parikshit Shah, Nikhil Rao, Gongguo Tang

This motivates us to consider the problem of low rank tensor recovery from a class of linear measurements called separable measurements.

Matrix Completion Tensor Decomposition

Relative Entropy Relaxations for Signomial Optimization

1 code implementation26 Sep 2014 Venkat Chandrasekaran, Parikshit Shah

This sequence of lower bounds is computed by solving increasingly larger-sized relative entropy optimization problems, which are convex programs specified in terms of linear and relative entropy functions.

Optimization and Control

Forward - Backward Greedy Algorithms for Atomic Norm Regularization

no code implementations23 Apr 2014 Nikhil Rao, Parikshit Shah, Stephen Wright

CoGEnT combines a greedy selection scheme based on the conditional gradient approach with a backward (or "truncation") step that exploits the quadratic nature of the objective to reduce the basis size.

Cannot find the paper you are looking for? You can Submit a new open access paper.