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,742 papers · 148 categories

Trend · papers per month

2468 · May 201819922001200920172026
48 results for Rip van Winkle

New estimate reduces overfitting risk in machine learning models.

problem Error rate on test data may not reflect true population error due to adaptive data analysis practices.
method Introduces Rip van Winkle's Razor, a simple estimate of overfit to test data based on information content.
result Shows non-vacuous estimate of deviation in many modern settings.

This paper classifies planar-Rips complexes and their unit disk graphs up to homotopy.

problem Classifying planar-Rips complexes and their unit disk graphs.
method Simplicial classification, homotopy equivalence, and hereditary properties.
result Classification of planar-Rips complexes and unit disk graphs up to homotopy.

Homotopy types of Vietoris-Rips metric thickenings of the circle confirmed.

problem Understanding the homotopy types of Vietoris-Rips metric thickenings of the circle.
method Finding quotients of the metric thickenings that preserve homotopy type and showing that the quotient spaces can be described as CW complexes.
result The Vietoris-Rips metric thickenings of the circle are homotopy equivalent to odd-dimensional spheres at the expected scale parameters.

Generalizes Rips' result on hyperbolic spaces to metric spaces, showing collapses for tree metrics.

problem Understanding the contractibility of Vietoris-Rips complexes in metric spaces.
method Extending Rips' result using geodesic defect and apparent pairs gradient.
result Vietoris-Rips complexes collapse to subforests for finite tree metrics.

The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for computationally efficient recovery methods. As a consequence, even though it is in …

2016-05-31abs ↗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.

Fix a finite set of points in Euclidean nn-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an easily-computed but high-dimensional approximation to the homotopy type of DD. …

2007-12-03abs ↗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.

This paper interprets critical scales in persistent homology for compact metric spaces.

problem Understanding critical scales in persistent homology for general compact metric spaces.
method Analyzing local minima of the distance function and their impact on persistence.
result Each decrease in zero-dimensional persistence and increase in one-dimensional persistence is induced by local minima of the distance function.

MuRiT efficiently computes multi-parameter persistence barcodes.

problem Efficient computation of multi-parameter persistent homology.
method Vietoris-Rips transformation to reduce multi-parameter to single-parameter computation.
result MuRiT computes pathwise persistence barcodes for multi-filtered flag complexes.

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 ↗

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.

Using ideas of the Dowker duality we prove that the Rips complex at scale rr is homotopy equivalent to the nerve of a cover consisting of sets of prescribed diameter. We then develop a functorial version of the Nerve theorem coupled with the Dowker duality, which is presented as a Functorial Dowker-Nerve Diagram. Thes…

2019-06-10abs ↗pdf ↗

Persistent homology has emerged as a novel tool for data analysis in the past two decades. However, there are still very few shapes or even manifolds whose persistent homology barcodes (say of the Vietoris-Rips complex) are fully known. Towards this direction, let PnP_n be the boundary of a regular polygon in the plane…

2018-07-28abs ↗pdf ↗

Given a compact geodesic space XX we apply the fundamental group and alternatively the first homology group functor to the corresponding Rips or Čech filtration of XX to obtain what we call a persistence. This paper contains the theory describing such persistence: properties of the set of critical points, their preci…

2017-09-15abs ↗pdf ↗

The classical Van Est theory relates the smooth cohomology of Lie groups with the cohomology of the associated Lie algebra, or its relative versions. Some aspects of this theory generalize to Lie groupoids and their Lie algebroids. In this paper, continuing an idea from [18], we revisit the van Est theory using the Per…

2019-06-05abs ↗pdf ↗

We construct a compact subset K of the four dimensional Euclidean space with the following property: For all values of the parameter in an interval, the Vietoris-Rips complex of K has uncountably generated first homology. This answers a question that arose in work on persistent homology.

2012-10-15abs ↗pdf ↗

We study isometric actions of finitely presented groups on R\mathbb{R}-trees. In this paper, we develop a relative version of the Rips machine to study pairs\textit{pairs} of such actions. An important example of a pair\textit{pair} is a group action on an R\mathbb{R}-tree and a subgroup action on its minimal invariant su…

2016-12-23abs ↗pdf ↗

