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

Trend · papers per month

169339508677 · Jun 202019922001200920172026
48 results for Partition Function

Topological recursion recovers a specific partition function for colored knots.

problem Recovering the extended Ooguri-Vafa partition function for colored HOMFLY-PT polynomials of torus knots.
method Applying topological recursion to the spectral curve of colored HOMFLY-PT polynomials of torus knots.
result Topological recursion reproduces the n-point functions of the extended Ooguri-Vafa partition function.

Proposes SPFB method for optimizing partition functions in stochastic learning.

problem Optimizing partition functions in stochastic learning settings.
method Stochastic Gradient Bound (SPFB) method based on upper-bounding the partition function with a quadratic surrogate.
result Sub-linear convergence rate of SPFB method and efficient training of deep learning models.

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. …

2013-09-03abs ↗pdf ↗

The abstract conjectures a link between knot homologies and quiver partition functions.

problem Understanding the relationship between knot homologies and quiver partition functions.
method Interpreting quiver nodes as holomorphic curves with boundary on the knot conormal, and studying recursion relations.
result Generalized quiver partition functions are related to knot homologies.

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…

2017-11-05abs ↗pdf ↗

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…

2010-05-31abs ↗pdf ↗

Let Hh=h2L+VH_h = h^2 L +V where LL is a self-adjoint Laplace type operator acting on sections of a vector bundle over a compact Riemannian manifold and VV is a symmetric endomorphism field. We derive an asymptotic expansion for the heat kernel of HhH_h as h0h \to 0. As a consequence we get an asymptotic expansion for the …

2008-05-06abs ↗pdf ↗

New bound on partition function proves Kähler-Einstein stability.

problem Proving Kähler-Einstein metrics on complex manifolds.
method Quantitative bound on partition function, connecting probabilistic and quantization approaches.
result Direct analytic proof of Kähler-Einstein stability for uniformly Gibbs stable manifolds.

Paper proposes a new method to learn EBMs and their partition function.

problem Intractability of exact MLE for EBMs due to partition function computation.
method Jointly learns an energy model and its log-partition function using neural networks.
result First tractable method for optimizing sparsemax loss in large spaces.

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…

2012-08-08abs ↗pdf ↗

CwA optimizes search performance by jointly learning a balanced database partition and a neural probing function.

problem Suboptimal search performance due to mismatched database and query distributions.
method CwA jointly learns a balanced database partition and a neural probing function to optimize search performance directly for the query distribution.
result CwA achieves up to 4.7x throughput over state-of-the-art methods at equal recall.

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…

2016-03-07abs ↗pdf ↗

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…

2019-03-02abs ↗pdf ↗

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…

2013-03-12abs ↗pdf ↗

The paper studies partition functions of point processes on Kähler manifolds, generalizing geometric functionals and relating to QHE.

problem Analyzing partition functions of determinantal point processes on Kähler manifolds.
method Using geometric functionals and TYZ expansion coefficients of the Bergman kernel.
result The coefficients of the partition function expansion are geometric functionals on Kähler metrics.

POUnets combine partitions of unity and monomials for efficient deep learning.

problem Efficiently approximating functions with deep neural networks in high dimensions.
method Integrates partitions of unity and monomials into neural network architecture.
result POUnets achieve hp-convergence for smooth functions and outperform MLPs for discontinuous functions.

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 MM into level sets is a Fins…

2018-07-23abs ↗pdf ↗

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…

2014-12-05abs ↗pdf ↗

We calculate the free energy of Coulomb gas systems on Riemann surfaces.

problem Analyzing the free energy of Coulomb gas systems on Riemann surfaces.
method Using bosonization formula and analytic torsion, we derive the asymptotic expansion of the partition function.
result We prove the geometric version of the Zabrodin-Wiegmann conjecture in the determinantal case.

New method reduces Gibbs partition function estimation complexity.

problem Estimating partition functions of Gibbs distributions.
method Doubly-adaptive MCMC with adaptive cooling schedule and mean estimator.
result Outperforms state-of-the-art algorithms in computational complexity and robustness.

Study on hypermaps and KP hierarchy, proving tau function and enumerative meaning.

problem Understanding the partition function of meromorphic functions on the Riemann sphere.
method Analysis of Hurwitz Dubrovin--Frobenius manifold structure and rational reductions of the KP hierarchy.
result The all genera partition function is a tau function of a rational reduction of the Kadomtsev--Petviashvili hierarchy.

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…

2016-04-22abs ↗pdf ↗

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.

2015-01-02abs ↗pdf ↗

Resurgent analysis reveals full partition function for 3-manifold invariants.

problem Analyzing resurgence in 3-manifold invariants for SL(2,C)SL(2, \mathbb{C}).
method Resurgent analysis applied to infinite families of Seifert manifolds and torus knot complements.
result The contribution from abelian flat connections contains information of all non-abelian flat connections, indicating a full partition function.

LA-MCTS learns search space partition for black-box optimization using Monte Carlo Tree Search.

problem High-dimensional black-box optimization challenges.
method LA-MCTS recursively splits search space into regions with high/low function values, learns nonlinear partition and local models online.
result LA-MCTS achieves strong performance in black-box optimization and reinforcement learning benchmarks, especially for high-dimensional problems.

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, ZZ, is then linear in the number of categories, which is problematic as real-world problem sets continue to grow in categorical types, such as …

2015-08-07abs ↗pdf ↗

In this paper we investigate the following existence problem for rational functions: for a given collection ΠΠ of partitions of a number nn to define whether there exists a rational function ff of degree nn for which ΠΠ is the branch datum. An important particular case when the answer to this problem is known is t…

2006-11-25abs ↗pdf ↗

Algorithms learn and test variable partitions in various groups and error metrics.

problem Learning and testing variable partitions in different groups and error metrics.
method Algorithms for agnostically learning and testing kk-partitionability over various groups and error metrics.
result Learning algorithms for kk-partitionability with polynomial time complexity and testing with adaptive queries.

AIS method improves estimation of RBM partition function with reduced computational cost.

problem Efficiently estimating partition function of RBMs for large systems.
method Annealed Importance Sampling (AIS) with optimized initialization.
result Good estimation of partition function Z with reduced computational cost.

We consider isotropic non lower semicontinuous weighted perimeter functionals defined on partitions of domains in Rn\mathbb{R}^n. 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…

2015-05-04abs ↗pdf ↗

We propose a new description of 3d N=2\mathcal{N}=2 theories which do not admit conventional Lagrangians. Given a quiver QQ and a mutation sequence mm on it, we define a 3d N=2\mathcal{N}=2 theory T[(Q,m)]\mathcal{T}[(Q,m)] in such a way that the Sb3S^3_b partition function of the theory coincides with the cluster partition f…

2013-01-24abs ↗pdf ↗

Summing over 3-manifolds using TQFT partition functions.

problem Summing over all 3-manifolds with fixed boundary.
method Rewriting the sum over 3-manifolds as a sum over homology groups, using TQFT partition functions and topological boundary conditions.
result Existence of a distribution of 2d TQFTs whose ensemble average equals the sum over 3-manifolds.