default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Locatelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Devanarayanan Ettisserry, Angelo Visconti, Mauro Bonanomi, Riccardo Pazzocco, Andrea Locatelli, Alessandro Sebastiani, Ashonita Chavan, Matthew Hollander, Giorgio Servalli, Alessandro Calderoni, Nirmal Ramaswamy:
Comprehensive Reliability Assessment of 32Gb (Hf,Zr)O2-Based Ferroelectric NVDRAM. IRPS 2024: 1-8- 2020
- [b1]Andrea Locatelli:
On adaptivity in active sequential learning. University of Halle, Germany, 2020
2010 – 2019
- 2019
- [c9]Andrea Locatelli, Alexandra Carpentier, Michal Valko:
Active multiple matrix completion with adaptive confidence sets. AISTATS 2019: 1783-1791 - [c8]Julien Seznec, Andrea Locatelli, Alexandra Carpentier, Alessandro Lazaric, Michal Valko:
Rotting bandits are no harder than stochastic ones. AISTATS 2019: 2564-2572 - 2018
- [c7]Andrea Locatelli, Alexandra Carpentier, Samory Kpotufe:
An Adaptive Strategy for Active Learning with Smooth Decision Boundary. ALT 2018: 547-571 - [c6]Andrea Locatelli, Alexandra Carpentier:
Adaptivity to Smoothness in X-armed bandits. COLT 2018: 1463-1492 - [i4]Julien Seznec, Andrea Locatelli, Alexandra Carpentier, Alessandro Lazaric, Michal Valko:
Rotting bandits are no harder than stochastic ones. CoRR abs/1811.11043 (2018) - 2017
- [c5]Andrea Locatelli, Alexandra Carpentier, Samory Kpotufe:
Adaptivity to Noise Parameters in Nonparametric Active Learning. COLT 2017: 1383-1416 - [i3]Andrea Locatelli, Alexandra Carpentier, Samory Kpotufe:
An Adaptive Strategy for Active Learning with Smooth Decision Boundary. CoRR abs/1711.09294 (2017) - 2016
- [c4]Alexandra Carpentier, Andrea Locatelli:
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem. COLT 2016: 590-604 - [c3]Davide Rocco, Luca Carletti
, Andrea Locatelli, Costantino De Angelis, Valerio F. Gili, Giuseppe Leo:
Modelling And Optimization Of The Second-Harmonic Radiation Pattern In Dielectric Nanoantennas. ECMS 2016: 453-459 - [c2]Andrea Locatelli, Maurilio Gutzeit, Alexandra Carpentier:
An optimal algorithm for the Thresholding Bandit Problem. ICML 2016: 1690-1698 - [i2]Andrea Locatelli, Maurilio Gutzeit, Alexandra Carpentier:
An optimal algorithm for the Thresholding Bandit Problem. CoRR abs/1605.08671 (2016) - [i1]Alexandra Carpentier, Andrea Locatelli:
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem. CoRR abs/1605.09004 (2016) - 2014
- [c1]Costantino De Angelis, Andrea Locatelli:
Efficient Modeling Of Graphene Based Optical Devices. ECMS 2014: 171-176
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-10-17 21:31 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:
