◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Richard Combes

31 papers hereh-index 211.8k citations71 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author15
  • middle author8
  • last author7

Across the 31 of 31 papers where every author was matched, so the position is known.

fields
  • stat.ML9
  • cs.NI7
  • cs.IT6
  • cs.LG6
  • cs.AI1
  • cs.LO1
same name
  • Richard Combes — 6 papers, h 3
  • Richard Combes — 2 papers, h 0
  • Richard Combes — 1 paper
  • Richard Combes — 1 paper, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20122026
most citedCombinatorial Bandits Revisited

118 citations · 405 across the 29 of their papers we have counts for

collaborators
Showing 2017Show all

4 papers · 1 filter

stat.ML2017★ 79 cited

Minimal Exploration in Structured Stochastic Bandits

Richard Combes, Stefan Magureanu, Alexandre Proutiere

This paper introduces and addresses a wide class of stochastic bandit problems where the function mapping the arm to the corresponding reward exhibits some known structural propert…

cs.IT2017

An Approximate ML Detector for MIMO Channels Corrupted by Phase Noise

Richard Combes, Sheng Yang

We consider the multiple-input multiple-output (MIMO) communication channel impaired by phase noises at both the transmitter and receiver. We focus on the maximum likelihood (ML) d…

cs.AI2017

Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles

Jung-hun Kim, Se-Young Yun, Minchan Jeong +3

We study contextual linear bandit problems under feature uncertainty, where the features are noisy and have missing entries. To address the challenges posed by this noise, we analy…

cs.IT2017

Opportunistic Content Delivery in Fading Broadcast Channels

Asma Ghorbel, Khac-Hoang Ngo, Richard Combes +2

We consider content delivery over fading broadcast channels. A server wants to transmit K files to K users, each equipped with a cache of finite size. Using the coded caching schem…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.