Yanjun Han
23 papers · 2010–2024 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
π§ Keyword Pioneer π Interdisciplinary Bridge π Conference Polyglot (5) π Academic Marathon (14) π Cross-Pollinator (9)
πΊοΈ
Taxonomy Completionist
(36)
π
Interdisciplinary Bridge
π
Conference Polyglot
(5)
π
Keyword Champion
π
Century Club
(23)
π
Trend Setter
π₯
Unstoppable
(7)
ποΈ
Keyword Collector
(111)
Conferences
NIPS (14)
COLT (6)
AISTATS (1)
ICML (1)
JMLR (1)
Top co-authors
Research topics
Keywords
regret bound
(7)
online learning
(5)
sample complexity
(4)
learning theory
(3)
online algorithm
(3)
interactive decision making
(3)
minimax risk
(3)
minimax rate
(3)
multi-armed bandit
(3)
communication constraint
(3)
information-theoretic lower bound
(2)
lower bound
(2)
reinforcement learning
(2)
stochastic bandit
(2)
oracle-efficient algorithm
(2)
information theory
(2)
markov chain
(2)
regret minimization
(2)
nonparametric estimation
(2)
minimax optimal
(2)
Papers
Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
NIPS 2024
Stochastic contextual bandits with graph feedback: from independence number to MAS number
NIPS 2024
Online Estimation via Offline Estimation: An Information-Theoretic Framework
NIPS 2024
Prediction from compression for models with infinite memory, with applications to hidden Markov and renewal processes
COLT 2024
Minimax optimal testing by classification
COLT 2023
Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient
COLT 2023
Learning and Collusion in Multi-unit Auctions
NIPS 2023
Oracle-Efficient Online Learning for Smoothed Adversaries
NIPS 2022
Beyond the Best: Distribution Functional Estimation in Infinite-Armed Bandits
NIPS 2022
Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions
NIPS 2022
On the High Accuracy Limitation of Adaptive Property Estimation
AISTATS 2021
Optimal prediction of Markov chains with and without spectral gap
NIPS 2021
On the Value of Interaction and Function Approximation in Imitation Learning
NIPS 2021
Adversarial Combinatorial Bandits with General Non-linear Reward Functions
ICML 2021
Lower Bounds for Learning Distributions under Communication Constraints via Fisher Information
JMLR 2020
Minimax Optimal Nonparametric Estimation of Heterogeneous Treatment Effects
NIPS 2020
Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit
COLT 2020
Batched Multi-armed Bandits Problem
NIPS 2019
Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints
COLT 2018
The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal
NIPS 2018
Entropy Rate Estimation for Markov Chains with Large State Space
NIPS 2018
Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance
COLT 2018
Avoiding False Positive in Multi-Instance Learning
NIPS 2010