English
Related papers

Related papers: Johnson-Lindenstrauss Embeddings with Kronecker St…

200 papers

Let $ \mu $ be a self-affine measure associated with a diagonal affine iterated function system (IFS) $ \Phi = \{ (x_{1}, \ldots, x_{d}) \mapsto ( r_{i, 1}x_{1} + t_{i,1}, \ldots, r_{i,d}x_{d} + t_{i,d}) \}_{i\in\Lambda} $ on $…

Dynamical Systems · Mathematics 2025-02-14 Zhou Feng

The aim of this paper is two-fold: firstly, to present subspace embedding properties for $s$-hashing sketching matrices, with $s\geq 1$, that are optimal in the projection dimension $m$ of the sketch, namely, $m=\mathcal{O}(d)$, where $d$…

Numerical Analysis · Mathematics 2021-05-26 Coralia Cartis , Jan Fiala , Zhen Shao

Let $\mathcal{M}$ be a smooth $d$-dimensional submanifold of $\mathbb{R}^N$ with boundary that's equipped with the Euclidean (chordal) metric, and choose $m \leq N$. In this paper we consider the probability that a random matrix $A \in…

Information Theory · Computer Science 2022-05-24 Mark A. Iwen , Benjamin Schmidt , Arman Tavakoli

We introduce the TTStack sketch, a structured random projection tailored to the tensor train (TT) format that unifies existing TT-adapted sketching operators. By varying two integer parameters $P$ and $R$, TTStack interpolates between the…

Numerical Analysis · Mathematics 2026-03-16 Paul Cazeaux , Mi-Song Dupuy , Rodrigo Figueroa Justiniano

We study permutation-invariant embeddings of $d$-dimensional point sets, which are defined by sorting $D$ independent one-dimensional projections of the input. Such embeddings arise in graph deep learning where outputs should be invariant…

Machine Learning · Computer Science 2026-05-26 Nadav Dym , Matthias Wellershoff , Efstratios Tsoukanis , Daniel Levy , Radu Balan

In the study manifolds of Ricci curvature bounded below, a stumbling obstruction is the lack of links between large-scale geometry and small-scale geometry at a fixed reference point. There have been few links (volume, dimension) when the…

Differential Geometry · Mathematics 2018-09-12 Jiayin Pan , Xiaochun Rong

We study self-similar sets and measures on $\mathbb{R}^{d}$. Assuming that the defining iterated function system $\Phi$ does not preserve a proper affine subspace, we show that one of the following holds: (1) the dimension is equal to the…

Classical Analysis and ODEs · Mathematics 2017-06-07 Michael Hochman

This paper considers compressed sensing matrices and neighborliness of a centrally symmetric convex polytope generated by vectors $\pm X_1,...,\pm X_N\in\R^n$, ($N\ge n$). We introduce a class of random sampling matrices and show that they…

Probability · Mathematics 2009-05-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…

Machine Learning · Statistics 2018-09-05 Krzysztof Choromanski , Mark Rowland , Adrian Weller

Constrained least-squares regression problems, such as the Nonnegative Least Squares (NNLS) problem, where the variables are restricted to take only nonnegative values, often arise in applications. Motivated by the recent development of the…

Data Structures and Algorithms · Computer Science 2009-03-13 Christos Boutsidis , Petros Drineas

For a matrix $M$ and a positive integer $r$, the rank $r$ rigidity of $M$ is the smallest number of entries of $M$ which one must change to make its rank at most $r$. There are many known applications of rigidity lower bounds to a variety…

Data Structures and Algorithms · Computer Science 2021-02-25 Josh Alman

It is now well known that sparse or compressible vectors can be stably recovered from their low-dimensional projection, provided the projection matrix satisfies a Restricted Isometry Property (RIP). We establish new implications of the RIP…

Functional Analysis · Mathematics 2012-11-09 Rémi Gribonval , Morten Nielsen

Let $x_{j+1}=\phi(x_{j})$, $x_{j}\in\mathbb{R}^{d}$, be a dynamical system with $\phi$ being a diffeomorphism. Although the state vector $x_{j}$ is often unobservable, the dynamics can be recovered from the delay vector…

Dynamical Systems · Mathematics 2018-06-21 Raymundo Navarrete , Divakar Viswanath

We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove…

Data Structures and Algorithms · Computer Science 2025-02-14 Raphael A. Meyer , William Swartworth , David P. Woodruff

We consider tilings $(\mathcal{Q},\Phi)$ of $\mathbb{R}^d$ where $\mathcal{Q}$ is the $d$-dimensional unit cube and the set of translations $\Phi$ is constrained to lie in a pre-determined lattice $A \mathbb{Z}^d$ in $\mathbb{R}^d$. We…

Classical Analysis and ODEs · Mathematics 2024-03-13 Dae Gwan Lee , Goetz E. Pfander , David Walnut

In this article, we propose an algorithm for approximating the action of $\varphi-$functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum…

Numerical Analysis · Mathematics 2022-11-03 Matteo Croci , Judit Muñoz-Matute

Statistical distance measures have found wide applicability in information retrieval tasks that typically involve high dimensional datasets. In order to reduce the storage space and ensure efficient performance of queries, dimensionality…

Computational Geometry · Computer Science 2010-03-09 Arnab Bhattacharya , Purushottam Kar , Manjish Pal

We establish the following Hadamard--Stoker type theorem: Let $f:M^n\rightarrow\mathscr{H}^n\times\mathbb R$ be a complete connected hypersurface with positive definite second fundamental form, where $\mathscr H^n$ is a Hadamard manifold.…

Differential Geometry · Mathematics 2020-08-25 Ronaldo Freire de Lima

In this paper we show that for the purposes of dimensionality reduction certain class of structured random matrices behave similarly to random Gaussian matrices. This class includes several matrices for which matrix-vector multiply can be…

Information Theory · Computer Science 2015-10-08 Samet Oymak , Benjamin Recht , Mahdi Soltanolkotabi

The seminal Fast Johnson-Lindenstrauss (Fast JL) transform by Ailon and Chazelle (SICOMP'09) embeds a set of $n$ points in $d$-dimensional Euclidean space into optimal $k=O(\varepsilon^{-2} \ln n)$ dimensions, while preserving all pairwise…

Data Structures and Algorithms · Computer Science 2022-04-06 Ora Nova Fandina , Mikael Møller Høgsgaard , Kasper Green Larsen