Christopher Liaw

540 total citations
13 papers, 153 citations indexed

About

Christopher Liaw is a scholar working on Artificial Intelligence, Management Science and Operations Research and Marketing. According to data from OpenAlex, Christopher Liaw has authored 13 papers receiving a total of 153 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Artificial Intelligence, 6 papers in Management Science and Operations Research and 4 papers in Marketing. Recurrent topics in Christopher Liaw's work include Machine Learning and Algorithms (6 papers), Auction Theory and Applications (4 papers) and Consumer Market Behavior and Pricing (4 papers). Christopher Liaw is often cited by papers focused on Machine Learning and Algorithms (6 papers), Auction Theory and Applications (4 papers) and Consumer Market Behavior and Pricing (4 papers). Christopher Liaw collaborates with scholars based in Canada, United States and Japan. Christopher Liaw's co-authors include Abbas Mehrabian, Peter L. Bartlett, Nicholas J. A. Harvey, Aranyak Mehta, D. Sivakumar, Yaniv Plan, Weiwei Kong, Paul Liu, Guru Guruganesh and Abhishek Sethi and has published in prestigious journals such as Journal of the ACM, Journal of Machine Learning Research and Discrete Mathematics.

In The Last Decade

Christopher Liaw

10 papers receiving 145 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Christopher Liaw Canada 5 98 27 26 23 20 13 153
Ankan Saha United States 5 140 1.4× 23 0.9× 32 1.2× 49 2.1× 14 0.7× 14 216
Dmitry Pechyony United States 9 175 1.8× 18 0.7× 101 3.9× 22 1.0× 8 0.4× 12 222
Alistair Stewart United States 6 109 1.1× 21 0.8× 12 0.5× 12 0.5× 29 1.4× 21 178
Abhay Harpale United States 5 157 1.6× 43 1.6× 40 1.5× 29 1.3× 11 0.6× 7 308
Yevgeny Seldin Germany 10 215 2.2× 126 4.7× 25 1.0× 21 0.9× 9 0.5× 30 266
Yancheng Yuan Hong Kong 5 59 0.6× 13 0.5× 19 0.7× 24 1.0× 17 0.8× 20 131
Beyza Ermiş Türkiye 7 88 0.9× 14 0.5× 24 0.9× 20 0.9× 3 0.1× 18 172
Srinivas Vadrevu United States 9 202 2.1× 22 0.8× 55 2.1× 24 1.0× 13 0.7× 17 287
Markus Jalsenius United Kingdom 6 57 0.6× 10 0.4× 19 0.7× 4 0.2× 77 3.9× 12 165
Tasuku Soma Japan 7 62 0.6× 21 0.8× 8 0.3× 14 0.6× 100 5.0× 15 169

Countries citing papers authored by Christopher Liaw

Since Specialization
Citations

This map shows the geographic impact of Christopher Liaw'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 Christopher Liaw with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christopher Liaw more than expected).

Fields of papers citing papers by Christopher Liaw

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Christopher Liaw. 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 Christopher Liaw. The network helps show where Christopher Liaw may publish in the future.

Co-authorship network of co-authors of Christopher Liaw

This figure shows the co-authorship network connecting the top 25 collaborators of Christopher Liaw. A scholar is included among the top collaborators of Christopher Liaw 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 Christopher Liaw. Christopher Liaw is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
2.
Cai, Yang, Christopher Liaw, Aranyak Mehta, & Mingfei Zhao. (2024). The Power of Two-Sided Recruitment in Two-Sided Markets. 201–212.
3.
Liaw, Christopher, et al.. (2023). Efficiency of Non-Truthful Auctions in Auto-bidding: The Power of Randomization. 3561–3571. 3 indexed citations
4.
Feng, Zhe, Guru Guruganesh, Christopher Liaw, Aranyak Mehta, & Abhishek Sethi. (2021). Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions. Proceedings of the AAAI Conference on Artificial Intelligence. 35(6). 5399–5406. 9 indexed citations
5.
Harvey, Nicholas J. A., Christopher Liaw, & Tasuku Soma. (2020). Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds. Neural Information Processing Systems. 33. 123–133. 2 indexed citations
6.
Ben-David, Shai, et al.. (2020). Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. Journal of the ACM. 67(6). 1–42. 3 indexed citations
7.
Harvey, Nicholas J. A., et al.. (2020). Optimal anytime regret for two experts. 40. 1404–1415.
8.
Kong, Weiwei, Christopher Liaw, Aranyak Mehta, & D. Sivakumar. (2019). A new dog learns old tricks: RL finds classic optimization algorithms. International Conference on Learning Representations. 17 indexed citations
9.
Harvey, Nicholas J. A., et al.. (2019). Tight analyses for non-smooth stochastic gradient descent. Conference on Learning Theory. 1579–1613. 11 indexed citations
10.
Ben-David, Shai, et al.. (2018). Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. Neural Information Processing Systems. 31. 3412–3421. 4 indexed citations
11.
Harvey, Nicholas J. A., Christopher Liaw, & Paul Liu. (2018). Greedy and Local Ratio Algorithms in the MapReduce Model. 25. 43–52. 9 indexed citations
12.
Bartlett, Peter L., et al.. (2017). Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks. Journal of Machine Learning Research. 20(63). 1–17. 94 indexed citations
13.
Harvey, Nicholas C. & Christopher Liaw. (2017). Rainbow Hamilton cycles and lopsidependency. Discrete Mathematics. 340(6). 1261–1270. 1 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026