4 papers
Enforcing Fair Predicted Scores on Intervals of Percentiles by Difference-of-Convex Constraints
Yutian He, Yankun Huang, Yao Yao +1
Fairness in machine learning has become a critical concern. Existing approaches often focus on achieving full fairness across all score ranges generated by predictive models, ensur…
Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
Yankun Huang, Qihang Lin, Yangyang Xu
In this paper, we investigate how structural properties of the constraint system impact the oracle complexity of smooth non-convex optimization problems with convex inequality cons…
Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems
Wei Liu, Qihang Lin, Yangyang Xu
Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-ca…
A Near-optimal Method for Linearly Constrained Composite Non-convex Non-smooth Problems
Wei Liu, Qihang Lin, Yangyang Xu
We study first-order methods (FOMs) for solving \emph{composite nonconvex nonsmooth} optimization with linear constraints. Recently, the lower complexity bounds of FOMs on finding…