A general learning algorithm for functions between metric spaces
Kerry M. Soileau

TL;DR
This paper introduces a universal learning algorithm capable of approximating functions between any two metric spaces, broadening the scope of learnable functions beyond traditional settings.
Contribution
It presents a general framework for learning functions between metric spaces, extending existing methods to more abstract and diverse spaces.
Findings
The algorithm effectively approximates functions in various metric spaces.
The approach generalizes previous learning algorithms to broader contexts.
Experimental results demonstrate the algorithm's versatility and accuracy.
Abstract
In this paper we show how to approximate ("learn") a function f, where X and Y are metric spaces.
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
TopicsNeural Networks and Applications
