Most papers here follow the Hardy Littlewood Rules where authors are presented in alphabetical order, with a few exceptions. (*) indicates equal contribution.

Ongoing Work and Preprints

• Scalable Gradient-Based Attribution of LLM Behaviors
  Linda Cai*, Xinyan Hu*, Alex Pan*, Socrates Osorio, Pratyay Pandey, Michael I. Jordan, Jacob Steinhardt.
  Ongoing work. Preprint available upon request! [code]
• Cost-aware Stopping for Bayesian Optimization
  Qian Xie*, Linda Cai*, Alexander Terenin, Peter I. Frazier, Ziv Scully.
  In submission. Preliminary version accepted to AutoML 2025, Non-archival Track.
  [poster]   [code]

Conference Publications

• Faster Diffusion-based Sampling with Randomized Midpoints: Sequential and Parallel
  Shivam Gupta, Linda Cai, Sitan Chen.
  The 13th International Conference on Learning Representations (ICLR), 2025.
  [video]   [poster]
• Competition Complexity in Multi-Item Auctions: Beyond VCG and Regularity
  Hedyeh Beyhaghi, Linda Cai, Yiding Feng, Yingkai Li, S. Matthew Weinberg.
  The 26th ACM Conference on Economics and Computation (EC), 2025.
• Profitable Manipulations of Cryptographic Self-Selection are Statistically Detectable
  Linda Cai, Jingyi Liu, S. Matthew Weinberg, Chenghan Zhou.
  The 6th international conference on Advances in Financial Technologies (AFT), 2024.
• Bundling in Oligopoly: Revenue Maximization with Single-Item Competitors
  Moshe Babaioff, Linda Cai, Brendan Lucier.
  The 25th ACM Conference on Economics and Computation (EC), 2024.
  [slides]
• Selling to Multiple No-Regret Buyers
  Linda Cai, S. Matthew Weinberg, Evan Wildenhain, Shirley Zhang.
  The 19th Conference On Web And InterNet Economics (WINE), 2023.
  [slides]
• Optimal Stopping with Multi-Dimensional Comparative Loss Aversion
  Linda Cai, Joshua Gardner, S. Matthew Weinberg.
  The 19th Conference On Web And InterNet Economics (WINE), 2023.
  [slides]
• Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS.
  Hedyeh Beyhaghi, Linda Cai.
  In Proceedings of 55th Annual ACM Symposium on Theory of Computing (STOC), 2023.
  [video]   [short slides]   [long slides]
• The Short-Side Advantage in Random Matching Markets.
  Linda Cai, Clayton Thomas.
  In Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA), 2022.
  [slides]
• 99% Revenue with Constant Enhanced Competition.
  Linda Cai, Raghuvansh R. Saxena.
  In Proceedings of The Twenty-Second ACM Conference on Economics and Computation (EC), 2021.
  [video]   [slides]
• Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms when Demand Queries are NP-hard.
  Linda Cai, Clayton Thomas, S. Matthew Weinberg.
  In Proceedings of the 11th Innovations in Theoretical Computer Science (ITCS), 2020.
  [slides]
• Baechi: fast device placement of machine learning graphs.
  Beomyeol Jeon, Linda Cai, Pallavi Srivastava, Jintao Jiang, Xiaolan Ke, Yitao Meng, Cong Xie, Indranil Gupta.
  In Proceedings of ACM Symposium on Cloud Computing (SOCC), 2020.
  [slides]

Survey Papers

• Recent Developments in Pandora’s Box Problem: Variants and Applications.
  Hedyeh Beyhaghi, Linda Cai.
  SIGecom Exchanges Vol. 21.1, 2023.