Abstract
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays an important role in a wide variety of areas, such as numerical analysis, machine learning, and topology, but is poorly understood in the context of (combinatorial) algorithms.
In this paper we present a framework for analyzing the stability of algorithms. We focus in particular on the tradeoff between the stability of an algorithm and the quality of the solution it computes.
Our framework allows for three types of stability analysis with increasing degrees of complexity: event stability, topological stability, and Lipschitz stability.
We demonstrate the use of topological stability by applying it to kinetic Euclidean minimum spanning trees.
In this paper we present a framework for analyzing the stability of algorithms. We focus in particular on the tradeoff between the stability of an algorithm and the quality of the solution it computes.
Our framework allows for three types of stability analysis with increasing degrees of complexity: event stability, topological stability, and Lipschitz stability.
We demonstrate the use of topological stability by applying it to kinetic Euclidean minimum spanning trees.
| Original language | English |
|---|---|
| Pages | 11:1-11:6 |
| Number of pages | 6 |
| Publication status | Published - 2018 |
| Event | 34th European Workshop on Computational Geometry (EuroCG2018) - Berlin, Germany Duration: 21 Mar 2018 → 23 Mar 2018 https://conference.imp.fu-berlin.de/eurocg18/home |
Conference
| Conference | 34th European Workshop on Computational Geometry (EuroCG2018) |
|---|---|
| Abbreviated title | EuroCG2018 |
| Country/Territory | Germany |
| City | Berlin |
| Period | 21/03/18 → 23/03/18 |
| Internet address |