Related papers: Speeding up parallel tempering simulations
We propose various improvements of finite step-size updating for full QCD on the lattice that might turn finite step-size updating into a viable alternative to the hybrid Monte Carlo algorithm. These improvements are noise reduction of the…
The main barrier to progress in the task of Formality Style Transfer is the inadequacy of training data. In this paper, we study how to augment parallel data and propose novel and simple data augmentation methods for this task to obtain…
In this work we illustrate our novel quantitative simulation approach for dense amorphous polymer systems, as discussed in our previous work[Kulkarni et al., A Novel Approach for Lattice Simulations of Polymer Chains in Dense Amorphous…
We study the 4d Heisenberg spin glass model with Gaussian nearest-neighbor interactions. We use finite size scaling to analyze the data. We find a behavior consistent with a finite temperature spin glass transition. Our estimates for the…
Speculative decoding has proven to be an efficient solution to large language model (LLM) inference, where the small drafter predicts future tokens at a low cost, and the target model is leveraged to verify them in parallel. However, most…
Recent advancements in Large Language Models (LLMs) have created new opportunities to enhance performance on complex reasoning tasks by leveraging test-time computation. However, existing scaling methods have key limitations: parallel…
We develop and implement a parallel flatPERM algorithm \cite{G97,PK04} with mutually interacting parallel flatPERM sequences and use it to sample self-avoiding walks in 2 and 3 dimensions. Our data show that the parallel implementation…
We study the first order phase transition of the fixed-connectivity triangulated surface model using the Parallel Tempering Monte Carlo (PTMC) technique on relatively large lattices. From the PTMC results, we find that the transition is…
Optimization-based falsification employs stochastic optimization algorithms to search for error input of hybrid systems. In this paper we introduce a simple idea to enhance falsification, namely time staging, that allows the time-causal…
We show that, when the double bootstrap is used to improve performance of bootstrap methods for bias correction, techniques based on using a single double-bootstrap sample for each single-bootstrap sample can be particularly effective. In…
In this paper, we revisit the large-scale constrained linear regression problem and propose faster methods based on some recent developments in sketching and optimization. Our algorithms combine (accelerated) mini-batch SGD with a new…
Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…
We report on experimental measurement of the Hilbert-Schmidt distance between two two-qubit states by many-particle interference. We demonstrate that our three-step method for measuring distances in Hilbert space is far less complex than…
Atomistic simulations of thermodynamic properties of magnetic materials rely on an accurate modelling of magnetic interactions and an efficient sampling of the high-dimensional spin space. Recent years have seen significant progress with a…
With the steady increase in the precision of flavour physics measurements collected during LHC Run 2, the LHCb experiment requires simulated data samples of larger and larger sizes to study the detector response in detail. The simulation of…
The paper studies a problem of constructing simultaneous likelihood-based confidence sets. We consider a simultaneous multiplier bootstrap procedure for estimating the quantiles of the joint distribution of the likelihood ratio statistics,…
In this paper we combine the Parareal parallel-in-time method together with spatial parallelization and investigate this space-time parallel scheme by means of solving the three-dimensional incompressible Navier-Stokes equations.…
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm cite{BKL75}, which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is…
For distributions over discrete product spaces $\prod_{i=1}^n \Omega_i'$, Glauber dynamics is a Markov chain that at each step, resamples a random coordinate conditioned on the other coordinates. We show that $k$-Glauber dynamics, which…
The tempered Lefschetz thimble method (TLTM) is a parallel-tempering algorithm towards solving the numerical sign problem. It tames both the sign and ergodicity problems simultaneously by tempering the system with the flow time of…