The following pages link to Universal prediction (Q4701188):
Displaying 50 items.
- Nonparametric sequential prediction for stationary processes (Q533751) (← links)
- Sensor networks: from dependence analysis via matroid bases to online synthesis (Q742408) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- Objective prior for the number of degrees of freedom of a \(t\) distribution (Q899016) (← links)
- On calibration error of randomized forecasting algorithms (Q1017657) (← links)
- Measuring the efficiency of the intraday Forex market with a universal data compression algorithm (Q1020542) (← links)
- Fractal dimension and logarithmic loss unpredictability. (Q1401414) (← links)
- Universal prediction of random binary sequences in a noisy environment (Q1431550) (← links)
- On prediction of individual sequences (Q1583891) (← links)
- On asymptotically optimal methods of prediction and adaptive coding for Markov sources (Q1599202) (← links)
- Objective Bayesian analysis of the Yule-Simon distribution with applications (Q1695507) (← links)
- Randomized prediction of individual sequences (Q1733293) (← links)
- Prediction and dimension (Q1780452) (← links)
- On universal algorithms for classifying and predicting stationary processes (Q2039763) (← links)
- Loss-based approach to two-piece location-scale distributions with applications to dependent data (Q2218635) (← links)
- A loss-based prior for variable selection in linear regression methods (Q2226693) (← links)
- On a loss-based prior for the number of components in mixture models (Q2288805) (← links)
- On universal prediction and Bayesian confirmation (Q2382281) (← links)
- Fast learning rates in statistical inference through aggregation (Q2388975) (← links)
- Generalized self-concordant analysis of Frank-Wolfe algorithms (Q2687046) (← links)
- Learning hurdles for sleeping experts (Q2826040) (← links)
- Restriction access (Q2826041) (← links)
- Mechanism design with approximate valuations (Q2826042) (← links)
- Quantum strategic game theory (Q2826043) (← links)
- The curse of simultaneity (Q2826044) (← links)
- No justified complaints: on fair sharing of multiple resources (Q2826045) (← links)
- From randomizing polynomials to parallel algorithms (Q2826046) (← links)
- Practical verified computation with streaming interactive proofs (Q2826047) (← links)
- Paging for multi-core shared caches (Q2826048) (← links)
- Noise vs computational intractability in dynamics (Q2826049) (← links)
- Distribution free evolvability of polynomial functions over all convex loss functions (Q2826050) (← links)
- Algorithms on evolving graphs (Q2826051) (← links)
- Towards deterministic tree code constructions (Q2826052) (← links)
- Linear time decoding of regular expander codes (Q2826053) (← links)
- List decoding subspace codes from insertions and deletions (Q2826055) (← links)
- Bounds on locally testable codes with unique tests (Q2826056) (← links)
- Approximately optimal mechanism design via differential privacy (Q2826057) (← links)
- Fairness through awareness (Q2826058) (← links)
- Dynamics of prisoner's dilemma and the evolution of cooperation on networks (Q2826059) (← links)
- Crowdsourced Bayesian auctions (Q2826060) (← links)
- Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure (Q2826061) (← links)
- Quantum interactive proofs with weak error bounds (Q2826062) (← links)
- Quantum money from knots (Q2826064) (← links)
- (Leveled) fully homomorphic encryption without bootstrapping (Q2826066) (← links)
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again (Q2826067) (← links)
- Targeted malleability: homomorphic encryption for restricted computations (Q2826068) (← links)
- Sherali-Adams relaxations and indistinguishability in counting logics (Q2826069) (← links)
- Graph densification (Q2826070) (← links)
- Spectral sparsification via random spanners (Q2826071) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
