Results 61 to 70 of about 955,306 (131)
, 2023 We study the effect of Johnson-Lindenstrauss transforms in various projective clustering problems, generalizing recent results which only applied to center-based clustering [MMR19]. We ask the general question: for a Euclidean optimization problem and an
Waingarten, Erik, Charikar, Moses
core +1 more source
A quantum Johnson-Lindenstrauss lemma via unitary t-designs
, 2018 The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation followed by projection onto the first O(log n) coordinates followed by a scaling works as a valid transformation ...
openaire +2 more sources
A supervised take on dimensionality reduction via hybrid subset selection. [PDF]
Patterns (N Y), 2022 Rahimikollu J, Das J.
europepmc +1 more source
We study the effect of Johnson-Lindenstrauss transforms in various projective clustering problems, generalizing recent results which only applied to center-based clustering [MMR19]. We ask the general question: for a Euclidean optimization problem and an accuracy parameter $ε\in (0, 1)$, what is the smallest target dimension $t \in \mathbb{N}$ such ...
Moses Charikar, Erik Waingarten
openaire +4 more sources
On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Subsets of $\mathbb{R}^N$ [PDF]
The celebrated Johnson-Lindenstrauss lemma states that for all $\varepsilon \in (0,1)$ and finite sets $X \subseteq \mathbb{R}^N$ with $n>1$ elements, there exists a matrix $\Phi \in \mathbb{R}^{m \times N}$ with $m=\mathcal{O}(\varepsilon^{-2}\log n ...
Chiclana, Rafael +2 more
core +1 more source
Johnson-Lindenstrauss Transformations [PDF]
, 2017 With the quick progression of technology and the increasing need to process large data, there has been an increased interest in data-dependent and data-independent dimension reduction techniques such as principle component analysis (PCA) and Johnson ...
Knoll, Fiona
core +1 more source
The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction
, 2016 For any n > 1, 0 < ϵ < 1/2, and N > n C for some constant C > 0, we show the existence of an N-point subset X of ℓ 2 n such that any linear map from X to ℓ 2 m with distortion at most 1 + ϵ must have m = Ω (min{n, ϵ -2 lgN}). This improves a lower bound of Alon [Alon, Discre.
Larsen, Kasper Green; id_orcid 0000-0001-8841-5929 +1 more
openaire +1 more source
Simple and complex cells revisited: toward a selectivity-invariance model of object recognition. [PDF]
Front Comput Neurosci, 2023 Li X, Wang S.
europepmc +1 more source
Efficient Least-Squares State Estimation Using Uniform Sampling. [PDF]
IFAC Pap OnLine, 2023 Vafaee R, Siami M.
europepmc +1 more source
Impartially Validated Multiple Deep-Chain Models to Detect COVID-19 in Chest X-ray Using Latent Space Radiomics. [PDF]
J Clin Med, 2021 Yousefi B +7 more
europepmc +1 more source