Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,786 papers · 148 categories

Trend · papers per month

25507499 · May 202619922001200920172026
48 results for restricted isometry

Matrices satisfying the Restricted Isometry Property (RIP) play an important role in the areas of compressed sensing and statistical learning. RIP matrices with optimal parameters are mainly obtained via probabilistic arguments, as explicit constructions seem hard. It is therefore interesting to ask whether a fixed mat…

2019-04-11abs ↗pdf ↗

Sign-RIP improves robust low-rank matrix recovery by preserving norms even with corrupted measurements.

problem Robust low-rank matrix recovery in the presence of corrupted measurements.
method Proposed Sign-RIP, a robust restricted isometry property.
result Sign-RIP guarantees uniform convergence of subdifferentials in robust low-rank matrix recovery.

New analysis proves sketching operators' RIP guarantees for mixture models without importance sampling.

problem Proving sketching operators' Restricted Isometry Property (RIP) for mixture models without assuming importance sampling.
method Proposed alternative analysis based on new deterministic bounds and concentration inequalities.
result Theoretical guarantees for sketching operators without importance sampling.

In this paper we develop a complete theory of factorization for isometries of hyperbolic 4-space. Of special interest is the case where a pair of isometries is linked, that is, when a pair of isometries can be expressed each as compositions of two involutions, one of which is common to both isometries. Here we develop …

2013-11-25abs ↗pdf ↗

We prove a Lipschitz-Volume rigidity theorem in Alexandrov geometry, that is, if a 1-Lipschitz map f ⁣:X=⨿XYf\colon X=\amalg X_\ell\to Y between Alexandrov spaces preserves volume, then it is a path isometry and an isometry when restricted to the interior of XX. We furthermore characterize the metric structure on YY with re…

2011-10-25abs ↗pdf ↗

A manifold is locally \emph{kk-fold symmetric}, if for any point and any kk-dimensional vector subspace tangent to this point there exists a local isometry such that this point is a fixed point and the differential of the isometry restricted to that kk-dimensional vector subspace is minus the identity. We show that …

2016-07-19abs ↗pdf ↗

The paper analyzes conditions for solving low-rank matrix recovery problems with noisy measurements.

problem Low-rank matrix recovery with corrupted measurements.
method Analysis of the restricted isometry property (RIP) and local search methods.
result Sharp bounds on the maximum distance between local minimizers and the ground truth.

A Jacobi field on a Riemannian manifold M is defined along a geodesic. We generalize this notion to an arbitrary smooth curve, and call it an infinitesimal isometry along the curve. We give two approaches to this: 1) compute the complete prolongation of the Killing equation and then restrict to the curve, and 2) comput…

2009-06-04abs ↗pdf ↗

Deep 3D models are vulnerable to isometry transformations under adversarial attacks.

problem Vulnerability of deep 3D models to isometry transformations under adversarial attacks.
method Developed a black-box attack with success rate over 95% and a novel white-box attack framework.
result Deep 3D models are extremely vulnerable to isometry transformations under adversarial attacks.

For a prime number q2q\neq 2 and r>0r>0 we study, whether there exists an isometry of order qrq^r acting on a free Zpk\mathbb{Z}_{p^k}-module equipped with a scalar product. We investigate, whether there exists such an isometry with no non-zero fixed points. Both questions are completely answered in this paper if $p\neq …

2018-10-09abs ↗pdf ↗

This work builds on the foundation laid by Gordon and Wilson in the study of isometry groups of solvmanifolds, i.e. Riemannian manifolds admitting a transitive solvable group of isometries. We restrict ourselves to a natural class of solvable Lie groups called almost completely solvable; this class includes the complet…

2013-04-20abs ↗pdf ↗

This paper investigates the average-case time complexity of certifying RIP matrices.

problem Certifying the restricted isometry property (RIP) for large sparsity levels in random Gaussian matrices.
method Analysis of the low-degree likelihood ratio to determine the average-case time complexity.
result Subexponential runtime of NildeΩ(s2/M)N^{ ildeΩ(s^2/M)} is required for certifying RIP matrices.

In this paper, we obtain the following generalisation of isometric C1C^1-immersion theorem of Nash and Kuiper. Let MM be a smooth manifold of dimension mm and HH a rank kk subbundle of the tangent bundle TMTM with a Riemannian metric gHg_H. Then the pair (H,gH)(H,g_H) defines a sub-Riemannian structure on MM. We call …

2010-09-27abs ↗pdf ↗

We generalize the natural cross ratio on the ideal boundary of a rank one symmetric spaces, or even CAT(1)\mathrm{CAT}(-1) space, to higher rank symmetric spaces and (non-locally compact) Euclidean buildings - we obtain vector valued cross ratios defined on simplices of the building at infinity. We show several properties …

2017-01-31abs ↗pdf ↗

When the linear measurements of an instance of low-rank matrix recovery satisfy a restricted isometry property (RIP)---i.e. they are approximately norm-preserving---the problem is known to contain no spurious local minima, so exact recovery is guaranteed. In this paper, we show that moderate RIP is not enough to elimin…

2018-05-25abs ↗pdf ↗

For n4n\geq 4 we show that generic closed Riemannian nn-manifolds have no nontrivial totally geodesic submanifolds, answering a question of Spivak. An immediate consequence is a severe restriction on the isometry group of a generic Riemannian metric. Both results are widely believed to be true, but we are not aware of…

2017-03-27abs ↗pdf ↗

We consider an inverse problem for a hyperbolic partial differential equation on a compact Riemannian manifold. Assuming that Γ1Γ_1 and Γ2Γ_2 are two disjoint open subsets of the boundary of the manifold we define the restricted Dirichlet-to-Neumann operator ΛΓ1,Γ2Λ_{Γ_1,Γ_2}. This operator corresponds the boundary measure…

