Compact representations that support geometrically meaningful comparisons are valuable for learning from probability distributions. We study optimal, free-weight $M$-atom quantization of one-dimensional probability measures in quadratic Wasserstein distance and extend it to higher dimensions via slicing. Using $L$ shar...
Elaheh Akbari, James Liu, Keaton Hamm et al.· 0 citations
Long context inference with large language models becomes increasingly expensive as attention must operate over an ever growing KV cache. Page sparse attention reduces this cost by representing each KV page compactly and retrieving only a subset for each query. Existing retrieval methods are designed to estimate attent...
In lifelong reinforcement learning, retaining previously learned policies is not sufficient for effective transfer to a new task. Useful knowledge may be distributed across several prior policies, and its relevance may change as the learner acquires experience. One hypothesis is that task similarity can be effectively...
Saptarshi Nath, Inish M. D'Souza, Antonio Carta et al.· 0 citations
Zero Sum SVD (ZS-SVD) is proposed, a post-training method that performs global singular component selection using activation whitening and first-order calibration loss estimates in whitened coordinates, automatically yielding heterogeneous ranks without solving a rank allocation optimization.
Ali Abbasi, Chayne Thrash, Hao-Ran Qin et al.· arXiv.org· 9 citations· ⚡1
Large language models are increasingly expensive to serve. In large-scale serving systems, autoregressive decoding is often bottlenecked by transferring model weights from accelerator high-bandwidth memory into on-chip SRAM. Mixture-of-experts (MoE) models reduce computation by activating only a small subset of experts...
Ali Abbasi, Justin Shi, Soheil Kolouri· arXiv.org· 1 citation
This work characterize the effect of a residual-stream perturbation through both its activation covariance and the local sensitivity of the model output, and derives a tractable spectral upper bound that reduces subspace selection to an eigendecomposition of a sensitivity-weighted covariance matrix, retaining the effic...
Chayne Thrash, Ke Chen, Soheil Kolouri· arXiv.org· 0 citations
PAWC is proposed: an exact $O(N\log N)$ time, $O(N)$ memory algorithm returning all $K+1$ costs, nested active sets and plans in one run, together with a single gap that is simultaneously optimal for every cardinality.
Soheil Kolouri· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.