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

Trend · papers per month

57114170227 · May 202619922001200920172026
48 results for split normal mixture

A new tree model, GRST, improves option pricing without log-normality assumptions.

problem Limitations of CRR binomial trees in valuing securities with early exercise characteristics.
method Gaussian Recombining Split Tree (GRST) that generates a discrete probability mass function approximating a Gaussian distribution.
result Option prices from GRST align closely with market prices.

The paper presents a method for generating well-calibrated prediction intervals using quality-driven deep ensembles.

problem Generating reliable prediction intervals for regression analysis.
method A multi-objective loss function combining quality measures for prediction intervals and point estimates, with a penalty function to ensure semantic integrity and stability.
result The method produces well-calibrated prediction intervals and point estimates, capturing both aleatoric and epistemic uncertainty.

Novel methods for splitting Gaussian mixtures improve uncertainty propagation in nonlinear systems.

problem Improving accuracy and efficiency in nonlinear uncertainty propagation.
method Preserving mean and covariance, novel heuristics for selecting splitting direction informed by initial uncertainty and nonlinear function properties.
result Improved accuracy and efficiency in uncertainty propagation compared to existing techniques.

Optimizes cover parameter in Mapper algorithm for better visualization.

problem Tuning the cover parameter in Mapper algorithm to generate a ``nice'' graph.
method Optimizes cover by repeatedly splitting using statistical tests and Gaussian mixture model.
result Algorithm generates covers that retain dataset essence while being faster.

Study classifies mappings of bivariate normal densities, revealing three types with distinct geometric and statistical properties.

problem Understanding the properties of two-component bivariate normal mixtures.
method Classification via A\mathcal{A}-equivalence and statistical analysis.
result Three distinct types of mappings with specific geometric and statistical properties, and upper bounds for the number of modes.

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.

Improves DPGMM sampler by better initializing subclusters for more effective clustering.

problem Poor initialization of subclusters leads to ineffective sampling and clustering.
method Proposed heuristic and deep learning-based methods to improve subcluster initialization.
result Better splits lead to improved performance, results, and stability.

The thesis models financial returns using mixtures of generalized normal distributions.

problem Estimation issues in financial return analysis.
method Mixtures of generalized normal distributions (MGND), ECM/GEM algorithms, constrained mixture models (CMGND), GND-HMMs.
result Enhanced accuracy and interpretability in financial return modeling.

Normalized compound random measures are flexible nonparametric priors for related distributions. We consider building general nonparametric regression models using normalized compound random measure mixture models. Posterior inference is made using a novel pseudo-marginal Metropolis-Hastings sampler for normalized comp…

2016-08-02abs ↗pdf ↗

