Image de couverture de livre

Bandit Max-Min Fair Allocation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Harada, Tsubasa, Ito, Shinji, Sumita, Hanna
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
par: Harada, Tsubasa, et autres
Publié: (2025)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
par: Shibukawa, Yuki, et autres
Publié: (2026)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
par: Ichikawa, Koji, et autres
Publié: (2023)

Collaborative Min-Max Regret in Grouped Multi-Armed Bandits
par: Blanchard, Moïse, et autres
Publié: (2025)

Near-Optimal Privacy-Preserving Learning for Max-Min Fair Multi-Agent Bandits
par: Leshem, Amir
Publié: (2023)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
par: Kato, Masahiro, et autres
Publié: (2024)

Influential Bandits: Pulling an Arm May Change the Environment
par: Sato, Ryoma, et autres
Publié: (2025)

MinMaxMin $Q$-learning
par: Soffair, Nitsan, et autres
Publié: (2024)

Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation
par: Xu, Chen, et autres
Publié: (2025)

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
par: Zhao, Canzhe, et autres
Publié: (2025)

Replicability is Asymptotically Free in Multi-armed Bandits
par: Komiyama, Junpei, et autres
Publié: (2024)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
par: Chase, Zachary, et autres
Publié: (2025)

M$^2$FGB: A Min-Max Gradient Boosting Framework for Subgroup Fairness
par: Pereira, Jansen S. B., et autres
Publié: (2025)

A Perturbation Approach to Unconstrained Linear Bandits
par: Jacobsen, Andrew, et autres
Publié: (2026)

Transformer-Based Power Optimization for Max-Min Fairness in Cell-Free Massive MIMO
par: Chafaa, Irched, et autres
Publié: (2025)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
par: Lee, Jongyeong, et autres
Publié: (2025)

Retain-Neutral Surrogates for Min-Max Unlearning
par: Cai, Junhao, et autres
Publié: (2026)

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
par: Ito, Shinji, et autres
Publié: (2025)

Smooth Min-Max Monotonic Networks
par: Igel, Christian
Publié: (2023)

Enhancing Convergence, Privacy and Fairness for Wireless Personalized Federated Learning: Quantization-Assisted Min-Max Fair Scheduling
par: Zhao, Xiyu, et autres
Publié: (2025)

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
par: Lee, Jongyeong, et autres
Publié: (2024)

Continuous K-Max Bandits
par: Chen, Yu, et autres
Publié: (2025)

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
par: Nguyen, Quan, et autres
Publié: (2025)

Diffusion Stochastic Optimization for Min-Max Problems
par: Cai, Haoyuan, et autres
Publié: (2024)

Robust Variational Bayes by Min-Max Median Aggregation
par: Yan, Jiawei, et autres
Publié: (2025)

A Novel Gaussian Min-Max Theorem and its Applications
par: Akhtiamov, Danil, et autres
Publié: (2024)

Constrained Multi-Objective Reinforcement Learning with Max-Min Criterion
par: Park, Giseung, et autres
Publié: (2026)

Min-p, Max Exaggeration: A Critical Analysis of Min-p Sampling in Language Models
par: Schaeffer, Rylan, et autres
Publié: (2025)

Implicit Riemannian Optimism with Applications to Min-Max Problems
par: Roux, Christophe, et autres
Publié: (2025)

FedMABA: Towards Fair Federated Learning through Multi-Armed Bandits Allocation
par: Wang, Zhichao, et autres
Publié: (2024)

MinMax Recurrent Neural Cascades
par: Ronca, Alessandro
Publié: (2026)

Statistical Mechanics of Min-Max Problems
par: Ichikawa, Yuma, et autres
Publié: (2024)

BanditQ: Fair Bandits with Guaranteed Rewards
par: Sinha, Abhishek
Publié: (2023)

Bayesian Neural Networks: A Min-Max Game Framework
par: Hong, Junping, et autres
Publié: (2023)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
par: Daskalakis, Constantinos, et autres
Publié: (2018)

Bandit Allocational Instability
par: Chen, Yilun, et autres
Publié: (2026)

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
par: Tsuchiya, Taira, et autres
Publié: (2024)

A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds
par: Tsuchiya, Taira, et autres
Publié: (2024)

Revisiting Min-Max Optimization Problem in Adversarial Training
par: Ahmadi, Sina Hajer, et autres
Publié: (2024)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
par: Cai, Yang, et autres
Publié: (2024)