Functional Penalised Basis Pursuit on Spheres
Matthieu Simeoni

TL;DR
This paper introduces a comprehensive framework for spherical functional inverse problems, combining theoretical insights with practical algorithms for recovering spherical fields using penalised basis pursuit with gTV regularisation.
Contribution
It presents a novel representer theorem characterising solutions as spherical splines with sparse innovations and develops an efficient discretisation and optimisation scheme.
Findings
Framework is compatible with various measurement types.
Solution sets characterized by spherical splines with sparse innovations.
Demonstrated effectiveness on environmental science data.
Abstract
In this paper, we propose a unified theoretical and practical spherical approximation framework for functional inverse problems on the hypersphere. More specifically, we consider recovering spherical fields directly in the continuous domain using functional penalised basis pursuit problems with gTV regularisation terms. Our framework is compatible with various measurement types as well as non-differentiable convex cost functionals. Via a novel representer theorem, we characterise their solution sets in terms of spherical splines with sparse innovations. We use this result to derive an approximate canonical spline-based discretisation scheme, with vanishing approximation error. To solve the resulting finite-dimensional optimisation problem, we propose an efficient and provably convergent primal-dual splitting algorithm. We illustrate the versatility of our framework on real-life examples…
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.
