# Vapnik–Chervonenkis theory

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- 2014

This chapter shows how returning to the combinatorial nature of the Vapnik-Chervonenkis bounds provides simple ways to increase… (More)

Is this relevant?

Review

2014

Review

2014

- 2014

We review recent advances on uniform martingale laws of large numbers and the associated sequential complexity measures. These… (More)

Is this relevant?

2012

2012

- 2012

For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik–Chervonenkis (VC… (More)

Is this relevant?

2008

2008

- 2008

Nous démontrons que si T est une théorie dépendante, sa randomisée de Keisler T R l’est aussi. Pour faire cela nous généralisons… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Transactions on Knowledge and Data…
- 2004

We present a mechanism to train support vector machines (SVMs) with a hybrid kernel and minimal Vapnik-Chervonenkis (VC… (More)

Is this relevant?

2000

2000

- COLT
- 2000

In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain… (More)

Is this relevant?

1996

1996

- 1996

Perceptron learning of randomly labeled patterns is analyzed using a Gibbs distribution on the set of realizable labelings of the… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- J. Comb. Theory, Ser. A
- 1995

Let V f0; 1g n have Vapnik-Chervonenkis dimension d. Let M(k=n; V ) denote the cardinality of the largest W V such that any two… (More)

Is this relevant?

1992

1992

- Neural Computation
- 1992

We describe a series of numerical experiments that measure the average generalization capability of neural networks trained on a… (More)

Is this relevant?

1992

1992

- 1992

We show that a class of subsets of a structure uniformly definable by a first-order formula is a Vapnik-Chervonenkis class if and… (More)

Is this relevant?