The Matrix Spencer conjecture asserts that for all symmetric matrices $A_1,\ldots,A_n\in\mathbb{R}^{n\times n}$ with $\|A_i\|\le1$ there are signs $\varepsilon_1,\ldots,\varepsilon_n\in\{-1,1\}$ with $\|\sum_{i=1}^n\varepsilon_iA_i\|=O(\sqrt n)$. We prove it: a signing of discrepancy below $8\sqrt n$ always exists. We...
A new fast, dense randomized transform is introduced, which combines a randomized Hadamard flattening, a random permutation, and balanced, disjoint Gaussian pooling to achieve a truly nearly-linear-in-d row count.
This work analyzes exact-metric, Metropolis-adjusted Dikin walks by keeping the proposal determinant and reverse quadratic form together, leaving centered fluctuations that can be controlled with second-order tools.
Zhao Song, Li-Cheng Zhang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.