248,646 research outputs found

    A Comparison Framework for Interleaved Persistence Modules

    Get PDF
    We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for R\mathbb{R}-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show how the generalized algebraic stability theorem enables the computation of rigorous error bounds in the space of persistence diagrams that go beyond the typical formulation in terms of bottleneck (or log bottleneck) distance

    Hurwitz rational functions

    Get PDF
    A generalization of Hurwitz stable polynomials to real rational functions is considered. We establishe an analogue of the Hurwitz stability criterion for rational functions and introduce a new type of determinants that can be treated as a generalization of the Hurwitz determinants.Comment: 10 page

    Data-Dependent Stability of Stochastic Gradient Descent

    Full text link
    We establish a data-dependent notion of algorithmic stability for Stochastic Gradient Descent (SGD), and employ it to develop novel generalization bounds. This is in contrast to previous distribution-free algorithmic stability results for SGD which depend on the worst-case constants. By virtue of the data-dependent argument, our bounds provide new insights into learning with SGD on convex and non-convex problems. In the convex case, we show that the bound on the generalization error depends on the risk at the initialization point. In the non-convex case, we prove that the expected curvature of the objective function around the initialization point has crucial influence on the generalization error. In both cases, our results suggest a simple data-driven strategy to stabilize SGD by pre-screening its initialization. As a corollary, our results allow us to show optimistic generalization bounds that exhibit fast convergence rates for SGD subject to a vanishing empirical risk and low noise of stochastic gradient

    Stability and BPS branes

    Get PDF
    We define the concept of Pi-stability, a generalization of mu-stability of vector bundles, and argue that it characterizes N=1 supersymmetric brane configurations and BPS states in very general string theory compactifications with N=2 supersymmetry in four dimensions.Comment: harvmac, 18 p
    • …
    corecore