Share your thoughts, 1 month free Claude Pro on us
See more
Home
/
Benchmarks
Regret Minimization on KL-regularized Bandits Preference w/ Linear Reward
Loading...
2
Regret
Online Iterative GSHF
1.9
1.95
2
2.05
Mar 2, 2026
Regret
Sample Complexity
Matches Lower Bound
Updated 1mo ago
Evaluation Results
Method
Method
Links
Regret
Sample Complexity
Matches Lower Bound
Online Iterative GSHF
Type=Upper Bound
2026.03
2
-
-
Feedback
Search any
task
Search any
task
