default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Nicolò Cesa-Bianchi
![[0000-0001-8477-4748]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-8477-4748")
University of Milan, Italy
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 263 matches
- 2024
- Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Margin-Based Active Learning of Classifiers. J. Mach. Learn. Res. 25: 127:1-127:45 (2024) - Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Regret Analysis of Bilateral Trade with a Smoothed Adversary. J. Mach. Learn. Res. 25: 234:1-234:36 (2024) - Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. Math. Oper. Res. 49(1): 171-203 (2024) - Nicolò Cesa-Bianchi, Tommaso Cesari, Riccardo Della Vecchia:
Cooperative Online Learning with Feedback Graphs. Trans. Mach. Learn. Res. 2024 (2024) - Giulia Clerici, Pierre Laforgue, Nicolò Cesa-Bianchi:
Linear Bandits with Memory. Trans. Mach. Learn. Res. 2024 (2024) - Juliette Achddou, Nicolò Cesa-Bianchi, Pierre Laforgue:
Multitask Online Learning: Listen to the Neighborhood Buzz. AISTATS 2024: 1846-1854 - Yuko Kuroki, Alberto Rumi, Taira Tsuchiya, Fabio Vitale, Nicolò Cesa-Bianchi:
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits. AISTATS 2024: 1216-1224 - Stephen U. Pasteris, Alberto Rumi, Fabio Vitale, Nicolò Cesa-Bianchi:
Sum-max Submodular Bandits. AISTATS 2024: 2323-2331 - Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen:
A Theory of Interpretable Approximations. COLT 2024: 648-668 - Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. STOC 2024: 225-236 - Khaled Eldowa, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli:
Information Capacity Regret Bounds for Bandits with Mediator Feedback. CoRR abs/2402.10282 (2024) - François Bachoc, Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni:
Fair Online Bilateral Trade. CoRR abs/2405.13919 (2024) - Tianyuan Jin, Kyoungseok Jang, Nicolò Cesa-Bianchi:
Sparsity-Agnostic Linear Bandits with Adaptive Adversaries. CoRR abs/2406.01192 (2024) - Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen:
A Theory of Interpretable Approximations. CoRR abs/2406.10529 (2024) - Nicolò Cesa-Bianchi, Khaled Eldowa, Emmanuel Esposito, Julia Olkhovskaya:
Improved Regret Bounds for Bandits with Expert Advice. CoRR abs/2406.16802 (2024) - Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Luigi Foscari, Vinayak Pathak:
Market Making without Regret. CoRR abs/2411.13993 (2024) - Juliette Achddou, Nicolò Cesa-Bianchi, Hao Qiu:
Distributed Online Optimization with Stochastic Agent Availability. CoRR abs/2411.16477 (2024) - 2023
- Lukas Zierahn, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Gergely Neu:
Nonstochastic Contextual Combinatorial Bandits. AISTATS 2023: 8771-8813 - Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Learning the Stackelberg Equilibrium in a Newsvendor Game. AAMAS 2023: 242-250 - Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. COLT 2023: 1095-1130 - 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 - 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 - 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 - Khaled Eldowa, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli:
Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice. ITW 2023: 30-35 - Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari, Nicolò Cesa-Bianchi:
On the Minimax Regret for Online Learning with Feedback Graphs. NeurIPS 2023 - Pier Giuseppe Sessa, Pierre Laforgue, Nicolò Cesa-Bianchi, Andreas Krause:
Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning. NeurIPS 2023 - Giulia Clerici, Pierre Laforgue, Nicolò Cesa-Bianchi:
Linear Bandits with Memory: from Rotting to Rising. CoRR abs/2302.08345 (2023) - Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. CoRR abs/2302.10805 (2023) - Khaled Eldowa, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli:
Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice. CoRR abs/2303.08102 (2023) - 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)
skipping 233 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2025-01-17 00:10 CET from data curated 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:
