On the public citation graph

Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension

0 signed · 77 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/0471200611openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1007/bf00322017openalex-snapshot
Donsker classes of sets
inferredcites →https://doi.org/10.1007/bf00994111openalex-snapshot
A Framework for Average Case Analysis of Conjunctive Learning Algorithms
inferredcites →https://doi.org/10.1007/bfb0077101openalex-snapshot
Rates of convergence in the central limit theorem for empirical processes
inferredcites →https://doi.org/10.1016/0097-3165(72)90019-2openalex-snapshot
On the density of families of sets
inferredcites →https://doi.org/10.1016/0097-3165(95)90052-7openalex-snapshot
Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1016/0166-218x(93)90179-ropenalex-snapshot
Bounding sample size with the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1016/b978-1-55860-146-8.50032-1openalex-snapshot
AGGREGATING STRATEGIES
inferredcites →https://doi.org/10.1016/b978-1-55860-213-7.50011-0openalex-snapshot
Calculation of the Learning Curve of Bayes Optimal Classification Algorithm for Learning a Perceptron With Noise
inferredcites →https://doi.org/10.1103/physrevlett.65.1683openalex-snapshot
Learning from examples in large neural networks
inferredcites →https://doi.org/10.1109/18.54897openalex-snapshot
Information-theoretic asymptotics of Bayes methods
inferredcites →https://doi.org/10.1109/ijcnn.1989.118274openalex-snapshot
Consistent inference of probabilities in layered networks: predictions and generalizations
inferredcites →https://doi.org/10.1109/sfcs.1988.21929openalex-snapshot
Learning probabilistic prediction functions
inferredcites →https://doi.org/10.1109/sfcs.1989.63487openalex-snapshot
The weighted majority algorithm
inferredcites →https://doi.org/10.1137/0221029openalex-snapshot
Probably Approximate Learning over Classes of Distributions
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/103418.103467openalex-snapshot
On-line learning of linear functions
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1162/neco.1989.1.1.151openalex-snapshot
What Size Net Gives Valid Generalization?
inferredcites →https://doi.org/10.2307/2988246openalex-snapshot
Estimation of Dependences Based on Empirical Data.
inferredcites →https://doi.org/10.5802/aif.938openalex-snapshot
Densité et dimension

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/wcs.1228openalex-snapshot
Learnability theory
inferred← citeshttps://doi.org/10.1006/inco.2000.2919openalex-snapshot
Improved Lower Bounds for Learning from Noisy Examples: An Information-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/978-3-662-44923-3openalex-snapshot
Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/bf00996271openalex-snapshot
On the Stochastic Complexity of Learning Realizable and Unrealizable Rules
inferred← citeshttps://doi.org/10.1007/bf02574389openalex-snapshot
Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90052-7openalex-snapshot
Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
inferred← citeshttps://doi.org/10.1016/b978-0-12-801522-3.00012-4openalex-snapshot
Bayesian Learning
inferred← citeshttps://doi.org/10.1016/b978-0-12-818803-3.00023-4openalex-snapshot
Bayesian Learning: Inference and the EM Algorithm
inferred← citeshttps://doi.org/10.1016/b978-0-12-820676-8.00015-6openalex-snapshot
Group vs individual rationality
inferred← citeshttps://doi.org/10.1016/b978-0-44-329238-5.00018-4openalex-snapshot
Bayesian learning: inference and the EM algorithm
inferred← citeshttps://doi.org/10.1016/b978-012161964-0/50006-6openalex-snapshot
Machine Learning
inferred← citeshttps://doi.org/10.1016/b978-1-55860-377-6.50065-7openalex-snapshot
For Every Generalization Action, Is There Really an Equal and Opposite Reaction? Analysis of the Conservation Law for Generalization Performance
inferred← citeshttps://doi.org/10.1016/j.acha.2025.101777openalex-snapshot
A tighter generalization error bound for wide GCN based on loss landscape
inferred← citeshttps://doi.org/10.1016/j.elerap.2018.06.004openalex-snapshot
A generalized stereotype learning approach and its instantiation in trust modeling
inferred← citeshttps://doi.org/10.1016/j.inffus.2020.02.007openalex-snapshot
Processes and methods of information fusion for ranking products based on online reviews: An overview
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.09.016openalex-snapshot
Risk upper bounds for general ensemble methods with an application to multiclass classification
inferred← citeshttps://doi.org/10.1016/s0025-5564(01)00096-7openalex-snapshot
Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00079-2openalex-snapshot
Query by committee, linear separation and random walks
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00102-3openalex-snapshot
Sample size lower bounds in PAC learning by algorithmic complexity theory
inferred← citeshttps://doi.org/10.1016/s0364-0213(99)80015-9openalex-snapshot
Primate Social Intelligence
inferred← citeshttps://doi.org/10.1016/s0893-6080(01)00061-2openalex-snapshot
An approach to guaranteeing generalisation in neural networks
inferred← citeshttps://doi.org/10.1016/s0893-6080(02)00032-1openalex-snapshot
On the capabilities of neural networks using limited precision weights
inferred← citeshttps://doi.org/10.1016/s0933-3657(03)00053-8openalex-snapshot
Bayesian applications of belief networks and multilayer perceptrons for ovarian tumor classification with rejection
inferred← citeshttps://doi.org/10.1023/a:1007330508534openalex-snapshot
Selective Sampling Using the Query by Committee Algorithm
inferred← citeshttps://doi.org/10.1023/a:1007577530334openalex-snapshot
Prequential and Cross-Validated Regression Estimation
inferred← citeshttps://doi.org/10.1023/a:1022855530995openalex-snapshot
Learning from a Population of Hypotheses
inferred← citeshttps://doi.org/10.1037/e448672006-001openalex-snapshot
The dynamics of cognition: An ACT-R model of cognitive arithmetic
inferred← citeshttps://doi.org/10.1109/18.605594openalex-snapshot
A general minimax result for relative entropy
inferred← citeshttps://doi.org/10.1109/21.293485openalex-snapshot
Majority and location based fusers for systems of PAC concept learners
inferred← citeshttps://doi.org/10.1109/34.879795openalex-snapshot
How bad may learning curves be?
inferred← citeshttps://doi.org/10.1109/72.363472openalex-snapshot
Generalization and PAC learning: some new results for the class of generalized single-layer networks
inferred← citeshttps://doi.org/10.1109/9.964680openalex-snapshot
Learning with prior information
inferred← citeshttps://doi.org/10.1109/icnn.1994.374184openalex-snapshot
How practical are VC dimension bounds? [learning from examples]
inferred← citeshttps://doi.org/10.1109/icsmc.1994.399824openalex-snapshot
On the complexity of hypothesis space and the sample complexity for machine learning
inferred← citeshttps://doi.org/10.1109/iecon.1998.724126openalex-snapshot
Construction of a classifier with prior domain knowledge formalised as Bayesian network
inferred← citeshttps://doi.org/10.1109/ijcnn.1999.831533openalex-snapshot
New approach to the storage capacity of neural networks using the minimum distance between input patterns
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619319openalex-snapshot
Error Exponent in Agnostic PAC Learning
inferred← citeshttps://doi.org/10.1109/jproc.2015.2494178openalex-snapshot
Foundational Principles for Large-Scale Inference: Illustrations Through Correlation Mining
inferred← citeshttps://doi.org/10.1109/mlsp.2015.7324319openalex-snapshot
A rate-distortion framework for supervised learning
inferred← citeshttps://doi.org/10.1109/nnsp.1993.471874openalex-snapshot
Differentially generated neural network classifiers are efficient
inferred← citeshttps://doi.org/10.1109/tit.2022.3176056openalex-snapshot
Minimum Excess Risk in Bayesian Learning
inferred← citeshttps://doi.org/10.1109/tpami.2007.1030openalex-snapshot
Analytical Results on Style-Constrained Bayesian Classification of Pattern Fields
inferred← citeshttps://doi.org/10.1111/tops.12004openalex-snapshot
Editors' Introduction: Why Formal Learning Theory Matters for Cognitive Science
inferred← citeshttps://doi.org/10.1155/2011/606857openalex-snapshot
A General System for Automatic Biomedical Image Segmentation Using Intensity Neighborhoods
inferred← citeshttps://doi.org/10.1162/089976601753195969openalex-snapshot
Predictability, Complexity, and Learning
inferred← citeshttps://doi.org/10.1162/08997660252741121openalex-snapshot
On the Complexity of Computing and Learning with Multiplicative Neural Networks
inferred← citeshttps://doi.org/10.1214/aos/1030741081openalex-snapshot
Mutual information, metric entropy and cumulative relative entropy risk
inferred← citeshttps://doi.org/10.1287/isre.2022.1111openalex-snapshot
Getting Personal: A Deep Learning Artifact for Text-Based Measurement of Personality
inferred← citeshttps://doi.org/10.1371/journal.pone.0029028openalex-snapshot
Automated Discovery of Food Webs from Ecological Data Using Logic-Based Machine Learning
inferred← citeshttps://doi.org/10.18178/ijiet.2018.8.5.1057openalex-snapshot
Automatic Classification with SVM and F-VSM on Elementary Chinese Composition
inferred← citeshttps://doi.org/10.20965/jaciii.2024.p0623openalex-snapshot
Bagging Algorithm Based on Possibilistic Data Interpolation for Brain-Computer Interface
inferred← citeshttps://doi.org/10.3390/e19110583openalex-snapshot
Instance Selection for Classifier Performance Estimation in Meta Learning
inferred← citeshttps://doi.org/10.3724/sp.j.1004.2008.00282openalex-snapshot
Multi-source Fuzzy Information Fusion Method Based on Bayesian Optimal Classifier
inferred← citeshttps://doi.org/10.4018/978-1-4666-6078-6.ch004openalex-snapshot
Towards an Improved Ensemble Learning Model of Artificial Neural Networks
inferred← citeshttps://doi.org/10.4018/978-1-5225-0159-6.ch031openalex-snapshot
Towards an Improved Ensemble Learning Model of Artificial Neural Networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.