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

Trend · papers per month

122243365486 · May 202619922001200920172026
48 results for PL structure

Arguments on PL,(=piecewise linear) topology work over any ordered field in the same way as over the real field, and those on differential topology do over a real closed field R in an o-minimal structure that expands (R,<,0,1,+,cdot). One of the most fundamental properties of definable sets is that a compact definable …

2010-02-08abs ↗pdf ↗

James McClure recently showed that the domain for the intersection pairing of PL chains on a PL manifold MM is a subcomplex of C(M)C(M)C_*(M)\otimes C_*(M) that is quasi-isomorphic to C(M)C(M)C_*(M)\otimes C_*(M) and, more generally, that the intersection pairing endows C(M)C_*(M) with the structure of a partially-defined commutati…

2008-08-12abs ↗pdf ↗

New examples show non-locally-flat PL-disk bounds in rational homology balls but not in integer homology balls.

problem Characterizing knots that bound PL-disks in integer homology balls.
method Involutive Heegaard Floer homology formal properties.
result Found infinitely many manifold-knot pairs (Y, J) where J does not bound a PL-disk in an integer homology ball but does in a rational homology ball.

This paper gives a combinatorial description of spin and spin^c-structures on triangulated PL-manifolds of arbitrary dimension. These formulations of spin and spin^c-structures are established primarily for the purpose of aiding in computations. The novelty of the approach is we rely heavily on the naturality of binary…

2013-06-20abs ↗pdf ↗

R-PLS improves analysis of brain functional connectivity matrices.

problem Improving analysis of functional connectivity matrices in brain imaging.
method Introducing R-PLS, a generalization of PLS for symmetric positive definite matrices.
result R-PLS identifies key functional connections in brain imaging datasets.

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a number of known results. New results include a combinatorial characterization of c…

2012-08-30abs ↗pdf ↗

PLS-Lasso integrates dimension reduction into regression for financial index tracking.

problem Dimension reduction and regression are traditionally treated separately in multivariate data analysis.
method PLS-Lasso integrates dimension reduction directly into the regression process, presenting two formulations: PLS-Lasso-v1 and PLS-Lasso-v2.
result PLS-Lasso-v1 and PLS-Lasso-v2 outperform Lasso in financial index tracking.

PLS-SVD struggles with missing data in multimodal datasets, showing a phase transition in performance.

problem Missing data in PLS-SVD for multimodal datasets.
method Replica-symmetric analysis of spiked rectangular random matrices with missing entries.
result PLS-SVD performance transitions from uninformative to informative singular vectors at a critical signal-to-noise threshold.

Minimal crystallizations of simply connected PL 4-manifolds are very natural objects. Many of their topological features are reflected in their combinatorial structure which, in addition, is preserved under the connected sum operation. We present a minimal crystallization of the standard PL K3 surface. In combination w…

2014-07-03abs ↗pdf ↗

The paper analyzes PLS-SVD in high-dimensional data integration, revealing its strengths and limitations.

problem Understanding the behavior of PLS-SVD in high-dimensional data integration.
method Analysis using random matrix theory and singular value decomposition.
result PLS-SVD exhibits counter-intuitive or limiting behavior in certain regimes and outperforms PCA when detecting common latent subspace.

We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured triangulations or, equivalently, via crystallizations) into classes whose elements are PL-homeomorphic. The algorithm, implemented in the case n=4, succeeds to solve completely the PL-homeomorphism problem among the catalogu…

2014-08-02abs ↗pdf ↗

Suppose M is a noncompact connected PL 2-manifold. In this paper we study the topological property of the triple (H(M)_0, H^PL(M)_0, H^PL, c(M)_0), where H(M)_0 is the identity component of the homeomorphism group {\cal H}(M) of M with the compact-open topology, and H^PL(M)_0 and H^PL, c(M)_0 are the identity component…

2000-10-24abs ↗pdf ↗

Let M be a compact oriented PL manifold and let C_*M be its PL chain complex. The domain of the chain-level intersection pairing is a subcomplex G of C_*M\otimes C_*M. We prove that G is a "full" subcomplex, that is, the inclusion of G in C_*M \otimes C_*M is a quasi-isomorphism. An analogous result is true for the dom…

2004-10-20abs ↗pdf ↗

The purpose of this note is to scrutinize the proof of Burago and Zalgaller regarding the existence of PLPL isometric embeddings of PLPL compact surfaces into R3\mathbb{R}^3. We conclude that their proof does not admit a direct extension to higher dimensions. Moreover, we show that, in general, PLPL manifolds of dimens…

