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

4284126168 · May 202619922001200920172026
48 results for spectral parametrization

Bayesian parametric matrix models provide uncertainty quantification for spectral learning.

problem Uncertainty quantification in spectral learning for safety-critical applications.
method Bayesian parametric matrix models (B-PMMs) that extend PMMs to provide uncertainty estimates.
result B-PMMs achieve exceptional uncertainty calibration (ECE < 0.05) while maintaining favorable scaling.

Develops flexible non-parametric ACFs using B-spline kernels.

problem Flexible modelling of the autocovariance function (ACF) in time-series, spatial, and spatio-temporal analysis.
method Derives the inverse Fourier transform of B-spline spectral bases to create a general class of non-parametric ACFs.
result Provides a provably dense, flexible, and general class of non-parametric ACFs for various types of processes.

BSD is a Bayesian framework for analyzing neural spectral data.

problem Challenges in statistical analysis and group-level comparisons of neural power spectra.
method Bayesian Spectral Decomposition (BSD) for parametric models of neural spectra.
result BSD outperforms existing methods in model selection and parameter estimation.

Unified spectral clustering for sparse networks with heterogeneous degrees.

problem Efficiently detecting communities in sparse networks with varying degrees.
method Developed a parametrized regularized Laplacian matrix for spectral clustering.
result Improved parametrization accounts for network heterogeneity and community hardness.

Inspired by a string duality, we construct a deformation family for G2G_2-orbifolds given as total spaces of coassociative fibrations by ADE singularities over a closed and oriented smooth three-manifold QQ. The deformations are parametrized by sections of a fiber bundle on QQ that can be interpreted as spectral/came…

2019-10-23abs ↗pdf ↗

ParPIC clusters directed graphs using random walks and diffusion operators.

problem Challenges in vertex-level clustering for directed graphs due to edge directionality.
method Parametrized Power-Iteration Clustering (ParPIC) based on reversible random walks and diffusion operators.
result ParPIC achieves competitive clustering accuracy with improved scalability compared to spectral and teleportation-based methods.

Positive scalar curvature metrics on cobordisms yield only reducible Seiberg-Witten solutions.

problem Counting solutions to Seiberg-Witten equations on cobordisms.
method Constructing families of metrics with positive scalar curvature.
result Irreducible solutions are absent when positive scalar curvature metrics are used.

Early approaches to multiple-output Gaussian processes (MOGPs) relied on linear combinations of independent, latent, single-output Gaussian processes (GPs). This resulted in cross-covariance functions with limited parametric interpretation, thus conflicting with the ability of single-output GPs to understand lengthscal…

2017-09-05abs ↗pdf ↗

In spectral clustering and spectral image segmentation, the data is partioned starting from a given matrix of pairwise similarities S. the matrix S is constructed by hand, or learned on a separate training set. In this paper we show how to achieve spectral clustering in unsupervised mode. Our algorithm starts with a se…

2012-07-04abs ↗pdf ↗

Spectral risk measures are attractive risk measures as they allow the user to obtain risk measures that reflect their subjective risk-aversion. This paper examines spectral risk measures based on an exponential utility function, and finds that these risk measures have nice intuitive properties. It also discusses how th…

2011-03-28abs ↗pdf ↗

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.

Paper estimates spectral risk measures for insurance data with truncated and censored data.

problem Estimating spectral risk measures for insurance data with left truncation and right censoring.
method Proposes a non-parametric estimator using product limit estimator and establishes asymptotic normality.
result Proposed estimator outperforms existing methods for small k and small sample sizes.

Spectral methods have greatly advanced the estimation of latent variable models, generating a sequence of novel and efficient algorithms with strong theoretical guarantees. However, current spectral algorithms are largely restricted to mixtures of discrete or Gaussian distributions. In this paper, we propose a kernel m…

2013-11-13abs ↗pdf ↗

We describe a graph parametrization of rational quadratic differentials with presence of a simple pole, whose critical trajectories form a network depending on parameters focusing on the network topological jumps. Obtained bifurcation diagrams are associated with the Stasheff polytopes.

2015-09-02abs ↗pdf ↗

The paper parametrizes spaces of maximal framed representations for a specific type of surface group.

problem Counting connected components and maximal representations for a specific type of surface group.
method Parametrization of spaces of maximal framed representations using a Hermitian Lie group of tube type.
result Counted connected components and maximal representations for the space of maximal framed representations.

A large class of machine learning techniques requires the solution of optimization problems involving spectral functions of parametric matrices, e.g. log-determinant and nuclear norm. Unfortunately, computing the gradient of a spectral function is generally of cubic complexity, as such gradient descent methods are rath…

2018-02-18abs ↗pdf ↗

