Dávid Pál - RankMe

45 papers A* 11A 4B 2Journal 21Unranked 6

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Auction for Double-Wide Ads. CoRR Jonathan Gu, Dávid Pál, Kevin Ryan
2021	J	`jnl`	Parameter-free Stochastic Optimization of Variationally Coherent Functions. CoRR Francesco Orabona, Dávid Pál
2020	A*	`conf`	Learning to Crawl. AAAI Utkarsh Upadhyay, Róbert Busa-Fekete, Wojciech Kotlowski, Dávid Pál, Balázs Szörényi
2019	A*	`conf`	Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case. ICML Alina Beygelzimer, Dávid Pál, Balázs Szörényi, Devanathan Thiruvenkatachari, Chen-Yu Wei, Chicheng Zhang
2019	J	`jnl`	Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case. CoRR Alina Beygelzimer, Dávid Pál, Balázs Szörényi, Devanathan Thiruvenkatachari, Chen-Yu Wei, Chicheng Zhang
2019	J	`jnl`	Learning to Crawl. CoRR Utkarsh Upadhyay, Róbert Busa-Fekete, Wojciech Kotlowski, Dávid Pál, Balázs Szörényi
2019	A*	`conf`	The information-theoretic value of unlabeled data in semi-supervised learning. ICML Alexander Golovnev, Dávid Pál, Balázs Szörényi
2019	J	`jnl`	The information-theoretic value of unlabeled data in semi-supervised learning. CoRR Alexander Golovnev, Dávid Pál, Balázs Szörényi
2018	J	`jnl`	Scale-free online learning. Theor. Comput. Sci. Francesco Orabona, Dávid Pál
2017	A*	`conf`	Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP. ICML Satyen Kale, Zohar S. Karnin, Tengyuan Liang, Dávid Pál
2017	J	`jnl`	Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP. CoRR Satyen Kale, Zohar S. Karnin, Tengyuan Liang, Dávid Pál
2016	—	`conf`	Coin Betting and Parameter-Free Online Learning. NIPS Francesco Orabona, Dávid Pál
2016	J	`jnl`	From Coin Betting to Parameter-Free Online Learning. CoRR Francesco Orabona, Dávid Pál
2016	—	`conf`	Hardness of Online Sleeping Combinatorial Optimization Problems. NIPS Satyen Kale, Chansoo Lee, Dávid Pál
2016	A*	`conf`	Open Problem: Parameter-Free and Scale-Free Online Algorithms. COLT Francesco Orabona, Dávid Pál
2016	—	`conf`	Parameter-Free Convex Learning through Coin Betting. AutoML@ICML Francesco Orabona, Dávid Pál
2016	J	`jnl`	Scale-Free Online Learning. CoRR Francesco Orabona, Dávid Pál
2015	J	`jnl`	Hardness of Online Sleeping Combinatorial Optimization Problems. CoRR Satyen Kale, Chansoo Lee, Dávid Pál
2015	J	`jnl`	Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice. CoRR Francesco Orabona, Dávid Pál
2015	B	`conf`	Scale-Free Algorithms for Online Linear Optimization. ALT Francesco Orabona, Dávid Pál
2015	J	`jnl`	Scale-Free Algorithms for Online Linear Optimization. CoRR Francesco Orabona, Dávid Pál
2014	J	`jnl`	Partial Monitoring - Classification, Regret Bounds, and Algorithms. Math. Oper. Res. Gábor Bartók, Dean P. Foster, Dávid Pál, Alexander Rakhlin, Csaba Szepesvári
2013	—	`conf`	Online problémy v strojovom učení. ITAT Dávid Pál
2013	J	`jnl`	Toward a classification of finite partial-monitoring games. Theor. Comput. Sci. András Antos, Gábor Bartók, Dávid Pál, Csaba Szepesvári
2012	A	`conf`	Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits. AISTATS Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári
2011	—	`conf`	Improved Algorithms for Linear Stochastic Bandits. NIPS Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári
2011	A*	`conf`	Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments. COLT Gábor Bartók, Dávid Pál, Csaba Szepesvári
2011	J	`jnl`	Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems CoRR Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári
2011	J	`jnl`	Toward a Classification of Finite Partial-Monitoring Games CoRR András Antos, Gábor Bartók, Dávid Pál, Csaba Szepesvári
2010	A	`conf`	Contextual Multi-Armed Bandits. AISTATS Tyler Lu, Dávid Pál, Martin Pal
2010	—	`conf`	Estimation of Renyi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs. NIPS Dávid Pál, Barnabás Póczos, Csaba Szepesvári
2010	J	`jnl`	Estimation of Rényi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs CoRR Dávid Pál, Barnabás Póczos, Csaba Szepesvári
2010	A	`conf`	Impossibility Theorems for Domain Adaptation. AISTATS Shai Ben-David, Tyler Lu, Teresa Luu, Dávid Pál
2010	B	`conf`	Toward a Classification of Finite Partial-Monitoring Games. ALT Gábor Bartók, Dávid Pál, Csaba Szepesvári
2009	A*	`conf`	Agnostic Online Learning. COLT Shai Ben-David, Dávid Pál, Shai Shalev-Shwartz
2009	—	`—`	Contributions to Unsupervised and Semi-Supervised Learning. Dávid Pál
2009	A*	`conf`	General auction mechanism for search advertising. WWW Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál
2009	A	`conf`	Learning Low Density Separators. AISTATS Shai Ben-David, Tyler Lu, Dávid Pál, Miroslava Sotáková
2008	A*	`conf`	Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning. COLT Shai Ben-David, Tyler Lu, Dávid Pál
2008	J	`jnl`	General Auction Mechanism for Search Advertising CoRR Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál
2008	J	`jnl`	Learning Low-Density Separators CoRR Shai Ben-David, Tyler Lu, Dávid Pál, Miroslava Sotáková
2007	J	`jnl`	Colouring Cubic Graphs by Small Steiner Triple Systems. Graphs Comb. Dávid Pál, Martin Skoviera
2007	J	`jnl`	Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems. Electron. Notes Discret. Math. Dávid Pál, Martin Skoviera
2007	A*	`conf`	Stability of COLT Shai Ben-David, Dávid Pál, Hans Ulrich Simon
2006	A*	`conf`	A Sober Look at Clustering Stability. COLT Shai Ben-David, Ulrike von Luxburg, Dávid Pál