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

59118177236 · May 202619922001200920172026
48 results for stable noise

New methods for estimating ARMA and GARCH models with stable noise.

problem Estimating parameters of ARMA and GARCH models with stable noise.
method Modified Hannan-Rissanen Method and Modified Empirical Characteristic Function for estimation.
result Efficiency, accuracy, and simplicity of proposed methods demonstrated through simulation.

This work extracts stochastic dynamical systems with α\alpha-stable Lévy noise.

problem Extracting data-driven governing laws of dynamical systems with non-Gaussian noise.
method End-to-end deep learning approach for learning drift and diffusion coefficients for α\alpha-stable Lévy noise.
result Effectiveness of the method confirmed by numerical experiments.

DLPM replaces Gaussian noise with α-stable noise in DDPM, improving data distribution coverage and robustness.

problem Handling mode collapse and class imbalance in datasets with heavy-tailed noise.
method Extending DDPM to use α-stable noise, simplifying the process with elementary proof techniques.
result DLPM yields better coverage of data distribution tails, improved robustness to unbalanced datasets, and faster computation times.

We develop a flexible framework for low-rank matrix estimation that allows us to transform noise models into regularization schemes via a simple bootstrap algorithm. Effectively, our procedure seeks an autoencoding basis for the observed matrix that is stable with respect to the specified noise model; we call the resul…

2014-10-30abs ↗pdf ↗

A new method for feature selection robust to noise and design variability.

problem Feature selection in high-dimensional regression under sampling variability and measurement error.
method Injects controlled additive noise into the design matrix, fits a base selector, and aggregates selection frequencies.
result Improved robustness compared to Stability Selection and standard base selectors.

Study how neural networks optimize to stable linearly connected regions.

problem Understanding how neural networks converge to stable solutions under different training conditions.
method Investigate the stability of neural networks to SGD noise and apply it to iterative magnitude pruning.
result Subnetworks that reach full accuracy must be stable to SGD noise, either at initialization or early in training.

Method extracts stochastic systems with Lévy noise from data.

problem Identifying stochastic dynamical systems with Lévy noise from short data.
method Estimate Lévy jump measure and noise intensity, approximate drift coefficient.
result Accurate and effective method for discovering stochastic laws.

The paper tackles drift identification in Lévy α-stable stochastic systems, proposing a Fourier space approach.

problem Estimating the drift field of a stochastic differential equation driven by Lévy α-stable noise.
method Fourier space approach, parameterizing the drift field using Fourier series, minimizing a loss function with gradients computed via the adjoint method.
result The method is capable of learning drift fields in qualitative and/or quantitative agreement with ground truth fields.

Noise in RNNs promotes flatter minima and more stable dynamics.

problem Understanding and optimizing the training of RNNs with noise.
method Formalizing RNNs as stochastic differential equations and analyzing the effect of noise in the hidden states.
result Noise injection in RNNs leads to flatter minima, more stable dynamics, and improved robustness.

Paper tackles SMPC for linear systems with unknown noise distribution.

problem Stochastic MPC for linear systems with chance state constraints and unknown noise distribution.
method Reformulate chance constraints, design robust benchmark SMPC, and develop adaptive SMPC with online noise statistics learning.
result Adaptive SMPC guarantees time-uniform satisfaction of unknown reformulated state constraints with high probability.

Noise can stabilize systemic risk models with uncertain robustness.

problem Understanding systemic risk in financial systems with uncertain parameters.
method Analyzing a mean-field model of systemic risk with uncertain coefficients and noise.
result Noise can induce stability in systemic risk models, contrary to intuition.

DSPM models control noise volatility, improving financial data analysis.

problem Financial returns exhibit volatility clustering, challenging traditional models.
method DSPM uses a tempered-stable subordinator to control noise volatility, preserving kurtosis and autocorrelation.
result DSPM models accurately capture volatility clustering and noise mechanisms.

SignSGD outperforms SGD in linear regression with optimal scaling laws under PLRF model.

problem Improving linear regression performance with signSGD under power-law random features.
method Analysis of signSGD risk under PLRF model, comparison with SGD, identification of unique effects.
result SignSGD can have a steeper compute-optimal slope than SGD in noisy regimes, especially with WSD schedule.

Noise-robust Koopman operator framework for control with improved stability and performance.

problem Developing a stable and noise-robust Koopman operator for control tasks.
method Proposes a learning framework using Hankel matrix and neural network approximations for system dynamics, ensuring long-term stability and noise robustness.
result Demonstrates improved model performance and noise robustness in control tasks compared to existing methods.

I-BBS identifies latent sub-manifolds from distance matrices, robust to noise.

problem Identifying latent sub-manifolds from distance matrices in high-dimensional spaces.
method Coordinate-free inference using random distance matrix theory and generative noise models.
result Recovering latent geometry from integer-stable signatures of eigenvalues.

Recurrent neural networks trained on regular languages exhibit stable states that can recover from noise.

problem Stability of internal states in recurrent neural networks trained on regular languages.
method Empirical study with analysis of network activation and transitions between states.
result Recurrent neural networks trained on regular languages can recover from random perturbations and maintain stable states.

Study examines noise sensitivity of DNNs for binary classification.

