The reproducible properties of correct forecasts
From MaRDI portal
Publication:1434485
Recommendations
- Forecasting: predictability, probability, and persistence
- On Testing the Validity of Sequential Probability Forecasts
- Correction to: ‘Valid sequential inference on probability forecast performance’
- Probabilistic Forecasts, Calibration and Sharpness
- Testable forecasts
- Probabilistic forecast reconciliation: properties, evaluation and score optimisation
- Evaluating the Accuracy of Forecasts from Vector Autoregressions
Cited in
(58)- A nonmanipulable test
- Transferable deposits as a screening mechanism
- Mostly calibrated
- On comparison of experts
- Non-asymptotic calibration and resolution
- Merging and testing opinions
- Learning hurdles for sleeping experts
- Restriction access
- Mechanism design with approximate valuations
- Quantum strategic game theory
- The curse of simultaneity
- No justified complaints: on fair sharing of multiple resources
- From randomizing polynomials to parallel algorithms
- Practical verified computation with streaming interactive proofs
- Paging for multi-core shared caches
- Noise vs computational intractability in dynamics
- Distribution free evolvability of polynomial functions over all convex loss functions
- Algorithms on evolving graphs
- Towards deterministic tree code constructions
- Linear time decoding of regular expander codes
- List decoding subspace codes from insertions and deletions
- Bounds on locally testable codes with unique tests
- Approximately optimal mechanism design via differential privacy
- Fairness through awareness
- Dynamics of prisoner's dilemma and the evolution of cooperation on networks
- Crowdsourced Bayesian auctions
- Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure
- Quantum interactive proofs with weak error bounds
- Quantum money from knots
- (Leveled) fully homomorphic encryption without bootstrapping
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Targeted malleability: homomorphic encryption for restricted computations
- Sherali-Adams relaxations and indistinguishability in counting logics
- Graph densification
- Spectral sparsification via random spanners
- On persistent homotopy, knotted complexes and the Alexander module
- Gadgets and anti-gadgets leading to a complexity dichotomy
- On beating the hybrid argument
- Linear programming, width-1 CSPs, and robust satisfaction
- Marginal hitting sets imply super-polynomial lower bounds for permanent
- On the recoverability of forecasters' preferences
- A strategy-proof test of portfolio returns
- Efficient Testing of Forecasts
- The Complexity of Forecast Testing
- A prequential test for exchangeable theories
- Learning in Games
- Testable forecasts
- Efficient testing of forecasts
- Defensive Forecasting: How to Use Similarity to Make Forecasts That Pass Statistical Tests
- Good Randomized Sequential Probability Forecasting is Always Possible
- Calibration with Many Checking Rules
- High-confidence predictions under adversarial uncertainty
- On the degree of univariate polynomials over the integers
- Compressed matrix multiplication
- Indistinguishable predictions and multi-group fair learning
- Testing theories with learnable and predictive representations
- Nonmanipulable Bayesian testing
- On universal algorithms for adaptive forecasting
This page was built for publication: The reproducible properties of correct forecasts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434485)