Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
The Power of Test-Time Training for Approximate Sampling
Noah Golowich, Ankur Moitra, Dhruv Rohatgi
Efficiently sampling from a complex probability distribution is a fundamental problem which has become increasingly pertinent in recent years with the rise of generative AI, as sop…
cs.DS2025
Overcomplete Tensor Decomposition via Koszul-Young Flattenings
Pravesh K. Kothari, Ankur Moitra, Alexander S. Wein
Motivated by connections between algebraic complexity lower bounds and tensor decompositions, we investigate Koszul-Young flattenings, which are the main ingredient in recent lower…