Let GG be a group acting properly and by isometries on a metric space XX; it follows that the quotient or orbit space X/GX/G is also a metric space. We study the Vietoris-Rips and Čech complexes of X/GX/G. Whereas (co)homology theories for metric spaces let the scale parameter of a Vietoris-Rips or Čech complex go to z…

2019-11-02abs ↗pdf ↗

Recently, Rips produced an example of a double of two free groups which has unsolvable generalized word problem. In this paper, we show that Rips's example fits into a large class of doubles of groups, each member of which contains F_2 x F_2 and therefore has unsolvable generalized word problem and is incoherent.

1998-09-23abs ↗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.

The paper connects geometric and topological concepts to bound distances between metric spaces.

problem Bounding distances between metric spaces using Gromov-Hausdorff distance.
method Using Borsuk-Ulam theorems and Vietoris-Rips complexes, the paper obstructs the existence of certain continuous maps between complexes to bound discontinuities of functions.
result The paper provides new bounds on Gromov-Hausdorff distances between spheres of different dimensions.

Match van Stockum dust to vacuum metrics with a single parameter.

problem Matching van Stockum dust to vacuum metrics.
method 1-parametric family of non-static Papapetrou vacuum metrics, Ehlers and Kramer--Neugebauer transformations.
result Explicit examples of matching, including Bonnor metric and Lanczos--van Stockum dust metric.

We inspect Vietoris-Rips complexes VRt(X)VR_t(X) of certain metric spaces XX using a new generalization of Bestvina-Brady discrete Morse theory. Our main result is a pair of metric criteria on XX, called the Morse Criterion and Link Criterion, that allow us to deduce information about the homotopy types of certain $VR_t(…

2018-12-28abs ↗pdf ↗

The Van Est homomorphism for a Lie groupoid GMG \rightrightarrows M, as introduced by Weinstein-Xu, is a cochain map from the complex C(BG)C^\infty(BG) of groupoid cochains to the Chevalley-Eilenberg complex C(A)C(A) of the Lie algebroid AA of GG. It was generalized by Weinstein, Mehta, and Abad-Crainic to a morphism from…

2014-03-05abs ↗pdf ↗

Two groups with same profinite completion have different co-Hopfian properties.

problem Understanding co-Hopfian properties in residually finite groups.
method Using a specific construction involving a finitely presented acyclic group with trivial profinite completion.
result Found two groups with same profinite completion but different co-Hopfian properties.

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 ↗

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.

Given a sample of points XX in a metric space MM and a scale r>0r>0, the Vietoris-Rips simplicial complex VR(X;r)\mathrm{VR}(X;r) is a standard construction to attempt to recover MM from XX up to homotopy type. A deficiency of this approach is that VR(X;r)\mathrm{VR}(X;r) is not metrizable if it is not locally finite, and thu…

2017-06-15abs ↗pdf ↗

The paper derives Gauss-Bonnet theorems for deformed connections in affine and rigid motions groups.

problem Computing curvature and geodesic curvature for surfaces and curves in affine and rigid motions groups.
method Defined deformed Schouten-Van Kampen connections, computed Gaussian curvature limits, and signed geodesic curvature.
result Derived Gauss-Bonnet theorems for deformed connections in affine and rigid motions groups.

We exhibit relations between van Kampen-Flores, Conway-Gordon-Sachs and Radon theorems, by presenting direct proofs of some implications between them. The key idea is an interesting relation between the van Kampen and the Conway-Gordon-Sachs numbers for restrictions of a map of (d+2)(d+2)-simplex to Rd\mathbb R^d to the $…

2017-04-02abs ↗pdf ↗

VB-groupoids define a special class of Lie groupoids which carry a compatible linear structure. In this paper, we show that their differentiable cohomology admits a refinement by considering the complex of cochains which are k-homogeneous on the linear fiber. Our main result is a Van Est theorem for such cochains. We a…

2016-02-22abs ↗pdf ↗

Researchers decompose Forman-Ricci curvature for efficient computation in VR complexes.

problem Efficiently computing Forman-Ricci curvature in higher-dimensional data.
method Decomposition and set-theoretical proof for local computation of FRC in VR complexes.
result Reveals critical geometric insights overlooked by conventional techniques.

In "Rips complexes and covers in the uniform category" \cite{Rips} the authors define, following James \cite{J}, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of universal uniform covering maps and generalized uniform covering maps are given…

2010-08-02abs ↗pdf ↗