國立虎尾科技大學 |

Measures of Complexity = Festschrift for Alexey Chervonenkis /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Measures of Complexity/ edited by Vladimir Vovk, Harris Papadopoulos, Alexander Gammerman.
其他題名:	Festschrift for Alexey Chervonenkis /
其他作者:	Vovk, Vladimir.
面頁冊數:	XXXI, 399 p. 47 illus., 30 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Artificial intelligence. -
電子資源:	https://doi.org/10.1007/978-3-319-21852-6
ISBN:	9783319218526

Measures of Complexity = Festschrift for Alexey Chervonenkis /
Measures of ComplexityFestschrift for Alexey Chervonenkis /[electronic resource] :edited by Vladimir Vovk, Harris Papadopoulos, Alexander Gammerman. - 1st ed. 2015. - XXXI, 399 p. 47 illus., 30 illus. in color.online resource.

Chervonenkis’s Recollections -- A Paper That Created Three New Fields -- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities -- Sketched History: VC Combinatorics, 1826 up to 1975 -- Institute of Control Sciences through the Lens of VC Dimension -- VC Dimension, Fat-Shattering Dimension, Rademacher Averages, and Their Applications -- Around Kolmogorov Complexity: Basic Notions and Results -- Predictive Complexity for Games with Finite Outcome Spaces -- Making Vapnik–Chervonenkis Bounds Accurate -- Comment: Transductive PAC-Bayes Bounds Seen as a Generalization of Vapnik–Chervonenkis Bounds -- Comment: The Two Styles of VC Bounds -- Rejoinder: Making VC Bounds Accurate -- Measures of Complexity in the Theory of Machine Learning -- Classes of Functions Related to VC Properties -- On Martingale Extensions of Vapnik–Chervonenkis -- Theory with Applications to Online Learning -- Measuring the Capacity of Sets of Functions in the Analysis of ERM -- Algorithmic Statistics Revisited -- Justifying Information-Geometric Causal Inference -- Interpretation of Black-Box Predictive Models -- PAC-Bayes Bounds for Supervised Classification -- Bounding Embeddings of VC Classes into Maximum Classes -- Algorithmic Statistics Revisited -- Justifying Information-Geometric Causal Inference -- Interpretation of Black-Box Predictive Models -- PAC-Bayes Bounds for Supervised Classification -- Bounding Embeddings of VC Classes into Maximum Classes -- Strongly Consistent Detection for Nonparametric Hypotheses -- On the Version Space Compression Set Size and Its Applications -- Lower Bounds for Sparse Coding -- Robust Algorithms via PAC-Bayes and Laplace Distributions -- Postscript: Tragic Death of Alexey Chervonenkis -- Credits -- Index.

This book brings together historical notes, reviews of research developments, fresh ideas on how to make VC (Vapnik–Chervonenkis) guarantees tighter, and new technical contributions in the areas of machine learning, statistical inference, classification, algorithmic statistics, and pattern recognition. The contributors are leading scientists in domains such as statistics, mathematics, and theoretical computer science, and the book will be of interest to researchers and graduate students in these domains.

ISBN: 9783319218526

Standard No.: 10.1007/978-3-319-21852-6doiSubjects--Topical Terms:

559380
Artificial intelligence.

LC Class. No.: Q334-342

Dewey Class. No.: 006.3

Measures of Complexity = Festschrift for Alexey Chervonenkis /
LDR:03688nam a22003975i 4500 001 961099
003 DE-He213
005 20200630042508.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319218526 $9 978-3-319-21852-6
024 7 $a 10.1007/978-3-319-21852-6 $2 doi
035 $a 978-3-319-21852-6
050 4 $a Q334-342
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
245 1 0 $a Measures of Complexity $h [electronic resource] : $b Festschrift for Alexey Chervonenkis / $c edited by Vladimir Vovk, Harris Papadopoulos, Alexander Gammerman.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XXXI, 399 p. 47 illus., 30 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Chervonenkis’s Recollections -- A Paper That Created Three New Fields -- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities -- Sketched History: VC Combinatorics, 1826 up to 1975 -- Institute of Control Sciences through the Lens of VC Dimension -- VC Dimension, Fat-Shattering Dimension, Rademacher Averages, and Their Applications -- Around Kolmogorov Complexity: Basic Notions and Results -- Predictive Complexity for Games with Finite Outcome Spaces -- Making Vapnik–Chervonenkis Bounds Accurate -- Comment: Transductive PAC-Bayes Bounds Seen as a Generalization of Vapnik–Chervonenkis Bounds -- Comment: The Two Styles of VC Bounds -- Rejoinder: Making VC Bounds Accurate -- Measures of Complexity in the Theory of Machine Learning -- Classes of Functions Related to VC Properties -- On Martingale Extensions of Vapnik–Chervonenkis -- Theory with Applications to Online Learning -- Measuring the Capacity of Sets of Functions in the Analysis of ERM -- Algorithmic Statistics Revisited -- Justifying Information-Geometric Causal Inference -- Interpretation of Black-Box Predictive Models -- PAC-Bayes Bounds for Supervised Classification -- Bounding Embeddings of VC Classes into Maximum Classes -- Algorithmic Statistics Revisited -- Justifying Information-Geometric Causal Inference -- Interpretation of Black-Box Predictive Models -- PAC-Bayes Bounds for Supervised Classification -- Bounding Embeddings of VC Classes into Maximum Classes -- Strongly Consistent Detection for Nonparametric Hypotheses -- On the Version Space Compression Set Size and Its Applications -- Lower Bounds for Sparse Coding -- Robust Algorithms via PAC-Bayes and Laplace Distributions -- Postscript: Tragic Death of Alexey Chervonenkis -- Credits -- Index.
520 $a This book brings together historical notes, reviews of research developments, fresh ideas on how to make VC (Vapnik–Chervonenkis) guarantees tighter, and new technical contributions in the areas of machine learning, statistical inference, classification, algorithmic statistics, and pattern recognition. The contributors are leading scientists in domains such as statistics, mathematics, and theoretical computer science, and the book will be of interest to researchers and graduate students in these domains.
650 0 $a Artificial intelligence. $3 559380
650 0 $a Statistics . $3 1253516
650 0 $a Mathematical statistics. $3 527941
650 0 $a Mathematical optimization. $3 527675
650 1 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Statistical Theory and Methods. $3 671396
650 2 4 $a Probability and Statistics in Computer Science. $3 669886
650 2 4 $a Optimization. $3 669174
700 1 $a Vovk, Vladimir. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 669774
700 1 $a Papadopoulos, Harris. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 815994
700 1 $a Gammerman, Alexander. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 669776
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319218519
776 0 8 $i Printed edition: $z 9783319218533
776 0 8 $i Printed edition: $z 9783319357782
856 4 0 $u https://doi.org/10.1007/978-3-319-21852-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)