Greedy Sampling Is Provably Efficient for RLHF

Wu, Di; Shi, Chengshuai; Yang, J; Shen, Cong

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 5:00 PM ET until 8:00 PM ET on Friday, September 11 due to maintenance. We apologize for the inconvenience.

Citation Details

This content will become publicly available on December 7, 2026

Greedy Sampling Is Provably Efficient for RLHF

Award ID(s):: 2531789 2531023

PAR ID:: 10686371

Author(s) / Creator(s):: Wu, Di; Shi, Chengshuai; Yang, J; Shen, Cong

Publisher / Repository:: NeurIPS 2025

Date Published:: 2025-12-07

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on December 7, 2026
Conference Paper:
The DOI is not currently available.

More Like this