activity
20062026
most citedInapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models

124 citations · 275 across the 42 of their papers we have counts for

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2020

Statistical Mechanical Analysis of Neural Network Pruning

Rupam Acharyya, Ankani Chattoraj, Boyu Zhang +2

Deep learning architectures with a huge number of parameters are often compressed using pruning techniques to ensure computational efficiency of inference during deployment. Despit…

cs.LG2017★ 1 cited

Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models

Sejun Park, Yunhun Jang, Andreas Galanis +3

The Gibbs sampler is a particularly popular Markov chain used for learning and inference problems in Graphical Models (GMs). These tasks are computationally intractable in general,…

cs.LG2017

On The Projection Operator to A Three-view Cardinality Constrained Set

Haichuan Yang, Shupeng Gui, Chuyang Ke +3

The cardinality constraint is an intrinsic way to restrict the solution structure in many domains, for example, sparse learning, feature selection, and compressed sensing. To solve…

cs.LG2012★ 1 cited

Subset Selection for Gaussian Markov Random Fields

Satyaki Mahalanabis, Daniel Stefankovic

Given a Gaussian Markov random field, we consider the problem of selecting a subset of variables to observe which minimizes the total expected squared prediction error of the unobs…

cs.LG2007★ 15 cited

Density estimation in linear time

Satyaki Mahalanabis, Daniel Stefankovic

We consider the problem of choosing a density estimate from a set of distributions F, minimizing the L1-distance to an unknown distribution (Devroye, Lugosi 2001). Devroye and Lugo…