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

Trend · papers per month

77155232309 · May 202619922001200920172026
48 results for asymptotic white Gaussian

The paper bounds estimation and prediction errors in time series using entropy.

problem Estimating and predicting errors in time series analysis.
method Information-theoretic approach focusing on conditional entropy.
result Generic bounds on estimation and prediction errors determined by conditional entropy.

Random neural networks with ReLU activations are non-Gaussian processes.

problem Understanding the behavior of neural networks with random initialization and rectified linear units.
method Proving these networks are non-Gaussian processes and deriving their properties.
result These networks can converge to non-Gaussian processes under certain conditions.

We investigate and compare the fundamental performance of several distributed learning methods that have been proposed recently. We do this in the context of a distributed version of the classical signal-in-Gaussian-white-noise model, which serves as a benchmark model for studying performance in this setting. The resul…

2017-11-08abs ↗pdf ↗

Study analyzes correlation structure in two-factor Hull-White model for XVA calculations.

problem Capturing the correlation structure in two-factor Hull-White model for accurate XVA calculations.
method Combination of approximation formula and Monte-Carlo simulation to investigate correlation structure.
result Hull-White model effectively captures de-correlation of the yield curve under specific parameter conditions.

Paper presents a fast algorithm for pricing Bermudan swaptions under the two-factor Hull-White model.

problem Evaluating Bermudan swaption prices under the two-factor Hull-White model with high computational efficiency.
method Discretization of expected value calculation, Gaussian kernel sums, fast Gauss transform, grid rotation for stability.
result Significant reduction in computation time and improved stability for correlation close to -1.

Recursive KalmanNet combines neural networks with Kalman filters for precise state estimation.

problem State estimation in systems with noisy measurements and non-Gaussian noise.
method Recursive KalmanNet uses a recurrent neural network to estimate states with consistent error covariance, optimizing for Gaussian negative log-likelihood.
result Recursive KalmanNet outperforms conventional Kalman filters and deep learning-based estimators in non-Gaussian noise conditions.

ODS improves adversarial attacks by maximizing output diversity.

problem Efficiency and effectiveness of adversarial attacks, especially black-box attacks.
method Output Diversified Sampling (ODS) that maximizes diversity in model outputs.
result ODS reduces the number of queries needed for black-box attacks on ImageNet by a factor of two.

We study the compact noncollapsed ancient convex solutions to Mean Curvature Flow in Rn+1\mathbb{R}^{n+1} with O(1)×O(n)O(1)\times O(n) symmetry. We show they all have unique asymptotics as tt\to -\infty and we give precise asymptotic description of these solutions. In particular, solutions constructed by White, and Haslhofer …

2015-03-04abs ↗pdf ↗

Researchers disrupt Gaussian model inference to test adversarial attacks.

problem Disrupting conditional inference in multivariate Gaussian models under adversarial conditions.
method Considered white- and grey-box settings with complete and incomplete knowledge of the Gaussian distribution, respectively. Reduced to quadratic and stochastic quadratic programs. Derived structural properties for solution methods.
result Demonstrated the impact and efficacy of attacks in various applications, including real estate evaluation, interest rate estimation, and signals processing.

Generative Adversarial Nets (GANs) and Variational Auto-Encoders (VAEs) provide impressive image generations from Gaussian white noise, but the underlying mathematics are not well understood. We compute deep convolutional network generators by inverting a fixed embedding operator. Therefore, they do not require to be o…

2018-05-17abs ↗pdf ↗

WSINDy algorithm proves robust to noise in identifying differential equations.

problem Identifying differential equations from noisy data.
method Weak-form sparse identification of nonlinear dynamics (WSINDy) algorithm.
result WSINDy is asymptotically consistent for a wide class of models, including Navier-Stokes and Kuramoto-Sivashinsky equations.

Paper defends machine learning models from adversarial attacks using GLRT.

problem Adversarial attacks on machine learning models leading to misclassification.
method Generalized likelihood ratio test (GLRT) for robust classification.
result GLRT yields performance competitive with minimax approach under worst-case attacks, and better trade-off under weaker attacks.

Paper uses RL to optimize bit-flipping decoding for binary codes.

problem Improving bit-flipping decoding for binary linear codes.
method Mapped iterative decoding algorithms to MDPs for reinforcement learning.
result Learned BF decoders offer performance-complexity trade-offs and near-optimal performance.

We define a relative entropy for two expanding solutions to mean curvature flow of hypersurfaces, asymptotic to the same cone at infinity. Adapting work of White and using recent results of Bernstein and Bernstein-Wang, we show that expanders with vanishing relative entropy are unique in a generic sense. This also impl…

2018-12-20abs ↗pdf ↗

Colored noise improves neural network robustness against adversarial attacks.

problem Vulnerability of neural networks to adversarial perturbations.
method Injection of colored noise into network weights and activations during adversarial training.
result Our approach outperforms previous methods in terms of adversarial accuracy on CIFAR-10 and CIFAR-100 datasets.

Approximates option prices in Barndorff-Nielsen and Shephard models using Taylor expansion.

problem Approximating option prices in complex stochastic volatility models.
method Taylor expansion and recursive algorithm for closed-form approximations.
result Explicit results for inverse Gaussian and gamma stationary distributions, with favorable comparisons to characteristic function.

