Li-Yang Tan
13 papers · 2012–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
π Academic Marathon (13) π Interdisciplinary Bridge π§ Keyword Pioneer π Conference Polyglot (3) π Cross-Pollinator (7)
π
Cross-Pollinator
(7)
πΊοΈ
Taxonomy Completionist
(10)
π€
Dynamic Duo
(11)
β
The Questioner
π₯
Unstoppable
(6)
ποΈ
Keyword Collector
(51)
π
Century Club
(13)
π
Trend Setter
Conferences
COLT (6)
NIPS (4)
ICML (3)
Top co-authors
Keywords
decision tree
(3)
decision tree learning
(3)
attribute-efficient learning
(2)
pac learning
(1)
statistical query
(1)
boolean function
(1)
computational complexity
(1)
membership query
(1)
noise tolerance
(1)
query complexity
(1)
mistake bound
(1)
greedy algorithm
(1)
lower bound
(1)
local explanation
(1)
agnostic learning
(1)
multitask learning
(1)
sample complexity
(1)
adaptive adversary
(1)
polynomial time algorithm
(1)
active learning
(1)
Papers
A Distributional-Lifting Theorem for PAC Learning
COLT 2025
Superconstant Inapproximability of Decision Tree Learning
COLT 2024
Multitask Learning via Shared Features: Algorithms and Hardness
COLT 2023
Harnessing the power of choices in decision tree learning
NIPS 2023
Popular decision tree algorithms are provably noise tolerant
ICML 2022
On the power of adaptivity in statistical adversaries
COLT 2022
Open Problem: Properly learning decision trees in polynomial time?
COLT 2022
A query-optimal algorithm for finding counterfactuals
ICML 2022
Provably efficient, succinct, and precise explanations
NIPS 2021
Universal guarantees for decision tree induction via a higher-order splitting criterion
NIPS 2020
Provable guarantees for decision tree induction: the agnostic setting
ICML 2020
Estimating decision tree learnability with polylogarithmic sample complexity
NIPS 2020
Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions
COLT 2012