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

Trend · papers per month

70141211281 · Jun 202019922001200920182026
48 results for Non-Gaussian inputs

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.

The paper analyzes how gradient descent learns convolutional filters for non-Gaussian inputs.

problem Learning convolutional filters with ReLU for non-Gaussian input distributions.
method Analysis of gradient descent convergence for ReLU activation with polynomial time complexity.
result Gradient descent can learn convolutional filters in polynomial time, with convergence rate dependent on input distribution smoothness and patch similarity.

The ACCRU framework improves probabilistic forecasts by capturing input-dependent uncertainty.

problem Uncertainty in deterministic predictions, especially for skewed and non-Gaussian errors.
method Neural network trained with a loss function balancing accuracy and reliability to learn input-dependent, non-Gaussian uncertainty distributions.
result Improves probabilistic forecasts relative to existing methods, capturing skewed and non-Gaussian errors.

GGMPs improve non-Gaussian conditional density estimation.

problem Multimodality, heteroscedasticity, and strong non-Gaussianity in conditional density estimation.
method GGMP combines local Gaussian mixture fitting, cross-input component alignment, and per-component heteroscedastic GP training.
result GGMPs improve distributional approximation on synthetic and real-world datasets.

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.

Robust method estimates state, input, and parameters of linear systems online.

problem Joint estimation of state, input, and parameters in noisy or outlier-prone measurements.
method Combines recursive, alternating, and iteratively-reweighted least squares into a single algorithm.
result Good performance in presence of outliers and compared to state-of-the-art methods.

Learning rate needs to decrease with higher data moments for effective ICA in high dimensions.

problem Slower convergence of ICA in high-dimensional data with high-order moments.
method High-dimensional ODE analysis of ICA algorithm under controlled moment structure.
result Critical learning rate threshold for effective ICA when moments are high.

This paper improves GP for learning complex data distributions.

problem Vanilla Gaussian processes struggle with complex data distributions.
method Introduces scalable GP paradigms with latent variables and variational inference.
result Scalable modulated GPs, especially latent GPs, learn diverse data distributions better.

New framework models neural systems with random architecture on manifolds.

problem Complex, uncertain systems with non-Gaussian outputs.
method Latent random field on compact manifold generates neural architecture and weights.
result Synthetic neural systems can produce stochastic outputs for deterministic inputs.

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.

LNGCA extends ICA to non-Gaussian signals and noise, improving estimation and testing.

problem Modeling multivariate data with non-Gaussian components and Gaussian noise.
method Linear latent factor model, simultaneous estimation of non-Gaussian and Gaussian components, discrepancy maximization, resampling-based test.
result Improved estimation and testing of non-Gaussian components over competing methods.

The paper tackles Bayesian inference with small datasets using manifold learning.

problem Small datasets challenge Bayesian inference with non-Gaussian models.
method Manifold learning and sampling for Bayesian posterior approximation.
result The method effectively samples Bayesian posteriors with non-Gaussian models from small datasets.

Researchers derive exact priors for finite Bayesian neural networks.

problem Understanding non-Gaussian priors in finite Bayesian neural networks.
method Analytical derivation of function space priors for finite fully-connected feedforward networks.
result Exact solutions for priors of finite networks, including Meijer G-function for linear networks and mixtures for ReLU networks.

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.

Finite-width neural networks use non-Gaussian priors, extending Gaussian process theory.

problem Understanding the behavior of neural networks with finite width.
method Perturbative extension of Gaussian process theory to finite-width neural networks, tracking preactivation distributions.
result Non-Gaussian processes as priors in finite-width neural networks.

Paper proposes a generalized precision matrix for t-Student distributions to improve portfolio optimization.

problem Limitations of inverse covariance matrix in non-Gaussian settings.
method Exploits local dependence function to define generalized precision matrix (GPM) for multivariate t-Student distribution.
result GPM leads to statistically significant lower out-of-sample variances in minimum-variance portfolios.

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.

Study improves regression models for non-Gaussian noise and outliers using correntropy.

problem Improving regression models for non-Gaussian noise and outliers.
method Introduces mixture of symmetric stable noise and uses correntropy for regression.
result Establishes asymptotic optimal learning rates for correntropy based regression.

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.

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.

We use Gaussian processes to estimate conditional distributions with latent variables.

problem Challenging task of estimating conditional distributions with model complexity and overfitting trade-offs.
method Extend model input with latent variables and use Gaussian processes for mapping.
result Bayesian approach allows for modeling small datasets and applying to big data.

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.

Max-margin classifiers' behavior is studied in high dimensions with non-Gaussian features.

problem Understanding the role of featurization maps and high-dimensional misclassification error.
method High-dimensional asymptotics, Gaussian model, support vector representation.
result Asymptotic behavior of max-margin classifiers is determined by feature covariance and label covariance.

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 ↗

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.

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.

Transformer with denoising diffusion improves probabilistic density estimation.

problem Estimating non-Gaussian and multimodal probability distributions for regression problems.
method Training a denoising diffusion head on top of a Transformer model.
result The model provides reasonable probability density estimation for high-dimensional inputs.

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 ↗

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.

Develops a novel method to estimate non-Gaussian hydraulic conductivities efficiently.

problem Estimation of non-Gaussian hydraulic conductivity fields in subsurface flow models.
method Integrates adversarial autoencoders with residual dense convolutional networks for parameterization and surrogate modeling.
result Significantly reduces computation time for accurate inversion results.

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.