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.

169,341 papers · 148 categories

Trend · papers per month

13263952 · Jun 202019922001200920182026
48 results for Dirichlet partitions

Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified and a novel rearrangement algorithm is proposed, which we show is strictly decreas…

2013-08-22abs ↗pdf ↗

The study shows that random surfaces built from polygons converge to a Poisson-Dirichlet partition.

problem Understanding geometric properties of random surfaces constructed from polygons.
method Uniformly pairing polygon sides to form surfaces, analyzing degree sequences and geometric properties using probabilistic techniques.
result Several geometric properties of the graph are universal, converging to a Poisson-Dirichlet partition as non o \infty.

Study on length distribution of random multicurves on large genus surfaces converging to Poisson-Dirichlet distribution.

problem Length statistics of random multicurves on large genus hyperbolic surfaces.
method Analytical proof of convergence to Poisson-Dirichlet distribution as genus tends to infinity.
result Mean lengths of the three longest components converge to specific percentages of total length as genus increases.

DPMM-CFL clusters clients for federated learning without fixed K, improving performance.

problem Improving federated learning performance under non-IID client heterogeneity.
method DPMM-CFL uses a Dirichlet Process Mixture Model to infer both cluster number and client assignments.
result DPMM-CFL optimizes per-cluster federated objectives and jointly infers cluster number and assignments.

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 ↗

Novel threefold partitioning of L2L^2-spinor space on cone links.

problem Understanding equivariant Riemann-Roch defects in complex spaces with conic singularities.
method Investigates supertraces over local cohomology groups and spectral asymmetry.
result Novel complex equivariant ξTξ_T and ηTη_T invariants defined.

HIRM models noisy, sparse, heterogeneous relational data using hierarchical clustering and Dirichlet processes.

problem Modeling noisy, sparse, and heterogeneous relational data.
method Hierarchical Chinese restaurant process and Dirichlet process mixture for clustering and modeling relation values.
result HIRM generalizes standard models and discovers relational structure in real-world datasets.

A new method for multiclass calibration using vector quantization.

problem Challenges in multiclass calibration, especially in high-stakes settings.
method Compositional approach via Vector Quantization (VQ) to learn region-specific calibration maps.
result Significant improvements in local calibration with competitive global calibration and predictive performance.

New EPM models improve model shrinkage in edge partition models.

problem Overfitting and inappropriate model shrinkage in EPMs.
method Proposed two novel EPM models: CEPM and DEPM, incorporating constrained and Dirichlet priors respectively.
result IDEPM model shows state-of-the-art performance in generalization and prediction.

Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they offer computational benefits over latent-mean models and can handle arbitrary pairwise similarity measures between data points. However, when…

2012-06-13abs ↗pdf ↗

We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of particles (representing the objects) diffusing in some continuous space, analogou…

2014-08-14abs ↗pdf ↗

Bayesian nonparametric model for image segmentation using a generalized Swendsen-Wang algorithm.

problem Unsupervised image segmentation of pixels into homogeneous regions.
method Combination of Potts-like spatial smoothness and prior on partitions controlled by a Bayesian nonparametric model.
result Competitive performance in terms of RAND index compared to popular methods.

Proposes a nonparametric tensor factorization for sparse data.

problem Handling sparse tensor data with structural and interpretability benefits.
method Hierarchical Gamma processes and Poisson random measures for tensor-valued process, Dirichlet processes for sampling entry indices, Gaussian processes for values.
result Demonstrates superior performance on benchmark datasets.

Study finds only first and second eigenvalues are Courant-sharp for flat Klein bottle and cylinders.

problem Determining Courant-sharp eigenvalues for compact flat surfaces.
method Analyzing flat Klein bottle and cylinders, proving only first and second eigenvalues are Courant-sharp.
result Only first and second eigenvalues are Courant-sharp for flat Klein bottle and cylinders.

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 ↗

Solves a specific Dirichlet problem on Hermitian manifolds.

problem Solving Dirichlet problem for Monge-Ampère type equations on Hermitian manifolds.
method Solves the Dirichlet problem for Monge-Ampère type equations for (n1)(n-1)-plurisubharmonic functions on Hermitian manifolds.
result Solves a specific Dirichlet problem on Hermitian manifolds.

Study non-linear Dirichlet-to-Neumann map for Poincaré-Einstein fillings.

problem Non-linear Dirichlet-to-Neumann map for Poincaré-Einstein fillings.
method Description of range in terms of Dirichlet-to-Neumann tensor, construction of hypersurface invariants.
result Unique conformally invariant Dirichlet-to-Neumann hypersurface invariants for Poincaré-Einstein fillings.

LDTA expands LDA's topic modeling capacity with tree-structured priors.

problem Limited expressiveness of Dirichlet priors in LDA for complex topic relationships.
method Introduces Latent Dirichlet-Tree Allocation (LDTA) with Dirichlet-Tree (DT) priors, and develops universal mean-field variational inference and Expectation Propagation.
result LDTA enables expressive, tree-structured priors over topic proportions, expanding modeling capacity of LDA.

The paper studies higher order Dirichlet-to-Neumann maps on graphs and their eigenvalues.

problem Analyzing eigenvalues of higher order Dirichlet-to-Neumann maps on graphs.
method Introducing and studying higher order Dirichlet-to-Neumann maps on graphs, deriving estimates on eigenvalues.
result Raulot-Savo-type estimates on the eigenvalues of the DtN maps.

Solves a specific Dirichlet problem on Riemannian manifolds.

problem Dirichlet problem for degenerate fully nonlinear elliptic equations on Riemannian manifolds.
method Derives existence of C1,1C^{1,1}-solutions under appropriate assumptions.
result Existence of C1,1C^{1,1}-solutions.

Paper shows approximate Dirichlet domain works as well as exact one for tiling hyperbolic balls.

problem Empirical success of SnapPea's length spectrum algorithm despite using approximate data.
method Showed under certain conditions, approximate Dirichlet domain can perform equivalently to exact one.
result Empirical success of SnapPea's length spectrum algorithm explained.

Study compares eigenvalues on spherically symmetric manifolds to Euclidean balls.

problem Comparing eigenvalues on spherically symmetric manifolds to Euclidean balls.
method Examines Dirichlet Laplace eigenvalues on balls of spherically symmetric manifolds and Euclidean space.
result Eigenvalues on spherically symmetric manifolds are smaller for small radii, but larger for hyperbolic spaces.