Unified Inductive Logic: From Formal Learning to Statistical Inference to Supervised Learning
December 04, 2024 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Hanti Lin
arXiv ID
2412.02969
Category
stat.OT
Cross-listed
cs.LG,
stat.ME
Citations
0
Venue
arXiv.org
Last Checked
3 months ago
Abstract
While the traditional conception of inductive logic is Carnapian, I develop a Peircean alternative and use it to unify formal learning theory, statistics, and a significant part of machine learning: supervised learning. Some crucial standards for evaluating non-deductive inferences have been assumed separately in those areas, but can actually be justified by a unifying principle.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β stat.OT
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Topological Information Data Analysis
R.I.P.
π»
Ghosted
Approaching Ethical Guidelines for Data Scientists
R.I.P.
π»
Ghosted
Aggregating incoherent agents who disagree
R.I.P.
π»
Ghosted
Product risk assessment: a Bayesian network approach
R.I.P.
π»
Ghosted
A Fourier-invariant method for locating point-masses and computing their attributes
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted