activity
20092015
most citedTelescoping Recursive Representations and Estimation of Gauss-Markov Random Fields

17 citations · 56 across the 9 of their papers we have counts for

collaborators
Showing stat.MLShow all

6 papers · 1 filter

stat.ML2015★ 15 cited

Mathematical Language Processing: Automatic Grading and Feedback for Open Response Mathematical Questions

Andrew S. Lan, Divyanshu Vats, Andrew E. Waters +1

While computer and communication technologies have provided effective means to scale up many aspects of education, the submission and grading of assessments such as homework assign…

stat.ML2014★ 2 cited

Active Learning for Undirected Graphical Model Selection

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. Conventional graphical mo…

stat.ML2013★ 3 cited

A Junction Tree Framework for Undirected Graphical Model Selection

Divyanshu Vats, Robert Nowak

An undirected graphical model is a joint probability distribution defined on an undirected graph G*, where the vertices in the graph index a collection of random variables and the…

stat.ML2012★ 3 cited

High-Dimensional Screening Using Multiple Grouping of Variables

Divyanshu Vats

Screening is the problem of finding a superset of the set of non-zero entries in an unknown p-dimensional vector β* given n noisy observations. Naturally, we want this superset to…

stat.ML2011★ 6 cited

Finding Non-overlapping Clusters for Generalized Inference Over Graphical Models

Divyanshu Vats, José M. F. Moura

Graphical models use graphs to compactly capture stochastic dependencies amongst a collection of random variables. Inference over graphical models corresponds to finding marginal p…

stat.ML2010★ 3 cited

Graphical Models as Block-Tree Graphs

Divyanshu Vats, Jose M. F. Moura

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a clu…