Universal prediction
From MaRDI portal
Publication:4701188
DOI10.1109/18.720534zbMath0933.94008OpenAlexW2294584261MaRDI QIDQ4701188
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/50f8b27297425b6bab118dda625dd63809c7c3f8
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Source coding (94A29)
Related Items (75)
Adaptive strategies in Kelly’s horse races model ⋮ ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS ⋮ A universal online caching algorithm based on pattern matching ⋮ On universal prediction and Bayesian confirmation ⋮ An Objective Bayesian Criterion to Determine Model Prior Probabilities ⋮ Fast learning rates in statistical inference through aggregation ⋮ Reporting Bayes factors or probabilities to decision makers of unknown loss functions ⋮ Unnamed Item ⋮ A Bayesian approach to (online) transfer learning: theory and algorithms ⋮ A loss‐based prior for Gaussian graphical models ⋮ Optimal, reliable estimation of quantum states ⋮ Fractal dimension and logarithmic loss unpredictability. ⋮ Objective prior for the number of degrees of freedom of a \(t\) distribution ⋮ Objective Bayesian analysis of the Yule-Simon distribution with applications ⋮ Generalized self-concordant analysis of Frank-Wolfe algorithms ⋮ Chasing Ghosts: Competing with Stateful Policies ⋮ On the mathematics of the Jeffreys–Lindley paradox ⋮ Optimal Sampling of Parametric Families: Implications for Machine Learning ⋮ Loss-based approach to two-piece location-scale distributions with applications to dependent data ⋮ Universal prediction of random binary sequences in a noisy environment ⋮ A loss-based prior for variable selection in linear regression methods ⋮ Randomized prediction of individual sequences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nonparametric sequential prediction for stationary processes ⋮ On the degree of univariate polynomials over the integers ⋮ Online portfolio selection ⋮ Explanatory and creative alternatives to the MDL principle ⋮ Prediction and dimension ⋮ High-confidence predictions under adversarial uncertainty ⋮ Quantum rejection sampling ⋮ Compressed matrix multiplication ⋮ On a loss-based prior for the number of components in mixture models ⋮ On universal algorithms for classifying and predicting stationary processes ⋮ Sensor networks: from dependence analysis via matroid bases to online synthesis ⋮ On calibration error of randomized forecasting algorithms ⋮ Measuring the efficiency of the intraday Forex market with a universal data compression algorithm ⋮ Learning hurdles for sleeping experts ⋮ Restriction access ⋮ Mechanism design with approximate valuations ⋮ Quantum strategic game theory ⋮ The curse of simultaneity ⋮ No justified complaints ⋮ 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 ⋮ Sherali-Adams relaxations and indistinguishability in counting logics ⋮ Graph densification ⋮ Spectral sparsification via random spanners ⋮ Multicommodity flows and cuts in polymatroidal networks ⋮ 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 prediction of individual sequences ⋮ Unnamed Item ⋮ On asymptotically optimal methods of prediction and adaptive coding for Markov sources
This page was built for publication: Universal prediction
