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

90180269359 · Jun 202019922001200920172026
48 results for linear non-Gaussian

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 ↗

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 reviews identifiability in linear and nonlinear models, from Gaussian to non-Gaussian.

problem Identifiability issues in latent-variable and structural-equation models, especially in nonlinear cases.
method Review of identifiability theory for linear and nonlinear models, including factor analysis and structural equation models.
result Even nonparametric nonlinear models can be estimated with additional assumptions.

Non-Gaussian component analysis (NGCA) is aimed at identifying a linear subspace such that the projected data follows a non-Gaussian distribution. In this paper, we propose a novel NGCA algorithm based on log-density gradient estimation. Unlike existing methods, the proposed NGCA algorithm identifies the linear subspac…

2016-01-28abs ↗pdf ↗

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.

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 ↗

Study non-Gaussian measures' concentration properties in metric spaces.

problem Concentration properties for non-linear Gaussian functionals with non-Gaussian tails.
method Prove generalised Transportation-Cost Inequalities (TCIs) for specific functionals.
result Extended TCIs for rough volatility and Parabolic Anderson Model.

In recent years, several methods have been proposed for the discovery of causal structure from non-experimental data (Spirtes et al. 2000; Pearl 2000). Such methods make various assumptions on the data generating process to facilitate its identification from purely observational data. Continuing this line of research, …

2012-07-04abs ↗pdf ↗

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 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.

Study identifies parameters in causal models with latent confounding.

problem Parameter identification in linear non-Gaussian causal models with latent confounding.
method Graphical criterion for necessary and sufficient identifiability of direct causal effects, with polynomial-time algorithm.
result Developed a graphical criterion for identifying direct causal effects in latent variable models with arbitrary non-linear confounding.

Paper optimizes WGAN parameters for non-Gaussian data.

problem Optimizing parameters for non-Gaussian data in WGAN.
method Characterization of optimal solutions for population WGAN beyond LQG setting, using sliced Wasserstein framework.
result Closed-form optimal parameters for non-linear activation functions and non-Gaussian data derived.

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.

This work preserves linear invariants in ensemble filters for non-Gaussian data assimilation.

problem Maintaining critical invariants like mass, stoichiometric balance, and charge in non-Gaussian data assimilation.
method Introducing a novel class of nonlinear ensemble filters using measure transport theory.
result Recovery of a constrained Kalman filter for Gaussian settings and combination with regularization techniques.

OT-ICA uses optimal transport to find independent components, outperforming traditional methods.

problem Finding independent components from linear mixtures of signals.
method OT-ICA uses the squared Wasserstein distance to maximize non-Gaussianity, optimizing projections via gradient descent.
result OT-ICA outperforms traditional proxy-based methods in various applications.

New method learns graph structure with hidden causes from observational data.

problem Learning the structure of linear non-Gaussian models with hidden causes.
method Augments hidden variable structure by learning multidirected edges and uses higher order cumulants.
result Correct structure recovery for bow-free acyclic mixed graphs with multi-directed edges.

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 ↗

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.

A linear non-Gaussian structural equation model called LiNGAM is an identifiable model for exploratory causal analysis. Previous methods estimate a causal ordering of variables and their connection strengths based on a single dataset. However, in many application domains, data are obtained under different conditions, t…

2011-04-28abs ↗pdf ↗

We consider learning the possible causal direction of two observed variables in the presence of latent confounding variables. Several existing methods have been shown to consistently estimate causal direction assuming linear or some type of nonlinear relationship and no latent confounders. However, the estimation resul…

2013-10-24abs ↗pdf ↗

ICA accurately estimates treatment effects even with confounders.

problem Estimating treatment effects in the presence of confounding variables.
method Uses Independent Component Analysis (ICA) to identify latent sources and estimate mixing coefficients.
result Linear ICA can consistently estimate multiple treatment effects, even with Gaussian confounders, and is more sample-efficient than Orthogonal Machine Learning (OML).

New robust discriminant analysis for non-Gaussian data.

problem Classical discriminant analysis struggles with non-Gaussian distributions and contaminated datasets.
method Each data point follows its own ES distribution with arbitrary scale, leading to robust classification.
result Maximum-likelihood estimation and classification are simple, fast, and robust.

New algorithm identifies causal effects in latent confounding models.

problem Identifying causal effects in linear non-Gaussian models with latent confounding.
method Recursive algorithm using rank conditions on higher-order cumulants.
result Algorithm achieves comparable performance to overcomplete ICA without knowing the number of latent variables.

A new robust and flexible classification method for non-Gaussian data.

problem Robustness to scale changes and non-Gaussian distributions in classical discriminant analysis.
method FEMDA uses arbitrary Elliptically Symmetrical distributions and scale parameters for each data point.
result FEMDA is robust to scale changes and outperforms other methods.

Adaptive algorithm improves nonlinear data assimilation for non-Gaussian systems.

problem Challenges of non-Gaussian statistics in data assimilation.
method Triangular measure transport with P-spline basis functions and an information criterion.
result Automatic selection of parsimonious parametrization for efficient adaptation.

A new factor analysis method using ICA reduces portfolio concentration and diversifies excess kurtosis.

problem Standard factor analysis suffers from issues with pairwise correlations of asset returns.
method Identifies factors based on non-Gaussianity instead of variance, using ICA.
result Fat-tailed portfolios significantly reduce portfolio concentration and winner-takes-all problem.

Optimizes experiment design for causal structure learning in linear models with cycles.

problem Causal structure learning from combined observational and interventional data in linear non-Gaussian cyclic models.
method Combinatorial characterization of equivalence classes, adaptive stochastic optimization, greedy policy with near-optimal performance guarantee, sampling-based estimator for reward function.
result Optimal experiment design reduces the equivalence class of causal graphs to a single true graph with a small number of interventions.

Study of deep linear neural networks with proportional width and depth.

problem Lack of descriptive power in Gaussian limit of deep linear neural networks.
method Proportional infinite-width infinite-depth limit for deep linear neural networks.
result Characterization of limiting distribution as a nontrivial mixture of Gaussians.

Study on linear regression with dependent covariates, proving universality and error characterization.

problem Linear regression with dependent covariates in high-dimensional settings.
method Analysis of ridge regression performance, Gaussian universality theorem, spectral properties of covariance matrices.
result Asymptotic performance of ridge regression is invariant under non-Gaussian covariates with preserved mean and covariance.