Gradient descent converges linearly for neural networks with specific conditions.
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.
Trend · papers per month
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 …
Bayesian Pseudo Label Selection reduces overfitting in semi-supervised learning.
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.
New examples show non-locally-flat PL-disk bounds in rational homology balls but not in integer homology balls.
Study introduces combinatorial criterion for quasi-isometry groups of Euclidean spaces.
We show that there exist non-trivial piecewise-linear (PL) knots with isolated singularities , , 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…
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…
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…
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…
Pseudo-label selection affects semi-supervised learning performance.
The study explores convex unions and completions in simplicial pseudomanifolds, revealing unexpected behavior.
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…
SGD and stochastic gradient descent converge at optimal rates for certain non-convex functions.
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…
Gradient descent converges linearly in finite-width networks with positive NTK and compatible 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…
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…
For a given polyhedron the notation denotes a regular neighborhood of in . We study the following problem: find all pairs such that if is a compact -polyhedron and a PL -manifold, then , for each two homotopic PL embeddings . We prove …
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…
New method speeds up NIR spectroscopy calibration by 400x.
New analysis shows GMD can converge linearly under PL-like conditions.
The paper classifies certain PL manifolds using PL cobordism.
Solves linearity problem for acyclic groups, bounds Cheeger-Gromov ρ-invariants.
We provide new branched covering representations for bounded and/or non-compact 4-manifolds, which extend the known ones for closed 4-manifolds. Assuming to be a connected oriented PL 4-manifold, our main results are the following: (1) if is compact with (possibly empty) boundary, there exists a simple branched…
The paper extends Thurston's method to new variants of Mather-Thurston theorem.
PLS-Lasso integrates dimension reduction into regression for financial index tracking.
We show the rigidity of the hexagonal Delaunay triangulated plane under Luo's PL conformality. As a consequence, we obtain a rigidity theorem for a particular type of locally finite convex ideal hyperbolic polyhedra.
Proves PL cobordism category's homotopy type, analogous to smooth case.
This work proposes a mathematical framework for loss landscapes and optimization in deep neural networks.
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…
Paper confirms conjecture for PL foliations of codimension 2.
Given a piecewise linear (PL) function defined on an open subset of , one may construct by elementary means a unique polyhedron with multiplicities $\D(p)$ in the cotangent bundle representing the graph of the differential of . Restricting to dimension 2, we show that any smooth functi…
Functional PLS improves prediction and inference for scalar responses from functional predictors.
New proof of link factorization theorem, avoiding case exhaustion.
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)…
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…
We study the renormalized volume of asymptotically hyperbolic Einstein (AHE in short) manifolds when the conformal boundary $\pl M$ has dimension even. Its definition depends on the choice of metric on in the conformal class at infinity determined by , we denote it by ${\rm Vol}_R(M,g;…
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…
It is shown that if a real value PL-invariant of closed combinatorial manifolds admits a local formula that depends only on the f-vector of the link of each vertex, then the invariant must be a constant times the Euler characteristic.
High-dimensional data common in genomics, proteomics, and chemometrics often contains complicated correlation structures. Recently, partial least squares (PLS) and Sparse PLS methods have gained attention in these areas as dimension reduction techniques in the context of supervised data analysis. We introduce a framewo…
Finite type invariants separate PL links in 3D space.
The purpose of this note is to scrutinize the proof of Burago and Zalgaller regarding the existence of isometric embeddings of compact surfaces into . We conclude that their proof does not admit a direct extension to higher dimensions. Moreover, we show that, in general, manifolds of dimens…
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…
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…
This study examines the relationship between PLS and OLS regression using eigenvalue distributions.
A method for selecting pseudo-labeled data in semi-supervised learning using generalized Bayes and soft revision.
A new method for fair representation learning using PLS.