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

15304459 · May 202619922001200920172026
48 results for NIG mixtures

Improved VB algorithm for NIG mixtures outperforms Gaussian mixtures for non-Gaussian data.

problem Clustering non-Gaussian data, especially heavy-tailed and asymmetric.
method Proposed an improved VB algorithm for NIG mixture models and extended Dirichlet process mixture models.
result Outperforms Gaussian mixtures and existing NIG mixture models, especially for highly non-normative data.

A new model forecasts Value-at-Risk using NIG distribution and dynamic scores.

problem Forecasting Value-at-Risk (VaR) in financial markets.
method Proposes a parametric forecasting model based on the normal inverse Gaussian distribution (NIG) incorporating intraday information.
result The model outperforms traditional GARCH models, especially in high-risk scenarios.

Proposes a simpler method for quantifying uncertainty in time-series with volatility clustering.

problem Uncertainty quantification for time-series with volatility clustering.
method Proposes a Scale Mixture Distribution to quantify return forecast uncertainty in neural networks.
result The proposed method provides a favorable complexity-accuracy trade-off and separates model parameters into subnetworks.

We introduce a wavelet-domain functional analysis of variance (fANOVA) method based on a Bayesian hierarchical model. The factor effects are modeled through a spike-and-slab mixture at each location-scale combination along with a normal-inverse-Gamma (NIG) conjugate setup for the coefficients and errors. A graphical mo…

2016-02-12abs ↗pdf ↗

In this paper, an application of three GARCH-type models (sGARCH, iGARCH, and tGARCH) with Student t-distribution, Generalized Error distribution (GED), and Normal Inverse Gaussian (NIG) distribution are examined. The new development allows for the modeling of volatility clustering effects, the leptokurtic and the skew…

2019-09-11abs ↗pdf ↗

In this work, we study the value of an Asian option in the case of exponential Levy markets. More specifically, we are interested in the NIG (normal inverse Gaussian) the VG (variance gamma) models. The exponential Levy models produce incomplete markets. There are therefore an infinite number of equivalent martingale m…

2017-06-05abs ↗pdf ↗

The paper integrates behavioral distortions into portfolio optimization using implied probability weighting functions.

problem Behavioral distortions in probability weighting affect portfolio optimization under different return distributions.
method Developed a unified framework to extract probability weighting functions from optimal portfolios modeled under Gaussian and NIG distributions.
result Increasing tail fatness amplifies behavioral distortions, and shifts in risk-free rates alter the curvature of these distortions.

Closed-form formulas for path-independent options in a specific Lévy model.

problem Valuation of path-independent options in the exponential NIG model.
method Closed-form pricing formulas derived using a factorized representation in Mellin space and complex analysis.
result Valid closed-form formulas with quickly convergent series for various options.

We provide an integral representation for the (implied) copulas of dependent random variables in terms of their moment generating functions. The proof uses ideas from Fourier methods for option pricing. This representation can be used for a large class of models from mathematical finance, including Lévy and affine proc…

2011-08-04abs ↗pdf ↗

We apply multilevel Monte Carlo for option pricing problems using exponential Lévy models with a uniform timestep discretisation to monitor the running maximum required for lookback and barrier options. The numerical results demonstrate the computational efficiency of this approach. We derive estimates of the convergen…

2014-03-20abs ↗pdf ↗

One popular approach to option pricing in Lévy models is through solving the related partial integro differential equation (PIDE). For the numerical solution of such equations powerful Galerkin methods have been put forward e.g. by Hilber et al. (2013). As in practice large classes of models are maintained simultaneous…

2016-03-27abs ↗pdf ↗

In this paper we present an application of the use of autocopulas for modelling financial time series showing serial dependencies that are not necessarily linear. The approach presented here is semi-parametric in that it is characterized by a non-parametric autocopula and parametric marginals. One advantage of using au…

2015-07-16abs ↗pdf ↗

We consider unsupervised estimation of mixtures of discrete graphical models, where the class variable corresponding to the mixture components is hidden and each mixture component over the observed variables can have a potentially different Markov graph structure and parameters. We propose a novel approach for estimati…

2012-03-04abs ↗pdf ↗

When estimating finite mixture models, it is common to make assumptions on the mixture components, such as parametric assumptions. In this work, we make no distributional assumptions on the mixture components and instead assume that observations from the mixture model are grouped, such that observations in the same gro…

2016-06-30abs ↗pdf ↗

The two most extended density-based approaches to clustering are surely mixture model clustering and modal clustering. In the mixture model approach, the density is represented as a mixture and clusters are associated to the different mixture components. In modal clustering, clusters are understood as regions of high d…

