Alexandra Carpentier
34 papers · 2011–2026 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (44) π Academic Marathon Β· Full π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π
Keyword Trendsetter Combo
(3)
π
Keyword Champion
(2)
π§
Keyword Pioneer
π¬
Deep Specialist
(12)
π§¬
Topic Evolution
π₯
Unstoppable Β· Gold
π
Conference Pioneer
β‘
Prolific Year Β· Productive
π
Renaissance Researcher
(5)
ποΈ
Keyword Collector
(145)
π
Trend Setter
π
Century Club Β· Bronze
Top co-authors
Research topics
Machine Learning
(31)
Optimization & Theory
(23)
Mathematics & Optimization
(21)
Optimization
(19)
Learning Types
(18)
Core Methods
(10)
Mathematics
(8)
Artificial Intelligence
(5)
Core AI
(5)
Data Science & Analytics
(3)
Applications
(2)
Statistics
(2)
Computer Science
(1)
Healthcare & Medicine
(1)
Application Areas
(1)
Keywords
multi-armed bandit
(14)
regret bound
(12)
online learning
(6)
stochastic optimization
(5)
minimax optimal
(4)
stratified sampling
(4)
active learning
(4)
upper confidence bound
(4)
online algorithm
(3)
cumulative regret
(3)
stochastic bandit
(3)
linear bandit
(3)
bandit algorithm
(3)
fixed budget
(3)
variance reduction
(3)
monte carlo integration
(3)
thresholding bandit
(3)
regret minimization
(2)
minimax regret
(2)
compressed sensing
(2)
Papers
Phase Transition for Stochastic Block Model with more than $\sqrtn$ Communities
COLT 2026
Clustering with bandit feedback: breaking down the computation/information gap
ALT 2025
On Weak Regret Analysis for Dueling Bandits
NeurIPS 2024
Active Ranking of Experts Based on their Performances in Many Tasks
ICML 2023
Online Learning with Feedback Graphs: The True Shape of Regret
ICML 2023
The price of unfairness in linear bandits with biased feedback
NeurIPS 2022
Bandits with many optimal arms
NeurIPS 2021
Problem Dependent View on Structured Thresholding Bandit Problems
ICML 2021
Linear bandits with Stochastic Delayed Feedback
ICML 2020
Stochastic bandits with arm-dependent delays
ICML 2020
The Influence of Shape Constraints on the Thresholding Bandit Problem
COLT 2020
Active multiple matrix completion with adaptive confidence sets
AISTATS 2019
A minimax near-optimal algorithm for adaptive rejection sampling
ALT 2019
Rotting bandits are no harder than stochastic ones
AISTATS 2019
Adaptivity to Smoothness in X-armed bandits
COLT 2018
An Adaptive Strategy for Active Learning with Smooth Decision Boundary
ALT 2018
Two-Sample Tests for Large Random Graphs Using Network Statistics
COLT 2017
An optimal algorithm for the Thresholding Bandit Problem
ICML 2016
Learning Relationships between Data Obtained Independently
AISTATS 2016
Pliable Rejection Sampling
ICML 2016
Revealing Graph Bandits for Maximizing Local Influence
AISTATS 2016
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem
COLT 2016
Adaptive Strategy for Stratified Monte Carlo Sampling
JMLR 2015
Implementable confidence sets in high dimensional regression
AISTATS 2015
Simple regret for infinitely many armed bandits
ICML 2015
Extreme bandits
NeurIPS 2014
Stochastic Simultaneous Optimistic Optimization
ICML 2013
Toward Optimal Stratification for Stratified Monte-Carlo Integration
ICML 2013
Adaptive Stratified Sampling for Monte-Carlo integration of Differentiable functions
NeurIPS 2012
Bandit Algorithms boost Brain Computer Interfaces for motor-task selection of a brain-controlled button
NeurIPS 2012
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit
AISTATS 2012
Online allocation and homogeneous partitioning for piecewise constant mean-approximation
NeurIPS 2012
Finite Time Analysis of Stratified Sampling for Monte Carlo
NeurIPS 2011
Sparse Recovery with Brownian Sensing
NeurIPS 2011