arXiv — Machine Learning · · 3 min read

Quantifying the Value of Constructive Induction, Knowledge, and Noise Filtering on Inductive Learning

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Machine Learning

arXiv:2610.02615 (cs)
[Submitted on 2 Oct 2026]

Title:Quantifying the Value of Constructive Induction, Knowledge, and Noise Filtering on Inductive Learning

View a PDF of the paper titled Quantifying the Value of Constructive Induction, Knowledge, and Noise Filtering on Inductive Learning, by Carl M. Kadie
View PDF
Abstract:Learning research, as one of its central goals, tries to measure, model, and understand how learning-problem properties affect average-case learning performance. For example, we would like to quantify the value of constructive induction, noise filtering, and background knowledge. This paper describes the effective dimension, a new learning measure that helps link problem properties to learning performance. Like the Vapnik-Chervonenkis (VC) dimension, the effective dimension is often in a simple linear relation with problem properties. Unlike the VC dimension, the effective dimension can be estimated empirically and makes average-case predictions. It is therefore more widely applicable to machine and human learning research. The measure is demonstrated on several learning systems including Backpropagation. Finally, the measure is used to precisely predict the benefit of using FRINGE, a feature construction system. The benefit is found to decrease as the complexity of the target concept increases.
Comments: 12 pages, including a modern cover note and the unchanged 11-page author manuscript from 1991. Extended author version of a paper published in Machine Learning Proceedings 1991 (ICML 1991), pp. 153-157. Deposited in arXiv in 2026
Subjects: Machine Learning (cs.LG)
ACM classes: I.2.6
Cite as: arXiv:2610.02615 [cs.LG]
  (or arXiv:2610.02615v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2610.02615
arXiv-issued DOI via DataCite (pending registration)
Journal reference: Machine Learning Proceedings 1991, Morgan Kaufmann, pp. 153-157 (1991)
Related DOI: https://doi.org/10.1016/B978-1-55860-200-7.50034-9
DOI(s) linking to related resources

Submission history

From: Carl Kadie [view email]
[v1] Fri, 2 Oct 2026 00:14:56 UTC (118 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Quantifying the Value of Constructive Induction, Knowledge, and Noise Filtering on Inductive Learning, by Carl M. Kadie
  • View PDF

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:
cs

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning