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

Trend · papers per month

52105157209 · May 202619922001200920172026
48 results for Non-Gaussian Targets

New method detects causal relationships from noisy measurements.

problem Discover causal relationships from noisy, imperfect measurements.
method Transformed Independent Noise (TIN) condition and ordered group decomposition.
result Identifies causal graph structure without over-complete ICA.

Sparse non-Gaussian component analysis (SNGCA) is an unsupervised method of extracting a linear structure from a high dimensional data based on estimating a low-dimensional non-Gaussian data component. In this paper we discuss a new approach to direct estimation of the projector on the target space based on semidefinit…

2011-06-01abs ↗pdf ↗

SKT improves EKI for Bayesian inverse problems with non-Gaussian targets.

problem Efficiently solving Bayesian inverse problems with expensive forward models and non-Gaussian posterior distributions.
method Embedding EKI and FAKI within a Bayesian annealing scheme to adapt tpCN sampler.
result Significant improvements in convergence rate compared to standard SMC and pCN.

This work extends Tweedie's formulae to non-Gaussian processes for better diffusion model generation.

problem Limited exploration of non-Gaussian diffusion models and corresponding Tweedie's formulae.
method Extended Tweedie's formulae to geometric Brownian motion, squared Bessel, and Cox-Ingersoll-Ross processes.
result Demonstrated potential of non-Gaussian models in image and financial time series generation.

This paper extends explainability methods to non-Gaussian Gaussian Processes.

problem Making non-Gaussian GP models transparent and explainable.
method Proposes Integrated Gradient-based explainability for non-Gaussian GP models.
result Offers both analytical and approximate solutions for non-Gaussian GP models.

Proposes a deep model for Bayesian quantile regression without Gaussian assumptions.

problem Uncertainty quantification from single forward-pass models is computationally expensive and restrictive.
method Deep evidential learning for Bayesian quantile regression.
result Achieves calibrated uncertainties on non-Gaussian distributions.

We revisit the Bayesian online inference problems for the linear dynamic systems (LDS) under non- Gaussian environment. The noises can naturally be non-Gaussian (skewed and/or heavy tailed) or to accommodate spurious observations, noises can be modeled as heavy tailed. However, at the cost of such noise robustness, the…

2015-04-22abs ↗pdf ↗

New methods use transport maps to improve Langevin dynamics for sampling.

problem Sampling high-dimensional, non-Gaussian distributions efficiently.
method Apply transport maps to accelerate Langevin dynamics convergence.
result Discretized processes converge to target distribution with non-asymptotic bounds.

This paper proposes a method to approximate non-Gaussian likelihoods in Gaussian Processes.

problem Approximating non-Gaussian likelihoods in Gaussian Processes.
method Proposes a piece-wise constant approximation for the inverse-link function.
result Yields a closed form solution for the SVGP lower bound.

Quantum model captures rare financial events not seen by Gaussian statistics.

problem Underestimation of rare financial events by Gaussian statistics.
method Quantum Bohmian Mechanics applied to multifractal random walk (MRW) models.
result Rare financial events generate a potential barrier in quantum potentials.

We investigate the low-dimensional structure of deterministic transformations between random variables, i.e., transport maps between probability measures. In the context of statistics and machine learning, these transformations can be used to couple a tractable "reference" measure (e.g., a standard Gaussian) with a tar…

2017-03-17abs ↗pdf ↗

Efficiently transforms Gaussian data to simulate various target distributions.

problem Generating observations from different target distributions given a single Gaussian observation.
method Designs computationally efficient procedures to approximate target distributions.
result Establishes reduction-based computational lower bounds for high-dimensional statistical models.

We investigate the ability of popular flow based methods to capture tail-properties of a target density by studying the increasing triangular maps used in these flow methods acting on a tractable source density. We show that the density quantile functions of the source and target density provide a precise characterizat…

2019-07-10abs ↗pdf ↗

EigenVI uses orthogonal function expansions for efficient variational inference.

problem Efficiently approximate complex distributions in variational inference.
method EigenVI constructs variational approximations using orthogonal function expansions, minimizing Fisher divergence.
result EigenVI provides more accurate approximations than existing methods for Gaussian BBVI.

The paper analyzes the non-Gaussian behavior of inflation and unemployment over 70 years using multifractal methods.

problem Capturing unusual fluctuations in inflation and unemployment over long periods.
method Coupled multifractal approach to analyze non-Gaussian distributions of inflation and unemployment over 70 years.
result The non-Gaussianity of unemployment is noticeable only for periods smaller than 1 year, while inflation's non-Gaussianity persists across all time scales.

Independent component analysis (ICA) decomposes multivariate data into mutually independent components (ICs). The ICA model is subject to a constraint that at most one of these components is Gaussian, which is required for model identifiability. Linear non-Gaussian component analysis (LNGCA) generalizes the ICA model t…

2017-12-23abs ↗pdf ↗

ICA reveals deep learning's feature learning mechanisms from non-Gaussian data.

