Qihang Lin
About
In The Last Decade
Qihang Lin
59 papers receiving 932 citations
Peers
Comparison fields: 5 of 115
- Artificial Intelligence 371
- Computational Mechanics 279
- Biomedical Engineering 189
- Materials Chemistry 124
- Catalysis 121
Countries citing papers authored by Qihang Lin
This map shows the geographic impact of Qihang Lin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Qihang Lin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Qihang Lin more than expected).
Fields of papers citing papers by Qihang Lin
This network shows the impact of papers produced by Qihang Lin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Qihang Lin. The network helps show where Qihang Lin may publish in the future.
Co-authorship network of co-authors of Qihang Lin
This figure shows the co-authorship network connecting the top 25 collaborators of Qihang Lin. A scholar is included among the top collaborators of Qihang Lin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Qihang Lin. Qihang Lin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 14 | |
| 4 | Hybrid Predictive Models: When an Interpretable Model Collaborates with a Black-box Model | 21 |
| 5 | Transparency Promotion with Model-Agnostic Linear Competitors | 2 |
| 6 | Sharp Analysis of Epoch Stochastic Gradient Descent Ascent Methods for Min-Max Optimization. | 2 |
| 7 | Inexact Proximal-Point Penalty Methods for Non-Convex Optimization with Non-Convex Constraints | 4 |
| 8 | DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization | 14 |
| 9 | Level-Set Methods for Finite-Sum Constrained Convex Optimization | 5 |
| 10 | Solving Weakly-Convex-Weakly-Concave Saddle-Point Problems as Successive Strongly Monotone Variational Inequalities | 4 |
| 11 | RSG: Beating Subgradient Method without Smoothness and Strong Convexity | 12 |
| 12 | No More Fixed Penalty Parameter in ADMM: Faster Convergence with New Adaptive Penalization | 0 |
| 13 | Distributed stochastic variance reduced gradient methods by sampling extra data with replacement | 31 |
| 14 | A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates. | 4 |
| 15 | ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization | 17 |
| 16 | Adaptive SVRG Methods under Error Bound Conditions with Unknown Growth Parameter | 3 |
| 17 | Distributed Stochastic Variance Reduced Gradient Methods. | 5 |
| 18 | An Accelerated Proximal Coordinate Gradient Method | 22 |
| 19 | Optimistic Knowledge Gradient Policy for Optimal Budget Allocation in Crowdsourcing | 69 |
| 20 | Optimal Regularized Dual Averaging Methods for Stochastic Optimization | 20 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.