Dávid Pál

15 papers · 2005–2020 · 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 ↓

+6 more ↓

🗺️ Taxonomy Completionist (24) 🏃 Academic Marathon · Full 🌍 Conference Polyglot · Silver 🌉 Interdisciplinary Bridge · Bronze 🐣 Hot Topic Early Bird

🧭 Keyword Pioneer 🏆 Keyword Champion 📈 Trend Setter 🚀 Conference Pioneer 💎 Century Club · Bronze 🗃️ Keyword Collector (75)

Venues

AISTATS (4) NeurIPS (4) ICML (3) COLT (2) AAAI (1) AutoML (1)

Top co-authors

Csaba Szepesvári (4) Francesco Orabona (3) Tyler Lu (3) Balázs Szörényi (3) Yasin Abbasi-Yadkori (2) Satyen Kale (2) Chicheng Zhang (1) Miroslava Sotakova (1) Alexander Golovnev (1) Teresa Luu (1)

Research topics

Machine Learning (14) Optimization & Theory (13) Learning Types (8) Mathematics & Optimization (6) Optimization (5) Core Methods (3) Artificial Intelligence (1) Application Areas (1) Core AI (1) Mathematics (1) Statistics (1)

Keywords

online learning (8) 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) regret minimization (1) sample complexity (1) bipartite matching (1) transfer learning (1) feature selection (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 Coin Betting and Parameter-Free Online Learning NeurIPS 2016 Hardness of Online Sleeping Combinatorial Optimization Problems NeurIPS 2016 Open Problem: Parameter-Free and Scale-Free Online Algorithms COLT 2016 Parameter-Free Convex Learning through Coin Betting AutoML 2016 Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits AISTATS 2012 Improved Algorithms for Linear Stochastic Bandits NeurIPS 2011 Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011 Contextual Multi-Armed Bandits AISTATS 2010 Estimation of Rényi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs NeurIPS 2010 Impossibility Theorems for Domain Adaptation AISTATS 2010 Learning Low Density Separators AISTATS 2005