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

23456890 · May 202619922001200920172026
48 results for proxy PL inequality

Unified framework for analyzing neural networks trained by gradient descent.

problem Lack of generalizable guarantees for neural networks trained by gradient descent.
method Proxy convexity and proxy Polyak-Lojasiewicz inequalities.
result Unified guarantees for neural networks trained by gradient descent.

This paper proves AdaGrad and Adam converge linearly under PL inequality.

problem Understanding the convergence of adaptive gradient methods.
method Unified approach proving AdaGrad and Adam converge linearly under PL inequality.
result AdaGrad and Adam converge linearly when the cost function is smooth and satisfies PL inequality.

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.

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.

Study on Wasserstein gradient flow for MMD between Coulomb measures.

problem Analyzing the long-time behavior of MMD between probability and target measures using Coulomb kernels.
method Existence of global weak solutions, ultracontractive estimate, regularity analysis, exponential decay proof, defective Polyak-Lojasiewicz inequality.
result Exponential decay of squared MMD toward a uniformly positive target measure on flat torus.

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.

Quantized Stochastic Primal-Dual Methods for Distributed Optimization

problem Distributed optimization with stochastic gradients and finite-bit communication
method q-PDGD, a quantized stochastic primal-dual method
result Linear contraction to an explicit neighborhood under RSI, O(1/k) convergence under PL inequality

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.

Using polar convex bodies and the C0C_0-bounds from Guan and Ni \cite{PL}, we obtain a uniform lower bound on the Gauss curvature of the normalized solution of the Gauss curvature flow without using Chow's Harnack inequality \cite{Ch2}.

2014-09-09abs ↗pdf ↗

The study examines how gamma positivity and PL homeomorphism types affect simplicial spheres.

problem Understanding gamma positivity and its relation to PL homeomorphism types in simplicial spheres.
method Using edge contractions and the link condition as proxies for flagness, the study analyzes the effect of gamma positivity on simplicial spheres.
result The link condition has a trivial effect on gamma vectors of high-dimensional simplicial spheres with nonnegative gamma vectors.

Predictive analytics is increasingly used to guide decision-making in many applications. However, in practice, we often have limited data on the true predictive task of interest, and must instead rely on more abundant data on a closely-related proxy predictive task. For example, e-commerce platforms use abundant custom…

2018-12-28abs ↗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.

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 ↗

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 ↗

Algorithm identifies spheres with maximal Buchstaber number.

problem Characterizing (n1)(n-1)-dimensional PL spheres with specific vertex counts.
method Computational algorithm for weak pseudo-manifolds, toric colorable seeds enumeration.
result Comprehensive characterization of (n1)(n-1)-spheres with maximal Buchstaber number.

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.

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 ↗

Study PL topology theorems for cubical complexes, solving Habegger and Funar's conjecture.

problem Characterize PL homeomorphic cubulations equivalence by Pachner moves.
method Show equivalence to the existence of cobordisms between generic immersions of hypersurfaces.
result Solve Habegger and Funar's conjecture about PL homeomorphic cubulations equivalence.

We prove that the norm version of the adaptive stochastic gradient method (AdaGrad-Norm) achieves a linear convergence rate for a subset of either strongly convex functions or non-convex functions that satisfy the Polyak Lojasiewicz (PL) inequality. The paper introduces the notion of Restricted Uniform Inequality of Gr…

2019-08-28abs ↗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 ↗

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.

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 ↗

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 ↗

PL-MCMC samples from normalizing flows' conditional distributions.

problem Sampling from complex conditional distributions learned by normalizing flows.
method Metropolis-Hastings implementation of PL-MCMC.
result PL-MCMC asymptotically samples from exact conditional distributions.

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.

Let M be a PL 2-manifold and X be a compact subpolyhedron of M and let E(X, M) denote the space of embeddings of X into M with the compact-open topology. In this paper we study an extension property of embeddings of X into M and show that the restriction map from the homeomorphism group of M to E(X, M) is a principal b…

2000-10-24abs ↗pdf ↗