activity
20152023
most citedAn Improved Linear Programming Bound on the Average Distance of a Binary Code

7 citations · 41 across the 23 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.LG2021

Active-LATHE: An Active Learning Algorithm for Boosting the Error Exponent for Learning Homogeneous Ising Trees

Fengzhuo Zhang, Anshoo Tandon, Vincent Y. F. Tan

The Chow-Liu algorithm (IEEE Trans.~Inform.~Theory, 1968) has been a mainstay for the learning of tree-structured graphical models from i.i.d.\ sampled data vectors. Its theoretica…

cs.IT2021

Distributed Sequential Hypothesis Testing With Zero-Rate Compression

Sadaf Salehkalaibar, Vincent Y. F. Tan

In this paper, we consider sequential testing over a single-sensor, a single-decision center setup. At each time instant , the sensor gets samples and describes the…

stat.ML2021

Robustifying Algorithms of Learning Latent Trees with Vector Variables

Fengzhuo Zhang, Vincent Y. F. Tan

We consider learning the structures of Gaussian latent tree models with vector observations when a subset of them are arbitrarily corrupted. First, we present the sample complexiti…

cs.LG2021

Adversarially-Trained Nonnegative Matrix Factorization

Ting Cai, Vincent Y. F. Tan, Cédric Févotte

We consider an adversarially-trained version of the nonnegative matrix factorization, a popular latent dimensionality reduction technique. In our formulation, an attacker adds an a…

stat.ML2021

SGA: A Robust Algorithm for Partial Recovery of Tree-Structured Graphical Models with Noisy Samples

Anshoo Tandon, Aldric H. J. Yuan, Vincent Y. F. Tan

We consider learning Ising tree models when the observations from the nodes are corrupted by independent but non-identically distributed noise with unknown statistics. Katiyar et a…