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

55110165220 · Jun 202019922001200920172026
48 results for Spectral Behavior

We perform a parallel analysis of the spectral density of (i) the logarithm of price and (ii) the daily number of trades of a set of stocks traded in the New York Stock Exchange. The stocks are selected to be representative of a wide range of stock capitalization. The observed spectral densities show a different power-…

1999-12-01abs ↗pdf ↗

A robust method for decomposing spectral peaks robust to distortion and interference.

problem Decomposing spectral peaks in the presence of distortion and interference.
method Optimizing a nonparametric approach using pseudo-symmetric functions with nonincreasing behavior.
result Decomposed spectral peaks show pseudo-orthogonal behavior and power preserving equality.

The study finds arbitrarily small spectral gaps for random hyperbolic surfaces with many cusps.

problem Understanding spectral gaps of random hyperbolic surfaces with many cusps.
method Analysis of moduli spaces of hyperbolic surfaces with Weil-Petersson metric.
result Arbitrarily small spectral gaps are observed as the number of cusps grows slower than the genus.

Study low energy resolvent behavior on fibred boundary metrics.

problem Analyze the resolvent of Hodge Laplacian on manifolds with fibred boundary metrics.
method Develop a 'split' pseudodifferential calculus to handle different asymptotic behaviors.
result Precise asymptotic behavior of resolvent as a fibred boundary pseudodifferential operator.

This paper studies how adding leaves to a tree affects its spectral properties.

problem Investigating the asymptotic behavior of tree spectra under leaf attachment.
method Analyzing the Ricci matrix and its largest eigenvalue for trees with pendant edges added.
result The sequence of largest eigenvalues converges to a limit that depends on local branch data.

Graph signal processing detects hallucinations in large language models.

problem Detecting factual reasoning from hallucinations in large language models.
method Modeling transformer layers as dynamic graphs, using spectral analysis to define diagnostics.
result Spectral signatures can distinguish different types of hallucinations and achieve high accuracy.

Spectral algorithms are graph partitioning algorithms that partition a node set of a graph into groups by using a spectral embedding map. Clustering techniques based on the algorithms are referred to as spectral clustering and are widely used in data analysis. To gain a better understanding of why spectral clustering i…

2019-12-06abs ↗pdf ↗

This note summarizes results that were obtained by the author in his habilitation thesis (arXiv:1607.08792) concerning the development of a spectral theory for simply periodic, 2-dimensional, complex-valued solutions of the sinh-Gordon equation. Spectral data for such solutions are defined for periodic Cauchy data on a…

2017-01-11abs ↗pdf ↗

Let Y be a compact, oriented 3-manifold with a contact form a. For any Dirac operator D, we study the asymptotic behavior of the spectral flow between D and D+cl(-ira) as r very large. If a is the Thurston-Winkelnkemper contact form whose monodromy is the product of Dehn twists along disjoint circles, we prove that the…

2011-04-26abs ↗pdf ↗

In this paper we study the asymptotic behavior of second-order uniformly elliptic operators on weighted Riemannian manifolds. They naturally emerge when studying spectral properties of the Laplace-Beltrami operator on families of manifolds with rapidly oscillating metrics. We appeal to the notion of H-convergence intro…

2017-10-25abs ↗pdf ↗

Accelerates optimal transport computation by 10x with spectral insights.

problem Exponential slow-down of convergence in Entropic Optimal Transport as regularization weakens.
method Spectral insights and spectral warm-start strategy to mitigate convergence issues.
result Faster convergence compared to the reference method Sinkhorn algorithm.

To date, most studies on spam have focused only on the spamming phase of the spam cycle and have ignored the harvesting phase, which consists of the mass acquisition of email addresses. It has been observed that spammers conceal their identity to a lesser degree in the harvesting phase, so it may be possible to gain ne…

2013-04-30abs ↗pdf ↗

The paper explores how structured representations influence learning dynamics in neural networks.

problem Understanding the training dynamics of deep neural networks.
method Investigates a family of enriched transformation layers with constrained pathways and adaptive corrections.
result Improved robustness, smoother optimization, and scalable depth behavior are achieved through structured representations.

Study the Bochner-Schrödinger operator on symplectic manifolds, proving gap existence and asymptotic kernel behavior.

problem Analyzing the spectrum and asymptotic behavior of the Bochner-Schrödinger operator on symplectic manifolds.
method Rough asymptotic description, existence proof, off-diagonal exponential estimate, complete asymptotic expansion.
result Existence of gaps in the spectrum and asymptotic kernel behavior.

When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different edge-weight representations, under a generic low rank model. We measure the quality of dif…

2019-10-12abs ↗pdf ↗