problem Understanding non-robustness of DNN classifiers under noise.
method Defined and extended noise sensitivity and stability concepts for Boolean functions, applied to DNN models.
result Sorted out the relation between definitions and properties of DNN architectures under noise.

This paper studies least-square regression penalized with partly smooth convex regularizers. This class of functions is very large and versatile allowing to promote solutions conforming to some notion of low-complexity. Indeed, they force solutions of variational problems to belong to a low-dimensional manifold (the so…

2014-05-05abs ↗pdf ↗

SPPCSO addresses multicollinearity in high-dimensional data, improving model stability and predictive accuracy.

problem Multicollinearity in high-dimensional data leads to unstable estimation and reduced predictive accuracy.
method SPPCSO integrates principal component regression and L1 regularization to adaptively adjust shrinkage factors.
result SPPCSO achieves stable and reliable estimation in high-noise settings, distinguishing signal variables from noise.

New convergence rates for SGD under heavy-tailed noise with infinite variance.

problem Convergence analysis of SGD under heavy-tailed noise with infinite variance.
method Identifying a condition on the Hessian and providing a convergence rate for the distance to the global optimum.
result SGD can converge to the global optimum under heavy-tailed noise with infinite variance.

PiNGDA learns beneficial noise for graph augmentation stability.

problem Challenges in generating effective and stable graph augmentations.
method PiNGDA uses positive-incentive noise to scientifically analyze and generate beneficial graph augmentations.
result PiNGDA improves GCL performance by learning beneficial noise on graph topology and attributes.

Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.

problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.

SGLRW improves robustness of stochastic gradient MCMC methods.

problem Sensitivity to minibatch size and gradient noise in stochastic-gradient MCMC methods.
method Proposes Stochastic Gradient Lattice Random Walk (SGLRW) with lattice-based discretization.
result SGLRW remains stable in regimes where SGLD fails, including heavy-tailed gradient noise.

The paper improves conditions for unique recovery in homomorphic sensing of subspaces.

problem Unique recovery of points in a linear subspace from their images under linear maps.
method Tighter and simpler conditions for unique recovery in single and subspace arrangement cases, extending to noise stability.
result Conditions for unique recovery in homomorphic sensing are improved and unified.

This paper improves generative models by using data scaling and theoretical analysis.

problem Challenges in selecting noise distributions for stable learning in generative models.
method Introduces Scale-GAN, which uses data scaling and variance-based regularization.
result Data scaling controls the bias-variance trade-off and improves stability and accuracy.

Paper proposes a self-supervised method to denoise autoregressive signals with heavy-tailed noise.

problem Denoising autoregressive signals corrupted by heavy-tailed noise.
method Self-supervised learning approach without requiring full noise distribution knowledge.
result Strong denoising performance compared to baseline methods, especially for impulsive noise.

We study the effect of the stochastic gradient noise on the training of generative adversarial networks (GANs) and show that it can prevent the convergence of standard game optimization methods, while the batch version converges. We address this issue with a novel stochastic variance-reduced extragradient (SVRE) optimi…

2019-04-18abs ↗pdf ↗

We consider a statistical model for pairs of traded assets, based on a Cointegrated Vector Auto Regression (CVAR) Model. We extend standard CVAR models to incorporate estimation of model parameters in the presence of price series level shifts which are not accurately modeled in the standard Gaussian error correction mo…

2010-08-01abs ↗pdf ↗

WS diffusion models handle anisotropic Gaussian noise better than conventional methods.

problem Handling anisotropic Gaussian noise in imaging inverse problems.
method Whitened Score (WS) diffusion models based on stochastic differential equations.
result WS DMs outperform conventional DMs on anisotropic Gaussian noise.

This paper investigates the problem of sparse signal recovery in the presence of additive impulsive noise. The heavytailed impulsive noise is well modelled with stable distributions. Since there is no explicit formulation for the probability density function of SαSSαS distribution, alternative approximations like Genera…

2018-04-12abs ↗pdf ↗

Study improves parameter estimation for SDEs driven by Levy noise.

problem Challenges in estimating parameters of SDEs with non-Gaussian noises.
method Introduces PEnet, a CNN-LSTM model for efficient parameter estimation.
result PEnet offers superior accuracy and adaptability for various SDE scenarios.

Estimates graph process with high-frequency data, proving asymptotic properties.

problem Estimating graph process with high-frequency data.
method Discretized maximum likelihood estimators for GrOU process under high-frequency sampling.
result Asymptotic central limit theorems for estimators under finite and infinite jump activity.

The paper addresses online prediction in marginally stable systems with bounded perturbations.

problem Online prediction in marginally stable linear dynamical systems with adversarial or stochastic perturbations.
method The online least-squares algorithm is used to achieve sublinear regret, with a refined regret analysis and a structural lemma.
result The online least-squares algorithm achieves sublinear regret, with polynomial dependence on the system's parameters.

Robustly estimates linear regression coefficients with adversarial and noisy data.

problem Estimating robust linear regression coefficients with adversarial and noisy data.
method Adversarial robust weighted Huber regression with polynomial computational complexity.
result Derives an estimation error bound that depends on the stable rank and condition number of the covariance matrix.