Related papers: A variance-minimization scheme for optimizing Jast…
We utilise a sampler originating from nonequilibrium statistical mechanics, termed here Jarzynski-adjusted Langevin algorithm (JALA), to build statistical estimation methods in latent variable models. We achieve this by leveraging…
Maximizing the precision in estimating parameters in a quantum system subject to instrumentation constraints is cast as a convex optimization problem. We account for prior knowledge about the parameter range by developing a worst-case and…
Chance constrained program is computationally intractable due to the existence of chance constraints, which are randomly disturbed and should be satisfied with a probability. This paper proposes a two-layer randomized algorithm to address…
We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph…
The algorithm of modified wavelet analysis is discussed. It is based on the weighted least squares approximation. Contrary to the Gaussian as a weight function, we propose to use a compact weight function. The accuracy estimates using the…
Empirical force fields employed in molecular dynamics simulations of complex systems can be optimised to reproduce experimentally determined structural and thermodynamic properties. In contrast, experimental knowledge about the rates of…
We present an improved formalism for quantum Monte Carlo calculations of energy derivatives and properties (e.g. the interatomic forces), with a multideterminant Jastrow-Slater function. As a function of the number $N_e$ of Slater…
Quantum Monte Carlo simulations of interacting electrons in solids often use Slater-Jastrow trial wave functions with Jastrow factors containing one- and two-body terms. In uniform systems the long-range behavior of the two-body term may be…
A mathematical extension of the weak value formalism to the simultaneous measurement of multiple parameters is presented in the context of an optical focused vector beam scatterometry experiment. In this example, preselection and…
We commonly encounter the problem of identifying an optimally weight adjusted version of the empirical distribution of observed data, adhering to predefined constraints on the weights. Such constraints often manifest as restrictions on the…
This paper proposes a max-test for testing (possibly infinitely) many zero parameter restrictions in an extremum estimation framework. The test statistic is formed by estimating key parameters one at a time based on many empirical loss…
Gutzwiller functions are popular variational wavefunctions for correlated electrons in Hubbard models. Following the variational principle, we are interested in the Gutzwiller parameters that minimize e.g. the expectation value of the…
Multiple importance sampling (MIS) is an increasingly used methodology where several proposal densities are used to approximate integrals, generally involving target probability density functions. The use of several proposals allows for a…
In this paper, we develop new fast and efficient algorithms for designing single/multiple unimodular waveforms/codes with good auto- and cross-correlation or weighted correlation properties, which are highly desired in radar and…
This paper proposes computationally efficient algorithms to maximize the energy efficiency in multi-carrier wireless interference networks, by a suitable allocation of the system radio resources, namely the transmit powers and subcarrier…
The minimum of the Gutzwiller energy functional depends on the number of parameters considered in the variational state. For a three-orbital Hubbard model we find that the frequently used diagonal Ansatz is very accurate in high-symmetry…
The increased use of low-cost gyroscopes within inertial sensors for navigation purposes, among others, has brought to the development of a considerable amount of research in improving their measurement precision. Aside from developing…
We present a statistical framework to benchmark the performance of reconstruction algorithms for linear inverse problems, in particular, neural-network-based methods that require large quantities of training data. We generate synthetic…
Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is…
We introduce a basis of counting functions that, by cleanly tessellating three dimensional space, allows real space number counting Jastrow factors to be straightforwardly applied to general molecular situations. By exerting direct control…