14 citations · 15 across the 4 of their papers we have counts for
4 papers
On Computational Limits of FlowAR Models: Expressivity and Efficiency
Yang Cao, Chengyue Gong, Yekun Ke +5
The expressive power and computational complexity of deep visual generative models, such as flow-based and autoregressive (AR) models, have gained considerable interest for their w…
Modern Hopfield Networks Require Chain-of-Thought to Solve -Hard Problems
Yang Cao, Xiaoyu Li, Yuanpeng Li +3
Modern Hopfield Networks (MHNs) have emerged as powerful components in deep learning, serving as effective replacements for pooling layers, LSTMs, and attention mechanisms. While r…
Minimum Cost Flows, MDPs, and -Regression in Nearly Linear Time for Dense Instances
Jan van den Brand, Yin Tat Lee, Yang P. Liu +4
In this paper we provide new randomized algorithms with improved runtimes for solving linear programs with two-sided constraints. In the special case of the minimum cost flow probl…
A Matrix Expander Chernoff Bound
Ankit Garg, Yin Tat Lee, Zhao Song +1
We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a random walk on an expander, confirming a conjecture due to Wigderson and Xiao. Our proof is…