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

Trend · papers per month

4896143191 · May 202619922001200920172026
48 results for synthetic spectra

Cycle-StarNet bridges theory and data by adapting synthetic spectra to observational data.

problem Lack of consistency between theoretical stellar models and observational data.
method Hybrid generative domain adaptation using unsupervised learning on large spectroscopic surveys.
result Improved spectral fitting and reduced gap between synthetic and observational data.

Proposes a method for training Bayesian neural networks using synthetic data from Raman and CARS spectra.

problem Limited real observations in Raman and CARS spectroscopy.
method Log-Gaussian Gamma Processes and Bayesian Neural Networks.
result Trained Bayesian neural networks provide accurate estimates of Raman and CARS spectra with uncertainty quantification.

Graph spectra have been successfully used to classify network types, compute the similarity between graphs, and determine the number of communities in a network. For large graphs, where an eigen-decomposition is infeasible, iterative moment matched approximations to the spectra and kernel smoothing are typically used. …

2018-04-18abs ↗pdf ↗

Bayesian framework integrates spectral deconvolution with expert reasoning for robust peak estimation.

problem Challenges in extracting meaningful peaks from noisy or complex spectra.
method Bayesian spectral deconvolution coupled with a physical-property regression layer.
result Recovery of weak peaks in poly(lactic acid) IR spectra related to degradation rates.

Improved spectroscopy classification with deep learning and synthetic data.

problem Identifying chlorinated solvents in Raman spectra.
method Locally-connected neural network (NN) for binary classification, autoencoder-based outlier detection, and synthetic training data.
result The proposed method outperforms existing algorithms in accuracy and robustness.

Study eigenvalue distributions of neural kernels for linear-width networks.

problem Eigenvalue distributions of neural kernels in linear-width networks.
method Asymptotic analysis of Conjugate Kernel and Neural Tangent Kernel under random initialization and approximate orthogonality.
result Eigenvalue distributions converge to deterministic limits, described by recursive fixed-point equations.

Stochastic momentum methods trade compute efficiency for serial runtime.

problem Stochastic momentum methods trade compute efficiency for serial runtime.
method Stochastic HB and ASGD for consistent linear regression with Gaussian covariates.
result HB preserves SGD-level CE over a larger batch-size window, allowing larger batches to reduce serial runtime until HB reaches its deterministic accelerated scale.

A new method interprets astrophysical spectra using geometric paths to distinguish line profiles.

problem Tackling the indistinguishability of spectral line profiles under scalar summaries.
method Introduces a geometric representation of line profiles using rough path theory, mapping profiles to a common velocity grid and defining descriptors from path properties.
result Compact descriptors separate morphologies with similar scalar summaries, revealing ordered line structures.

We give a simple sufficient condition for Quinn's "bordism-type spectra" to be weakly equivalent to strictly associative ring spectra. We also show that Poincare bordism and symmetric L-theory are naturally weakly equivalent to monoidal functors. Part of the proof of these statements involves showing that Quinn's funct…

2009-07-14abs ↗pdf ↗

Method calculates spectra of Rarita-Schwinger operator on symmetric spaces.

problem Calculating spectra of the Rarita-Schwinger operator on compact symmetric spaces.
method Using Weitzenböck formulas, Laplace operator, Casimir operator, Freudenthal's formula, and branching rules.
result Obtained spectra on the sphere, complex projective space, and quaternionic projective space.

Neural networks learn simpler features first, then more complex ones; Fourier analysis reveals this pattern.

problem Understanding the learning dynamics of neural networks, especially with natural image data.
method Fourier analysis of translation-invariant and power-law spectra to study feature learning.
result Simple neural networks first rely on amplitude information, then phase information, and power-law spectra can accelerate learning phase information.

Tomova, along with results of Bachman and Schleimer, showed that any high distance knot has a stair-step bridge spectrum. In this paper, we compute the bridge spectra and distance of generalized Montesinos knots. In particular, we produce the first example of a class of knots which attain the stair-step bridge spectra …

2015-10-28abs ↗pdf ↗

The difficulty of classification affects the weight matrices' heavy tail appearance in deep learning networks.

problem Understanding the spectral properties of weight matrices in deep learning networks.
method Spectral analysis of weight matrices in different modules of DNNs, classification difficulty as a driving factor for heavy tail appearance.
result Higher classification difficulty leads to more frequent appearance of heavy tails in weight matrices spectra.

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.

Jones-Wenzl projectors lifted to Khovanov spectra, proving knot conjectures.

problem Understanding Jones-Wenzl projectors in Khovanov spectra.
method Constructing and studying lifted projectors via maps and polynomial actions.
result Complete computation of 3-colored Khovanov spectrum of the unknot, proving conjectures.

We introduce a framework, twisted parametrized stable homotopy theory, for describing semi-infinite homotopy types. A twisted parametrized spectrum is a section of a bundle whose fibre is the category of spectra. We define these bundles in terms of modules over a stack of parametrized spectra and in terms of diagrams o…

2005-08-03abs ↗pdf ↗

We prove explicit upper and lower bounds for the L1L^1-moment spectra for the Brownian motion exit time from extrinsic metric balls of submanifolds PmP^m in ambient Riemannian spaces NnN^{n}. We assume that PP and NN both have controlled radial curvatures (mean curvature and sectional curvature, respectively) as view…

2010-09-07abs ↗pdf ↗

The paper describes correlations of spectra for higher rank Anosov representations.

problem Understanding correlations of spectra for Anosov representations of higher rank groups.
method Relates correlation problem to counting projections in truncated hypertubes.
result Extends previous work on rank one representations to higher rank.

We view strict ring spectra as generalized rings. The study of their algebraic K-theory is motivated by its applications to the automorphism groups of compact manifolds. Partial calculations of algebraic K-theory for the sphere spectrum are available at regular primes, but we seek more conceptual answers in terms of lo…

2014-03-24abs ↗pdf ↗

Wavelet scattering spectra model non-Gaussian time-series, proving scale invariance for self-similar processes.

problem Modeling non-Gaussian time-series with stationary increments.
method Complex wavelet transform for scale variations, joint correlation matrix for scale dependencies, second wavelet transform for diagonalization, maximum entropy models conditioned by scattering spectra coefficients.
result Scattering spectra of self-similar processes are scale invariant, allowing statistical testing and generation of new time-series.

The study reveals the spectral structure of attention layers and its implications for generalization.

problem Understanding the spectral structure and generalization of trained attention layers.
method Empirical risk minimization in a single-head tied-attention layer, using random matrix theory, spin-glass theory, and approximate message passing.
result Exact high-dimensional characterization of training and test error, interpolation and recovery thresholds, and spectrum of the key and query matrices.

Manifold methods improve amino acid classification in LIBS spectra.

problem Improving classification accuracy of amino acids in LIBS spectra.
method Developed an information theoretic method for measuring LIBS energy spectra, implemented manifold methods for nonlinear dimensionality reduction.
result Nonlinear methods lead to increased classification accuracy in amino acid classification.

We propose a Bayesian nonparametric method for low-pass filtering that can naturally handle unevenly-sampled and noise-corrupted observations. The proposed model is constructed as a latent-factor model for time series, where the latent factors are Gaussian processes with non-overlapping spectra. With this construction,…

2019-02-09abs ↗pdf ↗