arXiv research

We study the existence of monopole bound states saturating the BPS bound in N=2 supersymmetric Yang-Mills theories. We describe how the existence of such bound states relates to the topology of index bundles over the moduli space of BPS solutions. Using an $L^2$ index theorem, we prove the existence of certain BPS stat…

It is known that knot homologies admit a physical description as spaces of open BPS states. We study operators and algebras acting on these spaces. This leads to a very rich story, which involves wall crossing phenomena, algebras of closed BPS states acting on spaces of open BPS states, and deformations of Landau-Ginzb…

Quantum map counts BPS states in special theories.

The paper connects quivers to knot complements and studies their BPS states and 3d N=2 theories.

We discuss relations between quantum BPS invariants defined in terms of a product decomposition of certain series, and difference equations (quantum A-polynomials) that annihilate such series. We construct combinatorial models whose structure is encoded in the form of such difference equations, and whose generating fun…

This paper provides both a detailed study of color-dependence of link homologies, as realized in physics as certain spaces of BPS states, and a broad study of the behavior of BPS states in general. We consider how the spectrum of BPS states varies as continuous parameters of a theory are perturbed. This question can be…

In this paper, deep neural network (DNN) is utilized to improve the belief propagation (BP) detection for massive multiple-input multiple-output (MIMO) systems. A neural network architecture suitable for detection task is firstly introduced by unfolding BP algorithms. DNN MIMO detectors are then proposed based on two m…

Constructs Ricci-flat K3 metrics using D-geometry.

We analyze relations between BPS degeneracies related to Labastida-Marino-Ooguri-Vafa (LMOV) invariants, and algebraic curves associated to knots. We introduce a new class of such curves that we call extremal A-polynomials, discuss their special properties, and determine exact and asymptotic formulas for the correspond…

We find a Sasaki-Einstein metric from a CFT state in AdS5.

Variational quantum computing faces a flat optimization landscape problem.

Belief propagation (BP) is a popular method for performing probabilistic inference on graphical models. In this work, we enhance BP and propose self-guided belief propagation (SBP) that incorporates the pairwise potentials only gradually. This homotopy continuation method converges to a unique solution and increases th…

Symmetrizes 4d and 3d BPS quivers for Argyres-Douglas theories.

We formulate large $N$ duality of $\mathrm{U}(N)$ refined Chern-Simons theory with a torus knot/link in $S^3$. By studying refined BPS states in M-theory, we provide the explicit form of low-energy effective actions of Type IIA string theory with D4-branes on the $Ω$-background. This form enables us to relate refined C…

We count the supersymmetric bound states of many distinct BPS monopoles in N=4 Yang-Mills theories and in pure N=2 Yang-Mills theories. The novelty here is that we work in generic Coulombic vacua where more than one adjoint Higgs fields are turned on. The number of purely magnetic bound states is again found to be cons…

Constructs BPS complexes and Chern--Simons theories from G-structures.

Sampling the parameters of high-dimensional Continuous Time Markov Chains (CTMC) is a challenging problem with important applications in many fields of applied statistics. In this work a recently proposed type of non-reversible rejection-free Markov Chain Monte Carlo (MCMC) sampler, the Bouncy Particle Sampler (BPS), i…

We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single satisfying assignment. Our first CSP solver, called Perturbed Blief …

The goal of this article is twofold. First, we find a natural home for the double affine Hecke algebras (DAHA) in the physics of BPS states. Second, we introduce new invariants of torus knots and links called "hyperpolynomials" that address the "problem of negative coefficients" often encountered in DAHA-based approach…

New $\alpha$-BP algorithm improves belief propagation for graphs with loops.

The sum-product or belief propagation (BP) algorithm is a widely used message-passing technique for computing approximate marginals in graphical models. We introduce a new technique, called stochastic orthogonal series message-passing (SOSMP), for computing the BP fixed point in models with continuous random variables.…

We consider BPS states in a large class of d=4, N=2 field theories, obtained by reducing six-dimensional (2,0) superconformal field theories on Riemann surfaces, with defect operators inserted at points of the Riemann surface. Further dimensional reduction on S^1 yields sigma models, whose target spaces are moduli spac…

New K3 metrics derived from torus orbifold loci.

State-of-the-art algorithms for sparse subspace clustering perform spectral clustering on a similarity matrix typically obtained by representing each data point as a sparse combination of other points using either basis pursuit (BP) or orthogonal matching pursuit (OMP). BP-based methods are often prohibitive in practic…

Topological Skyrmions as intricate spin textures were observed experimentally in helimagnets on 2d plane. Theoretical foundation of such solitonic states to appear in pure ferromagnetic model, as exact solutions expressed through any analytic function, was made long ago by Belavin and Polyakov (BP). We propose an innov…

Finding the most probable assignment (MAP) in a general graphical model is known to be NP hard but good approximations have been attained with max-product belief propagation (BP) and its variants. In particular, it is known that using BP on a single-cycle graph or tree reweighted BP on an arbitrary graph will give the …

New cobordism invariants derived from BPS q-series.

Crowdsourcing systems are popular for solving large-scale labelling tasks with low-paid workers. We study the problem of recovering the true labels from the possibly erroneous crowdsourced labels under the popular Dawid-Skene model. To address this inference problem, several algorithms have recently been proposed, but …

The sum-product or belief propagation (BP) algorithm is a widely-used message-passing algorithm for computing marginal distributions in graphical models with discrete variables. At the core of the BP message updates, when applied to a graphical model with pairwise interactions, lies a matrix-vector product with complex…

The paper extends BPS invariants for framed knots and links.

We argue how to identify supersymmetric quiver quantum mechanics description of BPS states, which arise in string theory in brane systems representing knots. This leads to a surprising relation between knots and quivers: to a given knot we associate a quiver, so that various types of knot invariants are expressed in te…

Existing methods for arterial blood pressure (BP) estimation directly map the input physiological signals to output BP values without explicitly modeling the underlying temporal dependencies in BP dynamics. As a result, these models suffer from accuracy decay over a long time and thus require frequent calibration. In t…

BP-DIP combines DIP and backprojection for image restoration.

Belief propagation (BP) can do exact inference in loop-free graphs, but its performance could be poor in graphs with loops, and the understanding of its solution is limited. This work gives an interpretable belief propagation rule that is actually minimization of a localized $α$-divergence. We term this algorithm as $α…

Receiver algorithms which combine belief propagation (BP) with the mean field (MF) approximation are well-suited for inference of both continuous and discrete random variables. In wireless scenarios involving detection of multiple signals, the standard construction of the combined BP-MF framework includes the equalizat…

Researchers create BPS monopoles with any desired symmetry breaking.

Computing partition function is the most important statistical inference task arising in applications of Graphical Models (GM). Since it is computationally intractable, approximate methods have been used to resolve the issue in practice, where mean-field (MF) and belief propagation (BP) are arguably the most popular an…

Recent changes to greenhouse gas emission policies are catalyzing the electric vehicle (EV) market making it readily accessible to consumers. While there are challenges that arise with dense deployment of EVs, one of the major future concerns is cyber security threat. In this paper, cyber security threats in the form o…

We provide a proof of backpropagation algorithm in matrix notation.

Study of continuous symmetries in Nahm data and BPS monopoles.

Restricted Boltzmann machines~(RBMs) and conditional RBMs~(CRBMs) are popular models for a wide range of applications. In previous work, learning on such models has been dominated by contrastive divergence~(CD) and its variants. Belief propagation~(BP) algorithms are believed to be slow for structured prediction on con…

We develop a method for finding the zero modes of the Dirac operator in the presence of BPS monopoles. We use it to find the zero modes in the case of Abelian BPS monopoles in $\mathbb R^3$.

BPNNs learn to solve combinatorial problems faster and more accurately.

Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment over a distribution represented by a Graphical Model (GM). It has been shown that BP can solve a number of combinatorial optimization problems including minimum weight matching, shortest path…

We propose a method for determining the spins of BPS states supported on line defects in 4d $\mathcal{N}=2$ theories of class S. Via the 2d-4d correspondence, this translates to the construction of quantum holonomies on a punctured Riemann surface $\mathcal{C}$. Our approach combines the technology of spectral networks…

The abstract discusses resurgent functions in quantum knot invariants.

Unified view of spectral networks linking geometry and gauge theory.

Attribution methods aim to explain a neural network's prediction by highlighting the most relevant image areas. A popular approach is to backpropagate (BP) a custom relevance score using modified rules, rather than the gradient. We analyze an extensive set of modified BP methods: Deep Taylor Decomposition, Layer-wise R…