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

61122182243 · May 202619922001200920172026
48 results for geometric mixtures

This work investigates a mixture of LMC and RMHMC with MMALA for geometric ergodicity.

problem Lack of geometric ergodicity study in Riemannian manifold and Lagrangian Monte Carlo methods.
method Investigates a mixture of LMC and RMHMC with MMALA to achieve geometric ergodicity.
result Demonstrates geometric ergodicity in the mixture of LMC and RMHMC with MMALA.

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.

We will establish that the VC dimension of the class of d-dimensional ellipsoids is (d^2+3d)/2, and that maximum likelihood estimate with N-component d-dimensional Gaussian mixture models induces a geometric class having VC dimension at least N(d^2+3d)/2. Keywords: VC dimension; finite dimensional ellipsoid; Gaussian m…

2011-09-20abs ↗pdf ↗

New approach to control diffusion processes with soft constraints.

problem Finding an optimal diffusion process with a target terminal distribution.
method Generalized Schrödinger bridge problem with soft constraints, solving for a geometric mixture of target and other distributions.
result The terminal distribution of the optimally controlled process is a geometric mixture of the target and another distribution.

Introduces q-paths for generalizing geometric annealing paths in machine learning.

problem Limited applicability of existing path methods in machine learning.
method Develops a family of paths derived from a generalized mean, including geometric and arithmetic mixtures.
result Empirical gains in Bayesian inference and generative model evaluation.

Paper solves a geometric problem involving mixtures of area and curvature measures.

problem Investigates a geometric problem involving mixtures of area and curvature measures.
method Establishes a gradient estimate to prove the existence of a solution.
result Proves the existence of an even, smooth, strictly convex solution for 1<p<qk+11 < p < q \leq k + 1.

Improved sample complexity for Gaussian Mixture Models using Pair Correlation Factor.

problem Understanding the sample complexity of Gaussian Mixture Models.
method Introducing Pair Correlation Factor (PCF) to measure clustering of component means and improving sample complexity bounds.
result The Pair Correlation Factor (PCF) more accurately determines the difficulty of parameter recovery in Gaussian Mixture Models.

Enhanced 3D shape analysis using information geometry.

problem Challenges in comparing 3D point clouds due to their unstructured nature and complex geometry.
method Information geometric framework for 3D point cloud shape analysis using Gaussian Mixture Models (GMMs) on a statistical manifold. Proposed MSKL divergence with upper and lower bounds.
result MSKL provides stable and monotonically varying values that directly reflect geometric variation, outperforming traditional distances and existing KL approximations.

Exponential families and mixture families are parametric probability models that can be geometrically studied as smooth statistical manifolds with respect to any statistical divergence like the Kullback-Leibler (KL) divergence or the Hellinger divergence. When equipping a statistical manifold with the KL divergence, th…

2018-03-20abs ↗pdf ↗

Understanding separation effects on parameter estimation in finite Gaussian mixtures

problem Minimum component separation impact on convergence rates in finite Gaussian mixtures
method Developing a unified geometric framework using Hellinger lower bounds and specialized moment-extraction test functions
result Separation complexity driven by spatial configuration of mixture components

Paper proposes a method to efficiently cluster stretched mixtures.

problem Clustering stretched elliptical mixtures using standard methods like PCA and k-means fails.
method Proposes a non-convex program to transform data into a one-dimensional point cloud.
result Efficient first-order algorithm achieves near-optimal statistical precision.

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.

We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that are inspired by the ideas from toric topology.

2016-09-19abs ↗pdf ↗

New methods combine model predictions to avoid linear mixtures' limitations.

problem Combining predictions from different models to avoid linear mixtures' limitations.
method Log-linear pooling (locking) and quantum superposition (quacking) to optimise model weights.
result Demonstrated locking method with illustrative example and practical application.

This paper addresses the mode collapse for generative adversarial networks (GANs). We view modes as a geometric structure of data distribution in a metric space. Under this geometric lens, we embed subsamples of the dataset from an arbitrary metric space into the l2 space, while preserving their pairwise distance distr…

2018-05-19abs ↗pdf ↗

Generative model on manifolds reduces divergence computation and improves scalability.

problem Difficulties in modeling data on non-Euclidean spaces due to expensive divergence computation and approximations of heat kernel.
method Riemannian Diffusion Mixture, a principled framework using a mixture of bridge processes.
result Achieves superior performance on diverse manifolds with reduced simulation steps.

