Related papers: Curing the Andrews syndrom
The adaptive moment estimation algorithm Adam (Kingma and Ba) is a popular optimizer in the training of deep neural networks. However, Reddi et al. have recently shown that the convergence proof of Adam is problematic and proposed a variant…
Generative adversarial nets (GANs) have generated a lot of excitement. Despite their popularity, they exhibit a number of well-documented issues in practice, which apparently contradict theoretical guarantees. A number of enlightening…
We show that the equations underlying the $GW$ approximation have a large number of solutions. This raises the question: which is the physical solution? We provide two theorems which explain why the methods currently in use do, in fact,…
The notion of normal forms is ubiquitous in various equivalent transformations. Confluence (CR), one of the central properties of term rewriting systems (TRSs), concerns uniqueness of normal forms. Yet another such property, which is weaker…
Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic systems. In recent experiments a randomised equivalence test…
Many recent investigations conclude, based on asymptotic complexity analyses, that quantum computers could accelerate combinatorial optimization (CO) tasks relative to a purely classical computer. However, asymptotic analysis alone cannot…
We use the Wilf-Zeilberger method to prove identities between Mahler measures of polynomials. In particular, we offer a new proof of a formula due to Lal\'{i}n, and we show how to translate the identity into a formula involving elliptic…
In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…
A nonhomogeneous system of linear recurrence equations can be recognized by an automaton $\mathcal{A}$ over a one-letter alphabet $A = \{z\}$. Conversely, the automaton $\mathcal{A}$ generates precisely this nonhomogeneous system of linear…
We develop new computational methods for studying potential counterexamples to the Andrews-Curtis conjecture, in particular, Akbulut-Kurby examples AK(n). We devise a number of algorithms in an attempt to disprove the most interesting…
In a real Hilbert space setting, we reconsider the classical Arrow-Hurwicz differential system in view of solving linearly constrained convex minimization problems. We investigate the asymptotic properties of the differential system and…
Alzheimers disease (AD) is a severe neurological brain disorder. It is not curable, but earlier detection can help improve symptoms in a great deal. The machine learning based approaches are popular and well motivated models for medical…
The antifield formalism is extended so as to incorporate the rigid symmetries of a given theory. To that end, it is necessary to introduce global ghosts not only for the given rigid symmetries, but also for all the higher order conservation…
By considering a limiting case of a Kronecker-type identity, we obtain an identity found by both Andrews and Crandall. We then use the Andrews-Crandall identity to give a new proof of a formula of Gauss for the representations of a number…
We describe a "top down" approach for automated theorem proving (ATP). Researchers might usefully investigate the forms of the theorems mathematicians use in practice, carefully examine how they differ and are proved in practice, and code…
Recent developments in the theory and application of the Hardy-Littlewood method are discussed, concentrating on aspects associated with diagonal diophantine problems. Recent efficient differencing methods for estimating mean values of…
In this paper, we explore cooperative and competitive coupled obstacle systems, which, up to now, are new type obstacle systems and formed by coupling two equations belonging to classical obstacle problem. On one hand, applying the…
We consider the periodic homogenisation problem for the generalised parabolic Anderson model on the two dimensional torus. We show that, for the renormalisation that respects Wick ordering, the homogenisation and renormalisation procedures…
We introduce several new identities combining basic hypergeometric sums and integrals. Such identities appear in the context of superconformal index computations for three-dimensional supersymmetric dual theories. We give both analytic…