2016-09-15abs ↗pdf ↗

Optimal mixtures of generative models outperform individual models on image datasets.

problem Selecting the best single model from a group of trained generative models.
method Formulated a quadratic optimization problem and proposed the Mixture-UCB algorithm for efficient selection.
result Mixture of generative models achieves better evaluation scores than individual models on benchmark datasets.

New bounds on sample size for identifying mixture models with grouped samples.

problem Identifying mixture models with minimal sample size.
method Generalized identifiability bounds for mixture models with grouped samples.
result Identifiability with (2m1)/(k1)(2m-1)/(k-1) samples per group, with no improvement possible.

Bayesian approach learns nonparametric mixture components from heterogeneous data.

problem Realistic modeling of heterogeneous data populations with nonparametric mixture components.
method Bayesian nonparametric modeling using Dirichlet process mixture priors.
result Posterior contraction rates for component densities are nearly polynomial, improving over deconvolution methods.

Robust learning mixtures of linear regressions improve robustness.

problem Improving robustness in learning mixtures of linear regressions.
method Connecting mixtures of linear regressions and mixtures of Gaussians with thresholding for a quasi-polynomial time algorithm.
result The algorithm has significantly better robustness than previous results.

A new method detects outliers using ensembles of Dirichlet process mixtures.

problem Challenges in unsupervised outlier detection using Dirichlet process mixtures.
method Ensembles of Dirichlet process Gaussian mixtures with random subspace and subsampling.
result Empirically outperforms existing approaches in unsupervised outlier detection.

The parsimonious Gaussian mixture models, which exploit an eigenvalue decomposition of the group covariance matrices of the Gaussian mixture, have shown their success in particular in cluster analysis. Their estimation is in general performed by maximum likelihood estimation and has also been considered from a parametr…

2015-01-14abs ↗pdf ↗

Paper establishes universal lower bounds and optimal rates for clustering sub-exponential mixture models.

problem Achieving optimal error rates in clustering sub-exponential mixture models.
method Establishes universal lower bounds and demonstrates iterative algorithms' optimality in sub-exponential mixture models.
result Iterative algorithms achieve the universal lower bound in sub-exponential mixture models.

New method for summarizing Bayesian mixture models using sliced Wasserstein distances.

problem Estimating the mixing measure in nonparametric Bayesian mixture models.
method Decision-theoretic approach using sliced Wasserstein distances for Gaussian mixtures.
result Effective estimation of the mixing measure and mixture density.

Algorithm estimates nonparametric mixtures from grouped data.

problem Estimating identifiable nonparametric mixture models from grouped observations.
method Oracle inequality for weighted kernel density estimators and general consistency result.
result Consistent estimation of mixture components from grouped observations.

The paper tackles learning mixtures of two multinomial logits, showing identifiability and presenting an algorithm.

problem Learning an arbitrary mixture of two multinomial logits.
method Reduction to solving a system of univariate quartic equations, followed by an algorithm using polynomial and linear samples.
result Identifiability of the mixture models may only fail on an algebraic variety of negligible measure.

Finite mixture models are statistical models which appear in many problems in statistics and machine learning. In such models it is assumed that data are drawn from random probability measures, called mixture components, which are themselves drawn from a probability measure P over probability measures. When estimating …

2015-02-23abs ↗pdf ↗

Study on Dirichlet process mixtures for clustering consistency.

problem Consistency of clustering with Dirichlet process mixtures.
method Analysis of posterior distribution as sample size increases, focusing on consistency for the number of clusters.
result Consistency for the number of clusters can be achieved with a properly adapted concentration parameter in a Bayesian setting.

The paper uses Gaussian mixture models for Bayesian networks and proposes an optimization algorithm.

problem Modeling nodes in Bayesian networks with complex distributions.
method Gaussian mixture models combined with double iteration algorithm.
result The double iteration algorithm optimizes Gaussian mixture models effectively.

Deep learning is a hierarchical inference method formed by subsequent multiple layers of learning able to more efficiently describe complex relationships. In this work, Deep Gaussian Mixture Models are introduced and discussed. A Deep Gaussian Mixture model (DGMM) is a network of multiple layers of latent variables, wh…

2017-11-18abs ↗pdf ↗

Improves scalability and efficiency of mixture models in black-box variational inference.

problem Scaling mixture models in black-box variational inference leads to high parameter and time costs.
method Introduces MISVAE for amortized mixture parameter space and new ELBO estimators.
result Achieves superior estimation performance with fewer parameters and shorter inference time.