Compensated Convexity Methods for Approximations and Interpolations of Sampled Functions in Euclidean Spaces: Theoretical Foundations
Kewei Zhang, Elaine Crooks, Antonio Orlando

TL;DR
This paper presents new compensated convexity-based methods for approximating and interpolating sampled functions in Euclidean spaces, providing theoretical error bounds and stability analysis.
Contribution
It introduces Lipschitz and $C^{1,1}$ approximation techniques using compensated convex transforms with proven error estimates and stability properties.
Findings
Error estimates for various function classes
Methods are differentiation and integration free
Stable with respect to sample Hausdorff distance
Abstract
We introduce Lipschitz continuous and geometric approximation and interpolation methods for sampled bounded uniformly continuous functions over compact sets and over complements of bounded open sets in by using compensated convex transforms. Error estimates are provided for the approximations of bounded uniformly continuous functions, of Lipschitz functions, and of functions. We also prove that our approximation methods, which are differentiation and integration free and not sensitive to sample type, are stable with respect to the Hausdorff distance between samples.
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
TopicsOptimization and Variational Analysis · Numerical methods in inverse problems · Sparse and Compressive Sensing Techniques
