default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolò Cesa-Bianchi
- > Home > Persons > Nicolò Cesa-Bianchi
Publications
- 2023
[c111]Lukas Zierahn
, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Gergely Neu:
Nonstochastic Contextual Combinatorial Bandits. AISTATS 2023: 8771-8813- [c108]Dirk van der Hoeven, Lukas Zierahn, Tal Lancewicki, Aviv Rosenberg, Nicolò Cesa-Bianchi:
A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs. COLT 2023: 1285-1321 - [c107]Emmanuel Esposito, Saeed Masoudian, Hao Qiu, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Delayed Bandits: When Do Intermediate Observations Help? ICML 2023: 9374-9395 - [c106]Dirk van der Hoeven, Ciara Pike-Burke, Hao Qiu, Nicolò Cesa-Bianchi:
Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts. ICML 2023: 34809-34830 - [i74]Dirk van der Hoeven, Lukas Zierahn, Tal Lancewicki, Aviv Rosenberg, Nicolò Cesa-Bianchi:
A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs. CoRR abs/2305.08629 (2023) - [i72]Emmanuel Esposito, Saeed Masoudian, Hao Qiu, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Delayed Bandits: When Do Intermediate Observations Help? CoRR abs/2305.19036 (2023) - [i71]Dirk van der Hoeven, Ciara Pike-Burke, Hao Qiu, Nicolò Cesa-Bianchi:
Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts. CoRR abs/2307.00836 (2023) - [i68]Dirk van der Hoeven, Nikita Zhivotovskiy, Nicolò Cesa-Bianchi:
High-Probability Risk Bounds via Sequential Predictors. CoRR abs/2308.07588 (2023) - 2022
- [c101]Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Nonstochastic Bandits and Experts with Arm-Dependent Delays. AISTATS 2022: 2022-2044 - [c99]Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Learning on the Edge: Online Learning with Stochastic Feedback Graphs. NeurIPS 2022 - [c98]Dirk van der Hoeven, Nikita Zhivotovskiy, Nicolò Cesa-Bianchi:
A Regret-Variance Trade-Off in Online Learning. NeurIPS 2022 - [c97]Chloé Rouyer, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs. NeurIPS 2022 - [i63]Chloé Rouyer, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs. CoRR abs/2206.00557 (2022) - [i62]Dirk van der Hoeven, Nikita Zhivotovskiy, Nicolò Cesa-Bianchi:
A Regret-Variance Trade-Off in Online Learning. CoRR abs/2206.02656 (2022) - [i59]Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Learning on the Edge: Online Learning with Stochastic Feedback Graphs. CoRR abs/2210.04229 (2022) - 2021
- [c93]Dirk van der Hoeven, Federico Fusco, Nicolò Cesa-Bianchi:
Beyond Bandit Feedback in Online Multiclass Classification. NeurIPS 2021: 13280-13291 - [i53]Dirk van der Hoeven, Federico Fusco, Nicolò Cesa-Bianchi:
Beyond Bandit Feedback in Online Multiclass Classification. CoRR abs/2106.03596 (2021) - [i48]Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Nonstochastic Bandits and Experts with Arm-Dependent Delays. CoRR abs/2111.01589 (2021)
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-22 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
