most citedApproximation Algorithms for Bregman Co-clustering and Tensor Clustering

4 citations · 4 across the 1 of their papers we have counts for

collaborators

8 papers

stat.ML2016

Alternating Estimation for Structured High-Dimensional Multi-Response Models

Sheng Chen, Arindam Banerjee

We consider learning high-dimensional multi-response linear models with structured parameters. By exploiting the noise correlations among responses, we propose an alternating estim…

stat.ML2016

Structured Stochastic Linear Bandits

Nicholas Johnson, Vidyashankar Sivakumar, Arindam Banerjee

The stochastic linear bandit problem proceeds in rounds where at each round the algorithm selects a vector from a decision set after which it receives a noisy linear loss parameter…

math.ST2016

Generalized Direct Change Estimation in Ising Model Structure

Farideh Fazayeli, Arindam Banerjee

We consider the problem of estimating change in the dependency structure between two -dimensional Ising models, based on respectively and samples drawn from the mode…

math.AC2016

Graph Connectivity and Binomial Edge Ideals

Arindam Banerjee, Luis Núñez-Betancourt

We relate homological properties of a binomial edge ideal to invariants that measure the connectivity of a simple graph . Specifically, we show if $R/\mathcal{J}…

stat.ML2016

Structured Matrix Recovery via the Generalized Dantzig Selector

Sheng Chen, Arindam Banerjee

In recent years, structured matrix recovery problems have gained considerable attention for its real world applications, such as recommender systems and computer vision. Much of th…

math.ST2016

Estimating Structured Vector Autoregressive Model

Igor Melnyk, Arindam Banerjee

While considerable advances have been made in estimating high-dimensional structured models from independent data using Lasso-type models, limited progress has been made for settin…