A necessary and sufficient stability notion for adaptive generalization

06/03/2019
by   Katrina Ligett, et al.
0

We introduce a new notion of the stability of computations, which holds under post-processing and adaptive composition, and show that the notion is both necessary and sufficient to ensure generalization in the face of adaptivity, for any computations that respond to bounded-sensitivity linear queries while providing accuracy with respect to the data sample set. The stability notion is based on quantifying the effect of observing a computation's outputs on the posterior over the data sample elements. We show a separation between this stability notion and previously studied notions.

READ FULL TEXT
research
12/12/2012

Almost-everywhere algorithmic stability and generalization error

We explore in some detail the notion of algorithmic stability as a viabl...
research
01/29/2018

A notion of stability for k-means clustering

In this paper, we define and study a new notion of stability for the k-m...
research
08/16/2011

Stability Conditions for Online Learnability

Stability is a general notion that quantifies the sensitivity of a learn...
research
06/20/2021

Generalization in the Face of Adaptivity: A Bayesian Perspective

Repeated use of a data sample via adaptively chosen queries can rapidly ...
research
04/19/2023

Â-and Î-stability of collocation Runge-Kutta methods

This paper deals with stability of classical Runge-Kutta collocation met...
research
10/27/2020

Toward Better Generalization Bounds with Locally Elastic Stability

Classical approaches in learning theory are often seen to yield very loo...
research
01/30/2019

Natural Analysts in Adaptive Data Analysis

Adaptive data analysis is frequently criticized for its pessimistic gene...

Please sign up or login with your details

Forgot password? Click here to reset