N. V. Vinodchandran
9 papers · 2020–2025 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
π
Conference Polyglot Β· Silver
π
Academic Marathon Β· Sprint
π
Interdisciplinary Bridge Β· Bronze
πΊοΈ
Taxonomy Completionist
(22)
π
Grand Slam
Top co-authors
Research topics
Keywords
sample complexity
(4)
total variation distance
(4)
product distribution
(3)
replicable learning
(2)
list complexity
(2)
ising model
(2)
bayes net
(2)
computational complexity
(1)
pac learning
(1)
probabilistic inference
(1)
bayesian network
(1)
multi-armed bandit
(1)
regret bound
(1)
approximation algorithm
(1)
treewidth
(1)
probability distribution
(1)
geometric partition
(1)
statistical query
(1)
linear bandit
(1)
lower bound
(1)
Papers
Computational Explorations of Total Variation Distance
ICLR 2025
Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds
ICLR 2025
Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma
NeurIPS 2024
Total Variation Distance Meets Probabilistic Inference
ICML 2024
Constraint Optimization over Semirings
AAAI 2023
List and Certificate Complexities in Replicable Learning
NeurIPS 2023
On Approximating Total Variation Distance
IJCAI 2023
Testing Product Distributions: A Closer Look
ALT 2021
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning
NeurIPS 2020