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

Trend · papers per month

4386129172 · May 202619922001200920182026
48 results for fundamental frequency

STFNets learn signals from time-frequency perspective, outperforming traditional models.

problem Learning signals from IoT data with better features in the frequency domain.
method Integrates Short-Time Fourier Transform into neural networks for direct frequency domain feature learning.
result Significantly outperforms state-of-the-art models in various experiments.

Two models predict similar high-frequency price dynamics but differ in low-frequency impact strength.

problem Understanding the relationship between market prices and fundamental information.
method Comparing a microfounded linear model with a data-driven model at high and low frequencies.
result Both models predict similar high-frequency price dynamics but differ in low-frequency impact strength.

GNNS uses graph neural networks to efficiently estimate subgraph frequency distributions.

problem Efficiently calculating subgraph frequency distributions in large networks.
method Graph Neural Networks (GNNS) for sampling and estimating subgraph frequencies.
result GNNS achieves comparable accuracy with a significant speedup of three orders of magnitude.

Algorithm finds frequencies, amplitudes, and phases of sinusoids in noisy data.

problem Finding frequencies, amplitudes, and phases of sinusoids in noisy data.
method Maximum likelihood approach to estimate tone parameters from contaminated observations. Successively estimates frequencies and jointly optimizes amplitudes and phases.
result Near-linear computational complexity (O(N)) for estimating MM number of sinusoidal sources.

Two-layer networks struggle with high frequencies due to numerical and computational limitations.

problem High frequency approximation and learning in shallow networks.
method Mathematical and computational analysis focusing on numerical error, computational cost, and stability.
result Explicit answers to fundamental computational issues in shallow networks' high frequency handling.

This paper explores a variety of models for frame-based music transcription, with an emphasis on the methods needed to reach state-of-the-art on human recordings. The translation-invariant network discussed in this paper, which combines a traditional filterbank with a convolutional neural network, was the top-performin…

2017-11-13abs ↗pdf ↗

Many spectral unmixing methods rely on the non-negative decomposition of spectral data onto a dictionary of spectral templates. In particular, state-of-the-art music transcription systems decompose the spectrogram of the input signal onto a dictionary of representative note spectra. The typical measures of fit used to …

2016-09-30abs ↗pdf ↗

In this paper, we address the fundamental problem of line spectral estimation in a Bayesian framework. We target model order and parameter estimation via variational inference in a probabilistic model in which the frequencies are continuous-valued, i.e., not restricted to a grid; and the coefficients are governed by a …

2016-04-13abs ↗pdf ↗

This paper analyzes the multi-armed bandit problem using frequency-domain methods.

problem The exploration-exploitation trade-off in sequential decision-making.
method Proposes a frequency-domain analysis framework, reformulating the bandit process as a signal processing problem.
result Confidence bound term in UCB algorithm is equivalent to a time-varying gain in frequency domain.

New method improves Gaussian kernel approximations for high-frequency data.

problem Limited scalability of kernel-based models to large data sets.
method Local random feature approximations using Maclaurin expansions and polynomial sketches.
result Significant improvement in kernel approximations and downstream performance for high-frequency data.

This research explores principles of Lipschitz continuity in neural networks for robustness and generalization.

problem Ensuring robustness and generalization in neural networks, especially to small input perturbations and out-of-distribution data.
method Two complementary perspectives: internal (training dynamics) and external (frequency signal propagation).
result Advances in understanding the principles of Lipschitz continuity in neural networks.

New method for fast volatility estimation robust to change points.

problem Robust high-frequency volatility estimation with change points.
method ℓ1-regularized power variation estimators using LARS for sparse estimation and dynamic programming for change point refinement.
result Minimax rates achieved for volatility estimators, providing accurate and smooth forecasts.

FMMNN combines sine activations with multi-component, multi-layer structure for high-frequency function approximation.

problem Effective representation and learning of high-frequency features in neural networks.
method Introduces FMMNN with sine-type activations and multi-component, multi-layer structure.
result FMMNN achieves strong accuracy and favorable convergence on oscillatory function-approximation benchmarks.

Quantum ELMs use a quantum reservoir to learn from data, with limits on expressivity and scalability.

problem Understanding the limits of quantum ELMs for machine learning tasks.
method Decomposed QELM predictions into Fourier series to analyze expressivity and scalability.
result Expressivity of QELMs is limited by the number of Fourier frequencies and observables, and scalability is hindered by hardware noise and entanglement.

In the present work we address the problem of evaluating the historical performance of a trading strategy or a certain portfolio of assets. Common indicators such as the Sharpe ratio and the risk adjusted return have significant drawbacks. In particular, they are global indices, that is they do not preserve any 'local'…

2009-04-27abs ↗pdf ↗

A new FFT-based method simplifies causal structure recovery for linear dynamical systems.

problem Efficiently identifying dynamic causal effects from time-series data.
method FFT-based approach to reduce computational complexity to O(Tn3logN)O(Tn^3 \log N).
result Significant computational advantage for graph reconstruction.

Estimating a large alphabet probability distribution from a limited number of samples is a fundamental problem in machine learning and statistics. A variety of estimation schemes have been proposed over the years, mostly inspired by the early work of Laplace and the seminal contribution of Good and Turing. One of the b…

2018-07-06abs ↗pdf ↗

Agent-based model simulates financial market crashes and identifies key factors.

problem Analyzing and understanding flash crashes in financial markets.
method Agent-based modelling approach with calibrated high-frequency financial simulator.
result Model accurately reproduces historical flash crash events and identifies key factors.

The study analyzes macroeconomic factors affecting copper futures volatility and long-term correlation with S&P 500.

problem Understanding the impact of macroeconomic variables on copper futures volatility and long-term correlation.
method Employed GARCH-MIDAS and DCC-MIDAS modeling frameworks to examine the influence of low-frequency macroeconomic variables on copper futures returns and long-term correlation with S&P 500.
result PPI is the most efficient macroeconomic variable impacting copper futures returns, and MIDAS filter improves model fitness and long-run relationship.

DEAP Cache learns prefetching, eviction, and admission using machine learning.

problem Improving cache performance through better prefetching, eviction, and admission strategies.
method End-to-end pipeline using machine learning, inspired by pretraining on large corpora and online reinforcement learning.
result Optimal policy distribution between two orthogonal eviction strategies based on frequency and recency.

Profile entropy measures learnability and compressibility of discrete distributions.

problem Understanding the learnability and compressibility of discrete distributions.
method Investigates profile entropy, showing its role in estimation, inference, and compression.
result Profile entropy is a fundamental measure unifying estimation, inference, and compression.

HyFAD improves time series imputation by combining time and frequency diffusion.

problem Improve time series imputation by handling frequency-sensitive denoising and balancing global and local dynamics.
method HyFAD is a hybrid time-frequency diffusion model with frequency-aware embedding, built on DDPM paradigm.
result HyFAD achieves state-of-the-art performance in time series imputation.

Proposes a learned Bayesian Cramér-Rao bound for unknown measurement models.

problem Computing the Bayesian Cramér-Rao bound requires full knowledge of priors and measurement distributions.
method Introduces a Physics-encoded score neural network to learn priors and measurements.
result Demonstrates improved sample complexity and interpretability through domain knowledge incorporation.

SSMs have a built-in bias towards low-frequency components, which can be adjusted.

problem Frequency bias in SSMs affects their performance on long-range sequences.
method Proposed two mechanisms to tune frequency bias: scaling initialization or applying a Sobolev-norm-based filter.
result Tuning frequency bias improves SSMs' performance on long-range sequence learning tasks.