Qihang Lin

Qihang Lin

University of Iowa

H-index: 28

North America-United States

About Qihang Lin

Qihang Lin, With an exceptional h-index of 28 and a recent h-index of 25 (since 2020), a distinguished researcher at University of Iowa, specializes in the field of Continuous optimization, Stochastic Optimization, Machine Learning, Markov Decision Process.

His recent articles reflect a diverse array of research interests and contributions to the field:

Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization

Single-loop switching subgradient methods for non-smooth weakly convex optimization with non-smooth convex constraints

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization

First-order Methods for Affinely Constrained Composite Non-convex Non-smooth Problems: Lower Complexity Bound and Near-optimal Methods

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

Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method

Protox: Explaining a reinforcement learning agent via prototyping

Large-scale optimization of partial auc in a range of false positive rates

Qihang Lin Information

University

Position

The

Citations(all)

2938

Citations(since 2020)

1961

Cited By

1925

hIndex(all)

28

hIndex(since 2020)

25

i10Index(all)

40

i10Index(since 2020)

36

Email

University Profile Page

University of Iowa

Google Scholar

View Google Scholar Profile

Qihang Lin Skills & Research Interests

Continuous optimization

Stochastic Optimization

Machine Learning

Markov Decision Process

Top articles of Qihang Lin

Title

Journal

Author(s)

Publication Date

Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization

Advances in Neural Information Processing Systems

Yankun Huang

Qihang Lin

2024/2/13

Single-loop switching subgradient methods for non-smooth weakly convex optimization with non-smooth convex constraints

ArXiv. org

Yankun Huang

Qihang Lin

2023/1/30

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization

arXiv preprint arXiv:2310.10993

Yao Yao

Qihang Lin

Tianbao Yang

2023/10/17

First-order Methods for Affinely Constrained Composite Non-convex Non-smooth Problems: Lower Complexity Bound and Near-optimal Methods

arXiv preprint arXiv:2307.07605

Wei Liu

Qihang Lin

Yangyang Xu

2023/7/14

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

Yao Yao

Qihang Lin

Tianbao Yang

2023/4/11

Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method

SIAM journal on optimization

Qihang Lin

Yangyang Xu

2023/3/31

Protox: Explaining a reinforcement learning agent via prototyping

Advances in Neural Information Processing Systems

Ronilo Ragodos

Tong Wang

Qihang Lin

Xun Zhou

2022/12/6

Large-scale optimization of partial auc in a range of false positive rates

Advances in Neural Information Processing Systems

Yao Yao

Qihang Lin

Tianbao Yang

2022/12/6

Federated learning on adaptively weighted nodes by bilevel optimization

arXiv preprint arXiv:2207.10751

Yankun Huang

Qihang Lin

Nick Street

Stephen Baek

2022/7/21

Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization

Computational optimization and applications

Qihang Lin

Runchao Ma

Yangyang Xu

2022/5

Distributionally robust optimization with confidence bands for probability density functions

INFORMS journal on optimization

Xi Chen

Qihang Lin

Guanglin Xu

2022/1

Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning

Optimization Methods and Software

Hassan Rafique

Mingrui Liu

Qihang Lin

Tianbao Yang

2022/5/4

First-order convergence theory for weakly-convex-weakly-concave min-max problems

Journal of Machine Learning Research

Mingrui Liu

Hassan Rafique

Qihang Lin

Tianbao Yang

2021

Hybrid predictive models: When an interpretable model collaborates with a black-box model

Journal of machine learning research

Tong Wang

Qihang Lin

2021

A Parameter-free and Projection-free Restarting Level Set Method for Adaptive Constrained Convex Optimization Under the Error Bound Condition

arXiv preprint arXiv:2010.15267

Qihang Lin

Runchao Ma

Selvaprabu Nadarajah

Negar Soheili

2020/10/28

Optimal epoch stochastic gradient descent ascent methods for min-max optimization

Advances in Neural Information Processing Systems

Yan Yan

Yi Xu

Qihang Lin

Wei Liu

Tianbao Yang

2020

High-dimensional model recovery from random sketched data by exploring intrinsic sparsity

Machine learning

Tianbao Yang

Lijun Zhang

Qihang Lin

Shenghuo Zhu

Rong Jin

2020/5

Bayesian Decision Process for Budget-efficient Crowdsourced Clustering

Xiaozhou Wang

Xi Chen

Qihang Lin

Weidong Liu

2020

Revisiting approximate linear programming: Constraint-violation learning with applications to inventory control and energy storage

Management science

Qihang Lin

Selvaprabu Nadarajah

Negar Soheili

2020/4

A data efficient and feasible level set method for stochastic convex optimization with expectation constraints

Journal of machine learning research

Qihang Lin

Selvaprabu Nadarajah

Negar Soheili

Tianbao Yang

2020

See List of Professors in Qihang Lin University(University of Iowa)

Co-Authors

H-index: 48
Tianbao Yang

Tianbao Yang

University of Iowa

H-index: 35
Xi Chen

Xi Chen

New York University

H-index: 23
Javier Peña

Javier Peña

Carnegie Mellon University

academic-engine