3 citations · 34 across the 47 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2025
When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
Chenyang Li, Yingyu Liang, Zhenmei Shi +1
The weighted low-rank approximation problem is a fundamental numerical linear algebra problem and has many applications in machine learning. Given a weight matrix …
cs.CC2024
The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity
Yifang Chen, Xiaoyu Li, Yingyu Liang +2
In this paper, we analyze the computational limitations of Mamba and State-space Models (SSMs) by using the circuit complexity framework. Despite Mamba's stateful design and recent…
cs.CC2024
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…