Papers › Rational approximation and its application to improving deep learning classifiers
Rational approximation and its application to improving deep learning classifiers
V. Peiris, N. Sharon, N. Sukhorukova J. Ugon
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial approximations are not efficient. We prove that the optimisation problems appearing in the best uniform rational approximation are quasiconvex, and show how to use this fact for calculating the best approximation in a fast and efficient method. The paper presents a theoretical study of the arising optimisation problems and provides results of several numerical experiments. In all our computations, the algorithms terminated at optimal solutions. We apply our approximation as a preprocess step to deep learning classifiers and demonstrate that the classification accuracy is significantly improved compared to the classification of the raw signals.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections