Carregant...
Carregant...

Vés al contingut (premeu Retorn)

An optimal anytime estimation algorithm

Autor
Gavaldà, R.
Tipus d'activitat
Document cientificotècnic
Data
2004-12
Codi
LSI-04-56-R
Repositori
http://hdl.handle.net/2117/87244 Obrir en finestra nova
Resum
In many applications a key step is estimating some unknown quantity ~$mu$ from a sequence of trials, each having expected value~$mu$. Optimal algorithms are known when the task is to estimate $mu$ within a multiplicative factor of $epsilon$, for an $epsilon$ given in advance. In this paper we consider {em anytime} approximation algorithms, i.e., algorithms that must give a reliable approximation after each trial, and whose approximations have to be increasingly accurate as the number of trials g...
Citació
Gavaldà, R. "An optimal anytime estimation algorithm". 2004.
Paraules clau
Approximation algorithms, Optimal algorithms
Grup de recerca
LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge

Participants

Arxius