Minimal and CMC surfaces in S3S^3 can be treated via their associated family of flat $\SL(2,\C)$-connections. In this the paper we parametrize the moduli space of flat $\SL(2,\C)$-connections on the Lawson minimal surface of genus 2 which are equivariant with respect to certain symmetries of Lawson's geometric construc…

2012-09-14abs ↗pdf ↗

We construct a map from the suspension GG-spectrum ΣGMΣ_G^\infty M of a smooth compact GG-manifold to the equivariant AA-theory spectrum AG(M)A_G(M), and we show that its fiber is, on fixed points, a wedge of stable hh-cobordism spectra. This map is constructed as a map of spectral Mackey functors, which is compatible …

2020-01-15abs ↗pdf ↗

Simpler GNNs with low-rank non-parametric aggregators perform well on graph benchmarks.

problem Over-engineering in GNN architectures for common semi-supervised node classification datasets.
method Replacing feature aggregation with a non-parametric learner to streamline GNN design.
result Non-parametric regression is effective for semi-supervised learning on sparse, directed networks.

Using Takahashi theorem we propose an approach to extend known families of minimal tori in spheres. As an example, the well-known two-parametric family of Lawson tau-surfaces including tori and Klein bottles is extended to a three-parametric family of tori and Klein bottles minimally immersed in spheres. Extremal spect…

2013-08-07abs ↗pdf ↗

SpecNet2 improves spectral embedding without orthogonalization, achieving better performance and efficiency.

problem Improving spectral embedding methods for better performance and efficiency.
method Optimizes an equivalent objective of the eigen-problem without orthogonalization, allowing separate row and column sampling.
result Local and global convergence of the new objective using batch-based gradient descent is proven, and improved performance and efficiency are demonstrated on simulated and image datasets.

We use refined spectral sequence arguments to calculate known and previously unknown bi-Hamiltonian cohomology groups, which govern the deformation theory of semi-simple bi-Hamiltonian pencils of hydrodynamic type with one independent and \( N\) dependent variables. In particular, we rederive the result of Dubrovin-Liu…

2016-11-28abs ↗pdf ↗

New method estimates Nishimori temperature for node classification in weighted graphs.

problem Estimating Nishimori temperature for Bayesian inference.
method Spectral method using eigenvalues of Bethe Hessian matrix.
result Spectral method outperforms existing approaches in node classification.

The paper studies Dirac operators on large spectral three-manifolds.

problem Analyzing Dirac operators on spectrally large three-manifolds.
method Non-linear analysis of Seiberg-Witten equations and understanding transversality in monopole Floer homology.
result The locus of flat U(1)-connections on a three-torus where a twisted Dirac operator has kernel is a two-sphere.

In principle, Floer theory can be extended to define homotopy invariants of families of equivalent objects (e.g. Hamiltonian isotopic symplectomorphisms, 3-manifolds, Legendrian knots, etc.) parametrized by a smooth manifold B. The invariant of a family consists of a filtered chain homotopy type, which gives rise to a …

2003-08-12abs ↗pdf ↗

In this article, we study spectral methods for community detection based on α α-parametrized normalized modularity matrix hereafter called Lα {\bf L}_α in heterogeneous graph models. We show, in a regime where community detection is not asymptotically trivial, that Lα {\bf L}_α can be well approximated by a more tract…

2016-11-03abs ↗pdf ↗

Defines and parametrizes sl(2)\mathfrak{sl}(2)-type singular fibres in symplectic and odd orthogonal Hitchin systems.

problem Characterizing and understanding singular fibres in Hitchin systems.
method Stratification by semi-abelian spectral data, study of irreducible components, global description of degenerations.
result Extension of Langlands duality to sl(2)\mathfrak{sl}(2)-type Hitchin fibres.

New ICA method for sources with mixed spectra.

problem Inaccurate separation of sources with temporal autocorrelations and mixed spectra.
method Estimates spectral density functions and line spectra using cubic splines and indicator functions, then maximizes the Whittle likelihood function.
result Outperforms existing ICA methods in simulations and EEG data applications.

Informative and discriminative feature descriptors play a fundamental role in deformable shape analysis. For example, they have been successfully employed in correspondence, registration, and retrieval tasks. In the recent years, significant attention has been devoted to descriptors obtained from the spectral decomposi…

2011-10-23abs ↗pdf ↗

New method clusters directed and undirected graphs without losing directional information.

problem Clustering directed graphs due to asymmetry in edge connectivity.
method Generalized Dirichlet Energy (GDE) and generalized spectral clustering (GSC).
result GSC outperforms existing methods in clustering accuracy and robustness.

Study shows neural operators can efficiently solve complex reaction-diffusion systems.

problem Efficiently solving nonlinear reaction-diffusion systems using neural operators.
method Laplacian-based neural operators applied to a generalized Gierer-Meinhardt system.
result Explicit approximation error bounds established for neural operators in terms of network parameters.