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

62124186248 · Jun 202019922001200920172026
48 results for regularized Laplacian

This paper uses the technology of weighted and regular triangulations to study discrete versions of the Laplacian on piecewise Euclidean manifolds. Regular triangulations are studied in some detail, including flip algorithms. The Laplacian is then studied as an operator on functions of the vertices as a generalized wei…

2005-08-10abs ↗pdf ↗

Propagation-regularization improves GNN performance by infusing extra graph information.

problem The effectiveness of graph Laplacian regularization in GNNs is questioned and improved upon.
method Introducing Propagation-regularization (P-reg) to enhance GNN performance.
result P-reg boosts GNN performance on various tasks across multiple datasets.

The p-Laplacian Transformer improves transformer models by assigning higher attention weights to tokens in close proximity.

problem The self-attention mechanism in transformers does not effectively distinguish attention weights between tokens in close and non-close proximity.
method Proposes a novel class of transformers, p-Laplacian Transformers, that use pp-Laplacian regularization to assign higher attention weights to tokens in close proximity.
result Empirically demonstrates that p-Laplacian Transformers outperform baseline transformers on various benchmark datasets.

Dual regularized graph Laplacian improves spectral clustering for community detection.

problem Detecting clusters in networks with improved spectral clustering methods.
method Proposes dual regularized graph Laplacian for three spectral clustering approaches.
result Theoretical analysis shows DRSC and DRSLIM yield stable consistent community detection.

Method estimates multiple related Gaussian distributions using Laplacian regularization.

problem Jointly estimate multiple related zero-mean Gaussian distributions.
method Laplacian regularized stratified model fitting with hyper-parameters to encourage covariance closeness.
result The method performs well, especially in low data regimes, as demonstrated in finance, radar, and weather.

This paper tackles the curse of dimensionality in semi-supervised learning using Laplacian regularization.

problem The curse of dimensionality in semi-supervised learning with Laplacian regularization.
method Statistical analysis and spectral filtering methods using kernel methods.
result The paper provides a method to overcome the curse of dimensionality in semi-supervised learning.

Study pseudo-laplacians and ζ(1) for spinor bundles over Riemann surfaces.

problem Analyzing self-adjoint extensions of Dolbeault Laplacians on Riemann surfaces.
method Defined ζζ-regularized determinants, introduced Robin mass, derived comparison formulas.
result Explicit expressions for Robin mass in spinor bundles and scalar cases.

The paper proves new comparison theorems for sub-Laplacian in foliations with minimal leaves.

problem Proving comparison theorems for sub-Laplacian in Riemannian foliations with minimal leaves.
method Using Riemannian foliations with minimal leaves, the paper proves comparison theorems for the sub-Laplacian.
result The comparison theorems yield a Bonnet-Myers type theorem, stochastic completeness, and Lipschitz regularization property for the sub-Riemannian semigroup.

The paper proves Lipschitz regularity of graph Laplacian eigenvectors on random data clouds.

problem Analyzing the regularity of solutions to graph Laplacian equations on random data points.
method Probabilistic coupling of random walks and interpolation method for point clouds to continuum.
result Graph Laplacian eigenvectors are essentially Lipschitz with constants depending on eigenvalues.

Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick \emph{approximation} to the first nontrivial eigenvector of a data graph Laplacian \emph{exactly} solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistica…

2011-10-08abs ↗pdf ↗

This paper presents a bias-variance tradeoff of graph Laplacian regularizer, which is widely used in graph signal processing and semi-supervised learning tasks. The scaling law of the optimal regularization parameter is specified in terms of the spectral graph properties and a novel signal-to-noise ratio parameter, whi…

2017-06-02abs ↗pdf ↗

Stratified models depend in an arbitrary way on a selected categorical feature that takes KK values, and depend linearly on the other nn features. Laplacian regularization with respect to a graph on the feature values can greatly improve the performance of a stratified model, especially in the low-data regime. A sign…

2020-01-27abs ↗pdf ↗

Universal inequalities for Laplacian eigenvalues on discrete groups.

problem Proving inequalities for Laplacian eigenvalues on discrete groups.
method Analyzing Laplacian eigenvalues with Dirichlet boundary conditions on subsets of discrete groups.
result Yang-type universal inequalities for Cayley graphs of amenable groups and the d-regular tree.

Developed a framework for designing filters in spectral GCNNs with improved performance.

problem Designing effective filters for spectral GCNNs with regularization properties.
method Exploring regularization properties of graph Laplacian and proposing a generalized framework for filter design.
result New filters derived from the framework outperform state-of-the-art techniques in semi-supervised node classification.

