Related papers: A Nonlinear Approach to Dimension Reduction
We study the Lorentz and Dirac algebra, including antisymmetric $\epsilon$ tensors and the $\gamma_5$ matrix, in implicit gauge-invariant regularization/renormalization methods defined in fixed integer dimensions. They include constrained…
The very weak solution of the Poisson equation with $L^2$ boundary data is defined by the method of transposition. The finite element solution with regularized boundary data converges in the $L^2(\Omega)$-norm with order $1/2$ in convex…
Dimensionality reduction is a fundamental task that aims to simplify complex data by reducing its feature dimensionality while preserving essential patterns, with core applications in data analysis and visualisation. To preserve the…
This survey is written in summer, 2016. The purpose of this survey is to briefly introduce nonlinear dimensionality reduction (NLDR) in data reduction. The first two NLDR were respectively published in Science in 2000 in which they solve…
We study the metric properties of finite subsets of L_1. The analysis of such metrics is central to a number of important algorithmic problems involving the cut structure of weighted graphs, including the Sparsest Cut Problem, one of the…
In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…
In recent years, manifold methods have moved into focus as tools for dimension reduction. Assuming that the high-dimensional data actually lie on or close to a low-dimensional nonlinear manifold, these methods have shown convincing results…
Dimensionality reduction-based dictionary learning methods in the literature have often used iterative random projections. The dimensionality of such a random projection matrix is a random number that might not lead to a separable subspace…
There are many Rankin-Selberg integrals representing Langlands $L$-functions, and it is not apparent what the limits of the Rankin-Selberg method are. The Dimension Equation is an equality satisfied by many such integrals that suggests a…
Previous work has shown that DNNs with large depth $L$ and $L_{2}$-regularization are biased towards learning low-dimensional representations of the inputs, which can be interpreted as minimizing a notion of rank $R^{(0)}(f)$ of the learned…
By discretizing an argument of Kislyakov, Naor and Schechtman proved that the 1-Wasserstein metric over the planar grid $\{0,1,\dots n\}^2$ has $L_1$-distortion bounded below by a constant multiple of $\sqrt{\log n}$. We provide a new…
Dimension reduction is a key algorithmic tool with many applications including nearest-neighbor search, compressed sensing and linear algebra in the streaming model. In this work we obtain a {\em sparse} version of the fundamental tool in…
We introduce and study the notion of an outer bi-Lipschitz extension of a map between Euclidean spaces. The notion is a natural analogue of the notion of a Lipschitz extension of a Lipschitz map. We show that for every map $f$ there exists…
Suppose that $Y$ is a scalar and $X$ is a second-order stochastic process, where $Y$ and $X$ are conditionally independent given the random variables $\xi_1,...,\xi_p$ which belong to the closed span $L_X^2$ of $X$. This paper investigates…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
In this paper, we study a class of two-dimensional Finsler metrics defined by a Riemannian metric $\alpha$ and a 1-form $\beta$. We characterize those metrics which are Douglasian or locally projectively flat by some equations. In…
The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate. Here, we employ new tools from…
The Johnson-Lindenstrauss (JL) theorem states that a set of points in high-dimensional space can be embedded into a lower-dimensional space while approximately preserving pairwise distances with high probability Johnson and Lindenstrauss…
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…
We introduce a new technique for reducing the dimension of the ambient space of low-degree polynomials in the Gaussian space while preserving their relative correlation structure, analogous to the Johnson-Lindenstrauss lemma. As…