OC
Olivier Cappé
cs.LGstat.MLmath.STstat.THstat.COcs.AIastro-ph.COcs.CLcs.IRcs.NI
On Valency
published · living versionsW_kqjk6sht·v1 · currentpublished
W_zakmtbhq·v1published
W_btw9qywv·v1published
W_gfzjbtxd·v1published
Preprints & journals
40 papers in the corpus · 2005–2026Reliable Estimation of Differential Privacy under Selection Bias2610.27021v1 · Valentin Dorseuil (DI-ENS), Meenatchi Sundaram Muthu Selva Annamalai (UCL), Jamal Atif (CMAP) et al.2026 · 0 citationsarXiv
Counterfactual Certification for Sequential Unlearning with Long-Run Performance Guarantees2610.17993v1 · Hanna Benarroch (DI-ENS), Jamal Atif (CMAP), Olivier Capp'e (DI-ENS)2026 · 0 citationsarXiv
Certified Per-Instance Unlearning Using Individual Sensitivity Bounds2602.15602v3 · Hanna Benarroch (DI-ENS), Jamal Atif (CMAP), Olivier Capp'e (DI-ENS)2026 · 0 citationsarXiv
Assessing Per-Sample Membership Inference Vulnerability without Retraining2602.15919v2 · Valentin Dorseuil (DI-ENS), Jamal Atif (CMAP), Olivier Capp'e (DI-ENS)2026 · 0 citationsarXiv
Learning To Sample From Diffusion Models Via Inverse Reinforcement Learning2602.08689v2 · Constant Bourdrez, Alexandre V'erine, Olivier Capp'e2026 · 0 citationsarXiv
Stochastic Direct Search Method for Blind Resource Allocation2210.05222v2 · Juliette Achddou (PSL, DI-ENS), Olivier Cappe et al.2022 · 0 citationsTransactions on Machine Learning Research Journal, 2024
A/B/n Testing with Control in the Presence of Subpopulations2110.15573v1 · Yoan Russac, Christina Katsimerou, Dennis Bohle et al.2021 · 9 citationsNeurIPS 2021, Dec 2021, Virtual, France
Fast Rate Learning in Stochastic First Price Bidding2107.01835v2 · Juliette Achddou (DI-ENS, VALDA ), Olivier Capp'e (VALDA et al.2021 · 3 citationsACML 2021 - Proceedings of Machine Learning Research 157, 2021, Nov 2021, SIngapore, Singapore
On Limited-Memory Subsampling Strategies for Bandits2106.10935v1 · Dorian Baudry, Yoan Russac, Olivier Capp'e2021 · 2 citationsICML 2021- International Conference on Machine Learning, Jul 2021, Vienna- Virtual, Austria
Efficient Algorithms for Stochastic Repeated Second-price Auctions2011.05072v2 · Juliette Achddou (VALDA), Olivier Capp'e (VALDA), Aur'elien Garivier (UMPA-ENSL)2020 · 2 citationsALT 2021, Mar 2021, Paris, France
Self-Concordant Analysis of Generalized Linear Bandits with Forgetting2011.00819v2 · Yoan Russac, Louis Faury, Olivier Capp'e (DI-ENS et al.2020 · 3 citationsAISTATS 2021 - International Conference on Artificial Intelligence and Statistics, Apr 2021, San Diego / Virtual, United States
A Comparative Study of Gamma Markov Chains for Temporal Non-Negative Matrix Factorization2006.12843v5 · Louis Filstroff, Olivier Gouvert, C'edric F'evotte et al.2020 · 2 citationsarXiv
Algorithms for Non-Stationary Generalized Linear Bandits2003.10113v1 · Yoan Russac (DI-ENS), Olivier Capp'e (DI-ENS), Aur'elien Garivier (UMPA-ENSL)2020 · 9 citationsarXiv
Weighted Linear Bandits for Non-Stationary Environments1909.09146v2 · Yoan Russac (DI-ENS, VALDA), Claire Vernade et al.2019 · 59 citationsNeurIPS 2019 - 33rd Conference on Neural Information Processing Systems, Dec 2019, Vancouver, Canada
Stochastic Bandit Models for Delayed Conversions1706.09186v3 · Claire Vernade, Olivier Capp'e, Vianney Perchet2017 · 44 citationsarXiv
Algorithms for Online Influencer Marketing1702.05354v2 · Paul Lagr'ee, Olivier Capp'e, Bogdan Cautis et al.2017 · 51 citationsarXiv
Multiple-Play Bandits in the Position-Based Model1606.02448v1 · Paul Lagr'ee (UP11, LRI), Claire Vernade (LTCI) et al.2016 · 38 citationsarXivon Valency
Sequential ranking under random semi-bandit feedback1603.01450v2 · Hossein Vahabi, Paul Lagr'ee, Claire Vernade et al.2016 · 0 citationsarXiv
Learning From Missing Data Using Selection Bias in Movie Recommendation1509.09130v1 · Claire Vernade (LTCI), Olivier Capp'e (LTCI)2015 · 5 citationsarXiv
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models1407.4443v2 · Emilie Kaufmann (SEQUEL, LTCI), Olivier Capp'e (LTCI) et al.2014 · 704 citationsJournal of Machine Learning Research, Journal of Machine Learning Research, 2016, 17, pp.1-42on Valency
On the Complexity of A/B Testing1405.3224v2 · Emilie Kaufmann (LTCI), Olivier Capp'e (LTCI), Aur'elien Garivier (IMT)2014 · 12 citationsConference on Learning Theory, Jun 2014, Barcelona, Spain. JMLR: Workshop and Conference Proceedings, 35, pp.461-481
Adaptive MCMC with online relabeling1210.2601v3 · R'emi Bardenet, Olivier Capp'e, Gersende Fort et al.2012 · 3 citationsBernoulli 2015, Vol. 21, No. 3, 1304-1340
Kullback-Leibler upper confidence bounds for optimal sequential allocation1210.1136v4 · Olivier Capp'e, Aur'elien Garivier, Odalric-Ambrym Maillard et al.2012 · 307 citationsAnnals of Statistics 2013, Vol. 41, No. 3, 1516-1541
Homogeneity and change-point detection tests for multivariate data using rank statistics1107.1971v3 · Alexandre Lung-Yut-Fong (LTCI), C'eline L'evy-Leduc (LTCI), Olivier Capp'e (LTCI)2011 · 66 citationsarXiv
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond1102.2490v5 · Aur'elien Garivier, Olivier Capp'e2011 · 363 citationsConference On Learning Theory n{\deg}24 Jul. 2011 pp.359-376on Valency
Robust Retrospective Multiple Change-point Estimation for Multivariate Data1102.1796v2 · Alexandre Lung-Yut-Fong (LTCI), C'eline L'evy-Leduc (LTCI), Olivier Capp'e (LTCI)2011 · 8 citationsarXiv
CosmoPMC: Cosmology Population Monte Carlo1101.0950v3 · Martin Kilbinger, Karim Benabed, Olivier Cappe et al.2011 · 18 citationsarXiv
Online Expectation-Maximisation1011.1745v1 · Olivier Capp'e (LTCI)2010 · 0 citationsarXivon Valency
Optimism in Reinforcement Learning and Kullback-Leibler Divergence1004.5229v3 · Sarah Filippi (LTCI), Olivier Capp'e (LTCI), Aur'elien Garivier (LTCI)2010 · 66 citationsarXiv
Bayesian model comparison in cosmology with Population Monte Carlo0912.1614v2 · Martin Kilbinger, Darren Wraith, Christian P. Robert et al.2009 · 45 citationsarXiv
Distributed detection/localization of change-points in high-dimensional network traffic data0909.5524v2 · Alexandre Lung-Yut-Fong (LTCI), C'eline L'evy-Leduc (LTCI), Olivier Capp'e (LTCI)2009 · 38 citationsarXiv
Efficient Learning of Sparse Conditional Random Fields for Supervised Sequence Labelling0909.1308v2 · Nataliya Sokolovska (LTCI), Thomas Lavergne (LIMSI), Olivier Capp'e (LTCI) et al.2009 · 15 citationsarXiv
Online EM Algorithm for Hidden Markov Models0908.2359v2 · Olivier Capp'e (LTCI)2009 · 156 citationsarXiv
Regret Bounds for Opportunistic Channel Access0908.0319v1 · Sarah Filippi (LTCI), Olivier Capp'e (LTCI), Aur'elien Garivier (LTCI)2009 · 0 citationsarXiv
Estimation of cosmological parameters using adaptive importance sampling0903.0837v1 · Darren Wraith, Martin Kilbinger, Karim Benabed et al.2009 · 82 citationsPhys.Rev.D80:023507,2009
Online EM Algorithm for Latent Data Models0712.4273v4 · Olivier Capp'e (LTCI), Eric Moulines (LTCI)2007 · 482 citationsJournal of the Royal Statistical Society: Series B, Royal Statistical Society, 2009, 71 (3), pp.593-613
Adaptive Importance Sampling in General Mixture Classes0710.4242v4 · Olivier Capp'e (LTCI), Randal Douc (CMAP), Arnaud Guillin (LATP) et al.2007 · 216 citationsStatistics and Computing 18, 4 (2008) 447-459
Sequential Monte Carlo smoothing with application to parameter estimation in non-linear state space modelsmath/0609514v2 · Jimmy Olsson, Olivier Capp'e (LTCI), Randal Douc (CMAP) et al.2006 · 158 citationsBernoulli 14, 1 (2008) 155-179
Inference and Evaluation of the Multinomial Mixture Model for Text Clusteringcs/0606069v1 · Lois Rigouste (TSI), Olivier Capp'e (TSI), Francois Yvon (TSI)2006 · 93 citationsInformation Processing & Management 43, 5 (01/09/2007) 1260?1280
Comparison of Resampling Schemes for Particle Filteringcs/0507025v1 · Randal Douc (CMAP), Olivier Capp'e (LTCI), Eric Moulines (LTCI)2005 · 125 citationsImage and Signal Processing and Analysis, 2005. ISPA 2005. Proceedings of the 4th International Symposium on (2005) 64-69
Career total: 167 works. 40 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.