Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Secure Communication Over Fading Channels
2008668 citationsYingbin Liang, H. Vincent Poor et al.IEEE Transactions on Information Theoryprofile →
Information Theoretic Security
2007457 citationsYingbin Liang, H. Vincent Poor et al.profile →
Information Theoretic Security
2009415 citationsYingbin Liang, H. Vincent Poor et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Yingbin Liang'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 Yingbin Liang with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yingbin Liang more than expected).
This network shows the impact of papers produced by Yingbin Liang. 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 Yingbin Liang. The network helps show where Yingbin Liang may publish in the future.
Co-authorship network of co-authors of Yingbin Liang
This figure shows the co-authorship network connecting the top 25 collaborators of Yingbin Liang.
A scholar is included among the top collaborators of Yingbin Liang 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 Yingbin Liang. Yingbin Liang is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Zhou, Yi & Yingbin Liang. (2018). Critical Points of Linear Neural Networks: Analytical Forms and Landscape Properties. arXiv (Cornell University).14 indexed citations
12.
Wang, Zhe, Yi Zhou, Yingbin Liang, & Guanghui Lan. (2018). Sample Complexity of Stochastic Variance-Reduced Cubic Regularization for Nonconvex Optimization.. arXiv (Cornell University).2 indexed citations
Zhou, Yi, Yaoliang Yu, Wei Dai, Yingbin Liang, & Eric P. Xing. (2016). On Convergence of Model Parallel Proximal Gradient Algorithm for Stale Synchronous Parallel System. International Conference on Artificial Intelligence and Statistics. 713–722.14 indexed citations
Zhang, Huishuai & Yingbin Liang. (2016). Reshaped Wirtinger Flow for Solving Quadratic Systems of Equations. arXiv (Cornell University).12 indexed citations
18.
Zhang, Huishuai, Yi Zhou, & Yingbin Liang. (2015). Analysis of robust PCA via local incoherence. Neural Information Processing Systems. 28. 1819–1827.7 indexed citations
19.
Liang, Yingbin, et al.. (2014). Dirty interference cancelation for multiple access channels.. International Symposium on Information Theory and its Applications. 463–467.2 indexed citations
20.
Liang, Yingbin, Gerhard Kramer, H. Vincent Poor, & Shlomo Shamai. (2007). Compound wire-tap channels. mediaTUM (Technical University of Munich). 136–143.70 indexed citations
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.