DOE OSTI · 1828547
Topological Regularization via Persistence-Sensitive Optimization
Abstract
Optimization, a key tool in machine learning and statistics, relies on regularization to reduce overfitting. Traditional regularization methods control a norm of the solution to ensure its smoothness. Recently, topological methods have emerged as a way to provide a more precise and expressive control over the solution, relying on persistent homology to quantify and reduce its roughness. All such existing techniques back-propagate gradients through the persistence diagram, which is a summary of the topological features of a function. Their downside is that they provide information only at the critical points of the function. We propose a method that instead builds on persistence-sensitive simplification and translates the required changes to the persistence diagram into changes on large subsets of the domain, including both critical and regular points. This approach enables a faster and more precise topological regularization, the benefits of which we illustrate with experimental evidence.
Keep this discovery
Explore connections, maps & timelines
Nigmetov, Arnur, Krishnapriyan, Aditi S, Sanderson, Nicole, Morozov, Dmitriy. 2020-11-10. Topological Regularization via Persistence-Sensitive Optimization. https://searchnasa.com/record/osti%3A1828547/topological-regularization-via-persistence-sensitive-optimization
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.