Skip to content
conftrace_

Qihang Lin

29 papers · 2012–2025 · 5 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Achievements

Jump to papers ↓
+10 more ↓ πŸ—ΊοΈ Taxonomy Completionist (32) πŸƒ Academic Marathon Β· Half 🌍 Conference Polyglot Β· Silver πŸŒ‰ Interdisciplinary Bridge Β· Bronze 🐣 Hot Topic Early Bird
πŸ”¬ Deep Specialist (17) 🀝 Dynamic Duo (16) πŸ† Keyword Champion (4) 🧭 Keyword Pioneer πŸ“ˆ Trend Setter ⚑ Prolific Year Β· Productive πŸ—ƒοΈ Keyword Collector (143) πŸ”₯ Unstoppable Β· Silver πŸ’Ž Century Club Β· Bronze πŸš€ Conference Pioneer

Venues

JMLR (9) NeurIPS (9) ICML (8) IJCAI (2) AISTATS (1)

Top co-authors

Tianbao Yang (16) Yi Xu (6) Xi Chen (5) Yan Yan (3) Tong Wang (3) Lin Xiao (3) Runchao Ma (3) Negar Soheili (2) Yao Yao (2) Mingrui Liu (2)

Research topics

Machine Learning (28) Optimization & Theory Β· Machine Learning (23) Mathematics & Optimization (18) Optimization (18) Core Methods (6) Artificial Intelligence (5) Core AI (5) Learning Types (5) Deep Learning (3) Optimization & Theory Β· Deep Learning (3) Application Areas (2) Data Science & Analytics (1) Applications (1) Bayesian & Probabilistic (1) Mathematics (1)

Keywords

convex optimization (8) stochastic optimization (7) convergence rate (6) subgradient method (4) iteration complexity (4) first-order method (3) budget allocation (3) level set method (3) stochastic variance reduced gradient (3) markov decision process (3) knowledge gradient (3) min-max optimization (2) deep neural network (2) black-box model (2) linear convergence (2) bayesian optimization (2) proximal gradient method (2) strongly convex (2) stochastic convex optimization (2) distributed optimization (2)

Papers

An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition JMLR 2025 Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization NeurIPS 2023 Stochastic Methods for AUC Optimization subject to AUC-based Fairness Constraints AISTATS 2023 Large-scale Optimization of Partial AUC in a Range of False Positive Rates NeurIPS 2022 ProtoX: Explaining a Reinforcement Learning Agent via Prototyping NeurIPS 2022 First-order Convergence Theory for Weakly-Convex-Weakly-Concave Min-max Problems JMLR 2021 Hybrid Predictive Models: When an Interpretable Model Collaborates with a Black-box Model JMLR 2021 A Data Efficient and Feasible Level Set Method for Stochastic Convex Optimization with Expectation Constraints JMLR 2020 Bayesian Decision Process for Budget-efficient Crowdsourced Clustering IJCAI 2020 Optimal Epoch Stochastic Gradient Descent Ascent Methods for Min-Max Optimization NeurIPS 2020 Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints ICML 2020 Transparency Promotion with Model-Agnostic Linear Competitors ICML 2020 DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization JMLR 2019 Stochastic Optimization for DC Functions and Non-smooth Non-convex Regularizers with Non-asymptotic Convergence ICML 2019 A Unified Analysis of Stochastic Momentum Methods for Deep Learning IJCAI 2018 Level-Set Methods for Finite-Sum Constrained Convex Optimization ICML 2018 RSG: Beating Subgradient Method without Smoothness and Strong Convexity JMLR 2018 Adaptive SVRG Methods under Error Bound Conditions with Unknown Growth Parameter NeurIPS 2017 ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization NeurIPS 2017 A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates ICML 2017 Distributed Stochastic Variance Reduced Gradient Methods by Sampling Extra Data with Replacement JMLR 2017 Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence ICML 2017 Bayesian Decision Process for Cost-Efficient Dynamic Ranking via Crowdsourcing JMLR 2016 Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than O(1/Ξ΅) NeurIPS 2016 Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling JMLR 2015 An Accelerated Proximal Coordinate Gradient Method NeurIPS 2014 An Adaptive Accelerated Proximal Gradient Method and its Homotopy Continuation for Sparse Optimization ICML 2014 Optimistic Knowledge Gradient Policy for Optimal Budget Allocation in Crowdsourcing ICML 2013 Optimal Regularized Dual Averaging Methods for Stochastic Optimization NeurIPS 2012