paper-with-me

홈 › Papers

Prediction with Advice of Unknown Number of Experts

2014-08-09 · Alexey Chernov, Vladimir Vovk

In the framework of prediction with expert advice, we consider a recently introduced kind of regret bounds: the bounds that depend on the effective instead of nominal number of experts. In contrast to the Normal- Hedge bound, which mainly depends on the effective number of experts but also weakly depends on the nominal one, we obtain a bound that does not contain the nominal number of experts at all. We use the defensive forecasting method and introduce an application of defensive forecasting to multivalued supermartingales.

📄 PDF Abstract BibTeX arXiv:1408.2040

Code (0)

등록된 구현이 없습니다.

Tasks

Prediction

Similar Papers 제목 키워드 기반

Online Learning with Low Rank Experts

2016-03-21 · Elad Hazan, Tomer Koren, Roi Livni, Yishay Mansour

We consider the problem of prediction with expert advice when the losses of the experts have low-dimensional structure: they are restricted to an unknown $d$-dimensional subspace. We devise algorithms with regret bounds …

Advice-Efficient Prediction with Expert Advice

2013-04-12 · Yevgeny Seldin, Peter Bartlett, Koby Crammer

Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are allowed to ask for advice of a limited …

Prediction

Efficient tracking of a growing number of experts

2017-08-31 · Jaouad Mourtada, Odalric-Ambrym Maillard

We consider a variation on the problem of prediction with expert advice, where new forecasters that were unknown until then may appear at each round. As often in prediction with expert advice, designing an algorithm that…

Fast rates for prediction with limited expert advice

2021-10-27 · NeurIPS 2021 12 · El Mehdi Saad, Gilles Blanchard

We investigate the problem of minimizing the excess generalization error with respect to the best expert prediction in a finite family in the stochastic setting, under limited access to information. We assume that the le…

Prediction

Efficient and Optimal Fixed-Time Regret with Two Experts

2022-03-15 · Laura Greenstreet, Nicholas J. A. Harvey, Victor Sanches Portella

Prediction with expert advice is a foundational problem in online learning. In instances with $T$ rounds and $n$ experts, the classical Multiplicative Weights Update method suffers at most $\sqrt{(T/2)\ln n}$ regret when…

Vocal Bursts Valence Prediction