English
Related papers

Related papers: Guarantees for the Kronecker Fast Johnson-Lindenst…

200 papers

We consider a problem of covariance estimation from a sample of i.i.d. high-dimensional random vectors. To avoid the curse of dimensionality, we impose an additional assumption on the structure of the covariance matrix $\Sigma$. To be more…

Statistics Theory · Mathematics 2026-02-11 Artsiom Patarusau , Nikita Puchkin , Maxim Rakhuba , Fedor Noskov

There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered…

Data Structures and Algorithms · Computer Science 2012-10-16 Fabian Lim

Linear Canonical Transformations (LCTs) are known in signal processing and optics as the generalization of certain useful integral transforms. In quantum theory, they can be identified as the linear transformations which keep invariant the…

We show that the simplest FLRW cosmological system consisting in the homogeneous and isotropic massless Einstein-Scalar system enjoys a hidden conformal symmetry under the 1D conformal group $SL(2,\mathbb{R})$ acting as Mobius…

General Relativity and Quantum Cosmology · Physics 2025-02-06 Jibril Ben Achour , Etera R. Livine

This work presents a fast and non-convex algorithm for robust subspace recovery. The data sets considered include inliers drawn around a low-dimensional subspace of a higher dimensional ambient space, and a possibly large portion of…

Machine Learning · Computer Science 2018-11-07 Gilad Lerman , Tyler Maunu

Spectral inference provides fast algorithms and provable optimality for latent topic analysis. But for real data these algorithms require additional ad-hoc heuristics, and even then often produce unusable results. We explain this poor…

Machine Learning · Computer Science 2016-11-02 Moontae Lee , David Bindel , David Mimno

Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…

Probability · Mathematics 2020-08-10 Manjunath Krishnapur

We study a multivariate version of trend filtering, called Kronecker trend filtering or KTF, for the case in which the design points form a lattice in $d$ dimensions. KTF is a natural extension of univariate trend filtering (Steidl et al.,…

Machine Learning · Statistics 2024-04-09 Veeranjaneyulu Sadhanala , Yu-Xiang Wang , Addison J. Hu , Ryan J. Tibshirani

The Johnson-Lindenstrauss Lemma allows for the projection of $n$ points in $p-$dimensional Euclidean space onto a $k-$dimensional Euclidean space, with $k \ge \frac{24\ln \emph{n}}{3\epsilon^2-2\epsilon^3}$, so that the pairwise distances…

Machine Learning · Statistics 2010-05-11 Javier Rojo , Tuan Nguyen

We study the classification performance of Kronecker-structured models in two asymptotic regimes and developed an algorithm for separable, fast and compact K-S dictionary learning for better classification and representation of…

Information Theory · Computer Science 2018-10-26 Ishan Jindal , Matthew Nokleby

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Dynamical Systems · Mathematics 2020-09-14 Ville Salo

We give another proof, using tools from Geometric Invariant Theory, of a result due to S. Sam and A. Snowden in 2014, concerning the stability of Kro-necker coefficients. This result states that some sequences of Kronecker coefficients…

Representation Theory · Mathematics 2018-04-16 Maxime Pelletier

Consider random symmetric Toeplitz matrices $T_{n}=(a_{i-j})_{i,j=1}^{n}$ with matrix entries $a_{j}, j=0,1,2,...,$ being independent real random variables such that \be \mathbb{E}[a_{j}]=0, \ \ \mathbb{E}[|a_{j}|^{2}]=1 \ \ \textrm{for}\,\…

Probability · Mathematics 2010-11-09 Dang-Zheng Liu , Xin Sun , Zheng-Dong Wang

In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclidean distance between points up to a bounded relative error.…

Discrete Mathematics · Computer Science 2018-03-15 Michael Burr , Shuhong Gao , Fiona Knoll

We investigate the Hilbert complex of elasticity involving spaces of symmetric tensor fields. For the involved tensor fields and operators we show closed ranges, Friedrichs/Poincare type estimates, Helmholtz type decompositions, regular…

Analysis of PDEs · Mathematics 2021-08-17 Dirk Pauly , Walter Zulehner

The usual fluid equations describing the large-scale evolution of mass density in the universe can be written as local in the density, velocity divergence, and velocity potential fields. As a result, the perturbative expansion in small…

Cosmology and Nongalactic Astrophysics · Physics 2016-06-01 Marcel Schmittfull , Zvonimir Vlah , Patrick McDonald

In this paper, it is shown why Lorentz Transformation implies the general case where observed events are not necessarily in the inertia frame of any observer but assumes a special scenario when determining the length contraction and time…

General Physics · Physics 2012-09-24 Ibrahim M. Alabdulmohsin

Lorentz Invariance violation is a common feature of new physics beyond the standard model. We show that the symmetry of Randers spaces deduces a modified dispersion relation with characteristics of Lorentz Invariance violation. The…

High Energy Physics - Theory · Physics 2008-04-07 Zhe Chang , Xin Li

The Johnson-Lindenstrauss transform is a fundamental method for dimension reduction in Euclidean spaces, that can map any dataset of $n$ points into dimension $O(\log n)$ with low distortion of their distances. This dimension bound is tight…

Data Structures and Algorithms · Computer Science 2026-02-20 Shaofeng H. -C. Jiang , Robert Krauthgamer , Shay Sapir , Sandeep Silwal , Di Yue

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…

Data Structures and Algorithms · Computer Science 2010-06-01 Nir Ailon , Edo Liberty