Cargando…
On randomized sketching algorithms and the Tracy–Widom law
There is an increasing body of work exploring the integration of random projection into algorithms for numerical linear algebra. The primary motivation is to reduce the overall computational cost of processing large datasets. A suitably chosen random projection can be used to embed the original data...
Autores principales: | Ahfock, Daniel, Astle, William J., Richardson, Sylvia |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9852177/ https://www.ncbi.nlm.nih.gov/pubmed/36691583 http://dx.doi.org/10.1007/s11222-022-10148-5 |
Ejemplares similares
-
Tracy-Widom GUE law and symplectic invariants
por: Borot, Gaetan, et al.
Publicado: (2010) -
Tracy-Widom distribution in AdS/CFT
por: Korchemsky, Gregory
Publicado: (2023) -
Convergence Rate to the Tracy–Widom Laws for the Largest Eigenvalue of Wigner Matrices
por: Schnelli, Kevin, et al.
Publicado: (2022) -
Statistical properties of sketching algorithms
por: Ahfock, D. C., et al.
Publicado: (2021) -
Tracy Chapman/
por: Kershenbaum David