Nearly optimal linear embeddings into very low dimensions

We propose algorithms for constructing linear embeddings of a finite dataset V ⊂ ℝ[superscript d] into a k-dimensional subspace with provable, nearly optimal distortions. First, we propose an exhaustive-search-based algorithm that yields a k-dimensional linear embedding with distortion at most ε[sub...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों: Grant, Elyot, Hegde, Chinmay, Indyk, Piotr
अन्य लेखक: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
स्वरूप: लेख
भाषा:en_US
प्रकाशित: Institute of Electrical and Electronics Engineers (IEEE) 2018
ऑनलाइन पहुंच:http://hdl.handle.net/1721.1/113673
https://orcid.org/0000-0002-7983-9524