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,291 papers · 148 categories

Trend · papers per month

69139208277 · May 202619922001200920182026
48 results for spectral characterization

Study characterizes cryospheric spectral feature space using joint PC+t-SNE approach.

problem Characterize cryospheric spectral feature space for remote sensing applications.
method Compare and contrast two approaches for identifying feature space basis vectors via dimensionality reduction (PCA and t-SNE).
result Joint characterization reveals distinct continua and clusters of ice reflectance properties.

End-to-end differentially private LDA using spectral algorithm with theoretical guarantees.

problem Learning LDA models with differential privacy.
method Spectral algorithm with noise injection for differential privacy, identifying subsets of edges (configurations) for privacy guarantees.
result End-to-end differentially private spectral algorithm for LDA with utility guarantees.

Spectral methods improve parameter estimation in structured GLMs.

problem Parameter estimation in high-dimensional generalized linear models with structured data.
method Spectral methods using the principal eigenvector of a data-dependent matrix, with preprocessing for optimal performance.
result Precise asymptotic performance characterization and optimal preprocessing identified.

Developed a spectral theory for sinh-Gordon equation solutions.

problem Solving spectral data for simply periodic solutions of the sinh-Gordon equation.
method Defined spectral data, solved inverse problem, constructed Jacobi variety and Abel map.
result Spectral theory for sinh-Gordon equation solutions is developed and solved.

Study spectral estimators for multi-index models to recover low-dimensional signal subspaces.

problem Recovering low-dimensional signal subspaces in multi-index models.
method Spectral estimators for multi-index models.
result Precise asymptotic characterization of spectral methods' performance, revealing a phase transition for weak recovery.

This research optimizes Andrews plots for better visual clarity in high-dimensional data.

problem Visualizing high-dimensional datasets with clarity and aesthetics.
method Developed a method to add spectral smoothing to Andrews plots to reduce visual clutter.
result Optimal spatial-spectral smoothing leads to more aesthetically pleasing and clutter-free visualizations.

Let (M,g) be a compact Einstein manifold with smooth boundary. We consider the spectrum of the p form valued Laplacian with respect to a suitable boundary condition. We show that certain geometric properties of the boundary may be spectrally characterized in terms of this data where we fix the Einstein constant.

2003-05-07abs ↗pdf ↗

Proposes a probabilistic framework for stationary topological signals on simplicial complexes.

problem Complex data structures require new models and tools.
method Generalizes stationarity to topological signals on simplicial complexes.
result Defines topological power spectral density (PSD) for stationary signals.

Paper proposes AMP with spectral initialization for robust signal estimation.

problem Signal estimation from generalized linear model measurements with correlated initialization.
method Approximate message passing (AMP) with spectral initialization.
result Characterization of AMP with spectral initialization in high-dimensional limit.

New algorithms optimize spectral risk measures, improving interpolation between average and worst-case performance.

problem Optimizing spectral risk measures for learning systems.
method Developed stochastic algorithms to optimize spectral risk measures by characterizing their subdifferential and addressing challenges like biasedness of subgradient estimates and non-smoothness.
result Our approach outperforms out-of-the-box stochastic subgradient and dual averaging methods in optimizing spectral risk measures.

To a closed Riemannian manifold, we associate a set of (special values of) a family of Dirichlet series, indexed by functions on the manifold. We study the meaning of equality of two such families of spectral Dirichlet series under pullback along a map. This allows us to give a spectral characterization of when a smoot…

2010-07-06abs ↗pdf ↗

The paper develops spectral networks in symplectic topology and their relation to Lagrangian fillings.

problem Understanding spectral networks in symplectic topology and their role in Lagrangian fillings.
method Analytic results on adiabatic degeneration of Floer trajectories and explicit computation of continuation strips.
result Established equivalence between Family Floer functor and non-abelianization functor for Lagrangian fillings with spectral networks.

The study of spectral-tightness in Riemannian manifolds and its topological implications.

problem Understanding the spectral properties of Riemannian manifolds and their coverings.
method Analyzing the fundamental group and the Euclidean local de Rham factor to characterize spectral-tightness.
result Spectral-tightness is a topological property of the fundamental group, and it can be characterized by the dimension of the Euclidean local de Rham factor.