Paper uses VAEs to detect radar targets in complex noise.

problem Detecting radar targets in compound clutter and thermal noise.
method Proposes a VAE architecture to distinguish radar targets from various noise types.
result The VAE outperforms classical detectors in challenging noise conditions.

The paper proves lower bounds for Gaussian-weighted curvature integrals of self-shrinkers.

problem Proving lower bounds for Gaussian-weighted \(L^2\)-curvature integrals of self-shrinkers.
method Combining normal coordinate functions with weighted Poincaré inequalities and first-eigenvalue estimates.
result Explicit lower bounds in terms of entropy for closed self-shrinkers, leading to curvature gaps.

G-framework is presented by Peng [41] for measure risk under uncertainty. In this paper, we define fractional G-Brownian motion (fGBm). Fractional G-Brownian motion is a centered G-Gaussian process with zero mean and stationary increments in the sense of sub-linearity with Hurst index H(0,1)H\in (0,1). This process has sta…

2013-06-18abs ↗pdf ↗

We present the Causal Gaussian Process Convolution Model (CGPCM), a doubly nonparametric model for causal, spectrally complex dynamical phenomena. The CGPCM is a generative model in which white noise is passed through a causal, nonparametric-window moving-average filter, a construction that we show to be equivalent to …

2018-02-22abs ↗pdf ↗

We consider the stochastic volatility model dSt=σtStdWt,dσt=ωσtdZtdS_t = σ_t S_t dW_t,dσ_t = ωσ_t dZ_t, with (Wt,Zt)(W_t,Z_t) uncorrelated standard Brownian motions. This is a special case of the Hull-White and the β=1β=1 (log-normal) SABR model, which are widely used in financial practice. We study the properties of this model, discretized in …

2017-07-04abs ↗pdf ↗

Optimal data splitting improves covariance matrix estimation in large datasets.

problem Improving large covariance matrix estimation in high-dimensional settings.
method Focus on holdout method, derive closed-form error expression, connect to eigenvalue variance.
result Optimal train-test split scales as square root of matrix dimension.

A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, today's denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorit…

2014-06-16abs ↗pdf ↗

Novel 3D U-Net method for fast, reproducible white matter tract segmentation.

problem Challenges in fast and consistent white matter tract segmentation from diffusion tensor MRI.
method Convolutional neural network (3D U-Net) trained on a large DTI dataset.
result Reproducibility and accuracy of tract-specific diffusion measures.

We develop the notion of Brakke flow with free-boundary in a barrier surface. Unlike the classical free-boundary mean curvature flow, the free-boundary Brakke flow must "pop" upon tangential contact with the barrier. We prove a compactness theorem for free-boundary Brakke flows, define a Gaussian monotonicity formula v…

2016-02-11abs ↗pdf ↗

We propose a family of models that enable predictive estimation of time-varying extreme event probabilities in heavy-tailed and nonlinearly dependent time series. The models are a white noise process with conditionally log-Laplace stochastic volatility. In contrast to other, similar stochastic volatility formalisms, th…

2019-01-08abs ↗pdf ↗

We study the fair strike of a discrete variance swap for a general time-homogeneous stochastic volatility model. In the special cases of Heston, Hull-White and Schobel-Zhu stochastic volatility models we give simple explicit expressions (improving Broadie and Jain (2008a) in the case of the Heston model). We give condi…

2013-05-30abs ↗pdf ↗

Estimates localized complexity of white-matter wiring using GANs.

problem Complexity of white-matter wiring, especially in ambiguous regions, confounds analysis.
method Bayesian estimate of heteroscedastic aleatoric uncertainty through image inpainting.
result Localized wiring complexity quantified, directly reflecting difficulty of lesion inpainting.

A new machine learning method for Bayesian inverse problems in function spaces.

problem Bayesian inverse problems in function spaces with incompatibility of white noise sources.
method One-step generative transport with amortized neural operator and prior-aligned Gaussian random field.
result Generative operator trained on prior samples and noisy observations generates posterior samples efficiently.

Study on manifolds with kinks and Gaussian kernel behavior.

problem Understanding the asymptotic behavior of graph Laplacian on manifolds with singularities.
method Introduced manifolds with kinks, derived asymptotic behavior of Graph Laplacian with Gaussian kernel, and validated results numerically.
result Asymptotic behavior of the Graph Laplacian is determined by the inward sector of the tangent space.

The paper explores the trade-off between bias and variance in high-dimensional models.

problem Understanding the unavoidable trade-off between bias and variance in high-dimensional statistical models.
method Proposes a general strategy to obtain lower bounds on the variance of estimators with a specified bias, and applies it to various statistical models.
result Shows the extent to which the bias-variance trade-off is unavoidable and quantifies the performance loss for methods that do not balance it.

Study connects compressed signal to AWGN model for risk estimation.

problem Estimating high-dimensional signals under compression constraints.
method Utilizes Gaussian approximation and Wasserstein distance to relate compressed and noisy signals.
result Establishes a connection between estimator risks under different conditions.

In this paper, we present new results on using orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries for complex cases (i.e., complex measurement vector, complex dictionary and complex additive white Gaussian noise (CAWGN)). A sufficient condition that OMP can recover …

2012-06-11abs ↗pdf ↗