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

Trend · papers per month

10203040 · May 202619922001200920172026
48 results for Dirichlet Simplex Nest

Proposes Dirichlet Simplex Nest for probabilistic modeling of various data types.

problem Modeling and inference for diverse data types.
method Probabilistic models based on Dirichlet distribution and Voronoi tessellation, with fast and accurate inference algorithms exploiting convex geometry and simplicial structure.
result Inference algorithms achieve consistency and strong error bounds across various settings and data distributions.

We develop a nested hierarchical Dirichlet process (nHDP) for hierarchical topic modeling. The nHDP is a generalization of the nested Chinese restaurant process (nCRP) that allows each word to follow its own path to a topic node according to a document-specific distribution on a shared tree. This alleviates the rigid, …

2012-10-25abs ↗pdf ↗

We develop a nested hierarchical Dirichlet process (nHDP) for hierarchical topic modeling. The nHDP is a generalization of the nested Chinese restaurant process (nCRP) that allows each word to follow its own path to a topic node according to a document-specific distribution on a shared tree. This alleviates the rigid, …

2013-01-16abs ↗pdf ↗

We present a Bayesian nonparametric framework for multilevel clustering which utilizes group-level context information to simultaneously discover low-dimensional structures of the group contents and partitions groups into clusters. Using the Dirichlet process as the building block, our model constructs a product base-m…

2014-01-09abs ↗pdf ↗

Model clusters networks and their communities simultaneously.

problem Clustering networks and their communities in unlabeled, heterogeneous networks.
method Nested Stochastic Block Model (NSBM) with Bayesian approach and NDP prior.
result Model accurately estimates both within and across network clustering structures.

Stochastic gradient Markov chain Monte Carlo (SGMCMC) has become a popular method for scalable Bayesian inference. These methods are based on sampling a discrete-time approximation to a continuous time process, such as the Langevin diffusion. When applied to distributions defined on a constrained space the time-discret…

2018-06-19abs ↗pdf ↗

The Dirichlet mechanism protects privacy while minimizing KL divergence.

problem Minimizing KL divergence while protecting sensitive data privacy.
method Using the exponential mechanism with the KL divergence loss function, resulting in the Dirichlet mechanism.
result Proved a probability tail bound on KL divergence and derived a lower bound for sample complexity.

Recent advances in topic models have explored complicated structured distributions to represent topic correlation. For example, the pachinko allocation model (PAM) captures arbitrary, nested, and possibly sparse correlations between topics using a directed acyclic graph (DAG). While PAM provides more flexibility and gr…

2012-06-20abs ↗pdf ↗

The latent Dirichlet allocation (LDA) model is a widely-used latent variable model in machine learning for text analysis. Inference for this model typically involves a single-site collapsed Gibbs sampling step for latent variables associated with observations. The efficiency of the sampling is critical to the success o…

2016-08-02abs ↗pdf ↗

Tree structures are ubiquitous in data across many domains, and many datasets are naturally modelled by unobserved tree structures. In this paper, first we review the theory of random fragmentation processes [Bertoin, 2006], and a number of existing methods for modelling trees, including the popular nested Chinese rest…

2015-09-16abs ↗pdf ↗

We propose a new topic modeling procedure that takes advantage of the fact that the Latent Dirichlet Allocation (LDA) log likelihood function is asymptotically equivalent to the logarithm of the volume of the topic simplex. This allows topic modeling to be reformulated as finding the probability simplex that minimizes …

2019-04-03abs ↗pdf ↗

Researchers study the normalizing constant of a continuous categorical distribution.

problem Understanding the normalizing constant of the continuous categorical distribution.
method Characterize numerical behavior and present theoretical and methodological advances.
result The normalizing constant can be written in closed form using elementary functions.

We propose a family of multivariate Gaussian process models for correlated outputs, based on assuming that the likelihood function takes the generic form of the multivariate exponential family distribution (EFD). We denote this model as a multivariate generalized Gaussian process model, and derive Taylor and Laplace al…

2013-11-02abs ↗pdf ↗

New method attaches uncertainty to deep neural network predictions.

problem Quantifying uncertainty in deep learning predictions.
method Deep Dirichlet mixture network to learn and approximate classification probabilities.
result Construct credible intervals from learned Dirichlet mixture distribution.

