default search action
Dávid Pál
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i16]Jonathan Gu, Dávid Pál, Kevin Ryan:
Auction for Double-Wide Ads. CoRR abs/2207.04172 (2022) - 2021
- [i15]Francesco Orabona, Dávid Pál:
Parameter-free Stochastic Optimization of Variationally Coherent Functions. CoRR abs/2102.00236 (2021) - 2020
- [c23]Utkarsh Upadhyay, Róbert Busa-Fekete, Wojciech Kotlowski, Dávid Pál, Balázs Szörényi:
Learning to Crawl. AAAI 2020: 6046-6053
2010 – 2019
- 2019
- [c22]Alina Beygelzimer, Dávid Pál, Balázs Szörényi, Devanathan Thiruvenkatachari, Chen-Yu Wei, Chicheng Zhang:
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case. ICML 2019: 624-633 - [c21]Alexander Golovnev, Dávid Pál, Balázs Szörényi:
The information-theoretic value of unlabeled data in semi-supervised learning. ICML 2019: 2328-2336 - [i14]Alexander Golovnev, Dávid Pál, Balázs Szörényi:
The information-theoretic value of unlabeled data in semi-supervised learning. CoRR abs/1901.05515 (2019) - [i13]Alina Beygelzimer, Dávid Pál, Balázs Szörényi, Devanathan Thiruvenkatachari, Chen-Yu Wei, Chicheng Zhang:
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case. CoRR abs/1902.02244 (2019) - [i12]Utkarsh Upadhyay, Róbert Busa-Fekete, Wojciech Kotlowski, Dávid Pál, Balázs Szörényi:
Learning to Crawl. CoRR abs/1905.12781 (2019) - 2018
- [j5]Francesco Orabona, Dávid Pál:
Scale-free online learning. Theor. Comput. Sci. 716: 50-69 (2018) - 2017
- [c20]Satyen Kale, Zohar S. Karnin, Tengyuan Liang, Dávid Pál:
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP. ICML 2017: 1780-1788 - [i11]Satyen Kale, Zohar S. Karnin, Tengyuan Liang, Dávid Pál:
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP. CoRR abs/1706.04690 (2017) - 2016
- [c19]Francesco Orabona, Dávid Pál:
Open Problem: Parameter-Free and Scale-Free Online Algorithms. COLT 2016: 1659-1664 - [c18]Francesco Orabona, Dávid Pál:
Parameter-Free Convex Learning through Coin Betting. AutoML@ICML 2016: 75-82 - [c17]Francesco Orabona, Dávid Pál:
Coin Betting and Parameter-Free Online Learning. NIPS 2016: 577-585 - [c16]Satyen Kale, Chansoo Lee, Dávid Pál:
Hardness of Online Sleeping Combinatorial Optimization Problems. NIPS 2016: 2181-2189 - [i10]Francesco Orabona, Dávid Pál:
Scale-Free Online Learning. CoRR abs/1601.01974 (2016) - [i9]Francesco Orabona, Dávid Pál:
From Coin Betting to Parameter-Free Online Learning. CoRR abs/1602.04128 (2016) - 2015
- [c15]Francesco Orabona, Dávid Pál:
Scale-Free Algorithms for Online Linear Optimization. ALT 2015: 287-301 - [i8]Francesco Orabona, Dávid Pál:
Scale-Free Algorithms for Online Linear Optimization. CoRR abs/1502.05744 (2015) - [i7]Satyen Kale, Chansoo Lee, Dávid Pál:
Hardness of Online Sleeping Combinatorial Optimization Problems. CoRR abs/1509.03600 (2015) - [i6]Francesco Orabona, Dávid Pál:
Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice. CoRR abs/1511.02176 (2015) - 2014
- [j4]Gábor Bartók, Dean P. Foster, Dávid Pál, Alexander Rakhlin, Csaba Szepesvári:
Partial Monitoring - Classification, Regret Bounds, and Algorithms. Math. Oper. Res. 39(4): 967-997 (2014) - 2013
- [j3]András Antos, Gábor Bartók, Dávid Pál, Csaba Szepesvári:
Toward a classification of finite partial-monitoring games. Theor. Comput. Sci. 473: 77-99 (2013) - [c14]Dávid Pál:
Online problémy v strojovom učení. ITAT 2013: 1 - 2012
- [c13]Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári:
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits. AISTATS 2012: 1-9 - 2011
- [c12]Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári:
Improved Algorithms for Linear Stochastic Bandits. NIPS 2011: 2312-2320 - [c11]Gábor Bartók, Dávid Pál, Csaba Szepesvári:
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments. COLT 2011: 133-154 - [i5]András Antos, Gábor Bartók, Dávid Pál, Csaba Szepesvári:
Toward a Classification of Finite Partial-Monitoring Games. CoRR abs/1102.2041 (2011) - [i4]Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári:
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems. CoRR abs/1102.2670 (2011) - 2010
- [c10]Gábor Bartók, Dávid Pál, Csaba Szepesvári:
Toward a Classification of Finite Partial-Monitoring Games. ALT 2010: 224-238 - [c9]Dávid Pál, Barnabás Póczos, Csaba Szepesvári:
Estimation of Renyi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs. NIPS 2010: 1849-1857 - [c8]Shai Ben-David, Tyler Lu, Teresa Luu, Dávid Pál:
Impossibility Theorems for Domain Adaptation. AISTATS 2010: 129-136 - [c7]Tyler Lu, Dávid Pál, Martin Pal:
Contextual Multi-Armed Bandits. AISTATS 2010: 485-492 - [i3]Dávid Pál, Barnabás Póczos, Csaba Szepesvári:
Estimation of Rényi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs. CoRR abs/1003.1954 (2010)
2000 – 2009
- 2009
- [b1]Dávid Pál:
Contributions to Unsupervised and Semi-Supervised Learning. University of Waterloo, Ontario, Canada, 2009 - [c6]Shai Ben-David, Dávid Pál, Shai Shalev-Shwartz:
Agnostic Online Learning. COLT 2009 - [c5]Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál:
General auction mechanism for search advertising. WWW 2009: 241-250 - [c4]Shai Ben-David, Tyler Lu, Dávid Pál, Miroslava Sotáková:
Learning Low Density Separators. AISTATS 2009: 25-32 - 2008
- [c3]Shai Ben-David, Tyler Lu, Dávid Pál:
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning. COLT 2008: 33-44 - [i2]Shai Ben-David, Tyler Lu, Dávid Pál, Miroslava Sotáková:
Learning Low-Density Separators. CoRR abs/0805.2891 (2008) - [i1]Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál:
General Auction Mechanism for Search Advertising. CoRR abs/0807.1297 (2008) - 2007
- [j2]Dávid Pál, Martin Skoviera:
Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems. Electron. Notes Discret. Math. 28: 485-492 (2007) - [j1]Dávid Pál, Martin Skoviera:
Colouring Cubic Graphs by Small Steiner Triple Systems. Graphs Comb. 23(2): 217-228 (2007) - [c2]Shai Ben-David, Dávid Pál, Hans Ulrich Simon:
Stability of k -Means Clustering. COLT 2007: 20-34 - 2006
- [c1]Shai Ben-David, Ulrike von Luxburg, Dávid Pál:
A Sober Look at Clustering Stability. COLT 2006: 5-19
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint