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.
The beta-negative binomial process (BNBP), an integer-valued stochastic process, is employed to partition a count vector into a latent random count matrix. As the marginal probability distribution of the BNBP that governs the exchangeable random partitions of grouped data has not yet been developed, current inference f…
The study examines the balancedness of random partition models and finds the rich-get-richer characteristic is a result of model assumptions.
New classifiers converge under large data, simplifying complex models.
Many popular random partition models, such as the Chinese restaurant process and its two-parameter extension, fall in the class of exchangeable random partitions, and have found wide applicability in model-based clustering, population genetics, ecology or network analysis. While the exchangeability assumption is sensib…
Bayesian classifiers converge under certain exchangeability conditions with more data.
The paper introduces the concept of a cluster structure to define a joint distribution of the sample size and its exchangeable random partitions. The cluster structure allows the probability distribution of the random partitions of a subset of the sample to be dependent on the sample size, a feature not presented in a …
This thesis explores supervised classification methods using Bayesian and exchangeability theories.
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is considered unrealistic in observed graphs. We define a notion of edge exchangeability …
Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons. A natural estimation problem is how well we can recover a graphon given a single graph sampled from it. One general framework for estimating a graphon uses step-functions obtained by partitioning the nodes of the graph accor…
Capital distribution curve is defined as log-log plot of normalized stock capitalizations ranked in descending order. The curve displays remarkable stability over periods of time. Theory of exchangeable distributions on set partitions, developed for purposes of mathematical genetics and recently applied in non-parametr…
We have performed detailed multifractal analysis on the minutely volatility of two indexes and 1139 stocks in the Chinese stock markets based on the partition function approach. The partition function scales as a power law with respect to box size . The scaling exponents form a nonlinear function of …
This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability. We provide oracle inequalities with rate of c…
We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for non-exchangeability. This class can be used to model many kinds of dependencies between data in infinite clustering models, including dependencies across time or space. We examine the pr…
Quantized-TinyLLaVA reduces communication costs in split learning for multimodal models.
We propose a new model for pricing Quanto CDS and risky bonds. The model operates with four stochastic factors, namely: hazard rate, foreign exchange rate, domestic interest rate, and foreign interest rate, and also allows for jumps-at-default in the FX and foreign interest rates. Corresponding systems of PDEs are deri…
This work presents a partitioned solution procedure to compute shape gradients in fluid-structure interaction (FSI) using black-box adjoint solvers. Special attention is paid to project the gradients onto the undeformed configuration. This is due to the mixed Lagrangian-Eulerian formulation of large-displacement FSI in…
Federated Learning aims to train distributed deep models without sharing the raw data with the centralized server. Similarly, in distributed inference of neural networks, by partitioning the network and distributing it across several physical nodes, activations and gradients are exchanged between physical nodes, rather…
We study 4d superconformal indices for a large class of N=1 superconformal quiver gauge theories realized combinatorially as a bipartite graph or a set of "zig-zag paths" on a two-dimensional torus T^2. An exchange of loops, which we call a "double Yang-Baxter move", gives the Seiberg duality of the gauge theory, and t…
We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a compact lifted formulation which can be solved much more efficiently than the sta…
When observations are organized into groups where commonalties exist amongst them, the dependent random measures can be an ideal choice for modeling. One of the propositions of the dependent random measures is that the atoms of the posterior distribution are shared amongst groups, and hence groups can borrow informatio…
The study limits how many parts regular simplicial partitions can overlap.
We describe Venture, an interactive virtual machine for probabilistic programming that aims to be sufficiently expressive, extensible, and efficient for general-purpose use. Like Church, probabilistic models and inference problems in Venture are specified via a Turing-complete, higher-order probabilistic language desce…
Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs. However, theoretical aspects of such methods have seldom received …
T-duality acts on circle bundles by exchanging the first Chern class with the fiberwise integral of the H-flux, as we motivate using E_8 and also using S-duality. We present known and new examples including NS5-branes, nilmanifolds, Lens spaces, both circle bundles over RP^n, and the AdS^5 x S^5 to AdS^5 x CP^2 x S^1 w…
The exchange algorithm is studied for its convergence and asymptotic variance.
Study on pricing American Exchange options using Lévy processes.
In this paper, we propose a family of graph partition similarity measures that take the topology of the graph into account. These graph-aware measures are alternatives to using set partition similarity measures that are not specifically designed for graph partitions. The two types of measures, graph-aware and set parti…
The paper develops mixed-integer formulations for neural networks using partitioning.
New partition designs reduce star discrepancy in high-dimensional sampling.
Optimal crypto order execution using cross-exchange signals.
New causal models for growing networks avoid node deletion constraints.
The paper constructs Markov partitions for geodesic flow on hyperbolic surfaces.
Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including variants of multi-level methods and spectral clustering. We propose GAP, a Generaliz…
Survey of mass partition problems in geometry and topology.
New method unifies and formalizes data partitioning using a single vector.
In Bayesian statistics, the marginal likelihood, also known as the evidence, is used to evaluate model fit as it quantifies the joint probability of the data under the prior. In contrast, non-Bayesian models are typically compared using cross-validation on held-out data, either through -fold partitioning or leave-$p…
Locally isoperimetric partitions minimize perimeter in space.
Space partitions of underlie a vast and important class of fast nearest neighbor search (NNS) algorithms. Inspired by recent theoretical work on NNS for general metric spaces [Andoni, Naor, Nikolov, Razenshteyn, Waingarten STOC 2018, FOCS 2018], we develop a new framework for building space partitions re…
Study of Torelli groups of partitioned surfaces with bounds and asymptotic lengths.
Efficiently calculates PL model likelihood for partitioned preference data.
We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of the signed Laplacian may be meaningless, in contrast to partitioning based on th…
New proof of a unique 3-part partition in 8D space.
Paper recovers lattice signal partitions efficiently.
Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of partitioning hyperedges across clusters. Algorithmic solutions based on this approach assume that different p…
We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.
Maps discrete manifolds to partitions to define new manifolds.
Standard bubbles and partitions are stable in various model spaces.
To devise efficient solutions for approximating a mean partition in consensus clustering, Dimitriadou et al. [3] presented a necessary condition of optimality for a consensus function based on least square distances. We show that their result is pivotal for deriving interesting properties of consensus clustering beyond…