4 papers
Efficient Turing Machine Simulation with Transformers
Qian Li, Yuyi Wang
Constant bit-size Transformers are known to be Turing complete, but existing constructions require chain-of-thought (CoT) steps per simulated Turing machine (TM) step, le…
Constant Bit-size Transformers Are Turing Complete
Qian Li, Yuyi Wang
We prove that any Turing machine running on inputs of arbitrary length can be simulated by a constant bit-size transformer, as long as the context window is sufficiently long. This…
An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling
Linxin Yang, Bingheng Li, Tian Ding +6
Quadratic programs (QPs) arise in various domains such as machine learning, finance, and control. Recently, learning-enhanced primal-dual hybrid gradient (PDHG) methods have shown…
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
Qian Li, Minghui Ouyang, Yuyi Wang
This paper presents a distributed algorithm in the CONGEST model that achieves a -approximation for row-sparse fractional covering problems (RS-FCP) and the dual column-spar…