We define a Heegaard-Scharlemann-Thompson (HST) splitting of a 3-manifold M to be a sequence of pairwise-disjoint, embedded surfaces, {F_i}, such that for each odd value of i, F_i is a Heegaard splitting of the submanifold of M cobounded by F_{i-1} and F_{i+1}. Our main result is the following: Suppose M (\neq B^3 or S…

2003-09-02abs ↗pdf ↗

DM framework improves robustness and efficiency in latent-mixture models.

problem Efficient and robust inference in latent-mixture models.
method Divergence-minimization framework with monotonic convergence and robustness guarantees.
result DM yields consistent and asymptotically normal estimators under correct specification.

A new model combines normalizing flows with mixture components for better density estimation.

problem Lack of explicit probability density functions in deep generative models.
method Variational mixture of normalizing flows, using variational inference and neural network parameters.
result The model can perform density estimation, semi-supervised learning, and clustering.

This study evaluates cluster search algorithms using Gaussian mixture models.

problem Determining the optimal number of clusters in data sets generated by Gaussian mixture models.
method Examined centroid- and model-based cluster search algorithms in various cases.
result Model-based algorithms are more robust to cluster overlap and covariance type than centroid-based methods.

Mixture of Experts (MoE) is a popular framework in the fields of statistics and machine learning for modeling heterogeneity in data for regression, classification and clustering. MoE for continuous data are usually based on the normal distribution. However, it is known that for data with asymmetric behavior, heavy tail…

2016-12-09abs ↗pdf ↗

We show that given a partially flat angled ideal triangulation for a 3-manifold MM with boundary (as defined by Lackenby), there is an algorithm to produce a list of Heegaard splittings for MM such that below a given genus gg, each isotopy class appears exactly once. In particular, this algorithm determines precisel…

2010-04-26abs ↗pdf ↗

This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence, state-of-the-art methods require reference multi-class datasets to pretrain feature …

2018-12-20abs ↗pdf ↗

Proposes a method to partition univariate data into unimodal subsets.

problem Partitioning univariate multimodal data into unimodal subsets.
method Recursive splitting around valley points of the data density using properties of critical points on the convex hull of the ecdf plot.
result Obtains a hierarchical statistical model of the initial dataset as a mixture of UMMs.

In recent years, data have become increasingly higher dimensional and, therefore, an increased need has arisen for dimension reduction techniques for clustering. Although such techniques are firmly established in the literature for multivariate data, there is a relative paucity in the area of matrix variate, or three-w…

2018-09-07abs ↗pdf ↗

The paper introduces a new model to correct bias in treatment effect estimates due to sample selection.

problem Bias in treatment effect estimates due to sample selection.
method Type 2 Tobit Bayesian Additive Regression Trees (TOBART-2) with Dirichlet Process Mixture distribution and soft trees.
result Corrects bias in treatment effect estimates by accounting for nonlinearities and model uncertainty.

A new method improves posterior approximation for complex distributions.

problem Difficulty in capturing multimodal and heavy-tailed posteriors with standard normalizing flows.
method StiCTAF: stick-breaking mixture base with component-wise tail adaptation.
result Improved tail recovery and better mode coverage compared to benchmarks.

Deep neural networks converge to Gaussian mixtures as layer width increases.

problem Understanding the distribution of outputs from deep neural networks.
method Proof and experiments with a simple model showing the convergence of neural network outputs to Gaussian mixtures.
result Neural networks converge to Gaussian mixtures as the width of the last hidden layer increases.

In recent years, a rich variety of shrinkage priors have been proposed that have great promise in addressing massive regression problems. In general, these new priors can be expressed as scale mixtures of normals, but have more complex forms and better properties than traditional Cauchy and double exponential priors. W…

2011-07-25abs ↗pdf ↗

The hierarchical Dirichlet process (HDP) has become an important Bayesian nonparametric model for grouped data, such as document collections. The HDP is used to construct a flexible mixed-membership model where the number of components is determined by the data. As for most Bayesian nonparametric models, exact posterio…

2012-01-08abs ↗pdf ↗

Clustering of data sets is a standard problem in many areas of science and engineering. The method of spectral clustering is based on embedding the data set using a kernel function, and using the top eigenvectors of the normalized Laplacian to recover the connected components. We study the performance of spectral clust…

2014-04-29abs ↗pdf ↗

FlowGMM uses normalizing flows for semi-supervised learning, showing promising results across various data types.

problem Semi-supervised learning with limited labeled data.
method Normalizing flows combined with latent Gaussian mixture models for generative modeling.
result FlowGMM achieves promising results on multiple data types, including text and tabular data.

Bayesian mixture models are widely applied for unsupervised learning and exploratory data analysis. Markov chain Monte Carlo based on Gibbs sampling and split-merge moves are widely used for inference in these models. However, both methods are restricted to limited types of transitions and suffer from torpid mixing and…

2014-05-31abs ↗pdf ↗

A new probabilistic polygonal curve representation using Gaussian Mixture Models.

problem Capturing curves with uncertainty in both tangent and normal directions.
method Probabilistic polygonal approximation with Gaussian Mixture Model (GMM).
result The GMM accurately captures the local geometry and uncertainty of curves.

This paper generalizes the definition of a Heegaard splitting to unify Scharlemann and Thomspon's concept of thin position for 3-manifolds, Gabai's thin position for knots, and Rubinstein's almost normal surface theory. This gives generalizations of theorems of Scharlemann, Thompson, Rubinstein, and Stocking. In the fi…

1998-06-04abs ↗pdf ↗