Using the doubling dimension to analyze the generalization of learning algorithms
type: Item
instance of: scholarly article
title: Using the doubling dimension to analyze the generalization of learning algorithms
zbMATH Open document ID: 1175.68315
author: Nader H. Bshouty
author: Yi Li
author: Philip M. Long
published in: Journal of Computer and System Sciences
publication date: 2009-07-24T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5586765
zbMATH Keywords: PAC learning
zbMATH Keywords: generalization
zbMATH Keywords: doubling dimension
zbMATH Keywords: doubling metric
zbMATH Keywords: learning theory
zbMATH Keywords: statistical learning theory
zbMATH Keywords: local complexity
MaRDI profile type: Publication
full work available at URL: j.jcss.2009.01.003
OpenAlex ID: W2095439633
cites work: Q5369125
cites work: Neural Network Learning
cites work: Plongements lipschitziens dans ${\bbfR}\sp n$
cites work: Local Rademacher complexities
cites work: Prediction, learning, uniform convergence, and scale-sensitive dimensions
cites work: Learnability with respect to fixed distributions
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: On hierarchical routing in doubling metrics
cites work: Central limit theorems for empirical measures
cites work: A general lower bound on the number of examples needed for learning
cites work: Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
cites work: Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points
cites work: Lectures on analysis on metric spaces
cites work: Apple tasting.
cites work: Triangulation and embedding using small sets of beacons
cites work: Automata, Languages and Programming
cites work: Q5501341
cites work: On the locality of bounded growth
cites work: An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
cites work: 10.1162/1532443041424337
cites work: Q4856179
cites work: Bounding sample size with the Vapnik-Chervonenkis dimension
cites work: Distance estimation and object location via rings of neighbors
cites work: Bypassing the embedding
cites work: Q3655724
cites work: Weak convergence and empirical processes. With applications to statistics
cites work: Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
cites work: Q4935997
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
cites work: Information-theoretic upper and lower bounds for statistical estimation
DOI: 10.1016/J.JCSS.2009.01.003
description: scientific article; zbMATH DE number 5586765