Richard COMBES

Associate Professor

L2S, CentraleSupélec
Bât. Breguet A5.02
3 rue Joliot Curie
91190 Gif-sur-Yvette, France

+33 (0)1 69 85 14 68


Journal articles


Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits

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

An Approximate ML Detector for MIMO Channels Corrupted by Phase Noise

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

Opportunistic Content Delivery in Fading Broadcast Channels

Combes, Ghorbel, Kobayashi, Yang
JSAC, Institute of Electrical and Electronics Engineers, 2018

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

Multipath streaming: fundamental limits and efficient algorithms

Combes, Sidi, Elayoubi
JSAC, 35 (1), Institute of Electrical and Electronics Engineers, p. 188 – 199, 2016

Dynamic Rate and Channel Selection in Cognitive Radio Systems

Combes, Proutière
JSAC, 33 (5), Institute of Electrical and Electronics Engineers, p. 910-921, 2015

Optimal online control for sleep mode in green base stations

Combes, Elayoubi, ALI, SAKER, Chahed
Computer Networks, 78, p. 140-151, 2015

Distributed Coordination of Self-Organizing Mechanisms in Communication Networks

Tall, Combes, Altman, Altman
IEEE Transactions on Control of Network Systems, 1 (4), p. 328-337, 2014

Mixed Polling with Rerouting and Applications

Kavitha, Combes
Performance Evaluation, 70 (11), 2013

Self-Organizing Relays: Dimensioning, Self-Optimization, and Learning

Combes, Altman, Altman
TNSM, 9 (4), IEEE, p. 487 – 500, 2012

Conference papers


Asymptotically Optimal Strategies for Combinatorial Semi-Bandits in Polynomial Time

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

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

Approximate ML Detection for MIMO Phase Noise Channels

Combes, Yang
The International Zurich Seminar on Information and Communication, Zurich, Suisse, 2018

Minimal Exploration in Structured Stochastic Bandits

Combes, Magureanu, Proutiere
31st Conference on Neural Information Processing Systems (NIPS), Long Beach, CA, États-Unis, 2017

Opportunistic Content Delivery in Fading Broadcast Channels

Ghorbel, Ngo, Combes, Kobayashi, Yang
GLOBECOM 2017 – 2017 IEEE Global Communications Conference, Singapore, Singapour, 2017

Multipath Streaming Fundamental Limits and Efficient Algorithms

Combes, Sidi, Elayoubi
13th ACM SIGMETRICS/IFIP Performance Joint International Conference on Measurement and Modeling of Computer Science (ACM SIGMETRICS/IFIP), Antibes, France, 2016

Combinatorial Bandits Revisited

Combes, Talebi, Proutière, Lelarge
NIPS 2015 – Twenty-ninth Conference on Neural Information Processing Systems, Montreal, Canada, 2015

Bandits with Budgets: Regret Lower Bounds and Optimal Algorithms

Combes, Jiang, Rayadurgam
SIGMETRICS 2015, Portland, États-Unis, 2015

Learning to Rank: Regret Lower Bound and Efficient Algorithms

Combes, Magureanu, Proutière, Laroche
SIGMETRICS 2015, Portland, États-Unis, 2015

Unimodal bandits: Regret lower bounds and optimal algorithms

Combes, Proutière
ICML 2014, Beijing, Chine, 2014


Patents and software