How to better use expert advice
From MaRDI portal
Publication:703067
DOI10.1023/B:MACH.0000027784.72823.E4zbMATH Open1093.68094OpenAlexW2162243185MaRDI QIDQ703067FDOQ703067
Authors: Rani Yaroshinsky, Ran El-Yaniv, Steven S. Seiden 
Publication date: 19 January 2005
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:mach.0000027784.72823.e4
Recommendations
Cited In (47)
- A closer look at adaptive regret
- Extracting certainty from uncertainty: regret bounded by variation in costs
- Algorithmic Learning Theory
- Learning permutations with exponential weights
- Continuous Experts and the Binning Algorithm
- How to use expert advice
- Aggregating Algorithm for a Space of Analytic Functions
- The computational power of optimization in online learning
- Title not available (Why is that?)
- A closer look at adaptive regret
- Prediction with expert evaluators' advice
- Fast learning rates in statistical inference through aggregation
- 10.1162/153244303321897654
- Towards optimal algorithms for prediction with expert advice
- Derandomizing stochastic prediction strategies
- Learning Volatility of Discrete Time Series Using Prediction with Expert Advice
- Learning with continuous experts using drifting games
- On the value of persuasion by experts
- The best expert versus the smartest algorithm
- Algorithmic Learning Theory
- Learning Theory
- Multitask Learning with Expert Advice
- Learning with stochastic inputs and adversarial outputs
- Learning Theory
- Title not available (Why is that?)
- Regret to the best vs. regret to the average
- Tight lower bounds for multiplicative weights algorithmic families
- Improved second-order bounds for prediction with expert advice
- Learning with Continuous Experts Using Drifting Games
- Handling uncertainty when getting contradictory advice from experts
- Online prediction problems with variation
- Learning hurdles for sleeping experts
- Learning hurdles for sleeping experts
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- The lob-pass problem
- Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
- Combining expert advice in reactive environments
- Online Learning with Prior Knowledge
- Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimality
- Online learning in case of unbounded losses using follow the perturbed leader algorithm
- Algorithmic Learning Theory
- Soft-Bayes: prod for mixtures of experts with log-loss
- Probability theory for the Brier game
- Title not available (Why is that?)
- Online aggregation of unbounded losses using shifting experts with confidence
- Title not available (Why is that?)
This page was built for publication: How to better use expert advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703067)
