A Function Fitting Method

11/04/2018
by   Rajesh Dachiraju, et al.
0

In this article we present a function fitting method, which is a convex minimization problem and can be solved using a gradient descent algorithm. We also provide some analysis on the fitness of the function to the data. The function fitting problem is also shown to be a solution of a linear, weak pde which contains some global terms. We describe a simple numerical solution using a gradient descent algorithm, that converges uniformly to the actual solution.As the minimization problem is also that of a quadratic form, there also exists a numerical method using linear algebra.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2020

Iterative Pre-Conditioning to Expedite the Gradient-Descent Method

Gradient-descent method is one of the most widely used and perhaps the m...
research
09/10/2019

First Analysis of Local GD on Heterogeneous Data

We provide the first convergence analysis of local gradient descent for ...
research
01/05/2019

Analysis of a Two-Layer Neural Network via Displacement Convexity

Fitting a function by using linear combinations of a large number N of `...
research
01/31/2020

Learning Unitaries by Gradient Descent

We study the hardness of learning unitary transformations by performing ...
research
05/25/2019

Ultrametric Fitting by Gradient Descent

We study the problem of fitting an ultrametric distance to a dissimilari...
research
11/03/2020

The Complexity of Gradient Descent: CLS = PPAD ∩ PLS

We study search problems that can be solved by performing Gradient Desce...
research
06/10/2022

Extremal Fitting Problems for Conjunctive Queries

The fitting problem for conjunctive queries (CQs) is the problem to cons...

Please sign up or login with your details

Forgot password? Click here to reset