This paper provides a full controlled version of algebraic KK-theory. This includes a rich array of assembly maps; the controlled assembly isomorphism theorem identifying the controlled group with homology; and the stability theorem describing the behavior of the inverse limit as the control parameter goes to 0. There…

2004-02-24abs ↗pdf ↗

Sharp spectral gap estimates for higher-order operators on hyperbolic spaces.

problem Estimating spectral gaps for higher-order operators on Cartan-Hadamard manifolds.
method Symmetrization-free proofs based on general functional inequalities.
result Solves a sharp asymptotic problem from Cheng and Yang and answers a question from Kristály.

Unified framework for analyzing graph neural operators converging to graph limits.

problem Analyzing convergence of graph neural operators to graph limits.
method Develops a unified spectral framework for graph neural operators under various graphon assumptions.
result Unified framework enables direct comparison of convergence rates and tradeoffs.

Muon optimizer simplifies matrix optimization with spectral orthogonalization.

problem Matrix optimization challenges, especially with large condition numbers.
method Simplified Muon optimizer using spectral orthogonalization of gradients.
result Simplified Muon converges linearly with independent scalar sequences, outperforming gradient descent and Adam.

The paper constructs noncompact hyperbolic surfaces with uniform spectral gaps using random graph models.

problem Building noncompact hyperbolic surfaces with uniform spectral gaps.
method Introduced a random graph model Fχ,n\mathcal{F}_{χ,n} to construct expanding families of graphs, then applied these families to create hyperbolic surfaces.
result Explicitly constructed an expanding family of graphs in the critical regime, leading to a sequence of complete, noncompact hyperbolic surfaces with uniformly positive spectral gaps.

Non-Markovian point process shows power-law scaling, similar to nonlinear Markovian process.

problem Understanding the scaling behavior of non-Markovian point processes.
method Analyzed a confined fractional Brownian motion-driven point process and compared it to a nonlinear Markovian process.
result A nonlinear Markovian process can reproduce the power-law scaling behavior of a non-Markovian point process.

Study Bergman and spectral kernels for non-compact complex manifolds.

problem Analyze asymptotic behavior of kernels over non-compact complex manifolds.
method Generalize scaling method to study Bergman and spectral kernels.
result Derive leading term of Bergman and spectral kernels under local convergence of Chern curvatures.

This work analyzes a two-stage algorithm for single index models, showing precise asymptotics of gradient descent.

problem Learning single index models with non-convex optimization.
method Spectral initialization followed by gradient descent, with detailed analysis of dynamics and asymptotics.
result Gradient descent converges to long-time fixed points in the large system limit, representing mean field behavior.

New framework predicts AMP behavior in spiked models for finite iterations.

problem Understanding AMP dynamics in high-dimensional spiked models.
method Developed a non-asymptotic framework for AMP in spiked matrix estimation.
result Predicted AMP behavior for up to O(npolylogn)O\big(\frac{n}{\mathrm{poly}\log n}\big) iterations in Z2\mathbb{Z}_2 synchronization.

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.

Spectral algorithms improve under covariate shift with novel weighted techniques.

problem Improving spectral algorithms' performance under covariate shift.
method Analysis of spectral algorithms in non-parametric regression over RKHS, proposing a weighted spectral algorithm with clipped weights.
result Normalized weighted spectral algorithm achieves optimal capacity-independent convergence rates, and clipped weights can approach optimal capacity-dependent rates.

A recent line of work has uncovered a new form of data poisoning: so-called \emph{backdoor} attacks. These attacks are particularly dangerous because they do not affect a network's behavior on typical, benign data. Rather, the network only deviates from its expected output when triggered by a perturbation planted by an…

2018-11-01abs ↗pdf ↗

I review the milestones of the mathematical work of Krzysztof P. Wojciechowski. This will at the same time be a tour of Analysis and Geometry of Boundary Value Problems. Starting in the 80s I will discuss the spectral flow and the general linear conjugation problem, the Calderon projector and the topology of space of e…

2006-03-21abs ↗pdf ↗

Machine learning predicts dam-break flood wave behavior accurately.

problem Predicting long-term wave behavior in dam-break floods.
method Solved Saint-Venant equations using Lax-Wendroff scheme, trained RC-ESN with flow depth data.
result RC-ESN model predicts 286 time-steps ahead with RMSE < 0.01, outperforming LSTM.

In this article, associated with each lattice TZnT\subseteq \mathbb{Z}^n the concept of a harmonic-counting measure νTν_T on a sphere Sn1S^{n-1} is introduced and it is applied to determine the asymptotic behavior of the eigenfunctions of the Laplace-Beltrami operator on a lens space. In fact, the asymptotic behavior of …

2016-02-21abs ↗pdf ↗