Related papers: Fermat descent
We will be presenting two theorems in this paper. The first theorem, which is a new result, is about the non-existence of integer solutions of the cubic diophantine equation. In the proof of this theorem we have used some known results from…
For a locally Lipschitz continuous function $f:X\to\mathbb{R}$ the generalized gradient $\partial f(x)$ of Clarke is used to develop some (set-valued) gradient on a set $A\subset X$. Existence, uniqueness and some approximation are…
We define a derived enhancement of the classical quot functor of quotients associated to a coherent sheaf on a nonsingular quasiprojective variety. We prove its representability and show that it has the expected tangent complex. The derived…
Our work shows forms of descent, in the fppf, h and \'{e}tale topologies, for strong generation of the bounded derived category of a noncommutative coherent algebra over a scheme. Even for (commutative) schemes this yields new perspectives.…
For strongly convex objectives that are smooth, the classical theory of gradient descent ensures linear convergence relative to the number of gradient evaluations. An analogous nonsmooth theory is challenging. Even when the objective is…
The Cartesian reverse derivative is a categorical generalization of reverse-mode automatic differentiation. We use this operator to generalize several optimization algorithms, including a straightforward generalization of gradient descent…
We identity the optimal non-infinitesimal direction of descent for a convex function. An algorithm is developed that can theoretically minimize a subset of (non-convex) functions.
Mathematical diffraction theory is concerned with the analysis of the diffraction image of a given structure and the corresponding inverse problem of structure determination. In recent years, the understanding of systems with continuous and…
This paper considers the analysis of continuous time gradient-based optimization algorithms through the lens of nonlinear contraction theory. It demonstrates that in the case of a time-invariant objective, most elementary results on…
A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction…
In this paper we study two types of descent in the category of Berkovich analytic spaces: flat descent and descent with respect to an extension of the ground field. Quite surprisingly, the deepest results in this direction seem to be of the…
Using backpropagation to compute gradients of objective functions for optimization has remained a mainstay of machine learning. Backpropagation, or reverse-mode differentiation, is a special case within the general family of automatic…
The two squares theorem of Fermat is a gem in number theory, with a spectacular one-sentence "proof from the Book". Here is a formalisation of this proof, with an interpretation using windmill patterns. The theory behind involves…
We study flat deformations of quotients of a polynomial algebra in a class of graded commutative associative algebras. Functional equations and their solutions in terms of theta functions play important role in these studies. An analog of…
We study the convergence of the new family of mimetic finite difference schemes for linear diffusion problems recently proposed in [38]. In contrast to the conventional approach, the diffusion coefficient enters both the primary mimetic…
In this paper we develop a new explicit method to studying rational points near manifolds and obtain optimal lower bounds on the number of rational points of bounded height lying at a given distance from an arbitrary non-degenerate curve.…
We consider the practical computation of rational points on y^2=x(x^2+ax+b). The algebra necessary for a 4-descent procedure is described. A simple further descent is then described which only uses integer arithmetic. Numerous examples are…
In the present article, the author uses Fourier theory of tempered distributions (generalized functions) in deriving a formula for Dirichlet-like integrals. The applied method is remarkably efficient and allows a solution in a few…
The gradient scheme framework is based on a small number of properties and encompasses a large number of numerical methods for diffusion models. We recall these properties and develop some new generic tools associated with the gradient…
Training - the optimisation of complex models - is traditionally performed through small, local, iterative updates [D. E. Rumelhart, G. E. Hinton, R. J. Williams, Nature 323, 533-536 (1986)]. Approximating solutions through truncated…