Topological recursion recovers a specific partition function for colored knots.
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.
Trend · papers per month
Proposes SPFB method for optimizing partition functions in stochastic learning.
In this paper we relate the partition function to the max-statistics of random variables. In particular, we provide a novel framework for approximating and bounding the partition function using MAP inference on randomly perturbed models. As a result, we can use efficient MAP solvers such as graph-cuts to evaluate the c…
We study 4-dimensional higher-derivative conformal higher spin (CHS) fields generalising Weyl graviton and conformal gravitino. They appear, in particular, as "induced" theories in the AdS/CFT context. We consider their partition function on curved Einstein-space backgrounds like (A)dS or sphere and Ricci-flat spaces. …
We perform a resurgence analysis of the Chern-Simons partition function on a Brieksorn homology sphere . Starting from an exact Chern-Simons partition function, we study the Borel resummation of its perturbative expansion.
The abstract conjectures a link between knot homologies and quiver partition functions.
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for approximating the partition function are Markov Chain Monte Carlo and Variational Method…
Definition of the partition function of U(1) gauge theory is extended to a class of four-manifolds containing all compact spaces and certain asymptotically locally flat (ALF) ones including the multi-Taub--NUT spaces. The partition function is calculated via zeta-function regularization with special attention to its mo…
Let where is a self-adjoint Laplace type operator acting on sections of a vector bundle over a compact Riemannian manifold and is a symmetric endomorphism field. We derive an asymptotic expansion for the heat kernel of as . As a consequence we get an asymptotic expansion for the …
New bound on partition function proves Kähler-Einstein stability.
Paper proposes a new method to learn EBMs and their partition function.
Chern-Simons theory on a closed contact three-manifold is studied when the Lie group for gauge transformations is compact, connected and abelian. A rigorous definition of an abelian Chern-Simons partition function is derived using the Faddeev-Popov gauge fixing method. A symplectic abelian Chern-Simons partition functi…
CwA optimizes search performance by jointly learning a balanced database partition and a neural probing function.
Partition functions of probability distributions are important quantities for model evaluation and comparisons. We present a new method to compute partition functions of complex and multimodal distributions. Such distributions are often sampled using simulated tempering, which augments the target space with an auxiliar…
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…
A new method avoids partition function computation for Gibbs density estimation.
We consider the problem of adaptive stratified sampling for Monte Carlo integration of a noisy function, given a finite budget n of noisy evaluations to the function. We tackle in this paper the problem of adapting to the function at the same time the number of samples into each stratum and the partition itself. More p…
The paper studies partition functions of point processes on Kähler manifolds, generalizing geometric functionals and relating to QHE.
New bounds for estimating partition functions under bounded f-divergence.
The paper calculates a formula for knot complements using holomorphic curves.
Novel method recursively partitions sample space for density estimation.
Classifies instantons on a specific gravitational instanton and computes partition functions.
In the paper, the author studies properties of three functions relating to the exponential function and the existence of partitions of unity, including accurate and explicit computation of their derivatives, analyticity, complete monotonicity, logarithmically complete monotonicity, absolute monotonicity, and the like.
POUnets combine partitions of unity and monomials for efficient deep learning.
Quantum algorithm speeds up Gibbs partition function estimation.
In this note we discuss a few properties of transnormal Finsler functions, i.e., the natural generalization of distance functions and isoparametric Finsler functions. In particular, we prove that critical level sets of an analytic transnormal function are submanifolds, and the partition of into level sets is a Fins…
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…
We calculate the free energy of Coulomb gas systems on Riemann surfaces.
The semiclassical approximation for the partition function in Chern-Simons gauge theory is derived using the invariant integration method. Volume and scale factors which were undetermined and had to be fixed by hand in previous derivations are automatically taken account of in this framework. Agreement with Witten's ex…
New method reduces Gibbs partition function estimation complexity.
3D gauge theories link knot polynomials to vortex partition functions.
Study on hypermaps and KP hierarchy, proving tau function and enumerative meaning.
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…
E-string theory reveals modular properties of 4-manifold invariants.
We review the polynomial structure of the topological string partition functions as solutions to the holomorphic anomaly equations. We also explain the connection between the ring of propagators defined from special Kähler geometry and the ring of almost-holomorphic modular forms defined on modular curves.
Unsupervised space partitioning improves ANNS performance without pre-processing.
Resurgent analysis reveals full partition function for 3-manifold invariants.
LA-MCTS learns search space partition for black-box optimization using Monte Carlo Tree Search.
Study optimal partitions on spheres using fractional Q-curvature and variational methods.
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods to get algorithms for calculating partition functions in these families. These …
The output scores of a neural network classifier are converted to probabilities via normalizing over the scores of all competing categories. Computing this partition function, , is then linear in the number of categories, which is problematic as real-world problem sets continue to grow in categorical types, such as …
In this paper we investigate the following existence problem for rational functions: for a given collection of partitions of a number to define whether there exists a rational function of degree for which is the branch datum. An important particular case when the answer to this problem is known is t…
Algorithms learn and test variable partitions in various groups and error metrics.
AIS method improves estimation of RBM partition function with reduced computational cost.
We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an edge-by-edge correction. The approach leads to an intuitive framework in which o…
We consider isotropic non lower semicontinuous weighted perimeter functionals defined on partitions of domains in . Besides identifying a condition on the structure of the domain which ensures the existence of minimizing configurations, we describe the structure of such minima, as well as their regularity…
We propose a new description of 3d theories which do not admit conventional Lagrangians. Given a quiver and a mutation sequence on it, we define a 3d theory in such a way that the partition function of the theory coincides with the cluster partition f…
Summing over 3-manifolds using TQFT partition functions.