problem Understanding feature learning from non-Gaussian inputs in deep neural networks.
method Investigates ICA and SGD on synthetic and real data.
result FastICA requires nd4n \gtrsim d^4 samples for single non-Gaussian direction recovery, while SGD outperforms and optimised SGD reaches nd2n \gtrsim d^2.

This paper proposes a new method for conditional sampling using optimal transport.

problem Sampling conditional distributions in Bayesian inference and density estimation.
method Iterative block-triangular transport maps solving an optimal transport problem with a weighted L2 cost function.
result The proposed method extends the data-driven approach for conditional sampling.

Improves graph-based active learning for non-Gaussian models.

problem Efficiently selecting data points for labeling in graph-based semi-supervised learning.
method Approximates non-Gaussian distributions, introduces rank-one update and model change acquisition function.
result Enhanced active learning for graph-based SSL under non-Gaussian models.

This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.

problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.

The paper finds non-Gaussian directions in high-dimensional data using Wasserstein distance.

problem Locating interesting non-Gaussian features in high-dimensional data.
method Projection pursuit using 2-Wasserstein distance to maximize the difference from Gaussian.
result Statistical guarantees for accurately approximating an unknown low-dimensional non-Gaussian subspace.

Paper integrates real data into probabilistic models using Fourier transform.

problem Learning from constrained data sets in high dimensions.
method Functional approach based on weak formulation of Fourier transform of probability measures.
result Estimation of posterior probability measures for QoI and QoI with control parameter.

A new vine copula mixture model improves clustering accuracy for non-Gaussian data.

problem Finite mixture models struggle with asymmetric tail dependencies and non-elliptical clusters.
method Proposes a vine copula mixture model for clustering non-Gaussian data, addressing model selection and parameter estimation.
result Significant improvement in clustering accuracy for data with asymmetric tail dependencies or non-Gaussian margins.

This paper presents a method for efficient density estimation in nonlinear systems.

problem Accurate representation of non-Gaussian distributions in nonlinear dynamical systems is challenging.
method Uses Seminonparametric (SNP) densities with probabilists' Hermite polynomial basis and Monte Carlo approximation for maximum likelihood estimation.
result Demonstrates that the method can accurately capture non-Gaussian density structure and compute quantiles using fewer samples than raw Monte Carlo.

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.

Algorithm learns non-Gaussian graphical models via Hessian scores and triangular transport.

problem Learning graph structure from non-Gaussian data.
method Score based on integrated Hessian information, coupled with triangular transport map.
result Algorithm successfully recovers graph structure for non-Gaussian data.

We show that stochastic interpolation flow maps are Lipschitz with a sharp constant.

problem High dimensional sampling and transport problems.
method Investigating stochastic interpolation flow for generating data samples.
result Stochastic interpolation flow maps are Lipschitz with a sharp constant matching optimal transport maps.

Non-Gaussian component analysis (NGCA) is an unsupervised linear dimension reduction method that extracts low-dimensional non-Gaussian "signals" from high-dimensional data contaminated with Gaussian noise. NGCA can be regarded as a generalization of projection pursuit (PP) and independent component analysis (ICA) to mu…

2016-03-03abs ↗pdf ↗

Study large deviations in fractional volatility models with non-Gaussian volatility.

problem Large deviations in fractional volatility models with non-Gaussian volatility.
method Established a small-noise large deviation principle for log-price.
result Logarithmic call price asymptotics for large strikes in a special case.

Gaussian processes are ubiquitous in nature and engineering. A case in point is a class of neural networks in the infinite-width limit, whose priors correspond to Gaussian processes. Here we perturbatively extend this correspondence to finite-width neural networks, yielding non-Gaussian processes as priors. The methodo…

2019-09-30abs ↗pdf ↗

Study of a risk-averse informed trader in a multi-asset market with non-Gaussian prices.

problem Existence of equilibrium in a multi-asset market with non-Gaussian prices and a risk-averse informed trader.
method Constructed equilibrium using Fokker-Planck equation and coupled partial differential equations with an optimal transport constraint.
result Equilibrium exists in a market with multiple assets and non-Gaussian prices.

BaM improves BBVI by optimizing a score-based divergence, leading to faster convergence.

problem Slow convergence of black-box variational inference methods.
method Batch and match (BaM) approach based on a score-based divergence.
result BaM converges exponentially quickly to the target mean and covariance.

Method extracts governing laws from non-Gaussian stochastic systems data.

problem Modeling complex dynamics with non-Gaussian Lévy noise.
method Data-driven method to extract stochastic dynamical systems from noisy data.
result Established a theoretical framework and numerical algorithm to compute Lévy jump measure, drift, and diffusion.

Efficiently learns linear non-Gaussian DAGs with noisy nodes.

problem Learning DAGs with non-Gaussian noise and diverging number of nodes.
method Proposes a novel method using topological layers for bottom-up reconstruction and consistent parent-child relations.
result Topological layers can be exactly reconstructed and parent-child relations established without faithfulness assumption.

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.