2010-09-29abs ↗pdf ↗

There are 2^n possible resolutions of a smooth pseudodiagram with n precrossings. If we consider piecewise-linear (PL) pseudodiagrams and resolutions that themselves are PL, certain resolutions of the pseudodiagram may not exist in three-space. We investigate this situation and its impact on the weighted resolution set…

2013-08-30abs ↗pdf ↗

Motivated by the Bagging Partial Least Squares (PLS) and Principal Component Analysis (PCA) algorithms, we propose a Principal Model Analysis (PMA) method in this paper. In the proposed PMA algorithm, the PCA and the PLS are combined. In the method, multiple PLS models are trained on sub-training sets, derived from the…

2019-02-06abs ↗pdf ↗

This study examines the relationship between PLS and OLS regression using eigenvalue distributions.

problem Analyzing the difference between PLS and OLS regression in terms of eigenvalue distributions.
method Examined the distance between PLS and OLS regression coefficients using the Mahalanobis distance and eigenvalue distributions of the regressor covariance matrix.
result Provided a bound on the distance between PLS and OLS regression coefficients that depends only on the eigenvalue distribution of the regressor covariance matrix.

Stochastic gradient methods are dominant in nonconvex optimization especially for deep models but have low asymptotical convergence due to the fixed smoothness. To address this problem, we propose a simple yet effective method for improving stochastic gradient methods named predictive local smoothness (PLS). First, we …

2018-05-23abs ↗pdf ↗

Study compact PL 4-manifolds with special handle decompositions.

problem Existence of special handlebody decompositions for simply-connected closed PL 4-manifolds.
method Investigate colored triangulations inducing handle decompositions without 1-handles or 1- and 3-handles.
result Detect a class of compact simply-connected PL 4-manifolds with empty or connected boundary that admit such decompositions.

The set consisting of all rotations of the Euclidean plane is equipped with a quandle structure. We show that a knot is colorable by this quandle if and only if its Alexander polynomial has a root on the unit circle in C\mathbb{C}. Further we enumerate all non-trivial colorings of a torus knot diagram by the quandle u…

2014-10-10abs ↗pdf ↗

The paper proves a conjecture about manifold limits and characterizes their structure.

problem Characterizing limits of manifolds with a uniform contractibility function.
method Short proof using Gromov-Hausdorff distance and ANR properties.
result Obstruction vanishes if and only if the manifold can be approximated by PL-manifolds.

The study bounds invariants of PL manifolds and counts complexity of lens spaces.

problem Bounding invariants of PL manifolds and understanding their complexity.
method Using GG-colored polyhedra and relative hyperbolization, the study constructs cobordisms with linear complexity.
result Linear bounds on Wall ρρ-invariants and Cheeger-Gromov ρρ-invariants of PL manifolds.

New method speeds up NIR spectroscopy calibration by 400x.

problem Efficient preprocessing selection in NIR spectroscopy.
method Operator-adaptive PLS and Ridge regression.
result Significant reduction in fitting time with comparable prediction quality.

We extend results of Pachner and Casali to give finite sets of moves relating triangulations of PL manifolds respecting filtrations by locally flat manifolds and stratifications in which a finite family of simple local models exists for neighborhoods of strata.

2014-04-11abs ↗pdf ↗

After surveying classical notions of PL topology of the Seventies, we clarify the relation between Morse theory and its discretization by Forman. We show that PL handles theory and discrete Morse theory are equivalent, in the sense that every discrete Morse vector on some PL triangulation is also a PL handle vector, an…

2012-12-04abs ↗pdf ↗

The study explores convex unions and completions in simplicial pseudomanifolds, revealing unexpected behavior.

problem Understanding the behavior of convex unions in simplicial pseudomanifolds.
method Generalization to simplicial pseudomanifolds, considering PL homeomorphisms and edge subdivisions.
result Unexpected behavior in convex unions and completions, including empty contraction spaces and large/small contraction spaces.

A simplified proof for embedding higher-dimensional complexes into manifolds.

problem Embedding higher-dimensional complexes into manifolds with constraints.
method A short and accessible proof for the Patak-Tancer theorem.
result A simplified proof for the Heawood inequality in higher dimensions.

This paper proposes a new algorithm for Gaussian process classification based on posterior linearisation (PL). In PL, a Gaussian approximation to the posterior density is obtained iteratively using the best possible linearisation of the conditional mean of the labels and accounting for the linearisation error. PL has s…

2018-09-13abs ↗pdf ↗