Cover Image

Enforcing Fair Predicted Scores on Intervals of Percentiles by Difference-of-Convex Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	He, Yutian, Huang, Yankun, Yao, Yao, Lin, Qihang
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
by: Huang, Yankun, et al.
Published: (2025)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
by: Shen, Yiyang, et al.
Published: (2026)

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
by: Yao, Yao, et al.
Published: (2023)

A Note on Complexity for Two Classes of Structured Non-Smooth Non-Convex Compositional Optimization
by: Yao, Yao, et al.
Published: (2024)

Smooth Quasar-Convex Optimization with Constraints
by: Martínez-Rubio, David
Published: (2025)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
by: Dahal, Hari, et al.
Published: (2023)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
by: Wang, Jie, et al.
Published: (2024)

Stochastic Difference-of-Convex Optimization with Momentum
by: Chayti, El Mahdi, et al.
Published: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
by: Pan, Zhaoye, et al.
Published: (2026)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2025)

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
by: Hutchinson, Spencer, et al.
Published: (2024)

A Retention-Centric Framework for Continual Learning with Guaranteed Model Developmental Safety
by: Li, Gang, et al.
Published: (2024)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback
by: Liu, Shanqi, et al.
Published: (2024)

Online Convex Optimization with Memory and Limited Predictions
by: Wang, Zhengmiao, et al.
Published: (2024)

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
by: Jakob, Fabian, et al.
Published: (2025)

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
by: Hu, Quanqi, et al.
Published: (2024)

Fair Supervised Learning Through Constraints on Smooth Nonconvex Unfairness-Measure Surrogates
by: Khatti, Zahra, et al.
Published: (2025)

Are Convex Optimization Curves Convex?
by: Barzilai, Guy, et al.
Published: (2025)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Fair Clustering with Minimum Representation Constraints
by: Lawless, Connor, et al.
Published: (2024)

Multi-Agent Reinforcement Learning for Joint Police Patrol and Dispatch
by: Repasky, Matthew, et al.
Published: (2024)

Hidden Convexity of Fair PCA and Fast Solver via Eigenvalue Optimization
by: Shen, Junhui, et al.
Published: (2025)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

You Shall Pass: Dealing with the Zero-Gradient Problem in Predict and Optimize for Convex Optimization
by: Veviurko, Grigorii, et al.
Published: (2023)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

Landing with the Score: Riemannian Optimization through Denoising
by: Kharitenko, Andrey, et al.
Published: (2025)

A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage
by: Bach, Francis
Published: (2025)

Primal Methods for Variational Inequality Problems with Functional Constraints
by: Zhang, Liang, et al.
Published: (2024)

FairML: A Julia Package for Fair Classification
by: Burgard, Jan Pablo, et al.
Published: (2024)

Metrizing Fairness
by: Rychener, Yves, et al.
Published: (2022)

Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)

The Price of Adaptivity in Stochastic Convex Optimization
by: Carmon, Yair, et al.
Published: (2024)

Online Convex Optimization with Unbounded Memory
by: Kumar, Raunak, et al.
Published: (2022)

Astral Space: Convex Analysis at Infinity
by: Dudík, Miroslav, et al.
Published: (2022)