no code implementations • 18 Jan 2015 • Andrew S. Lan, Divyanshu Vats, Andrew E. Waters, Richard G. Baraniuk
Our data-driven framework for mathematical language processing (MLP) leverages solution data from a large number of learners to evaluate the correctness of their solutions, assign partial-credit scores, and provide feedback to each learner on the likely locations of any errors.
no code implementations • 13 Apr 2014 • Divyanshu Vats, Robert D. Nowak, Richard G. Baraniuk
This paper studies graphical model selection, i. e., the problem of estimating a graph of statistical relationships among a collection of random variables.
no code implementations • 23 Feb 2014 • Divyanshu Vats, Richard G. Baraniuk
In this paper, we address the challenging problem of selecting tuning parameters for high-dimensional sparse regression.
no code implementations • 5 Dec 2013 • Divyanshu Vats, Richard G. Baraniuk
We consider the high-dimensional sparse linear regression problem of accurately estimating a sparse vector using a small number of linear measurements that are contaminated by noise.
no code implementations • NeurIPS 2013 • Divyanshu Vats, Richard Baraniuk
We consider the problem of accurately estimating a high-dimensional sparse vector using a small number of linear measurements that are contaminated by noise.
no code implementations • 17 Apr 2013 • Divyanshu Vats, Robert Nowak
We highlight three main properties of using junction trees for UGMS.
no code implementations • 9 Aug 2012 • Divyanshu Vats
Screening is the problem of finding a superset of the set of non-zero entries in an unknown p-dimensional vector \beta* given n noisy observations.