18844

Video URL

https://simons.berkeley.edu/talks/sharp-matrix-concentration

Sharp Matrix Concentration

(2021). Sharp Matrix Concentration. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/sharp-matrix-concentration

Sharp Matrix Concentration. The Simons Institute for the Theory of Computing, Dec. 06, 2021, https://simons.berkeley.edu/talks/sharp-matrix-concentration 

          @misc{ scivideos_18844,
            doi = {},
            url = {https://simons.berkeley.edu/talks/sharp-matrix-concentration},
            author = {},
            keywords = {},
            language = {en},
            title = {Sharp Matrix Concentration},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2021},
            month = {dec},
            note = {18844 see, \url{https://scivideos.org/Simons-Institute/18844}}
          }
March Boedihardjo (University of California, Irvine)
Talk number18844
Source RepositorySimons Institute
Subject

Abstract

Classical matrix concentration inequalities are sharp up to a logarithmic factor. This logarithmic factor is necessary in the commutative case but unnecessary in many classical noncommutative cases. We will present some matrix concentration results that are sharp in many cases, where we overcome this logarithmic factor by using an easily computable quantity that captures noncommutativity. Joint work with Afonso Bandeira and Ramon van Handel. Paper: https://arxiv.org/abs/2108.06312