no code implementations • 11 Nov 2022 • Vashist Avadhanula, Omar Abdul Baki, Hamsa Bastani, Osbert Bastani, Caner Gocmen, Daniel Haimovich, Darren Hwang, Dima Karamshuk, Thomas Leeper, Jiayuan Ma, Gregory Macnamara, Jake Mullett, Christopher Palow, Sung Park, Varun S Rajagopal, Kevin Schaeffer, Parikshit Shah, Deeksha Sinha, Nicolas Stier-Moses, Peng Xu
We describe the current content moderation strategy employed by Meta to remove policy-violating content from its platforms.
no code implementations • 31 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.
no code implementations • 19 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.
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.
no code implementations • 15 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.
1 code implementation • 26 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
no code implementations • 23 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.