Topic: singular values

Davide Palitta introduces the S^T S-SVD, a decomposition of A derived from the SVD of its sketch SA. It is exact with high probability, preserves singular values probabilistically, and makes left singular vectors orthonormal in the sketch-induced seminorm, with lower computational cost. The talk relates this perspective to subspace embeddings and least-squares residuals, assesses sketch quality, and bounds departures from ordinary orthogonality in randomized QR. A further application extends the nearest-orthogonal-matrix problem to S^T S-orthogonality. The work builds on Gilbert, Park, and Wak

Learning in biological systems takes place in contexts and with dynamics not often accounted for by simple models. I will describe the learning dynamics of two model systems that incorporate either architectural or dynamic constraints from biological observations. In the first case, inspired by the observed mesoscopic structure of the mouse brain as revealed by the Allen Mouse Brain Connectivity Atlas, as well as multiple examples of parallel pathways in mammalian brains, I present a mathematical analysis of learning dynamics in networks that have parallel computational pathways driven by the