:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Harada, Tsubasa, Ito, Shinji, Sumita, Hanna
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	https://arxiv.org/abs/2505.05169
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
por: Harada, Tsubasa, et al.
Publicado: (2025)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
por: Ichikawa, Koji, et al.
Publicado: (2023)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
por: Shibukawa, Yuki, et al.
Publicado: (2026)

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

Collaborative Min-Max Regret in Grouped Multi-Armed Bandits
por: Blanchard, Moïse, et al.
Publicado: (2025)

Influential Bandits: Pulling an Arm May Change the Environment
por: Sato, Ryoma, et al.
Publicado: (2025)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
por: Kato, Masahiro, et al.
Publicado: (2024)

MinMaxMin $Q$-learning
por: Soffair, Nitsan, et al.
Publicado: (2024)

Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation
por: Xu, Chen, et al.
Publicado: (2025)

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
por: Zhao, Canzhe, et al.
Publicado: (2025)

Replicability is Asymptotically Free in Multi-armed Bandits
por: Komiyama, Junpei, et al.
Publicado: (2024)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
por: Chase, Zachary, et al.
Publicado: (2025)

M$^2$FGB: A Min-Max Gradient Boosting Framework for Subgroup Fairness
por: Pereira, Jansen S. B., et al.
Publicado: (2025)

A Perturbation Approach to Unconstrained Linear Bandits
por: Jacobsen, Andrew, et al.
Publicado: (2026)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
por: Lee, Jongyeong, et al.
Publicado: (2025)

Transformer-Based Power Optimization for Max-Min Fairness in Cell-Free Massive MIMO
por: Chafaa, Irched, et al.
Publicado: (2025)

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
por: Ito, Shinji, et al.
Publicado: (2025)

Smooth Min-Max Monotonic Networks
por: Igel, Christian
Publicado: (2023)

Retain-Neutral Surrogates for Min-Max Unlearning
por: Cai, Junhao, et al.
Publicado: (2026)

Enhancing Convergence, Privacy and Fairness for Wireless Personalized Federated Learning: Quantization-Assisted Min-Max Fair Scheduling
por: Zhao, Xiyu, et al.
Publicado: (2025)

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

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
por: Nguyen, Quan, et al.
Publicado: (2025)

Continuous K-Max Bandits
por: Chen, Yu, et al.
Publicado: (2025)

Diffusion Stochastic Optimization for Min-Max Problems
por: Cai, Haoyuan, et al.
Publicado: (2024)

Robust Variational Bayes by Min-Max Median Aggregation
por: Yan, Jiawei, et al.
Publicado: (2025)

MinMax Recurrent Neural Cascades
por: Ronca, Alessandro
Publicado: (2026)

Statistical Mechanics of Min-Max Problems
por: Ichikawa, Yuma, et al.
Publicado: (2024)

A Novel Gaussian Min-Max Theorem and its Applications
por: Akhtiamov, Danil, et al.
Publicado: (2024)

Constrained Multi-Objective Reinforcement Learning with Max-Min Criterion
por: Park, Giseung, et al.
Publicado: (2026)

Implicit Riemannian Optimism with Applications to Min-Max Problems
por: Roux, Christophe, et al.
Publicado: (2025)

Min-p, Max Exaggeration: A Critical Analysis of Min-p Sampling in Language Models
por: Schaeffer, Rylan, et al.
Publicado: (2025)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
por: Cai, Yang, et al.
Publicado: (2024)

FedMABA: Towards Fair Federated Learning through Multi-Armed Bandits Allocation
por: Wang, Zhichao, et al.
Publicado: (2024)

Bayesian Neural Networks: A Min-Max Game Framework
por: Hong, Junping, et al.
Publicado: (2023)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
por: Daskalakis, Constantinos, et al.
Publicado: (2018)

Revisiting Min-Max Optimization Problem in Adversarial Training
por: Ahmadi, Sina Hajer, et al.
Publicado: (2024)

BanditQ: Fair Bandits with Guaranteed Rewards
por: Sinha, Abhishek
Publicado: (2023)

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
por: Tsuchiya, Taira, et al.
Publicado: (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
por: Tsuchiya, Taira, et al.
Publicado: (2024)

Bandit Allocational Instability
por: Chen, Yilun, et al.
Publicado: (2026)