Hashing embeddings of optimal dimension, with applications to linear least squares
The aim of this paper is two-fold: firstly, to present subspace embedding properties for s-hashing sketching matrices, with s ≥ 1, that are optimal in the projection dimension m of the sketch, namely, m = O(d), where d is the dimension of the subspace. A diverse set of results are presented that add...
Autors principals: | Cartis, C, Fiala, J, Shao, Z |
---|---|
Format: | Internet publication |
Idioma: | English |
Publicat: |
2021
|
Ítems similars
-
Trust-region and other regularisations of linear least-squares problems
per: Cartis, C, et al.
Publicat: (2008) -
Trust-region and other regularisations of linear least-squares problems
per: Cartis, C, et al.
Publicat: (2009) -
Scalable subspace methods for derivative-free nonlinear least-squares optimization
per: Cartis, C, et al.
Publicat: (2022) -
Linear least-squares estimation /
per: Kailath, Thomas
Publicat: (1977) -
Linear least squares computations /
per: 213981 Farebrother, R. W.
Publicat: (1988)