default search action
Alexandra Carpentier
Person information
- affiliation: University of Potsdam, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c34]Emmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen:
Optimal rates for ranking a permuted isotonic matrix in polynomial time. SODA 2024: 3236-3273 - [i22]Victor Thuot, Alexandra Carpentier, Christophe Giraud, Nicolas Verzelen:
Active clustering with bandit feedback. CoRR abs/2406.11485 (2024) - [i21]Alexandra Carpentier:
A simple and improved algorithm for noisy, convex, zeroth-order optimisation. CoRR abs/2406.18672 (2024) - [i20]Maximilian Graf, Alexandra Carpentier, Nicolas Verzelen:
Optimal level set estimation for non-parametric tournament and crowdsourcing problems. CoRR abs/2408.15356 (2024) - 2023
- [c33]Tomás Kocák, Alexandra Carpentier:
Online Learning with Feedback Graphs: The True Shape of Regret. ICML 2023: 17260-17282 - [c32]El Mehdi Saad, Nicolas Verzelen, Alexandra Carpentier:
Active Ranking of Experts Based on their Performances in Many Tasks. ICML 2023: 29490-29513 - [i19]El Mehdi Saad, Nicolas Verzelen, Alexandra Carpentier:
Active Ranking of Experts Based on their Performances in Many Tasks. CoRR abs/2306.02628 (2023) - [i18]Tomás Kocák, Alexandra Carpentier:
Online Learning with Feedback Graphs: The True Shape of Regret. CoRR abs/2306.02971 (2023) - 2022
- [c31]Solenne Gaucher, Alexandra Carpentier, Christophe Giraud:
The price of unfairness in linear bandits with biased feedback. NeurIPS 2022 - 2021
- [c30]James Cheshire, Pierre Ménard, Alexandra Carpentier:
Problem Dependent View on Structured Thresholding Bandit Problems. ICML 2021: 1846-1854 - [c29]Rianne de Heide, James Cheshire, Pierre Ménard, Alexandra Carpentier:
Bandits with many optimal arms. NeurIPS 2021: 22457-22469 - [i17]Anne Gael Manegueu, Alexandra Carpentier, Yi Yu:
Generalized non-stationary bandits. CoRR abs/2102.00725 (2021) - [i16]Rianne de Heide, James Cheshire, Pierre Ménard, Alexandra Carpentier:
Bandits with many optimal arms. CoRR abs/2103.12452 (2021) - [i15]James Cheshire, Pierre Ménard, Alexandra Carpentier:
Problem Dependent View on Structured Thresholding Bandit Problems. CoRR abs/2106.10166 (2021) - [i14]Julien Chhor, Alexandra Carpentier:
Goodness-of-Fit Testing for Hölder-Continuous Densities: Sharp Local Minimax Rates. CoRR abs/2109.04346 (2021) - 2020
- [c28]James Cheshire, Pierre Ménard, Alexandra Carpentier:
The Influence of Shape Constraints on the Thresholding Bandit Problem. COLT 2020: 1228-1275 - [c27]Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier, Michal Valko:
Stochastic bandits with arm-dependent delays. ICML 2020: 3348-3356 - [c26]Claire Vernade, Alexandra Carpentier, Tor Lattimore, Giovanni Zappella, Beyza Ermis, Michael Brückner:
Linear bandits with Stochastic Delayed Feedback. ICML 2020: 9712-9721 - [i13]James Cheshire, Pierre Ménard, Alexandra Carpentier:
The Influence of Shape Constraints on the Thresholding Bandit Problem. CoRR abs/2006.10006 (2020) - [i12]Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier, Michal Valko:
Stochastic bandits with arm-dependent delays. CoRR abs/2006.10459 (2020) - [i11]Alexandra Carpentier, Claire Vernade, Yasin Abbasi-Yadkori:
The Elliptical Potential Lemma Revisited. CoRR abs/2010.10182 (2020)
2010 – 2019
- 2019
- [j3]Alexandra Carpentier, Olivier Collier, Laëtitia Comminges, Alexandre B. Tsybakov, Yuhao Wang:
Minimax Rate of Testing in Sparse Linear Regression. Autom. Remote. Control. 80(10): 1817-1834 (2019) - [c25]Andrea Locatelli, Alexandra Carpentier, Michal Valko:
Active multiple matrix completion with adaptive confidence sets. AISTATS 2019: 1783-1791 - [c24]Julien Seznec, Andrea Locatelli, Alexandra Carpentier, Alessandro Lazaric, Michal Valko:
Rotting bandits are no harder than stochastic ones. AISTATS 2019: 2564-2572 - [c23]Juliette Achdou, Joseph Lam-Weil, Alexandra Carpentier, Gilles Blanchard:
A minimax near-optimal algorithm for adaptive rejection sampling. ALT 2019: 94-126 - [i10]Joseph Lam-Weil, Alexandra Carpentier, Bharath K. Sriperumbudur:
Local minimax rates for closeness testing of discrete distributions. CoRR abs/1902.01219 (2019) - [i9]Oleksandr Zadorozhnyi, Gilles Blanchard, Alexandra Carpentier:
Restless dependent bandits with fading memory. CoRR abs/1906.10454 (2019) - 2018
- [c22]Andrea Locatelli, Alexandra Carpentier, Samory Kpotufe:
An Adaptive Strategy for Active Learning with Smooth Decision Boundary. ALT 2018: 547-571 - [c21]Andrea Locatelli, Alexandra Carpentier:
Adaptivity to Smoothness in X-armed bandits. COLT 2018: 1463-1492 - [i8]Claire Vernade, Alexandra Carpentier, Giovanni Zappella, Beyza Ermis, Michael Brückner:
Contextual Bandits under Delayed Feedback. CoRR abs/1807.02089 (2018) - [i7]Juliette Achdou, Joseph C. Lam, Alexandra Carpentier, Gilles Blanchard:
A minimax near-optimal algorithm for adaptive rejection sampling. CoRR abs/1810.09390 (2018) - [i6]Julien Seznec, Andrea Locatelli, Alexandra Carpentier, Alessandro Lazaric, Michal Valko:
Rotting bandits are no harder than stochastic ones. CoRR abs/1811.11043 (2018) - 2017
- [c20]Debarghya Ghoshdastidar, Maurilio Gutzeit, Alexandra Carpentier, Ulrike von Luxburg:
Two-Sample Tests for Large Random Graphs Using Network Statistics. COLT 2017: 954-977 - [c19]Andrea Locatelli, Alexandra Carpentier, Samory Kpotufe:
Adaptivity to Noise Parameters in Nonparametric Active Learning. COLT 2017: 1383-1416 - [i5]Andrea Locatelli, Alexandra Carpentier, Samory Kpotufe:
An Adaptive Strategy for Active Learning with Smooth Decision Boundary. CoRR abs/1711.09294 (2017) - 2016
- [c18]Alexandra Carpentier, Michal Valko:
Revealing Graph Bandits for Maximizing Local Influence. AISTATS 2016: 10-18 - [c17]Alexandra Carpentier, Teresa Schlueter:
Learning Relationships between Data Obtained Independently. AISTATS 2016: 658-666 - [c16]Alexandra Carpentier, Andrea Locatelli:
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem. COLT 2016: 590-604 - [c15]Andrea Locatelli, Maurilio Gutzeit, Alexandra Carpentier:
An optimal algorithm for the Thresholding Bandit Problem. ICML 2016: 1690-1698 - [c14]Akram Erraqabi, Michal Valko, Alexandra Carpentier, Odalric-Ambrym Maillard:
Pliable Rejection Sampling. ICML 2016: 2121-2129 - [i4]Andrea Locatelli, Maurilio Gutzeit, Alexandra Carpentier:
An optimal algorithm for the Thresholding Bandit Problem. CoRR abs/1605.08671 (2016) - [i3]Alexandra Carpentier, Andrea Locatelli:
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem. CoRR abs/1605.09004 (2016) - 2015
- [j2]Alexandra Carpentier, Rémi Munos, András Antos:
Adaptive strategy for stratified Monte Carlo sampling. J. Mach. Learn. Res. 16: 2231-2271 (2015) - [c13]Alexandra Carpentier:
Implementable confidence sets in high dimensional regression. AISTATS 2015 - [c12]Alexandra Carpentier, Michal Valko:
Simple regret for infinitely many armed bandits. ICML 2015: 1133-1141 - [i2]Alexandra Carpentier, Michal Valko:
Simple regret for infinitely many armed bandits. CoRR abs/1505.04627 (2015) - [i1]Alexandra Carpentier, Alessandro Lazaric, Mohammad Ghavamzadeh, Rémi Munos, Peter Auer, András Antos:
Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits. CoRR abs/1507.04523 (2015) - 2014
- [j1]Alexandra Carpentier
, Rémi Munos:
Minimax number of strata for online stratified sampling: The case of noisy samples. Theor. Comput. Sci. 558: 77-106 (2014) - [c11]Alexandra Carpentier, Michal Valko:
Extreme bandits. NIPS 2014: 1089-1097 - 2013
- [c10]Michal Valko, Alexandra Carpentier, Rémi Munos:
Stochastic Simultaneous Optimistic Optimization. ICML (2) 2013: 19-27 - [c9]Alexandra Carpentier, Rémi Munos:
Toward Optimal Stratification for Stratified Monte-Carlo Integration. ICML (2) 2013: 28-36 - 2012
- [c8]Alexandra Carpentier
Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples. ALT 2012: 229-244 - [c7]Alexandra Carpentier, Rémi Munos:
Adaptive Stratified Sampling for Monte-Carlo integration of Differentiable functions. NIPS 2012: 251-259 - [c6]Joan Fruitet, Alexandra Carpentier, Rémi Munos, Maureen Clerc:
Bandit Algorithms boost Brain Computer Interfaces for motor-task selection of a brain-controlled button. NIPS 2012: 458-466 - [c5]Alexandra Carpentier, Odalric-Ambrym Maillard:
Online allocation and homogeneous partitioning for piecewise constant mean-approximation. NIPS 2012: 1970-1978 - [c4]Alexandra Carpentier, Rémi Munos:
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit. AISTATS 2012: 190-198 - 2011
- [c3]Alexandra Carpentier
Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits. ALT 2011: 189-203 - [c2]Alexandra Carpentier, Rémi Munos:
Finite Time Analysis of Stratified Sampling for Monte Carlo. NIPS 2011: 1278-1286 - [c1]Alexandra Carpentier, Odalric-Ambrym Maillard, Rémi Munos:
Sparse Recovery with Brownian Sensing. NIPS 2011: 1782-1790
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-09-30 01: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: