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.

169,042 papers · 148 categories

Trend · papers per month

10192938 · May 202619922001200920172026
48 results for Laplacian sharpening

Paper proposes a method to reduce hallucinations in diffusion models using Laplacian score sharpening.

problem Hallucinations in diffusion models create incoherent or unrealistic samples.
method Post-hoc adjustment to the score function during inference using Laplacian approximation.
result Significantly reduces the rate of hallucinated samples across various data types.

Proposes a symmetric graph autoencoder for unsupervised learning.

problem Graph representation learning without labeled data.
method Symmetric graph convolutional autoencoder with Laplacian sharpening and signed graphs.
result Outperforms state-of-the-art algorithms in clustering, link prediction, and visualization tasks.

SpecAE detects anomalies in attributed networks by projecting them into a tailored space.

problem Detecting anomalies in attributed networks with complex dependencies and nodal attributes.
method Spectral convolution and deconvolution framework, leveraging Laplacian sharpening and density estimation.
result SpecAE effectively detects global and community anomalies in attributed networks.

Proposes a flexible deep learning model for complex distributions.

problem Complex shapes, strong skews, and multiple modes in output variable distributions.
method Uncountable Mixture of Asymmetric Laplacians (UMAL) deep learning framework.
result UMAL can estimate heterogeneous distributions without strong assumptions.

Study inverse problems with measure samples, improving estimator calibration and recovery.

problem Inverse problems with unknown potentials observed through measure samples.
method Introduced convex empirical objectives and sharpened Fenchel--Young losses for finite-dimensional potential classes.
result High-probability parameter recovery bounds for inverse entropic unbalanced optimal transport and inverse JKO learning.

Graph convolutions can enhance high frequencies, leading to over-sharpening.

problem Graph convolutions suffer from over-smoothing and poor performance on heterophilic graphs.
method Rigorously prove that linear graph convolutions minimize a generalized Dirichlet energy, showing that weight matrices induce edge-wise attraction or repulsion.
result Graph convolutions can enhance high frequencies, leading to over-sharpening instead of over-smoothing.

New theorem shows curvature concentration depends linearly on volume ratio.

problem Gap theorem for nonnegative Ricci curvature manifolds with small curvature concentration.
method Exhibited Ricci flow solution with faster than 1/t curvature decay.
result Curvature concentration depends linearly on asymptotic volume ratio.

Detecting edge correlation between two graphs sharpens a threshold based on densest subgraph.

problem Detecting edge correlation between two Erdős-Rényi graphs.
method Formulated as a hypothesis testing problem, connecting to densest subgraph detection.
result Sharp information-theoretic threshold established for edge correlation detection.

We study the Gassner representation of the pure braid group PnP_n by considering its restriction to a free subgroup FF. The kernel of the restriction is shown to lie in the subgroup [Γ3F,Γ2F][Γ^3 F,Γ^2 F], sharpening a result of Lipschutz.

2004-03-26abs ↗pdf ↗

We give tight concentration bounds for mixtures of martingales that are simultaneously uniform over (a) mixture distributions, in a PAC-Bayes sense; and (b) all finite times. These bounds are proved in terms of the martingale variance, extending classical Bernstein inequalities, and sharpening and simplifying prior wor…

2015-06-22abs ↗pdf ↗

We sharpen the construction of representation space in the paper "Principal Series Representations of Infinite Dimensional Lie Groups II: Construction of Induced Representations". We show that the principal series representation spaces constructed there, are completions of spaces of sections of Hilbert bundles rather t…

2012-10-19abs ↗pdf ↗

We give a new lower bound for the first gap λ2λ1λ_2 - λ_1 of the Dirichlet eigenvalues of the Schr{ö}dinger operator on a bounded convex domain ΩΩ in Rn^n or Sn^n and greatly sharpens the previous estimates. The new bound is explicit and computable.

2004-04-22abs ↗pdf ↗

The paper develops L2L^2-Hodge theory on almost Kähler manifolds and proves the Hopf conjecture.

problem Proving the Hopf conjecture for almost Kähler manifolds.
method Developed L2L^2-Hodge theory identities and applied them to prove vanishing theorems and refine estimates.
result Proved the Hopf conjecture for compact almost Kähler manifolds with negative sectional curvature.

Cohen et al. (2021) show GD trajectories align on a bifurcation diagram.

problem Understanding the Edge of Stability (EoS) phenomenon in gradient descent.
method Empirical studies and rigorous mathematical proofs for two-layer networks and single-neuron networks.
result GD trajectories align on a specific bifurcation diagram independent of initialization.

We further sharpen higher type adjunction inequalities of P. Ozsváth and Z. Szabó on a 4-manifold MM with a nonzero Seiberg-Witten invariant for a Spinc^c structure s\frak{s}, when an embedded surface ΣMΣ\subset M satisfies [Σ][Σ]0[Σ]\cdot [Σ]\geq 0 and [Σ],c1(s)+[Σ][Σ]2b1(M).|\langle [Σ],c_1(\frak{s})\rangle|+[Σ]\cdot [Σ]\geq 2b_1(M).

2014-06-17abs ↗pdf ↗

Improved Metropolized HMC mixing time with multi-step gradients.

problem Improving the efficiency of sampling from complex probability distributions.
method Analyzing Metropolized HMC with multi-step integrators and applying sharpening techniques.
result Non-asymptotic upper bound on mixing time for Metropolized HMC with explicit step-size and leapfrog steps.

Adversarial training makes logistic regression weight loss landscapes sharper.

problem Understanding why adversarial training sharpens the weight loss landscape in logistic regression.
method Theoretical analysis of linear logistic regression model with L2 norm constraints, and experiments on ResNet18.
result Adversarial training sharpens the weight loss landscape in linear logistic regression models.

Colding and Minicozzi have shown that an embedded minimal disk 0ΣBR0\inΣ\subset B_R in $\Real^3$ with large curvature at 0 looks like a helicoid on the scale of RR. Near 0, this can be sharpened: on the scale of A1(0)|A|^{-1}(0), ΣΣ is close, in a Lipschitz sense, to a piece of a helicoid. We use surfaces constructed by C…

2008-05-30abs ↗pdf ↗

NM-PPG optimizes adaptive feature acquisition in POMDPs for better predictions.

problem Optimizing adaptive feature acquisition in prediction problems with costly features.
method Non-myopic pathwise policy gradients (NM-PPG) with continuous relaxation and straight-through rollout.
result NM-PPG outperforms state-of-the-art AFA methods on synthetic and real-world datasets.

Given a data matrix XRn×dX \in R^{n\times d} and a response vector yRny \in R^{n}, suppose n>dn>d, it costs O(nd2)O(n d^2) time and O(nd)O(n d) space to solve the least squares regression (LSR) problem. When nn and dd are both large, exactly solving the LSR problem is very expensive. When ndn \gg d, one feasible approach to spee…

2014-03-30abs ↗pdf ↗

The study analyzes sharpness dynamics in neural networks, revealing mechanisms and conditions.

problem Understanding sharpness in neural network training.
method Fixed point analysis and edge of stability analysis in a simplified 2-layer linear network.
result Reveals mechanisms behind sharpness trends, conditions for edge of stability, and a period-doubling route to chaos.

In this paper we first give a one-move version of Markov's braid theorem for knot isotopy in S3S^3 that sharpens the classical theorem. Then a relative version of Markov's theorem concerning a fixed braided portion in the knot. We also prove an analogue of Markov's theorem for knot isotopy in knot complements. Finally …

2004-05-26abs ↗pdf ↗

A consequence of the Cabling Conjecture of Gonzalez-Acuña and Short is that Dehn surgery on a knot in S3S^3 cannot produce a manifold with more than two connected summands. In the event that some Dehn surgery produces a manifold with three or more connected summands, then the surgery parameter is bounded in terms of th…

2009-08-19abs ↗pdf ↗

Weight decay stabilizes training dynamics by slowing progressive sharpening.

problem Understanding how weight decay affects training stability in deep learning models.
method Analyzing weight decay effects at the Edge of Stability, developing a mathematical framework.
result Weight decay dampens oscillations and stabilizes sharpness in CNNs, causing a phase transition in MLPs.

The paper extends Laplacian spectra approximations to vector bundles.

problem Approximating the spectrum of the connection Laplacian.
method Extending the graph connection Laplacian to vector bundles and proving spectrum approximation.
result The spectrum of the extended operator approximates the spectrum of the connection Laplacian.

Proves Laplacian and Lichnerowicz Laplacian are sectorial in weighted Hölder spaces.

problem Analyzing sectoriality of Laplacian and Lichnerowicz Laplacian on asymptotically hyperbolic spaces.
method Proves sectoriality in weighted Hölder spaces using asymptotically hyperbolic metrics.
result Analytic semigroups apply, yielding well-posedness results for parabolic evolution equations.

Survey of Laplacian-based methods for data dimensionality reduction and embedding.

problem Efficiently reducing high-dimensional data to lower dimensions while preserving important features and structures.
method Laplacian-based methods including spectral clustering, Laplacian eigenmap, locality preserving projection, graph embedding, and diffusion map.
result Comprehensive overview of various optimization variants and applications of Laplacian-based techniques.

The graph Laplacian plays key roles in information processing of relational data, and has analogies with the Laplacian in differential geometry. In this paper, we generalize the analogy between graph Laplacian and differential geometry to the hypergraph setting, and propose a novel hypergraph pp-Laplacian. Unlike the …

2017-11-22abs ↗pdf ↗

The paper sets up eigenvalue comparison theorems for specific Laplacians on manifolds.

problem Eigenvalue comparison theorems for Witten-Laplacian and weighted pp-Laplacian on manifolds with modified Ricci curvature.
method Established Cheng-type eigenvalue comparison theorems for the first Dirichlet eigenvalues of the Witten-Laplacian and weighted pp-Laplacian on geodesic balls.
result Successfully set up eigenvalue comparison theorems for the Witten-Laplacian and weighted pp-Laplacian.

Paper investigates rigidity phenomena for weighted Ricci curvature bounds with Laplacian comparison theorem.

problem Investigating rigidity phenomena for weighted Ricci curvature bounds.
method Derived comparison geometric estimates and generalized for non-symmetric Laplacian.
result Obtained rigidity results for Laplacian comparison theorem, diameter comparisons, and volume comparisons.

Let T be the nilpotent group of 4 x 4 real upper triangular matrices. In this note we show that the Euler equations of certain left-invariant riemannian metrics on T have a horseshoe. We also show, with the aid of a numerical computation of a Melnikov-type integral, that the Euler equations of the sub-riemannian Carnot…

2007-09-28abs ↗pdf ↗