How to use expert advice
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
- On Bayes methods for on-line Boolean prediction
- A game of prediction with expert advice
- Predicting a binary sequence almost as well as the optimal biased coin
- Loss functions, complexities, and the Legendre transformation.
- Minmax regret solutions for minimax optimization problems with uncertainty
- Adaptive and self-confident on-line learning algorithms
- On minimaxity of follow the leader strategy in the stochastic setting
- Preselection and expert advice
- Scale-free online learning
- Randomized prediction of individual sequences
- Predictive complexity and information
- Prediction and dimension
- A quasi-Bayesian perspective to online clustering
- Adaptive game playing using multiplicative weights
- Predicting nearly as well as the best pruning of a planar decision graph.
- Suboptimal measures of predictive complexity for absolute loss function
- On complexity of easy predictable sequences
- Generalization bounds for averaged classifiers
- On approximating weighted sums with exponentially many terms
- Online learning in online auctions
- The best expert versus the smartest algorithm
- Regret bounds for sleeping experts and bandits
- Derandomizing stochastic prediction strategies
- Analysis of two gradient-based algorithms for on-line regression
- Sequential model aggregation for production forecasting
- Handling concept drift via model reuse
- Fano's inequality for random variables
- Committee, expert advice, and the weighted majority algorithm: an application to the pricing decision of a monopolist
- On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
- Order-disorder phase transition in heterogeneous populations of self-propelled particles
- Learning correlated equilibria in games with compact sets of strategies
- Improved second-order bounds for prediction with expert advice
- Fast learning rates in statistical inference through aggregation
- Step decision rules for multistage stochastic programming: a heuristic approach
- Linear programming with online learning
- How many strings are easy to predict?
- Asymptotically optimal strategies for online prediction with history-dependent experts
- Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models
- On martingale extensions of Vapnik-Chervonenkis theory with applications to online learning
- On minimaxity of follow the leader strategy in the stochastic setting
- Scale-free algorithms for online linear optimization
- Online forecast combinations of distributions: worst case bounds
- Chasing Ghosts: Competing with Stateful Policies
- scientific article; zbMATH DE number 1800545 (Why is no real title available?)
- Combining expert advice in reactive environments
- Aggregating Algorithm for a Space of Analytic Functions
- PORTFOLIO SELECTION AND ONLINE LEARNING
- Minimizing Regret With Label Efficient Prediction
- Automated trading with boosting and expert weighting
- Prediction with expert evaluators' advice
- Adaptive regularization of weight vectors
- Combining initial segments of lists
- scientific article; zbMATH DE number 67638 (Why is no real title available?)
- Sparse regression learning by aggregation and Langevin Monte-Carlo
- Learning with stochastic inputs and adversarial outputs
- scientific article; zbMATH DE number 1559549 (Why is no real title available?)
- Towards optimal algorithms for prediction with expert advice
- Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
- Soft-Bayes: prod for mixtures of experts with log-loss
- Learning Theory
- COMBINING FORECASTING PROCEDURES: SOME THEORETICAL RESULTS
- Competitive On-line Statistics
- Perfect strategies for the Ulam-Rényi game with multi-interval questions
- Online learning over a finite action set with limited switching
- scientific article; zbMATH DE number 7370589 (Why is no real title available?)
- Bandit convex optimization in non-stationary environments
- Finite-time 4-expert prediction problem
- Learning whenever learning is possible: universal learning under general stochastic processes
- A continuous-time approach to online optimization
- Note on universal conditional consistency
- scientific article; zbMATH DE number 7064063 (Why is no real title available?)
- Combining information from several experts: selecting and stopping rules in sequential consult\-ing
- Algorithmic Learning Theory
- Multitask Learning with Expert Advice
- Probability theory for the Brier game
- Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
- Aggregating expert predictions in a networked environment.
- General linear relations between different types of predictive complexity
- Online Prediction with <scp>History‐Dependent</scp> Experts: The General Case
- Optimal anytime regret with two experts
- User-friendly Introduction to PAC-Bayes Bounds
- Universal regression with adversarial responses
- Metalearning of time series: an approximate dynamic programming approach
- Playing against no-regret players
- Synthetic learner: model-free inference on treatments over time
- Gradient-free algorithms for distributed online convex optimization
- Numerical solution of a PDE arising from prediction with expert advice
- Optimal prediction using expert advice and randomized Littlestone dimension
- Convergence of natural policy gradient for a family of infinite-state queueing MDPs
- Optimization over a probability simplex
- Efficient projection-free online convex optimization using stochastic gradients
- The dimension of self-directed learning
- Bayesian predictive synthesis with outcome-dependent pools
- Universally consistent online learning with arbitrarily dependent responses
- Efficient and optimal fixed-time regret with two experts
- How to better use expert advice
- Competitive ratio vs regret minimization: achieving the best of both worlds
- Gradient equilibrium in online learning: theory and applications
- Sensor networks: from dependence analysis via matroid bases to online synthesis
This page was built for publication: How to use expert advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376978)
