Dávid Pál
14 papers · 2010–2020 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
🌉 Interdisciplinary Bridge 🐣 Hot Topic Early Bird 🗺️ Taxonomy Completionist (11) 🧭 Keyword Pioneer 🌍 Conference Polyglot (6)
🐣
Hot Topic Early Bird
🌉
Interdisciplinary Bridge
🗃️
Keyword Collector
(69)
📈
Trend Setter
💎
Century Club
(14)
🚀
Conference Pioneer
Conferences
NIPS (4)
AISTATS (3)
ICML (3)
COLT (2)
AAAI (1)
AUTOML (1)
Top co-authors
Keywords
online learning
(7)
regret bound
(6)
online linear optimization
(2)
confidence set
(2)
pac learning
(2)
parameter-free algorithm
(2)
stochastic bandit
(2)
coin betting
(2)
regret analysis
(2)
multiclass classification
(1)
sample complexity
(1)
transfer learning
(1)
feature selection
(1)
regret minimization
(1)
sparse learning
(1)
semi-supervised learning
(1)
sparse regression
(1)
mutual information
(1)
nonparametric estimation
(1)
convex optimization
(1)
Papers
Learning to Crawl
AAAI 2020
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case
ICML 2019
The information-theoretic value of unlabeled data in semi-supervised learning
ICML 2019
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP
ICML 2017
Hardness of Online Sleeping Combinatorial Optimization Problems
NIPS 2016
Coin Betting and Parameter-Free Online Learning
NIPS 2016
Parameter-Free Convex Learning through Coin Betting
AUTOML 2016
Open Problem: Parameter-Free and Scale-Free Online Algorithms
COLT 2016
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits
AISTATS 2012
Improved Algorithms for Linear Stochastic Bandits
NIPS 2011
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments
COLT 2011
Contextual Multi-Armed Bandits
AISTATS 2010
Impossibility Theorems for Domain Adaptation
AISTATS 2010
Estimation of Rényi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs
NIPS 2010