Pages that link to "Item:Q4503538"

The following pages link to Asymptotic minimax regret for data compression, gambling, and prediction (Q4503538):

Displaying 16 items.

• Information optimality and Bayesian modelling (Q280206) (← links)
• Predicting a binary sequence almost as well as the optimal biased coin (Q1398365) (← links)
• Using the Bayesian Shtarkov solution for predictions (Q1658740) (← links)
• On model selection, Bayesian networks, and the Fisher information integral (Q1670496) (← links)
• A lower bound on compression of unknown alphabets (Q1770393) (← links)
• Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory (Q1879959) (← links)
• Asymptotically minimax Bayesian predictive densities for multinomial models (Q1950845) (← links)
• When does ambiguity fade away? (Q2208852) (← links)
• A linear-time algorithm for computing the multinomial stochastic complexity (Q2379977) (← links)
• Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor (Q3529918) (← links)
• Optimal, reliable estimation of quantum states (Q4594493) (← links)
• Competitive On-line Statistics (Q4831997) (← links)
• Prequential analysis of complex data with adaptive model reselection (Q4969698) (← links)
• (Q5054630) (← links)
• Interpreting uninterpretable predictors: kernel methods, Shtarkov solutions, and random forests (Q5880100) (← links)
• A Bayesian approach to (online) transfer learning: theory and algorithms (Q6066772) (← links)