A Euclidean minimal torus with planar ends gives rise to an immersed Willmore torus in the conformal 3--sphere S3=R3{}S^3=\R^3\cup \{\infty\}. The class of Willmore tori obtained this way is given a spectral theoretic characterization as the class of Willmore tori with reducible spectral curve. A spectral curve of this type…

2012-12-20abs ↗pdf ↗

Study reveals learning curves and benign overfitting in spectral algorithms for large dimensions.

problem Understanding learning curves and benign overfitting in spectral algorithms for large-dimensional data.
method Analysis of learning curves and benign overfitting in spectral algorithms for inner-product kernels on the sphere and general domains.
result Characterization of three distinct regimes: over-regularized, under-regularized, and interpolation regimes, revealing benign overfitting across both under-regularized and interpolation regimes.

To a compact hyperbolic Riemann surface, we associate a finitely summable spectral triple whose underlying topological space is the limit set of a corresponding Schottky group, and whose ``Riemannian'' aspect (Hilbert space and Dirac operator) encode the boundary action through its Patterson-Sullivan measure. We prove …

2007-08-03abs ↗pdf ↗

The paper proves geodesic balls maximize the first Steklov eigenvalue in non-compact symmetric spaces.

problem Characterizing geodesic balls in non-compact rank one symmetric spaces.
method Utilizing a weighted isoperimetric inequality on harmonic manifolds, the paper proves the maximization of the first Steklov eigenvalue.
result Geodesic balls uniquely maximize the first Steklov eigenvalue among domains of fixed volume in non-compact rank one symmetric spaces.

The study determines if eigenvalues of a Laplacian can reveal the curvature of Kähler manifolds.

problem Can eigenvalues of the Laplacian determine the holomorphic sectional curvature of Kähler manifolds?
method Analyzes cohomologically Einstein and Fano Einstein conditions, showing constancy of curvature for most pairs (p,n).
result Characterizes standard complex projective spaces using a single spectral set under cohomological Einstein conditions.

The paper finds extremum values for mixed Laplacian eigenvalues on triangles and trapezoids.

problem Finding extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
method Characterizations obtained under suitable geometric constraints.
result Characterizations of extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.

The spectral kk-support norm enjoys good estimation properties in low rank matrix learning problems, empirically outperforming the trace norm. Its unit ball is the convex hull of rank kk matrices with unit Frobenius norm. In this paper we generalize the norm to the spectral (k,p)(k,p)-support norm, whose additional para…

2016-01-04abs ↗pdf ↗

New method preserves spectral clustering performance under aggressive sparsification and quantization.

problem Maintaining spectral clustering performance with sparse and quantized data.
method Random matrix theory applied to eigenspectrum changes under sparsification and quantization.
result Spectral clustering performance is preserved even with aggressive sparsification and quantization.

Machine learning predicts extreme events from spectral data.

problem Predicting extreme events in nonlinear systems from limited data.
method Trained a neural network to correlate spectral and temporal properties of optical fibre modulation instability.
result Predicted temporal probability distribution from high-dynamic range spectral data.

Recursive training of generative models can lead to model collapse, and the recursion converges to a unique limiting distribution.

problem Model collapse in recursive training of generative models
method Recursive training on their own outputs
result Recursive training converges to a unique limiting distribution

New method accelerates smooth games using spectral shape analysis.

problem Accelerating optimization in smooth games with complex numerical challenges.
method Matrix iteration theory and spectral shape analysis to characterize and manipulate acceleration.
result Identified a continuum of optimization strategies from convex minimization to gradient descent.

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.

New spectral conditions ensure graph rigidity and global rigidity in the Euclidean plane.

problem Ensuring graph rigidity and global rigidity in the Euclidean plane.
method Improving algebraic connectivity bounds for graph rigidity and global rigidity.
result Every 6-connected graph is rigid and globally rigid if its algebraic connectivity exceeds specific thresholds.

The study characterizes wobbly rank-2 bundles on Riemann surfaces using spectral curves.

problem Characterizing wobbly rank-2 bundles on Riemann surfaces.
method Using spectral curves and direct images of line bundles, the study provides sufficient and necessary conditions for wobbly bundles.
result All rank-2 wobbly bundles can be characterized as twists of direct images of line bundles.

Paper improves understanding of random Fourier features for kernel ridge regression.

problem Understanding statistical properties of random Fourier features for kernel ridge regression.
method Spectral matrix approximation approach to analyze random Fourier features.
result Proves statistical guarantees for kernel ridge regression using random Fourier features.