Alexandra Carpentier

Orcid: 0000-0002-1194-7385

Affiliations:
  • University of Potsdam, Germany


According to our database1, Alexandra Carpentier authored at least 47 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal level set estimation for non-parametric tournament and crowdsourcing problems.
CoRR, 2024

A simple and improved algorithm for noisy, convex, zeroth-order optimisation.
CoRR, 2024

Active clustering with bandit feedback.
CoRR, 2024

Optimal rates for ranking a permuted isotonic matrix in polynomial time.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Active Ranking of Experts Based on their Performances in Many Tasks.
Proceedings of the International Conference on Machine Learning, 2023

Online Learning with Feedback Graphs: The True Shape of Regret.
Proceedings of the International Conference on Machine Learning, 2023

2022
The price of unfairness in linear bandits with biased feedback.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Goodness-of-Fit Testing for Hölder-Continuous Densities: Sharp Local Minimax Rates.
CoRR, 2021

Generalized non-stationary bandits.
CoRR, 2021

Bandits with many optimal arms.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Problem Dependent View on Structured Thresholding Bandit Problems.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
The Elliptical Potential Lemma Revisited.
CoRR, 2020

Linear bandits with Stochastic Delayed Feedback.
Proceedings of the 37th International Conference on Machine Learning, 2020

Stochastic bandits with arm-dependent delays.
Proceedings of the 37th International Conference on Machine Learning, 2020

The Influence of Shape Constraints on the Thresholding Bandit Problem.
Proceedings of the Conference on Learning Theory, 2020

2019
Restless dependent bandits with fading memory.
CoRR, 2019

Local minimax rates for closeness testing of discrete distributions.
CoRR, 2019

Minimax Rate of Testing in Sparse Linear Regression.
Autom. Remote. Control., 2019

A minimax near-optimal algorithm for adaptive rejection sampling.
Proceedings of the Algorithmic Learning Theory, 2019

Rotting bandits are no harder than stochastic ones.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Active multiple matrix completion with adaptive confidence sets.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Contextual Bandits under Delayed Feedback.
CoRR, 2018

Adaptivity to Smoothness in X-armed bandits.
Proceedings of the Conference On Learning Theory, 2018

An Adaptive Strategy for Active Learning with Smooth Decision Boundary.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Two-Sample Tests for Large Random Graphs Using Network Statistics.
Proceedings of the 30th Conference on Learning Theory, 2017

Adaptivity to Noise Parameters in Nonparametric Active Learning.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
An optimal algorithm for the Thresholding Bandit Problem.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Pliable Rejection Sampling.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem.
Proceedings of the 29th Conference on Learning Theory, 2016

Revealing Graph Bandits for Maximizing Local Influence.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

Learning Relationships between Data Obtained Independently.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Adaptive strategy for stratified Monte Carlo sampling.
J. Mach. Learn. Res., 2015

Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits.
CoRR, 2015

Simple regret for infinitely many armed bandits.
Proceedings of the 32nd International Conference on Machine Learning, 2015

Implementable confidence sets in high dimensional regression.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014
Minimax number of strata for online stratified sampling: The case of noisy samples.
Theor. Comput. Sci., 2014

Extreme bandits.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Stochastic Simultaneous Optimistic Optimization.
Proceedings of the 30th International Conference on Machine Learning, 2013

Toward Optimal Stratification for Stratified Monte-Carlo Integration.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Bandit Algorithms boost Brain Computer Interfaces for motor-task selection of a brain-controlled button.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Online allocation and homogeneous partitioning for piecewise constant mean-approximation.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Adaptive Stratified Sampling for Monte-Carlo integration of Differentiable functions.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Sparse Recovery with Brownian Sensing.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Finite Time Analysis of Stratified Sampling for Monte Carlo.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011


  Loading...