arXiv Machine Learning July 14, 2026 By Melveena Jolly, Midhun Xavier

Rank-Conditioned Sample Reuse for the Plackett--Luce Best-of-$K$ Objective

Read the original on arXiv Machine Learning →

arXiv:2607. 11146v1 Announce Type: new Abstract: We study the coupled objective J_K^WOR = E_{S ~ PL-WOR_K}[max_{i in S} R_i]: the expected maximum reward of a size-K Plackett-Luce draw without replacement, the law of Gumbel-Top-K / Stochastic Beam Search decoding.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI

Jun 11

Pass@K Policy Optimization: Solving Harder Reinforcement Learning Problems

arXiv:2505. 15201v5 Announce Type: replace-cross Abstract: Reinforcement Learning (RL) algorithms sample multiple n>1 solution attempts for each problem and reward them independently.

By Christian Walder, Deep Karkhanis

llms reinforcement-learning

arXiv AI

Aug 6

Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits

arXiv:2608. 04324v1 Announce Type: cross Abstract: This paper studies generalized low-rank matrix bandits with multiple prioritized objectives.

By Bo Xue, Ji Cheng, Haodong Jing, Hongzong Li, Shuang Qiu

arXiv AI

Sep 10

Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids, and Full-Bandit Learning

arXiv:2608.12134v2 Announce Type: replace-cross Abstract: We study nonnegative submodular maximization on $n$ elements subject to a general matroid of rank $k$, when the offline algorithm is given an...

By Vaneet Aggarwal

reinforcement-learning benchmarks safety

arXiv Machine Learning

Jul 14

Diversified Multinomial Logit Contextual Bandits

arXiv:2607. 11684v1 Announce Type: cross Abstract: Existing contextual multinomial logit (MNL) bandits model relevance-driven choice but ignore the potential benefits of within-assortment diversity, while submodular/combinatorial bandits encode diversity in rewards but lack structured choice probabilities.

By Heesang Ann, Taehyun Hwang, Min-hwan Oh

reinforcement-learning

arXiv Machine Learning

Jul 13

Optimal Top-$k$ Identification from Pairwise Comparisons

arXiv:2607. 08979v1 Announce Type: new Abstract: We study the active learning problem of fixed-confidence top-$k$ identification from noisy pairwise comparisons.

By Motti Goldberger, Nils Rudi

reinforcement-learning

arXiv AI

Jul 16

Price of Fairness in Bandits: A Tight Minimax Characterization

arXiv:2607. 13402v1 Announce Type: cross Abstract: In bandit problems, standard regret-minimizing algorithms treat exploration as an amortized cost, which can expose early participants to unfair ex-ante losses in settings such as clinical trials.

By Dhruv Sarkar, Soumyadeep Dutta, Sayak Ray Chowdhury

reinforcement-learning safety

One email a morning, machine-written

Related stories

Pass@K Policy Optimization: Solving Harder Reinforcement Learning Problems

Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits

Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids, and Full-Bandit Learning

Diversified Multinomial Logit Contextual Bandits

Optimal Top-$k$ Identification from Pairwise Comparisons

Price of Fairness in Bandits: A Tight Minimax Characterization