The paper develops bounds and regularity for minimal boundaries in non-smooth spaces with Ricci curvature.

problem Minimal boundaries in non-smooth spaces with Ricci curvature.
method Intrinsic theory of Laplacian bounds, PDE principle, sharp Laplacian bounds on distance function, regularity theory for perimeter-minimizing boundaries.
result Sharp Laplacian bounds and regularity results for perimeter-minimizing boundaries.

S2MAM improves semi-supervised learning by selecting relevant variables and updating similarity metrics.

problem Joint learning from labeled and unlabeled data with geometric structure.
method Bilevel optimization scheme for automatic variable selection and similarity matrix update.
result The proposed S2MAM achieves robust and interpretable predictions.

In this paper we continue the study of spectral properties of Laplacians associated with an arbitrary smooth distribution on a compact manifold, initiated in a previous paper. Under assumption that the singular foliation generated by the distribution is smooth, we prove that the Laplacian associated with the distributi…

2017-10-27abs ↗pdf ↗

Sub-Riemannian Selberg trace formulae for compact quotients of SL(2, R)

problem Computing zeta-regularized determinants of sub-Laplacians
method Using Fourier decomposition and Selberg trace formulae
result Compact determinant formula expressed in terms of base hyperbolic surface and relative Selberg product

We propose a new approach, multi-view Laplacian support vector machines (SVMs), for semi-supervised learning under the multi-view scenario. It integrates manifold regularization and multi-view regularization into the usual formulation of SVMs and is a natural extension of SVMs from supervised learning to multi-view sem…

2013-07-26abs ↗pdf ↗

The paper studies the zeta-regularized determinant of a pseudo-Laplacian on a cuspidal end with flat unitary line bundle.

problem Analyzing the asymptotic behavior of the zeta-regularized determinant of a pseudo-Laplacian.
method Investigates the asymptotic behavior of the zeta-regularized determinant of a pseudo-Laplacian ΔL,0+μΔ_{L,0} + μ as μμ and aa vary.
result Determines the asymptotic behavior of the zeta-regularized determinant for various values of μμ and aa.

The paper calculates determinants for Laplacians on spinor bundles over surfaces with flat metrics.

problem Calculating determinants for Laplacians on spinor bundles over surfaces with flat metrics.
method Explicit expressions for determinants of self-adjoint extensions of Laplacians using Bergman tau-function and theta-constants.
result An explicit expression for the determinant of the Szegö extension and comparison formulas for different extensions.

New regularization techniques improve stability of deep neural networks.

problem Improving stability of deep neural networks in high-dimensional data.
method Apply manifold regularization to develop new regularizers based on graph Laplacian sparsification.
result Empirically, networks achieve high stability in various perturbation models, including adversarial attacks.

We prove a general essential self-adjointness criterion for sub-Laplacians on complete sub-Riemannian manifolds, defined with respect to singular measures. As a consequence, we show that the intrinsic sub-Laplacian (i.e. defined w.r.t. Popp's measure) is essentially self-adjoint on the equiregular connected components …

2017-08-31abs ↗pdf ↗

We study eigenvalue problems for intrinsic sub-Laplacians on regular sub-Riemannian manifolds. We prove upper bounds for sub-Laplacian eigenvalues λkλ_k of conformal sub-Riemannian metrics that are asymptotically sharp as k+k\to +\infty. For Sasakian manifolds with a lower Ricci curvature bound, and more generally, for…

2014-07-01abs ↗pdf ↗

It is shown that in a tower of coverings the regularized determinant of a generalized Laplacian converges to the L2L^2-determinant. This shows generic nontriviality of analytic torsion or regularized determinants since the L2L^2-counterparts are easier to compute. We further have an "Euler product expansion" for regula…

1995-11-23abs ↗pdf ↗

The paper studies the zeta-regularized determinant of a pseudo-Laplacian on a cuspidal end with specific boundary conditions.

problem Analyzing the asymptotic behavior of a zeta-regularized determinant on a cuspidal end.
method Specifying and analyzing the behavior of the pseudo-Laplacian with Alvarez--Wentworth boundary conditions.
result Finding the asymptotic behavior of the zeta-regularized determinant for various parameter values.

Study shows exponential growth of Laplacian determinant on random hyperbolic surfaces.

problem Understanding the behavior of Laplacian determinants on random hyperbolic surfaces.
method Investigated various models of random hyperbolic surfaces and their Laplacian determinants as genus increases.
result For all popular models, the determinant grows exponentially with a universal exponent as the genus goes to infinity.