Universal prediction
From MaRDI portal
Recommendations
- Universal probability-free prediction
- Universal forecasting algorithms
- Universal prediction of individual sequences
- Universal inference
- A universal predictor based on pattern matching
- Universal prediction of selected bits
- Correction to: Universal prediction schemes
- Universality of Bayesian predictions
- On universal prediction and Bayesian confirmation
Cited in
(86)- On calibration error of randomized forecasting algorithms
- Measuring the efficiency of the intraday Forex market with a universal data compression algorithm
- Fractal dimension and logarithmic loss unpredictability.
- Universal prediction of random binary sequences in a noisy environment
- On prediction of individual sequences
- On asymptotically optimal methods of prediction and adaptive coding for Markov sources
- Objective Bayesian analysis of the Yule-Simon distribution with applications
- Randomized prediction of individual sequences
- Prediction and dimension
- On universal algorithms for classifying and predicting stationary processes
- Loss-based approach to two-piece location-scale distributions with applications to dependent data
- A loss-based prior for variable selection in linear regression methods
- On a loss-based prior for the number of components in mixture models
- On universal prediction and Bayesian confirmation
- Fast learning rates in statistical inference through aggregation
- Generalized self-concordant analysis of Frank-Wolfe algorithms
- 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
- Chasing Ghosts: Competing with Stateful Policies
- An objective Bayesian criterion to determine model prior probabilities
- Universal Filtering Via Prediction
- A universal prediction lemma and applications to universal data compression and prediction
- Optimal, reliable estimation of quantum states
- On the mathematics of the Jeffreys-Lindley paradox
- A universal predictor based on pattern matching
- Memoryless sequences for general losses
- Universal time-series forecasting with mixture predictors
- Adaptive strategies in Kelly’s horse races model
- scientific article; zbMATH DE number 7625180 (Why is no real title available?)
- scientific article; zbMATH DE number 7625184 (Why is no real title available?)
- ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS
- Universal inference
- Reporting Bayes factors or probabilities to decision makers of unknown loss functions
- Optimal sampling of parametric families: implications for machine learning
- Consistency, integrability and asymptotic normality for some intermittent estimators
- Online portfolio selection: a survey
- Nonparametric sequential prediction for stationary processes
- High-confidence predictions under adversarial uncertainty
- On the degree of univariate polynomials over the integers
- Compressed matrix multiplication
- Explanatory and creative alternatives to the MDL principle
- A Bayesian approach to (online) transfer learning: theory and algorithms
- A loss‐based prior for Gaussian graphical models
- Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates
- The optimal causal linear predictor is not Turing computable
- Solomonoff prediction and Occam's razor
- A cheat sheet for Bayesian prediction
- Thompson sampling for adversarial bit prediction
- Non-uniform consistency of online learning with random sampling
- Sequential prediction under log-loss with side information
- Curious coincidences and Kolmogorov complexity
- Sensor networks: from dependence analysis via matroid bases to online synthesis
- A universal online caching algorithm based on pattern matching
- Objective prior for the number of degrees of freedom of a \(t\) distribution
This page was built for publication: Universal prediction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701188)
