Related papers: Second Moment Method on k-SAT: a General Framework
In this paper, we consider an inference problem for the first order autoregressive process driven by a long memory stationary Gaussian process. Suppose that the covariance function of the noise can be expressed as $\abs{k}^{2H-2}$ times a…
In simultaneous translation (SimulMT), the most widely used strategy is the wait-k policy thanks to its simplicity and effectiveness in balancing translation quality and latency. However, wait-k suffers from two major limitations: (a) it is…
This paper introduces a new approach to solving a continuous-time version of the multi-agent path finding problem. The algorithm translates the problem into an extension of the classical Boolean satisfiability problem, satisfiability modulo…
Scattering moments provide nonparametric models of random processes with stationary increments. They are expected values of random variables computed with a nonexpansive operator, obtained by iteratively applying wavelet transforms and…
In this paper, we extend Beta distribution to 2 by 2 matrix and give the analytical formula for its moments. Our analytical formula can be used to analyze the asymptotic behavior of Beta distribution for 2 by 2 matrix.
Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause…
The Method of Moments [Pea94] is one of the most widely used methods in statistics for parameter estimation, by means of solving the system of equations that match the population and estimated moments. However, in practice and especially…
We introduce a new class of algorithms, Stochastic Generalized Method of Moments (SGMM), for estimation and inference on (overidentified) moment restriction models. Our SGMM is a novel stochastic approximation alternative to the popular…
This paper concerns with numerical approximations of solutions of second order fully nonlinear partial differential equations (PDEs). A new notion of weak solutions, called moment solutions, is introduced for second order fully nonlinear…
This paper describes diff-SAT, an Answer Set and SAT solver which combines regular solving with the capability to use probabilistic clauses, facts and rules, and to sample an optimal world-view (multiset of satisfying Boolean variable…
We compute an asymptotic formula for a moment involving the spinor and the standard $L$-functions for holomorphic Siegel cusp forms of degree two and large weight $k$. Applications include simultaneous non-vanishing statements and lower…
We study stochastic second-order methods for solving general non-convex optimization problems. We propose using a special version of momentum to stabilize the stochastic gradient and Hessian estimates in Newton's method. We show that…
Much of the recent work on random constraint satisfaction problems has been inspired by ingenious but non-rigorous approaches from physics. The physics predictions typically come in the form of distributional fixed point problems that are…
A new framework for deriving equations of motion for constrained quantum systems is introduced, and a procedure for its implementation is outlined. In special cases the framework reduces to a quantum analogue of the Dirac theory of…
Non-commutative polynomial optimization is a powerful technique with numerous applications in quantum nonlocality, quantum key distribution, causal inference, many-body physics, amongst others. The standard approach is to reduce such…
This paper exposes the underlying mechanism for obtaining second integral moments of $GL_2$ automorphic $L$--functions over an arbitrary number field. Here, moments for $GL_2$ are presented in a form enabling application of the structure of…
A rigorous full-wave modal analysis based on the method of moments in the spectral domain is presented for line waveguides constituted by two-part impedance planes with arbitrary anisotropic surface impedances. An integral equation is…
Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem…
To study the structure of solutions for random k-SAT and random CSPs, this paper introduces the concept of average similarity degree to characterize how solutions are similar to each other. It is proved that under certain conditions, as r…
Continuing our earlier work in \cite{nss20a}, we study the random regular k-NAE-SAT model in the condensation regime. In \cite{nss20a}, the 1RSB properties of the model were established with positive probability. In this paper, we improve…