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

7 citations · 40 across the 21 of their papers we have counts for

collaborators
Showing stat.MLShow all

5 papers · 1 filter

stat.ML2022

Best Arm Identification in Restless Markov Multi-Armed Bandits

P. N. Karthik, Kota Srinivas Reddy, Vincent Y. F. Tan

We study the problem of identifying the best arm in a multi-armed bandit environment when each arm is a time-homogeneous and ergodic discrete-time Markov process on a common, finit…

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…

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…

stat.ML20201 cited

Exact Asymptotics for Learning Tree-Structured Graphical Models with Side Information: Noiseless and Noisy Samples

Anshoo Tandon, Vincent Y. F. Tan, Shiyao Zhu

Given side information that an Ising tree-structured graphical model is homogeneous and has no external field, we derive the exact asymptotics of learning its structure from indepe…

stat.ML2019

Sequential Classification with Empirically Observed Statistics

Mahdi Haghifam, Vincent Y. F. Tan, Ashish Khisti

Motivated by real-world machine learning applications, we consider a statistical classification task in a sequential setting where test samples arrive sequentially. In addition, th…