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

Trend · papers per month

66133199265 · May 202619922001200920172026
48 results for local PL criterion

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 ↗

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 ↗

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.

Study introduces combinatorial criterion for quasi-isometry groups of Euclidean spaces.

problem Determining quasi-isometries of Euclidean spaces.
method Introduces PLδPL_δ-homeomorphisms and combinatorial criterion using vertices and edges of simplicial structures.
result The center of the quasi-isometry group QI(Rn)QI(\mathbb{R}^n) is trivial.

We show that there exist non-trivial piecewise-linear (PL) knots with isolated singularities Sn2SnS^{n-2}\subset S^n, n5n\geq 5, whose complements have the homotopy type of a circle. This is in contrast to the case of smooth, PL locally-flat, and topological locally-flat knots, for which it is known that if the complement…

2004-08-24abs ↗pdf ↗

We generalize the classical study of Alexander polynomials of smooth or PL locally-flat knots to PL knots that are not necessarily locally-flat. We introduce three families of generalized Alexander polynomials and study their properties. For knots with point singularities, we obtain a classification of these polynomial…

2003-07-24abs ↗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 ↗

This is a survey on known results and open problems about Smooth and PL-Rigidity Problem for negatively curved locally symmetric spaces. We also review some developments about studying the basic topological properties of the space of negatively curved Riemannian metrics and the Teichmuller space of negatively curved me…

2015-10-11abs ↗pdf ↗

Pseudo-label selection affects semi-supervised learning performance.

problem Selection of pseudo-labeled data impacts semi-supervised learning's generalization performance.
method Embedding pseudo-label selection into decision theory, deriving a novel selection criterion based on posterior predictive.
result BPLS (Bayesian pseudo-label selection) outperforms traditional methods in overfitting-prone data.

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.

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 ↗

SGD and stochastic gradient descent converge at optimal rates for certain non-convex functions.

problem Optimal convergence rates for non-convex functions under gradient noise.
method Geometric interpretation of the PL-condition to analyze convergence rates.
result Convergence rates of SGD and stochastic gradient descent match those of strongly convex quadratics.

The classical knot groups are the fundamental groups of the complements of smooth or piecewise-linear (PL) locally-flat knots. For PL knots that are not locally-flat, there is a pair of interesting groups to study: the fundamental group of the knot complement and that of the complement of the ``boundary knot'' that occ…

2004-04-06abs ↗pdf ↗

Gradient descent converges linearly in finite-width networks with positive NTK and compatible conditions.

problem Local convergence of gradient descent in finite-width networks.
method Positive Neural Tangent Kernel (NTK), local Polyak-Łojasiewicz inequality, fixed-step containment in Locally Quasi-Convex Region (LQCR).
result Linear convergence achieved under specific conditions.

We generalize the PL intersection product for chains on PL manifolds and for intersection chains on PL stratified pseudomanifolds to products of locally finite chains on non-compact spaces that are natural with respect to restriction to open sets. This is necessary to sheafify the intersection product, an essential ste…

2016-09-20abs ↗pdf ↗

By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical Alexander polynomial invariants for smooth or PL locally-flat knots. We show that the i…

2003-07-10abs ↗pdf ↗

For a given polyhedron KMK\subset M the notation RM(K)R_M(K) denotes a regular neighborhood of KK in MM. We study the following problem: find all pairs (m,k)(m,k) such that if KK is a compact kk-polyhedron and MM a PL mm-manifold, then RM(fK)RM(gK)R_M(fK)\cong R_M(gK), for each two homotopic PL embeddings f,g:KMf,g:K\to M. We prove …

2006-08-27abs ↗pdf ↗

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the union of two PL collapsible subpolyhedra in terms of their simple homotopy type and…

2018-02-05abs ↗pdf ↗

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.

New analysis shows GMD can converge linearly under PL-like conditions.

problem Establishing linear convergence for generalized mirror descent.
method PL-based analysis for time-dependent mirrors, Taylor-series approach for stochastic GMD.
result Linear convergence of stochastic GMD under PL-like conditions.

Solves linearity problem for acyclic groups, bounds Cheeger-Gromov ρ-invariants.

problem Linearity problem for acyclic groups and Cheeger-Gromov ρ-invariants.
method Quantitative algebraic and geometric techniques over simplicial classifying spaces.
result Universal linear bound for Cheeger-Gromov ρ-invariants of PL (4k-1)-manifolds.

We provide new branched covering representations for bounded and/or non-compact 4-manifolds, which extend the known ones for closed 4-manifolds. Assuming MM to be a connected oriented PL 4-manifold, our main results are the following: (1) if MM is compact with (possibly empty) boundary, there exists a simple branched…

2016-02-24abs ↗pdf ↗

The paper extends Thurston's method to new variants of Mather-Thurston theorem.

problem Proving new variants of Mather-Thurston theorem for PL homeomorphisms and contactomorphisms.
method Generalizing Thurston's technique to prove new variants of Mather-Thurston theorem for PL homeomorphisms and contactomorphisms.
result The paper answers questions posed by Gelfand-Fuks and Greenberg on PL foliations and Rybicki on contactomorphisms.

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.

This work proposes a mathematical framework for loss landscapes and optimization in deep neural networks.

problem The effectiveness of gradient-based optimization in over-parameterized neural networks.
method A modern view and mathematical framework of loss landscapes and efficient optimization in over-parameterized machine learning models.
result Wide neural networks satisfy the PL^* condition, explaining (S)GD convergence to a global minimum.

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 ↗

Given a piecewise linear (PL) function pp defined on an open subset of Rn\R^n, one may construct by elementary means a unique polyhedron with multiplicities $\D(p)$ in the cotangent bundle Rn×Rn\R^n\times \R^{n*} representing the graph of the differential of pp. Restricting to dimension 2, we show that any smooth functi…

2013-05-09abs ↗pdf ↗

Functional PLS improves prediction and inference for scalar responses from functional predictors.

problem Estimating scalar responses from functional predictors in an ill-posed inverse problem.
method Functional partial least squares (PLS) estimator with adaptive early stopping and new tests.
result PLS attains nearly minimax-optimal convergence rates and detects local alternatives.

There have been different strategies to improve the performance of a machine learning model, e.g., increasing the depth, width, and/or nonlinearity of the model, and using ensemble learning to aggregate multiple base/weak learners in parallel or in series. This paper proposes a novel strategy called patch learning (PL)…

2019-06-01abs ↗pdf ↗

We introduce a combinatorial curvature flow for PL metrics on compact triangulated 3-manifolds with boundary consisting of surfaces of negative Euler characteristic. The flow tends to find the complete hyperbolic metric with totally geodesic boundary on a manifold. Some of the basic properties of the combinatorial flow…

2004-05-14abs ↗pdf ↗

We study the renormalized volume of asymptotically hyperbolic Einstein (AHE in short) manifolds (M,g)(M,g) when the conformal boundary $\pl M$ has dimension nn even. Its definition depends on the choice of metric h0h_0 on M\partial M in the conformal class at infinity determined by gg, we denote it by ${\rm Vol}_R(M,g;…

2012-11-28abs ↗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 ↗

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.

A method for selecting pseudo-labeled data in semi-supervised learning using generalized Bayes and soft revision.

problem Selecting pseudo-labeled data for semi-supervised learning with robustness to uncertainty.
method Using credal sets and the Gamma-Maximin method with soft revision to update priors and select pseudo-labeled data.
result The Gamma-Maximin method with soft revision can achieve promising results, especially in scenarios with low labeled data proportions.