Richard COMBES

Associate Professor

L2S, CentraleSupélec
3 rue Joliot Curie
91190 Gif-sur-Yvette, France

Publications

Journal articles

2021

Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits

Cuvelier, Combes, Gourdin
(POMACS), 5 (9), ACM, p. 1-31, 2021
2020

Unimodal Bandits with Continuous Arms: Order-optimal Regret without Smoothness

Combes, Proutière, Fauquette
(POMACS), 4 (1), ACM, p. 1-28, 2020

Performance Analysis of Device-to-Device Aided Multicasting in General Network Topologies

Santana, Combes, Kobayashi
IEEE Transactions on Communications, 68 (1), p. 137-149, 2020
2019

Optimal Rate Sampling in 802.11 Systems: Theory, Design, and Implementation

Combes, Ok, Proutiere, Yun, Yi
IEEE Transactions on Mobile Computing, 18 (5), p. 1145-1158, 2019

Computationally Efficient Estimation of the Spectral Gap of a Markov Chain

Combes, Touati
(POMACS), 3 (1), ACM, p. 1-21, 2019

Hierarchical Beamforming: Resource Allocation, Fairness and Flow Level Performance

Floquet, Combes, Altman
ACM SIGMETRICS Performance Evaluation Review, 46 (3), p. 70-71, 2019
2018

Hierarchical beamforming: Resource allocation, fairness and flow level performance

Floquet, Combes, Altman
Performance Evaluation, 127-128, p. 36-55, 2018

Utility Optimal Scheduling for Coded Caching in General Topologies

Combes, Ghorbel, Kobayashi, Yang
JSAC, 36 (8), Institute of Electrical and Electronics Engineers, p. 1692-1705, 2018

An Approximate ML Detector for MIMO Channels Corrupted by Phase Noise

Combes, Yang
IEEE Transactions on Communications, 66 (3), p. 1176 -1189, 2018
2017

Stochastic Online Shortest Path Routing: The Value of Feedback

Talebi, Zou, Combes, Proutiere, Johansson
IEEE Transactions on Automatic Control, 63 (4), p. 915 – 930, 2017

Conference papers

2023

Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles

Kim, Yun, Jeong, Nam, Shin, Combes
AISTATS, Valencia, Espagne, 2023
2022

Towards optimal algorithms for multi-player bandits without collision sensing information

Huang, Combes, Trinh
COLT 2022: 35th Conference on Learning Theory, London, Royaume-Uni, 2022
2021

On the Suboptimality of Thompson Sampling in High Dimensions

Zhang, Combes
35th Conference on Neural Information Processing Systems (NeurIPS 2021), Virtual Conference, France, 2021

Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits

Cuvelier, Combes, Gourdin
SIGMETRICS 2021, Virtual Event, Chine, 2021

Asymptotically Optimal Strategies for Combinatorial Semi-Bandits in Polynomial Time

Cuvelier, Combes, Gourdin
Algorithmic Learning Theory, Paris, France, 2021
2020

Unimodal Bandits with Continuous Arms

Combes, Proutiere, Fauquette
SIGMETRICS ’20: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Boston MA USA, États-Unis, 2020

Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling

Trinh, Kaufmann, Vernade, Combes
ALT 2020 – 31st International Conference on Algorithmic Learning Theory, San Diego, États-Unis, 2020
2019

Optimal Retransmission Policies for Ultra-Reliable Low Latency Communications with Delayed Feedback

Combes, Elayoubi, Varela
GLOBECOM 2019 – 2019 IEEE Global Communications Conference, Waikoloa, États-Unis, 2019

Computationally Efficient Estimation of the Spectral Gap of a Markov Chain

Combes, Touati
SIGMETRICS ’19: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Phoenix AZ USA, États-Unis, 2019
2018

Utility Optimal Scheduling for Coded Caching in General Topologies

Combes, Ghorbel, Kobayashi, Yang
2018 IEEE International Symposium on Information Theory (ISIT), Vail, États-Unis, 2018

Books

Patents and software

These/HDR