Bayesian ARMA model with directional shifts captures structural breaks in compositional time series.

problem Structural breaks in compositional time series due to external shocks or policy changes.
method Developed a Bayesian Dirichlet ARMA model augmented with a directional-shift intervention mechanism.
result The model captures structural breaks through interpretable parameters and produces coherent probabilistic forecasts.

The paper triangulates Heisenberg groups with horizontal and straight simplexes.

problem Triangulating Heisenberg groups with specific regularity properties.
method Constructing triangulations with horizontal and straight simplexes on a polyhedral structure and extending to the whole Heisenberg group.
result Explicit examples of grid and triangulations provided.

New methods for predicting compositional data using conformal prediction.

problem No well-established methods for constructing valid prediction sets in compositional data.
method Investigated three conformal prediction-based approaches for Dirichlet regression models.
result HDR approximation approach is robust in terms of coverage, while grid discretization reduces overcoverage.

Study of zonal spherical functions on partial flag manifolds using Jacobi polynomials.

problem Understanding zonal spherical functions on partial flag manifolds.
method Matrix variate version of Koornwinder's method for constructing orthogonal polynomials, using Hermitian Jacobi polynomials and multivariate Schur polynomials.
result Conjecture that Hermitian Jacobi polynomials are elementary zonal spherical functions.

Study optimal transport on simplex boundary, proving transport map and potential regularity.

problem Regularity of transport map and potential on simplex boundary.
method Boundary regularity results for optimal transport maps, exploiting simplex symmetries.
result Regularity properties of transport map and its convex potential.

A new method uses a product of experts with Dirichlet variables to approximate complex distributions.

problem Approximating complex distributions with tractable models.
method A product of experts with auxiliary Dirichlet variables, using a Feynman identity to sample and optimize.
result The method efficiently approximates complex distributions using a product of experts and Dirichlet variables.

We compute the expected value of the Kullback-Leibler divergence to various fundamental statistical models with respect to canonical priors on the probability simplex. We obtain closed formulas for the expected model approximation errors, depending on the dimension of the models and the cardinalities of their sample sp…

2012-07-14abs ↗pdf ↗

We consider the problem of analyzing the heterogeneity of clustering distributions for multiple groups of observed data, each of which is indexed by a covariate value, and inferring global clusters arising from observations aggregated over the covariate domain. We propose a novel Bayesian nonparametric method reposing …

2010-01-04abs ↗pdf ↗

Study cobordisms of nested manifolds and their invariants.

problem Understanding cobordisms of nested manifolds and their invariants.
method Identify a nested analog of the Pontryagin-Thom construction and find spaces homotopy equivalent to nested Pontryagin-Thom spaces.
result Discover nested cobordism invariants and provide an alternative proof of Wall's splitting result.

A hyperbolic 3-simplex reflection group is a Coxeter group arising as a lattice in the isometry group of hyperbolic 3-space, with fundamental domain a geodesic simplex (possibly with some ideal vertices). The classification of these groups is known, and there are exactly 9 cocompact examples, and 23 non-cocompact examp…

2007-05-07abs ↗pdf ↗

We introduce the non-pure versions of simplicial balls and spheres with minimum number of vertices. These are a special type of non-homogeneous balls and spheres (NH-balls and NH-spheres) satisfying a minimality condition on the number of maximal simplices. The main result is that minimal NH-balls and NH-spheres are pr…

2014-06-25abs ↗pdf ↗

In 1973, J. Cheeger and J. Simons raised the following question that still remains open and is known as the Rational Simplex Problem: Given a geodesic simplex in the spherical 3-space so that all of its interior dihedral angles are rational multiples of ππ, is it true that its volume is a rational multiple of the volu…

2013-04-28abs ↗pdf ↗

Paper calculates Gromov-Hausdorff distance between simplexes and 2-distance spaces.

problem Calculating Gromov-Hausdorff distance between simplexes and 2-distance spaces.
method Formulas derived for clique covering number and chromatic number of graphs.
result Complete solution to generalized Borsuk problem for 2-distance spaces.

Quantum algorithm speeds up nested expectation estimation by nearly quadratically.

problem Estimating repeatedly nested expectations with quantum computing.
method Proposes a quantum algorithm achieving nearly quadratic speedup over classical methods.
result Achieves nearly quadratic speedup for RNEs, up to logarithmic factors.