default search action
Nicolas Verzelen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [c7]Victor Thuot, Alexandra Carpentier, Christophe Giraud, Nicolas Verzelen:
Clustering with bandit feedback: breaking down the computation/information gap. ALT 2025: 1221-1284 - [i6]Maximilian Graf, Victor Thuot, Nicolas Verzelen:
Clustering Items through Bandit Feedback: Finding the Right Feature out of Many. CoRR abs/2503.11209 (2025) - 2024
- [c6]Bertrand Even, Christophe Giraud, Nicolas Verzelen:
Computation-information gap in high-dimensional clustering. COLT 2024: 1646-1712 - [c5]El Mehdi Saad, Alexandra Carpentier, Tomás Kocák, Nicolas Verzelen:
On Weak Regret Analysis for Dueling Bandits. NeurIPS 2024 - [c4]Emmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen:
Optimal rates for ranking a permuted isotonic matrix in polynomial time. SODA 2024: 3236-3273 - [i5]Victor Thuot, Alexandra Carpentier, Christophe Giraud, Nicolas Verzelen:
Active clustering with bandit feedback. CoRR abs/2406.11485 (2024) - [i4]Maximilian Graf, Alexandra Carpentier, Nicolas Verzelen:
Optimal level set estimation for non-parametric tournament and crowdsourcing problems. CoRR abs/2408.15356 (2024) - 2023
- [c3]El Mehdi Saad, Nicolas Verzelen, Alexandra Carpentier:
Active Ranking of Experts Based on their Performances in Many Tasks. ICML 2023: 29490-29513 - [c2]El Mehdi Saad, Gilles Blanchard, Nicolas Verzelen:
Covariance-adaptive best arm identification. NeurIPS 2023 - [i3]El Mehdi Saad, Nicolas Verzelen, Alexandra Carpentier:
Active Ranking of Experts Based on their Performances in Many Tasks. CoRR abs/2306.02628 (2023) - [i2]El Mehdi Saad, Gilles Blanchard, Nicolas Verzelen:
Covariance Adaptive Best Arm Identification. CoRR abs/2306.02630 (2023)
2010 – 2019
- 2018
- [j4]Jess Banks, Cristopher Moore
, Roman Vershynin, Nicolas Verzelen, Jiaming Xu
Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization. IEEE Trans. Inf. Theory 64(7): 4872-4894 (2018) - [i1]Christophe Giraud, Nicolas Verzelen:
Partial recovery bounds for clustering with the relaxed K-means. CoRR abs/1807.07547 (2018) - 2017
- [c1]Jess Banks, Cristopher Moore
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. ISIT 2017: 1137-1141 - 2010
- [j3]Nicolas Verzelen:
Data-driven neighborhood selection of a Gaussian field. Comput. Stat. Data Anal. 54(5): 1355-1371 (2010)
2000 – 2009
- 2009
- [j2]Nicolas Verzelen, Fanny Villers:
Tests for Gaussian graphical models. Comput. Stat. Data Anal. 53(5): 1894-1905 (2009) - 2008
- [j1]Noel Cressie
Conditional-mean least-squares fitting of Gaussian Markov random fields to Gaussian fields. Comput. Stat. Data Anal. 52(5): 2794-2807 (2008)
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 2025-04-22 21:00 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: