Alexey Chervonenkis

Known as: Chervonenkis 
Alexey Yakovlevich Chervonenkis (Russian: Алексей Яковлевич Червоненкис; 7 September 1938 – 22 September 2014) was a Soviet and Russian mathematician… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1945-2018
0102019452017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
This bibliography does not contain Alexey’s patents (he has at least two), technical reports, unpublished manuscripts, and… (More)
Is this relevant?
2015
2015
This introduction to Alexey Chervonenkis’s bibliography, which is published next in this issue, mainly consists of historical… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper provides an introduction to support vector machines, kernel Fisher discriminant analysis, and kernel principal… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table II
Is this relevant?
Highly Cited
1999
Highly Cited
1999
It is well known that for a given sample size there exists a model of optimal complexity corresponding to the smallest prediction… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
In this article we prove sanity-check bounds for the error of the leave-one-out cross-validation estimate of the generalization… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In this paper we consider the problem of tracking a subset of a domain (called the target) which changes gradually over time. A… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Learnability in Valiant's PAC learning model has been shown to be strongly related to the existence of uniform laws of large… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We characterize precisely the complexity of several natural computational problems in NP, which have been proposed but not… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Valiant's learnability model is extended to learning classes of concepts defined by regions in Euclidean space En. The methods in… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We prove a lower bound of ( ln + VCdim(C) ) on the number of random examples required for distribution-free learning of a concept… (More)
Is this relevant?