A new algorithm completes rank-1 tensors with minimal samples and time.
problem Completing rank-1 tensors with minimal samples and time.
method Gauss-Jordan on random linear systems.
result Gauss-Jordan algorithm uses samples and runs in time.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
1 result for “Gauss-Jordan”