English
Related papers

Related papers: Fermat descent

200 papers

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…

General Mathematics · Mathematics 2007-05-23 Joseph Amal Nathan

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…

Optimization and Control · Mathematics 2018-03-19 Jan Mankau , Friedemann Schuricht

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…

Algebraic Geometry · Mathematics 2022-11-28 Nachiketa Adhikari

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.…

Algebraic Geometry · Mathematics 2025-02-14 Timothy De Deyn , Pat Lank , Kabeer Manali Rahul

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…

Optimization and Control · Mathematics 2023-01-19 X. Y. Han , Adrian S. Lewis

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…

Optimization and Control · Mathematics 2021-09-22 Dan Shiebler

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.

Optimization and Control · Mathematics 2025-09-19 Andrew J. Young

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…

Mathematical Physics · Physics 2011-10-04 Michael Baake , Uwe Grimm

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…

Optimization and Control · Mathematics 2022-12-23 Patrick M. Wensing , Jean-Jacques E. Slotine

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…

Quantum Physics · Physics 2020-05-27 James Stokes , Josh Izaac , Nathan Killoran , Giuseppe Carleo

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…

Algebraic Geometry · Mathematics 2021-10-27 Brian Conrad , Michael Temkin

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…

Machine Learning · Computer Science 2022-02-18 Atılım Güneş Baydin , Barak A. Pearlmutter , Don Syme , Frank Wood , Philip Torr

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…

Logic in Computer Science · Computer Science 2022-01-17 Hing Lun Chan

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…

Quantum Algebra · Mathematics 2017-11-16 Boris Feigin , Alexander Odesskii

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…

Numerical Analysis · Mathematics 2016-12-07 G. Manzini , K. Lipnikov , J. D. Moulton , M. Shashkov

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.…

Number Theory · Mathematics 2018-09-18 V. Beresnevich , R. C. Vaughan , S. Velani , E. Zorin

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…

Number Theory · Mathematics 2007-05-23 Allan J. Macleod

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…

Functional Analysis · Mathematics 2021-10-05 Cyril Belardinelli

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…

Numerical Analysis · Mathematics 2015-11-10 Jerome Droniou , Robert Eymard , Raphaele Herbin

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…

Machine Learning · Computer Science 2025-10-08 Reza T. Batley , Sourav Saha
‹ Prev 1 3 4 5 6 7 10 Next ›