default search action
Gábor Lugosi
- > Home > Persons > Gábor Lugosi
Publications
- 2017
- [c38]Nicolò Cesa-Bianchi, Claudio Gentile, Gergely Neu, Gábor Lugosi:
Boltzmann Exploration Done Right. NIPS 2017: 6284-6293 - [i18]Nicolò Cesa-Bianchi, Claudio Gentile, Gábor Lugosi, Gergely Neu:
Boltzmann Exploration Done Right. CoRR abs/1705.10257 (2017) - 2013
- [j44]Sébastien Bubeck, Nicolò Cesa-Bianchi, Gábor Lugosi:
Bandits With Heavy Tail. IEEE Trans. Inf. Theory 59(11): 7711-7717 (2013) - 2012
- [j43]Nicolò Cesa-Bianchi, Gábor Lugosi:
Combinatorial bandits. J. Comput. Syst. Sci. 78(5): 1404-1422 (2012) - [c34]Nicolò Cesa-Bianchi, Pierre Gaillard, Gábor Lugosi, Gilles Stoltz:
Mirror Descent Meets Fixed Share (and feels no regret). NIPS 2012: 989-997 - [i10]Nicolò Cesa-Bianchi, Pierre Gaillard, Gábor Lugosi, Gilles Stoltz:
A new look at shifting regret. CoRR abs/1202.3323 (2012) - [i8]Sébastien Bubeck, Nicolò Cesa-Bianchi, Gábor Lugosi:
Bandits with heavy tail. CoRR abs/1209.1727 (2012) - 2009
- [c32]Nicolò Cesa-Bianchi, Gábor Lugosi:
Combinatorial Bandits. COLT 2009 - 2006
- [b3]Nicolò Cesa-Bianchi, Gábor Lugosi:
Prediction, learning, and games. Cambridge University Press 2006, ISBN 978-0-521-84108-5, pp. I-XII, 1-394 - [j29]Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Regret Minimization Under Partial Monitoring. Math. Oper. Res. 31(3): 562-580 (2006) - [c25]Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Regret Minimization Under Partial Monitoring. ITW 2006: 72-76 - 2005
- [j27]Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Minimizing regret with label efficient prediction. IEEE Trans. Inf. Theory 51(6): 2152-2162 (2005) - 2004
- [c18]Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Minimizing Regret with Label Efficient Prediction. COLT 2004: 77-92 - 2003
- [j24]Nicolò Cesa-Bianchi, Gábor Lugosi:
Potential-Based Algorithms in On-Line Prediction and Game Theory. Mach. Learn. 51(3): 239-261 (2003) - 2001
- [j20]Nicolò Cesa-Bianchi, Gábor Lugosi:
Worst-Case Bounds for the Logarithmic Loss of Predictors. Mach. Learn. 43(3): 247-264 (2001) - [c11]Nicolò Cesa-Bianchi, Gábor Lugosi:
Potential-Based Algorithms in Online Prediction and Game Theory. COLT/EuroCOLT 2001: 48-64 - 1999
- [c8]Nicolò Cesa-Bianchi, Gábor Lugosi:
Minimax Regret Under log Loss for General Classes of Experts. COLT 1999: 12-18 - 1998
- [c7]Nicolò Cesa-Bianchi, Gábor Lugosi:
On Sequential Prediction of Individual Sequences Relative to a Set of Experts. COLT 1998: 1-11
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-09-14 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint