◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Quanquan Gu

15 papers hereh-index 10264 citations19 works total

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

author position
  • middle author5
  • last author10

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

fields
  • cs.LG14
  • stat.ML1
same name
  • Quanquan Gu — 129 papers, h 64
  • Quanquan Gu — 12 papers, h 9
  • Quanquan Gu — 12 papers, h 10
  • Quanquan Gu — 11 papers, h 2
  • Quanquan Gu — 11 papers, h 6
  • Quanquan Gu — 7 papers, h 3

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
20232025
most citedEnhancing Multi-Step Reasoning Abilities of Language Models through Direct Q-Function Optimization

2 citations · 4 across the 14 of their papers we have counts for

collaborators
Showing 2025Show all

4 papers · 1 filter

cs.LG2025

Beyond-Expert Performance with Limited Demonstrations: Efficient Imitation Learning with Double Exploration

Heyang Zhao, Xingrui Yu, David M. Bossens +2

Imitation learning is a central problem in reinforcement learning where the goal is to learn a policy that mimics the expert's behavior. In practice, it is often challenging to lea…

cs.LG2025

Variance-Dependent Regret Lower Bounds for Contextual Bandits

Jiafan He, Quanquan Gu

Variance-dependent regret bounds for linear contextual bandits, which improve upon the classical O~(dK​) regret bound to O~(d∑k=1K​σk2​​), wher…

cs.LG2025

Logarithmic Regret for Online KL-Regularized Reinforcement Learning

Heyang Zhao, Chenlu Ye, Wei Xiong +2

Recent advances in Reinforcement Learning from Human Feedback (RLHF) have shown that KL-regularization plays a pivotal role in improving the efficiency of RL fine-tuning for large…

cs.LG2025

Towards a Sharp Analysis of Offline Policy Learning for f-Divergence-Regularized Contextual Bandits

Qingyue Zhao, Kaixuan Ji, Heyang Zhao +2

Many offline reinforcement learning algorithms are underpinned by f-divergence regularization, but their sample complexity *defined with respect to regularized objectives* still…

◍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.