Relative Deviation Learning Bounds and Generalization with Unbounded Loss Functions

2013-10-22 · Corinna Cortes, Spencer Greenberg, Mehryar Mohri

We present an extensive analysis of relative deviation bounds, including detailed proofs of two-sided inequalities and their implications. We also give detailed proofs of two-sided generalization bounds that hold in the general case of unbounded loss functions, under the assumption that a moment of the loss is bounded. These bounds are useful in the analysis of importance weighting and other learning tasks such as unbounded regression.

📄 PDF Abstract BibTeX arXiv:1310.5796

Code (0)

등록된 구현이 없습니다.

Tasks

Generalization Boundsregression

Relative Deviation Margin Bounds

2020-06-26 · Corinna Cortes, Mehryar Mohri, Ananda Theertha Suresh

We present a series of new and more favorable margin-based learning guarantees that depend on the empirical margin loss of a predictor. We give two types of learning bounds, both distribution-dependent and valid for gene…

Generalization Bounds valid

Tight Lower Bound on the Probability of a Binomial Exceeding its Expectation

2013-06-06 · Spencer Greenberg, Mehryar Mohri

We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative …

Generalization Bounds Learning Theory

Uniform Deviation Bounds for Unbounded Loss Functions like k-Means

2017-02-27 · Olivier Bachem, Mario Lucic, S. Hamed Hassani, Andreas Krause

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk m…

Clustering

Uniform Deviation Bounds for k-Means Clustering

2017-08-01 · ICML 2017 8 · Olivier Bachem, Mario Lucic, S. Hamed Hassani, Andreas Krause

Uniform deviation bounds limit the difference between a model’s expected loss and its loss on an empirical sample uniformly for all models in a learning problem. In this paper, we provide a novel framework to obtain…

Clustering

Risk Bounds for Robust Deep Learning

2020-09-14 · Johannes Lederer

It has been observed that certain loss functions can render deep-learning pipelines robust against flaws in the data. In this paper, we support these empirical findings with statistical theory. We especially show that em…

Deep Learning