activity
20102023
most citedSmoothing proximal gradient method for general structured sparse regression

241 citations · 815 across the 44 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

cs.LG2022

Stochastic Methods for AUC Optimization subject to AUC-based Fairness Constraints

Yao Yao, Qihang Lin, Tianbao Yang

As machine learning being used increasingly in making high-stakes decisions, an arising challenge is to avoid unfair AI systems that lead to discriminatory decisions for protected…

cs.LG2022★ 4 cited

ProtoX: Explaining a Reinforcement Learning Agent via Prototyping

Ronilo J. Ragodos, Tong Wang, Qihang Lin +1

While deep reinforcement learning has proven to be successful in solving control tasks, the "black-box" nature of an agent has received increasing concerns. We propose a prototype-…

cs.LG2022

Federated Learning on Adaptively Weighted Nodes by Bilevel Optimization

Yankun Huang, Qihang Lin, Nick Street +1

We propose a federated learning method with weighted nodes in which the weights can be modified to optimize the model's performance on a separate validation set. The problem is for…

cs.LG2022★ 5 cited

Large-scale Optimization of Partial AUC in a Range of False Positive Rates

Yao Yao, Qihang Lin, Tianbao Yang

The area under the ROC curve (AUC) is one of the most widely used performance measures for classification models in machine learning. However, it summarizes the true positive rates…

math.OC2022

Inexact accelerated proximal gradient method with line search and reduced complexity for affine-constrained and bilinear saddle-point structured convex problems

Qihang Lin, Yangyang Xu

The goal of this paper is to reduce the total complexity of gradient-based methods for two classes of problems: affine-constrained composite convex optimization and bilinear saddle…