New accelerators for EM improve convergence speed in complex mixture models.

problem Improving the convergence speed of the EM algorithm for complex mixture models.
method Derive a new operator connecting global descent and local convergence, and use it to develop two acceleration strategies.
result Two new acceleration strategies (G-Accelerator and Geo-Adaptive) significantly improve EM algorithm performance.

A new method identifies sub-populations in unlabelled heterogeneous data by accounting for co-features.

problem Estimating sub-populations in unlabelled heterogeneous data with co-features.
method Mixture of Conditional Gaussian Graphical Models (CGGM) with penalized EM algorithm.
result The method successfully identifies sub-populations disrupted by co-features.

The Expectation-Maximization (EM) algorithm is a widely used method for maximum likelihood estimation in models with latent variables. For estimating mixtures of Gaussians, its iteration can be viewed as a soft version of the k-means clustering algorithm. Despite its wide use and applications, there are essentially no …

2016-09-01abs ↗pdf ↗

An innovative extension of Geometric Brownian Motion model is developed by incorporating a weighting factor and a stochastic function modelled as a mixture of power and trigonometric functions. Simulations based on this Modified Brownian Motion Model with optimal weighting factors selected by goodness of fit tests, sub…

2015-07-08abs ↗pdf ↗

The seemingly disjoint problems of count and mixture modeling are united under the negative binomial (NB) process. A gamma process is employed to model the rate measure of a Poisson process, whose normalization provides a random probability measure for mixture modeling and whose marginalization leads to an NB process f…

2012-09-15abs ↗pdf ↗

Gradient EM converges globally for over-parameterized Gaussian mixtures.

problem Recovering ground truth Gaussian mixtures with over-parameterized models.
method Gradient EM with over-parameterization, using Hermite polynomials and tensor decomposition.
result Gradient EM globally converges to ground truth with n=Ω(mlogm)n = Ω(m\log m) over-parameterization.

Extends likelihood ratio exponential families to analyze various optimization methods.

problem Analyzing optimization methods like rate-distortion and information bottleneck.
method Linking geometric mixture paths to exponential families and using hypothesis testing.
result Provides a common mathematical framework for understanding these methods.

We introduce a new homological machine for the study of secondary geometric invariants. The objects, called spark complexes, occur in many areas of mathematics. The theory is applied here to establish the equivalence of a large family of spark complexes which appear naturally in geometry, topology and physics. These co…

2003-06-11abs ↗pdf ↗

This paper proposes to model asset price dynamics with a mixture of diffusion processes where the instantaneous volatility of the underlying diffusion process contains a random vector. The marginal probability distributions of the proposed process can match exactly the risk-neutral distributions implied by both spot va…

2016-10-05abs ↗pdf ↗

Universal model for soft tissue mechanics under shock waves.

problem Modeling shock wave mechanics in soft biological tissues.
method Continuum mixture theory with phase-field mechanics.
result Universal thermodynamically consistent formulation for soft porous tissues.

Generative models improve angular variable simulation in high dimensions.

problem Lack of flexibility and scalability in simulating multivariate angular variables.
method Introducing generative adversarial networks, normalizing flows, and flow matching.
result Deep learning methods outperform classical parametric models in complex data structures.

A new clustering method estimates non-linear boundaries and automatically selects the number of clusters.

problem Discriminative clustering with non-linear boundaries and data abnormalities.
method Regularized mutual information objective function with a mixture of Gaussian and uniform distributions.
result Automatic selection of the number of components and estimation of non-linear boundaries.

Unified perspective on natural gradient methods for GMMs, improving variational inference.

problem Efficiently learning multi-modal approximations of complex distributions.
method Comparison and optimization of VIPS and iBayes-GMM methods for Gaussian mixture models.
result Hybrid approach significantly outperforms both VIPS and iBayes-GMM.

A line of recent work has analyzed the behavior of the Expectation-Maximization (EM) algorithm in the well-specified setting, in which the population likelihood is locally strongly concave around its maximizing argument. Examples include suitably separated Gaussian mixture models and mixtures of linear regressions. We …

2018-10-01abs ↗pdf ↗

Geometric tempering improves sampling from distributions, with exponential convergence rates.

problem Sampling from probability distributions using gradient flow dynamics.
method Geometric tempering of the target distribution in Wasserstein and Fisher-Rao gradient flows.
result Exponential convergence in continuous and discrete time for geometric tempering.