Neural networks are capable of learning rich, nonlinear feature representations shown to be beneficial in many predictive tasks. In this work, we use such models to explore different geographical feature representations in the context of predicting colorectal cancer survival curves for patients in the state of Iowa, sp…
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,657 papers · 148 categories
Trend · papers per month
48 results for “Spectral analysis”
Spectrally-Corrected and Regularized Linear Discriminant Analysis for Spiked Covariance Modelstat.ML
Improved LDA method for better classification and dimensionality reduction.
problem Improving linear discriminant analysis for better classification performance.
method Integrates spectrally-corrected covariance matrix and regularized discriminant analysis.
result SRLDA has a linear classification global optimal solution under spiked model assumption.
New spectral clustering method for multi-layer networks improves accuracy.
problem Detecting community structure in multi-layer networks.
method Integrative spectral clustering based on adaptive layer aggregation.
result Our methods minimize mis-clustering error and outperform existing methods.
Essential principal components simplify spectral analysis with minimal training data.
problem Accurate spectral quantification from complex mixtures.
method Identifying essential principal components and using molar extinction coefficients.
result Near one-to-one projection from principal components to mixture constituents.
Improved spectral clustering with fewer eigenvectors performs better.
problem Improving spectral clustering performance under weaker conditions.
method Tighter analysis and using fewer eigenvectors for embedding.
result Spectral clustering can produce better results with fewer eigenvectors.
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…
New spectral triples defined for SU(1,1) using harmonic analysis.
problem Defining new spectral triples for SU(1,1).
method Using harmonic analysis of SU(1,1) to construct pseudo-Riemannian and indefinite spectral triples.
result Triple forms both pseudo-Riemannian and indefinite spectral triples.
Survey of spectral, probabilistic, and deep metric learning methods.
problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.
Proposes neural dynamic mode decomposition for end-to-end modeling of nonlinear dynamics.
problem Understanding and modeling nonlinear dynamical systems.
method Trains neural networks to minimize forecast error based on spectral decomposition in the lifted space.
result Demonstrates effectiveness in eigenvalue estimation and forecast performance.
The goal of this paper is to show that there exists a simple, yet universal statistical logic of spectral graph analysis by recasting it into a nonparametric function estimation problem. The prescribed viewpoint appears to be good enough to accommodate most of the existing spectral graph techniques as a consequence of …
Study spectral analysis on lens spaces, proving isospectral lens spaces with prime order fundamental groups.
problem Spectral analysis of the Kohn Laplacian on lens spaces.
method Analog of Weyl's law and isospectral lens spaces with prime order fundamental groups.
result Two 3D lens spaces with prime order fundamental groups are isospectral with respect to the Kohn Laplacian if and only if they are CR isometric.
We analyze DMs using spectral methods to design effective noise schedules.
problem Lack of theoretical foundation for synthesis process decisions in DMs.
method Introduced a frequency response perspective based on Gaussianity assumption.
result Proposed a spectral transfer function to understand DM inference process.
Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about performance guarantees for spectral clustering. This issue is partly due to the…
Study magnetic Schrödinger operators in Euclidean space.
problem Semiclassical spectral analysis of magnetic Schrödinger operators.
method Spectral problems for Bochner-Schrödinger operator on manifolds.
result Survey and describe ideas of proofs for magnetic Schrödinger operators.
Develops a new approach to spectral asymmetry using microlocal analysis.
problem Spectral asymmetry on 3-manifolds.
method Constructs an asymmetry operator using microlocal analysis.
result The asymmetry operator generalizes the eta invariant and contains spectral asymmetry information.
The aim of this survey is to present some aspects of the Bérard-Besson-Gallot spectral embeddings of a closed Riemannian manifold from their origins in Riemannian geometry to more recent applications in data analysis.
Study cryptocurrency price dynamics using adaptive EMD and spectral analysis.
problem Analyze the time-varying volatility of cryptocurrency prices.
method Adaptive complementary ensemble empirical mode decomposition (ACE-EMD) and Hilbert spectral analysis.
result Reveal the properties of various timescales in cryptocurrency price dynamics.
Paper proposes a new method for sparse spectral clustering on Stiefel manifold.
problem Sparse spectral clustering on Stiefel manifold with nonsmooth and nonconvex objective.
method Proposes a manifold proximal linear method (ManPL) to solve the original SSC formulation.
result Demonstrates the advantage of ManPL over existing methods on single-cell RNA sequencing data.
New methods avoid spectral pollution in transfer operators for accurate analysis.
problem Spectral pollution in finite-dimensional approximations of transfer operators.
method Algorithms for computing spectral properties of transfer operators without spectral pollution.
result Accurate spectral estimation across various applications, including protein folding models.
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.
This work analyzes how different layers in deep neural networks contribute to generalization error.
problem Understanding the role of each layer in deep neural networks for generalization.
method Spectral analysis, Neural Tangent Kernel, Hermite polynomials, Spherical Harmonics.
result Initial layers in deep neural networks have a larger bias towards high-frequency functions.
We prove that spherical spectral analysis and synthesis hold in Damek-Ricci spaces and derive two-radius theorems.
Paper combines geometry and time-series analysis for spatiotemporal data.
problem Multivariate time-series data from multiple sensors.
method Combines manifold learning, Riemannian geometry, and spectral analysis.
result Proposes Riemannian multi-resolution analysis (RMRA) for dynamic mode extraction.
Spectral density matrix estimation of multivariate time series is a classical problem in time series and signal processing. In modern neuroscience, spectral density based metrics are commonly used for analyzing functional connectivity among brain regions. In this paper, we develop a non-asymptotic theory for regularize…
We summarize recent results initiating spectral analysis on pseudo-Riemannian locally symmetric spaces , beyond the classical setting where is compact (e.g. theory of automorphic forms for arithmetic ) or is trivial (e.g. Plancherel-type formula for semisimple symmetric spaces).
The paper studies spectral analysis on complex spaces and finds explicit formulas for eigensections.
problem Understanding eigensections on complex projective spaces and Grassmannians.
method Using creation and annihilation operators, converting higher energy eigensections to lower energy holomorphic sections.
result Explicit formulas for the dimension of higher-level eigensections on .
We identify spectral conditions for reliable neural probe interpretation.
problem Unreliable performance of linear probes in interpreting neural representations.
method Formalized Spectral Identifiability Principle (SIP) based on eigengap and Fisher error.
result Reliability of neural probes depends on the eigengap relative to Fisher estimation error.
Despite excellent progress in recent years, mode collapse remains a major unsolved problem in generative adversarial networks (GANs).In this paper, we present spectral regularization for GANs (SR-GANs), a new and robust method for combating the mode collapse problem in GANs. Theoretical analysis shows that the optimal …
A large number of algorithms in machine learning, from principal component analysis (PCA), and its non-linear (kernel) extensions, to more recent spectral embedding and support estimation methods, rely on estimating a linear subspace from samples. In this paper we introduce a general formulation of this problem and der…
Paper tackles functional linear regression using spectral algorithms with discrete observations.
problem Functional linear regression problem with discretely observed data.
method Combines distributed spectral algorithms with Sobolev kernels for regularization.
result Derives matching upper and lower bounds for convergence in Sobolev norm.
Spectral methods predict long-term signals from linear and nonlinear systems.
problem Forecasting temporal signals from linear and nonlinear systems with arbitrary sampling.
method Introduces a spectral algorithm for linear signals and extends it to nonlinear systems using Koopman theory.
result The spectral methods achieve high accuracy in forecasting and uncertainty quantification.
Meta-learning for Koopman spectral analysis with short time-series data.
problem Lack of long time-series for training embedding functions in Koopman spectral analysis.
method Meta-learning approach using bidirectional LSTM and neural network to estimate embedding functions from short time-series.
result The proposed method achieves better performance in eigenvalue estimation and future prediction compared to existing methods.
Spectral methods simplify data analysis, improving accuracy and stability.
problem Extracting meaningful information from noisy, incomplete data.
method Eigenvalues and eigenvectors of matrices constructed from data.
result Spectral methods are effective and can be analyzed using modern statistical theory.
We review the spectral analysis and the time-dependent approach of scattering theory for manifolds with asymptotically cylindrical ends. For the spectral analysis, higher order resolvent estimates are obtained via Mourre theory for both short-range and long-range behaviors of the metric and the perturbation at infinity…
A theory of feature geometry using spectral analysis of weight matrices.
problem Current methods decompose neural network activations into sparse linear features, losing geometric structure.
method Develops a theory by analyzing the spectra of weight-derived matrices, introducing the frame operator.
result Features collapse onto single eigenspaces, organizing into tight frames, and admit discrete classification.
We study topological recursion on the irregular spectral curve , which produces a weighted count of dessins d'enfant. This analysis is then applied to topological recursion on the spectral curve , which takes the place of the Airy curve to describe asymptotic behaviour of enumerative proble…
CNNs outperform standard chemometric methods for spectral data classification.
problem Reducing the need for pre-processing steps in spectral data analysis.
method Convolutional neural networks (CNNs) compared with SVMs and PLSR for classification and regression of spectral data.
result CNNs outperform standard chemometric methods, especially for classification tasks.
A novel 3D shape registration method using spectral graph embedding and probabilistic matching.
problem Challenges in 3D shape analysis and registration, especially with large variability.
method Combining spectral graph matching with Laplacian embedding for large graphs, using commute-time embedding and PCA.
result A method to register shapes with different samplings and isometric deformations.
New method shows spectral clustering is consistent with theoretical guarantees.
problem Lack of theoretical support for anchor-based spectral clustering.
method Defined and analyzed a specific anchor-based algorithm.
result Theoretical consistency of the method in asymptotic settings.
Develops an ℓ_p theory for PCA and spectral clustering.
problem Lack of precise characterizations of PCA scores for low-dimensional embedding.
method An ℓ_p perturbation theory for PCA in Hilbert spaces, analyzing eigenvectors and Gram matrix.
result Optimal recovery results for Gaussian mixture and stochastic block models.
Combines noncommutative geometry and spectral theory for new Weyl laws.
problem Developing new Weyl laws for noncommutative manifolds.
method Functional analysis, spectral theory, and Tauberian conditions.
result Generalizes and simplifies recent results on Weyl laws and integration formulas.
We present Spectral Inference Networks, a framework for learning eigenfunctions of linear operators by stochastic optimization. Spectral Inference Networks generalize Slow Feature Analysis to generic symmetric operators, and are closely related to Variational Monte Carlo methods from computational physics. As such, the…
The problem of Hybrid Linear Modeling (HLM) is to model and segment data using a mixture of affine subspaces. Different strategies have been proposed to solve this problem, however, rigorous analysis justifying their performance is missing. This paper suggests the Theoretical Spectral Curvature Clustering (TSCC) algori…
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurementsmath.NA
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged as prevailing methods for efficiently recovering sparse and partially observed signals respectively. We combine the distance preserving measur…
HSSE framework embeds single-cell RNA-seq data at multiple scales.
problem Capturing heterogeneous local structure in single-cell RNA-seq data.
method Hierarchical sheaf spectral embedding (HSSE) framework.
result HSSE achieves competitive or improved performance in single-cell RNA-seq data representation learning.
New methods for clustering graphs using spectral analysis.
problem Graph clustering for complex systems.
method Transfer operators and spectral properties.
result Spectral clustering can be interpreted using Koopman operators.
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 sequence analysis for Sobolev mappings in Carnot groups.
problem Analyzing spectral sequences for Sobolev mappings in Carnot groups.
method Showed Pansu pullback induces a spectral sequence mapping.
result Pansu pullback induces a spectral sequence mapping.