2010-01-27abs ↗pdf ↗

New result on tensor recovery without strong assumptions.

problem Recoverability of randomly compressed tensors with low CP rank.
method Deriving restricted isometry property (R.I.P.) via set covering techniques.
result The tensor is recoverable if the number of measurements is proportional to the model parameters.

Nonnegative low-rank matrix recovery can have spurious local minima.

problem Nonnegative low-rank matrix recovery problems can have spurious local minima.
method Investigated projected gradient methods for nonnegative low-rank recovery problems.
result Benign nonconvexity holds in the fully-observed case with RIP constant δ=0 but fails in the partially-observed case and higher-rank ground truths.

Oracle inequalities and variable selection properties for the Lasso in linear models have been established under a variety of different assumptions on the design matrix. We show in this paper how the different conditions and concepts relate to each other. The restricted eigenvalue condition (Bickel et al., 2009) or the…

2009-10-05abs ↗pdf ↗

Gradient descent with specific initialization and step size achieves optimal sparse signal recovery.

problem Reconstructing a sparse signal from underdetermined linear measurements.
method Gradient descent with specific initialization, step size, and stopping time.
result Achieves the minimax rate with poly-logarithmic factors and adapts to instance difficulty.

The fused lasso is analyzed for high-dimensional piecewise-constant regression coefficients.

problem Estimation of high-dimensional piecewise-constant regression coefficients.
method Formulated a restricted isometry condition for the fused lasso estimator and derived estimation bounds.
result The estimation error can be dominated by either the lasso or the fused lasso rate, depending on the number of non-zero coefficients and piece-wise constant segments.

The paper describes distances on Sol-type groups using novel geometric techniques.

problem Understanding distances on Sol-type groups.
method New technique of Euclidean curve surgery to describe uniformly roughly geodesic paths.
result The rough isometry type of distances on Sol-type groups is determined by a specific metric restriction.

Gradient descent solves asymmetric low-rank matrix sensing without balancing.

problem Recovering asymmetric low-rank matrices from linear measurements.
method Gradient descent with spectral initialization, avoiding balancing term.
result Gradient descent converges linearly without balancing, factors stay balanced.

Paper introduces ENZ to measure significant coefficients in sparse recovery, improving over classical methods.

problem Numerical noise creates long tails of negligible coefficients in sparse recovery.
method Entropy-based notion of effective sparsity (ENZ) to measure significant coefficients, proving stability under restricted isometry condition.
result ENZ decomposes into support cardinality and efficiency factor, providing a precise measure of sparsity.

Study L2L^2-cohomology in unbounded geometry manifolds.

problem Invariance of L2L^2-cohomology under quasi-isometries on unbounded ends.
method Uniform homotopy equivalence, quasi-isometry on unbounded ends, mapping cone for L2L^2-cohomology.
result Invariance of L2L^2-cohomology groups under quasi-isometry on unbounded ends.

New rigidity results for quasi-Einstein metrics with non-zero divergence-free vector fields.

problem Classifying quasi-Einstein metrics with specific vector field properties.
method Analyzing quasi-Einstein metrics on closed manifolds and near-horizon geometries of extreme black holes.
result These metrics always admit a one-parameter group of isometries generated by the divergence-free vector field.

For two generator free Fuchsian groups, the quotient three manifold is a genus two solid handlebody and its boundary is a hyperelliptic Riemann surface. The convex core is also a hyperelliptic Riemann surface. We find the Weierstrass points of both of these surfaces. We then generalize the notion of a hyperelliptic Rie…

2005-01-21abs ↗pdf ↗

We present a theory for Euclidean dimensionality reduction with subgaussian matrices which unifies several restricted isometry property and Johnson-Lindenstrauss type results obtained earlier for specific data sets. In particular, we recover and, in several cases, improve results for sets of sparse and structured spars…

2014-02-17abs ↗pdf ↗

Paper analyzes noisy low-rank matrix optimization, improving RIP bounds and convergence rates.

problem Noisy low-rank matrix optimization with general objective functions.
method Develops new mathematical framework and proves convergence rate under RIP condition.
result Any spurious local solution is close to ground truth when RIP constant is less than 1/3.

The paper validates a method for recovering over-parameterized matrices and images from noisy measurements.

problem Recovering a low-rank matrix from noisy measurements when the rank is unknown.
method Using gradient descent with small random initialization on a nonconvex objective function built from a rank-overspecified factored representation of the matrix variable.
result Gradient descent iterations converge to the ground-truth matrix under certain conditions and can be stopped efficiently to detect a nearly optimal estimator.

We first show that the intrinsic, geometrical structure of a dynamical horizon is unique. A number of physically interesting constraints are then established on the location of trapped and marginally trapped surfaces in the vicinity of any dynamical horizon. These restrictions are used to prove several uniqueness theor…

2005-03-26abs ↗pdf ↗

New bounds on random quadratic forms hold under dependence, useful for adaptive modeling.

problem Need for independence in bounds on random quadratic forms.
method Uniform bounds on random quadratic forms of conditionally independent and sub-Gaussian stochastic processes.
result Bounds hold under general dependencies and sequential design.

The paper analyzes how good initial guesses affect the amount of data needed for low-rank matrix recovery.

problem Theoretical guarantee of local optimization algorithms requires excessive data to prevent spurious local minima.
method Quantifies the relationship between initial guess quality and sample complexity using restricted isometry constant.
result A linear improvement in initial guess quality leads to a constant factor improvement in sample complexity.