Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

COLT
2005
Springer

favoriteEmaildiscussreport

93views Machine Learning» more COLT 2005»

Localized Upper and Lower Bounds for Some Estimation Problems

13 years 10 months ago

Localized Upper and Lower Bounds for Some Estimation Problems

Download stat.rutgers.edu

Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all statistical estimators, match the obtained upper bounds for various problems. Moreover, our framework can be regarded as a natural generalization of the standard minimax framework, in that we allow the performance of the estimator to vary for diﬀerent possible underlying distributions according to a pre-deﬁned prior.

Tong Zhang

Real-time Traffic

COLT 2005 | Lower Bounds | Obtained Upper Bounds | Upper Bounds |

claim paper

Related Content

» Maximum common subgraph some upper bound and lower bound results

» A Lower Bound for the Breakpoint Phylogeny Problem

» New upper and lower bounds for randomized and quantum local search

» Estimating Upper and Lower Bounds on the Performance of WordSense Disambiguation Programs

» New algorithms for singly linearly constrained quadratic programs subject to lower and upp...

» A MultiRound Communication Lower Bound for Gap Hamming and Some Consequences

» Quantum Query Complexity of Some Graph Problems

» Estimating Bounds on Expected Plateau Size in MAXSAT Problems

» On some invariants in numerical semigroups and estimations of the order bound

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	COLT
Authors	Tong Zhang

Comments (0)