Quasipolynomial algorithm finds approximate fixed points of ℓ∞ contractions
The method geometrically shrinks the search region and implies simple stochastic games can be solved in quasipolynomial time.
4 stories, newest first · one card per story
The method geometrically shrinks the search region and implies simple stochastic games can be solved in quasipolynomial time.
Looped language models near fixed points cut training and decode cost via learned depth priors and orthogonal injection.
Learned depth priors and orthogonal injection improve looped language models while enabling cheaper KV sharing.
Fixed-point-guided reduction turns redundant AL-RNNs into minimal dynamics, lifting Chua success from 20% to 71%.
Today 1.1K readers · 1.3K views · 286 reads · all time 110K views