相关论文: A simple way to speedup Gauss Elimination

We present a modified Gibbs sampler for general state spaces. We establish that this modification can lead to substantial gains in statistical efficiency while maintaining the overall quality of convergence. We illustrate our results in two…

Flexible systems are linear systems of inclusions in which the elements of the coefficient matrix are external numbers in the sense of nonstandard analysis. External numbers represent real numbers with small, individual error terms. Using…

The main purpose of this article is to study higher power mean values of generalized quadratic Gauss sums using estimates for character sums, analytic method and algebraic geometric methods. In this article, we prove two conjectures which…

We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with non destructive single-shot readout of the two qubits. With this processor, we run the Grover…

A q-Gauss-Newton algorithm is an iterative procedure that solves nonlinear unconstrained optimization problems based on minimization of the sum squared errors of the objective function residuals. Main advantage of the algorithm is that it…

Recent work by Nesterov and Stich showed that momentum can be used to accelerate the rate of convergence for block Gauss-Seidel in the setting where a fixed partitioning of the coordinates is chosen ahead of time. We show that this setting…

Expectation Propagation is a very popular algorithm for variational inference, but comes with few theoretical guarantees. In this article, we prove that the approximation errors made by EP can be bounded. Our bounds have an asymptotic…

This paper describes a fast and stable algorithm for evaluating Bermudan swaption under the two factor Hull-White model. We discretize the calculation of the expected value in the evaluation of Bermudan swaption by numerical integration,…

Gaussian Boson sampling (GBS) provides a highly efficient approach to make use of squeezed states from parametric down-conversion to solve a classically hard-to-solve sampling problem. The GBS protocol not only significantly enhances the…

This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an…

3D Gaussian Splatting reconstructs scenes by starting from a sparse Structure-from-Motion initialization and refining under-reconstructed regions. This process is slow, as it requires multiple densification steps where Gaussians are…

Gauge-fixing as a sampling procedure of gauge copies provides a possibility to construct well-defined gauges also beyond perturbation theory. The implementation of such sampling strategies in lattice gauge theory is briefly outlined, and…

Gaussian splatting (GS) for 3D reconstruction has become quite popular due to their fast training, inference speeds and high quality reconstruction. However, GS-based reconstructions generally consist of millions of Gaussians, which makes…

We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. This class of relaxations for combinatorial optimization has so far eluded quantum speedups. Our methods combine…

In this paper, we propose a Gaussian Process (GP) emulator for the calculation of a) tomographic weak lensing band-power spectra, and b) coefficients of summary data massively compressed with the MOPED algorithm. In the former case…

This work mainly presents a relativistic analytical calculating method for the finite speed-of-light effect in atom gravimeters, which can simplify the deriva- tion and give a more complete expression for the associated correction.

In an attempt to look for a viable mechanism leading to a present-day accelerated expansion, we investigate the possibility that the observed cosmic speed up may be recovered in the framework of the Rastall's theory, relying on the…

Silicon quantum dot devices stand as promising candidates for large-scale quantum computing due to their extended coherence times, compact size, and recent experimental demonstrations of sizable qubit arrays. Despite the great potential,…

We present FAST-Splat for fast, ambiguity-free semantic Gaussian Splatting, which seeks to address the main limitations of existing semantic Gaussian Splatting methods, namely: slow training and rendering speeds; high memory usage; and…

We study two different versions of the simple exclusion process on augmented Galton-Watson trees, the constant speed model and the varying speed model. In both cases, the simple exclusion process starts from an equilibrium distribution with…