arXiv Machine Learning July 28, 2026 By Ibne Farabi Shihab, Joyanta Jyoti Mondal, Anuj Sharma

Discrepancy-Rounded Fair Bandits with Static and Time-Varying Exposure Floors

Read the original on arXiv Machine Learning →

arXiv:2607. 22935v1 Announce Type: new Abstract: Minimum-exposure constraints arise in recommendation, content curation, and regulated allocation when each provider, arm, or group must receive guaranteed exposure inside a period rather than only in aggregate.

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 Machine Learning

Aug 18

Beyond Peak Backlog: Conditional Energy and Temporal Geometry in Capacity-Constrained Delayed Bandit Optimization

arXiv:2608. 16216v1 Announce Type: new Abstract: What is the right delay complexity when a learner can track only $C$ pending feedback items and discarded feedback is permanently lost?

By Anling Xiang, Yuwen Yang, Yang Shen

reinforcement-learning

arXiv Machine Learning

1d ago

Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness

arXiv:2610. 01377v1 Announce Type: new Abstract: We study causal logistic bandits with counterfactual fairness constraints.

By Junhyuk Huh, Seoungbin Bae, Dabeen Lee

safety

arXiv Machine Learning

Aug 4

Meritocratic Fairness via $K$-Shapley Values in Budgeted Combinatorial Bandits with Full-Bandit Feedback

arXiv:2605. 00762v2 Announce Type: replace Abstract: We study meritocratic fairness in budgeted combinatorial multi-armed bandits with full-bandit feedback, where a learner selects at most $K$ arms per time step and observes only the noisy aggregate reward of the selected set.

By Shradha Sharma, Shweta Jain, Swapnil Dhamal

reinforcement-learning safety

arXiv Machine Learning

Jun 9

Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret

arXiv:2606. 09668v1 Announce Type: new Abstract: Contextual queueing bandits provide a framework for learning to schedule heterogeneous jobs under unknown context-dependent service rates.

By Seoungbin Bae, Dabeen Lee

arXiv Machine Learning

4d ago

Learning When to Update: A Near-Optimal Timing Bandit Approach

arXiv:2609.37932v1 Announce Type: new Abstract: Systems operating in dynamic environments require timely updates to sustain performance. For resource-intensive systems such as machine learning models...

By Qiulin Lin, Junyan Su, Liyuan Wang, Minghua Chen

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

Beyond Peak Backlog: Conditional Energy and Temporal Geometry in Capacity-Constrained Delayed Bandit Optimization

Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness

Meritocratic Fairness via $K$-Shapley Values in Budgeted Combinatorial Bandits with Full-Bandit Feedback

Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret

Learning When to Update: A Near-Optimal Timing Bandit Approach

Price of Fairness in Bandits: A Tight Minimax Characterization