.png){kind=icon}
.png){kind=icon}
Return
Carnapian Inductive Logic for Exponential Smoothing
.png){kind=icon}
PRE
AI
DOI：10.1017/psa.2026.10197.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper explores the inductive logic associated with exponential smoothing, the most widely used predictive rule that manifests the idea that more recent observations have a stronger influence on predictive probabilities than more remote ones. The main result shows that exponential smoothing can be derived from a set of plausible qualitative invariance assumptions about conditional probabilities. I discuss various aspects of the resulting inductive logic, including its connections to exchangeable processes, to Bayesian predictive inference and kernel methods in machine learning, as well as the philosophy of probabilistic invariance conditions and symmetries.
Journal
P
IF:
1.1
Papers:
32
Citations:
0
