Related papers: Bethe Ansatz in the Bernoulli Matching Model of Ra…
The $so(5)$ (i.e., $B_2$) quantum integrable spin chains with both periodic and non-diagonal boundaries are studied via the off-diagonal Bethe Ansatz method. By using the fusion technique, sufficient operator product identities (comparing…
We have recently constructed a large class of open quantum spin chains which have quantum-algebra symmetry and which are integrable. We show here that these models can be exactly solved using a generalization of the analytical Bethe Ansatz…
We study the persistent homology of random \v{C}ech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical framework in which we can state and address our main…
The Bethe ansatz equations are presented for Bariev's correlated electron chain with boundaries. This is achieved by using the coordinate space Bethe ansatz method.
Sequence-to-sequence models are commonly trained via maximum likelihood estimation (MLE). However, standard MLE training considers a word-level objective, predicting the next word given the previous ground-truth partial sentence. This…
The Nested Bethe Ansatz is generalized to open boundary conditions. This is used to find the exact eigenvectors and eigenvalues of the $A_{n-1}$ vertex model with fixed open boundary conditions and the corresponding $SU_{q}(n)$ invariant…
Recurrent neural networks (RNNs), such as long short-term memory networks (LSTMs), serve as a fundamental building block for many sequence learning tasks, including machine translation, language modeling, and question answering. In this…
The Bethe ansatz, both in its coordinate and its algebraic version, is an exceptional method to compute the eigenvectors and eigenvalues of integrable systems. However, computing correlation functions using the eigenvectors thus constructed…
One of the ways to improve the performance of a target task is to learn the transfer of abundant knowledge of a pre-trained network. However, learning of the pre-trained network requires high computation capability and large-scale labeled…
We propose a Bayesian approach, called the posterior spectral embedding, for estimating the latent positions in random dot product graphs, and prove its optimality. Unlike the classical spectral-based adjacency/Laplacian spectral embedding,…
The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…
The Bradley-Terry-Luce (BTL) model is a classic and very popular statistical approach for eliciting a global ranking among a collection of items using pairwise comparison data. In applications in which the comparison outcomes are observed…
We present a dynamic prediction framework for binary sequences that is based on a Bernoulli generalization of the auto-regressive process. Our approach lends itself easily to variants of the standard link prediction problem for a sequence…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
The Bethe ansatz in its several formulations is the common tool for the exact solution of one dimensional quantum Hamiltonians. This ansatz asserts that the several eigenfunctions of the Hamiltonians are given in terms of a sum of…
We present a unified algebraic Bethe ansatz for open vertex models which are associated with the non-exceptional $A^{(2)}_{2n},A^{(2)}_{2n-1},B^{(1)}_n,C^{(1)}_n,D^{(1)}_{n}$ Lie algebras. By the method, we solve these models with the…
Comparing observed behavior (event data generated during process executions) with modeled behavior (process models), is an essential step in process mining analyses. Alignments are the de-facto standard technique for calculating conformance…
A new approach for solving the Bethe ansatz (Gaudin-Richardson) equations of the standard pairing problem is established based on the Heine-Stieltjes correspondence. For $k$ pairs of valence nucleons on $n$ different single-particle levels,…
Recognizing named entities (NEs) is commonly conducted as a classification problem that predicts a class tag for a word or a NE candidate in a sentence. In shallow structures, categorized features are weighted to support the prediction.…
The generic quantum $\tau_2$-model (also known as Baxter-Bazhanov-Stroganov (BBS) model) with periodic boundary condition is studied via the off-diagonal Bethe Ansatz method. The eigenvalues of the corresponding transfer matrix (solutions…