The Complexity of Forecast Testing
From MaRDI portal
Nonparametric hypothesis testing (62G10) Applications of statistics in engineering and industry; control charts (62P30) Non-Markovian processes: estimation (62M09) Statistical methods; economic indices and measures (91B82) Prediction theory (aspects of stochastic processes) (60G25) Rationality and learning in game theory (91A26)
Recommendations
Cited in
(52)- Compressed matrix multiplication
- Linear programming, width-1 CSPs, and robust satisfaction
- Gadgets and anti-gadgets leading to a complexity dichotomy
- The curse of simultaneity
- scientific article; zbMATH DE number 4088928 (Why is no real title available?)
- On comparison of experts
- High-confidence predictions under adversarial uncertainty
- Indistinguishable predictions and multi-group fair learning
- Efficient testing of forecasts
- Quantum money from knots
- On the degree of univariate polynomials over the integers
- (Leveled) fully homomorphic encryption without bootstrapping
- Quantum strategic game theory
- Defensive Forecasting: How to Use Similarity to Make Forecasts That Pass Statistical Tests
- Expressible inspections
- Fairness through awareness
- Spectral sparsification via random spanners
- On persistent homotopy, knotted complexes and the Alexander module
- Marginal hitting sets imply super-polynomial lower bounds for permanent
- Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure
- Testing for the usefulness of forecasts
- Merging and testing opinions
- Crowdsourced Bayesian auctions
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Practical verified computation with streaming interactive proofs
- Quantum interactive proofs with weak error bounds
- Efficient Testing of Forecasts
- Distribution free evolvability of polynomial functions over all convex loss functions
- No justified complaints: on fair sharing of multiple resources
- Paging for multi-core shared caches
- Sherali-Adams relaxations and indistinguishability in counting logics
- List decoding subspace codes from insertions and deletions
- Dynamics of prisoner's dilemma and the evolution of cooperation on networks
- Restriction access
- On universal algorithms for adaptive forecasting
- From randomizing polynomials to parallel algorithms
- Graph densification
- Learning hurdles for sleeping experts
- Linear time decoding of regular expander codes
- Noise vs computational intractability in dynamics
- Towards deterministic tree code constructions
- Algorithms on evolving graphs
- Can theories be tested?
- Nonmanipulable Bayesian testing
- Targeted malleability: homomorphic encryption for restricted computations
- A nonmanipulable test
- Bounds on locally testable codes with unique tests
- On Depth of Immersion in Forecasting Task
- Approximately optimal mechanism design via differential privacy
- Testing theories with learnable and predictive representations
- On beating the hybrid argument
- Mechanism design with approximate valuations
This page was built for publication: The Complexity of Forecast Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627277)
