A New Algorithm to Fit Exponential Decays
Juan Antonio Fern\'andez Torvisco, Mariano Rodr\'iguez-Arias, Fern\'andez, Javier Cabello S\'anchez

TL;DR
This paper introduces a novel algorithm for fitting exponential decay models that leverages the quasiconvexity of the error function, enabling efficient estimation without initial guesses.
Contribution
The paper proves quasiconvexity of the error function for exponential decay fitting and proposes a new algorithm that does not require initial guesses.
Findings
Algorithm effectively fits exponential decays.
No initial guess needed for the estimation.
The approach is based on quasiconvexity proof.
Abstract
This paper deals with some nonlinear problems which exponential and biexponential decays are involved in. A proof of the quasiconvexity of the error function in some of these problems of optimization is presented. This proof is restricted to fitting observations by means of exponentials having the form Based on its quasiconvexity, we propose an algorithm to estimate the best approximation to each of these decays. Besides, this algorithm does not require an initial guess.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Cellular Automata and Applications · Distributed systems and fault tolerance
