Non-asymptotic calibration and resolution
From MaRDI portal
Publication:2465038
DOI10.1016/j.tcs.2007.07.026zbMath1202.68324OpenAlexW2152875601WikidataQ62046727 ScholiaQ62046727MaRDI QIDQ2465038
Publication date: 19 December 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.026
Hilbert spacelaw of large numberslaw of the iterated logarithmcalibrationkernelresolutionreproducing kernel Hilbert spacealgorithm of large numbersK29 algorithmK29\(^{*}\) algorithm
Related Items (1)
Cites Work
- Calibration-based empirical probability
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
- The reproducible properties of correct forecasts
- Probability and Finance
- 10.1162/153244302760185252
- Self-Calibrating Priors Do Not Exist
- Asymptotic calibration
- Any Inspection is Manipulable
- Learning Theory
- Function Classes That Approximate the Bayes Risk
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Prediction, Learning, and Games
- Good Randomized Sequential Probability Forecasting is Always Possible
- Calibration with Many Checking Rules
- Theory of Reproducing Kernels
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Non-asymptotic calibration and resolution