Cover Image

Online Multi-Class Selection with Group Fairness Guarantee

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zargari, Faraz, Nekouyan, Hossein, Hallett, Lyndon, Sun, Bo, Tan, Xiaoqi
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
by: Zargari, Faraz, et al.
Published: (2025)

Online Rounding Schemes for $ k $-Rental Problems
by: Nekouyan, Hossein, et al.
Published: (2025)

Risk-Sensitive Online Selection with Bounded Adaptivity
by: Nekouyan, Hossein, et al.
Published: (2025)

Static Pricing for Online Selection Problem and its Variants
by: Sun, Bo, et al.
Published: (2024)

Posted Price Mechanisms for Online Allocation with Diseconomies of Scale
by: Jazi, Hossein Nekouyan, et al.
Published: (2025)

Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty
by: Wang, Yanzhao, et al.
Published: (2025)

Time Fairness in Online Knapsack Problems
by: Lechowicz, Adam, et al.
Published: (2023)

Active Learning for Decision Trees with Provable Guarantees
by: Moakhar, Arshia Soltani, et al.
Published: (2026)

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

Dynamic Spectral Clustering with Provable Approximation Guarantee
by: Laenen, Steinar, et al.
Published: (2024)

Online Prediction with Limited Selectivity
by: Liu, Licheng, et al.
Published: (2025)

On Socially Fair Low-Rank Approximation and Column Subset Selection
by: Song, Zhao, et al.
Published: (2024)

Online Algorithms with Uncertainty-Quantified Predictions
by: Sun, Bo, et al.
Published: (2023)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
by: Blum, Avrim, et al.
Published: (2024)

Online Conformal Prediction with Efficiency Guarantees
by: Srinivas, Vaidehi
Published: (2025)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
by: Lee, Russell, et al.
Published: (2022)

Truthful Calibration Errors for Multi-Class Prediction
by: Lu, Yuxuan, et al.
Published: (2025)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
by: Lechowicz, Adam, et al.
Published: (2023)

Threshold Policies with Tight Guarantees for Online Selection with Convex Costs
by: Tan, Xiaoqi, et al.
Published: (2023)

Spectral Guarantees for Adversarial Streaming PCA
by: Price, Eric, et al.
Published: (2024)

Hierarchical Clustering via Local Search
by: Jowhari, Hossein
Published: (2024)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
by: Zhang, Keyuan, et al.
Published: (2024)

Online Sparsification of Bipartite-Like Clusters in Graphs
by: Das, Joyentanuj, et al.
Published: (2025)

Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees
by: Chandrasekaran, Gautam, et al.
Published: (2025)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
by: Chen, Yixin, et al.
Published: (2026)

Fair Secretaries with Unfair Predictions
by: Balkanski, Eric, et al.
Published: (2024)

Modification-Fair Cluster Editing
by: Froese, Vincent, et al.
Published: (2021)

Towards Fair Representation: Clustering and Consensus
by: Chakraborty, Diptarka, et al.
Published: (2025)

A Scalable Algorithm for Individually Fair K-means Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
by: Fahrbach, Matthew, et al.
Published: (2025)

Replicable Composition
by: Banihashem, Kiarash, et al.
Published: (2026)

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
by: Zhu, Yanhui, et al.
Published: (2024)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2023)

Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
by: Drexler, Lukas, et al.
Published: (2023)

Online Classification with Predictions
by: Raman, Vinod, et al.
Published: (2024)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
by: Attias, Idan, et al.
Published: (2025)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
by: Maity, Binita, et al.
Published: (2024)

Dynamic Data Layout Optimization with Worst-case Guarantees
by: Rong, Kexin, et al.
Published: (2024)

Online Learning in the Random Order Model
by: Bernasconi, Martino, et al.
Published: (2025)

Online Two-Stage Submodular Maximization
by: Nikolaou, Iasonas, et al.
Published: (2025)