Dávid Pál

According to our database1, Dávid Pál authored at least 34 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Auction for Double-Wide Ads.
CoRR, 2022

2021
Parameter-free Stochastic Optimization of Variationally Coherent Functions.
CoRR, 2021

2020
Learning to Crawl.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
The information-theoretic value of unlabeled data in semi-supervised learning.
Proceedings of the 36th International Conference on Machine Learning, 2019

Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Scale-free online learning.
Theor. Comput. Sci., 2018

2017
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
From Coin Betting to Parameter-Free Online Learning.
CoRR, 2016

Coin Betting and Parameter-Free Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Hardness of Online Sleeping Combinatorial Optimization Problems.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Parameter-Free Convex Learning through Coin Betting.
Proceedings of the 2016 Workshop on Automatic Machine Learning, 2016

Open Problem: Parameter-Free and Scale-Free Online Algorithms.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice.
CoRR, 2015

Scale-Free Algorithms for Online Linear Optimization.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

2014
Partial Monitoring - Classification, Regret Bounds, and Algorithms.
Math. Oper. Res., 2014

2013
Toward a classification of finite partial-monitoring games.
Theor. Comput. Sci., 2013

Online problémy v strojovom učení.
Proceedings of the Conference on Information Technologies, 2013

2012
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

2011
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments.
Proceedings of the COLT 2011, 2011

Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
CoRR, 2011

Improved Algorithms for Linear Stochastic Bandits.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010
Contextual Multi-Armed Bandits.
Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010

Impossibility Theorems for Domain Adaptation.
Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010

Estimation of Renyi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Toward a Classification of Finite Partial-Monitoring Games.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
Contributions to Unsupervised and Semi-Supervised Learning.
PhD thesis, 2009

Learning Low Density Separators.
Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009

General auction mechanism for search advertising.
Proceedings of the 18th International Conference on World Wide Web, 2009

Agnostic Online Learning.
Proceedings of the COLT 2009, 2009

2008
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007
Colouring Cubic Graphs by Small Steiner Triple Systems.
Graphs Comb., 2007

Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems.
Electron. Notes Discret. Math., 2007

Stability of <i>k</i> -Means Clustering.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
A Sober Look at Clustering Stability.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006


  Loading...