Related papers: A Swendsen-Wang update algorithm for the Symanzik …
We consider spin systems with nearest-neighbor interactions on an $n$-vertex $d$-dimensional cube of the integer lattice graph $\mathbb{Z}^d$. We study the effects that exponential decay with distance of spin correlations, specifically the…
We develop an implementable stochastic proximal point (SPP) method for a class of weakly convex, composite optimization problems. The proposed stochastic proximal point algorithm incorporates a variance reduction mechanism and the resulting…
We present a systematic approach for the semiclassical treatment of many-body dynamics of interacting, open spin systems. Our approach overcomes some of the shortcomings of the recently developed discrete truncated Wigner approximation…
Striped variation of the Smith-Waterman algorithm is known as extremely efficient and easily adaptable for the SIMD architectures. However, the potential for improvement has not been exhausted yet. The popular Lazy-F loop heuristic requires…
We extend the Frank-Wolfe (FW) optimization algorithm to solve constrained smooth convex-concave saddle point (SP) problems. Remarkably, the method only requires access to linear minimization oracles. Leveraging recent advances in FW…
The purpose of this article is to give a Chlodowsky type generalization of Szasz operators defined by means of the Sheffer type polynomials. We obtain convergence properties of our operators with the help of Korovkin's theorem and the order…
This note introduces a method for sampling Ising models with mixed boundary conditions. As an application of annealed importance sampling and the Swendsen-Wang algorithm, the method adopts a sequence of intermediate distributions that keeps…
Modifications to Swisdak [Phys. Plasmas 20, 062110 (2013)]'s rejection sampling algorithm for drawing a Maxwell-J\"{u}ttner distribution in particle simulations are presented. Handy approximations for $e$-folding points and a linear slope…
This paper explores an incremental training strategy for the skip-gram model with negative sampling (SGNS) from both empirical and theoretical perspectives. Existing methods of neural word embeddings, including SGNS, are multi-pass…
Recent progress in developing general purpose text embedders has been driven by training on ever-growing corpora of synthetic LLM-generated data. Nonetheless, no publicly available synthetic dataset exists, posing a barrier to studying its…
In this paper, we propose an improved iterative method for solving the monotone inclusion problem in the form of $0 \in Ax + Dx + N_{C}(x)$ in real Hilbert space, where $A$ is a maximally monotone operator, $D$ and $B$ are monotone and…
Grokking, a delayed generalization in neural networks after perfect training performance, has been observed in Transformers and MLPs, but the components driving it remain underexplored. We show that embeddings are central to grokking:…
Recently, there has been a renewed interest in the machine learning community for variants of a sparse greedy approximation procedure for concave optimization known as {the Frank-Wolfe (FW) method}. In particular, this procedure has been…
A new over-improved stout-link smearing algorithm, designed to stabilise instanton-like objects, is presented. A method for quantifying the selection of the over-improvement parameter, $\epsilon$, is demonstrated. The new smearing algorithm…
In this paper, we consider nonconvex minimax optimization, which is gaining prominence in many modern machine learning applications such as GANs. Large-scale edge-based collection of training data in these applications calls for…
We show that linear congruential pseudo-random-number generators can cause systematic errors in Monte Carlo simulations using the Swendsen-Wang algorithm, if the lattice size is a multiple of a very large power of 2 and one random number is…
We describe a number of recently developed cluster-flipping algorithms for the efficient simulation of classical spin models near their critical temperature. These include the algorithms of Wolff, Swendsen and Wang, and Niedermeyer, as well…
A particularly simple setup is introduced to study the influence of time-delayed coherent feedback on the optical squeezing properties of the degenerate parametric amplifier (DPA). The possibility for significantly enhanced squeezing is…
We propose an inexact Uzawa algorithm with two variable relaxation parameters for solving the generalized saddle-point system. The saddle-point problems can be found in a wide class of applications, such as the augmented Lagrangian…
Recent advances in transformer-based Large Language Models (LLMs) have demonstrated remarkable capabilities across various tasks. However, their quadratic computational complexity concerning sequence length remains a significant bottleneck…