Sciweavers

465 search results - page 27 / 93
» Optimizing Local Probability Models for Statistical Parsing
Sort
View
COLT
2003
Springer
15 years 7 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
CORR
2007
Springer
94views Education» more  CORR 2007»
15 years 1 months ago
Statistical tools to assess the reliability of self-organizing maps
Results of neural network learning are always subject to some variability, due to the sensitivity to initial conditions, to convergence to local minima, and, sometimes more dramat...
Eric de Bodt, Marie Cottrell, Michel Verleysen
ICASSP
2010
IEEE
15 years 2 months ago
A minimax approach to Bayesian estimation with partial knowledge of the observation model
We address the problem of Bayesian estimation where the statistical relation between the signal and measurements is only partially known. We propose modeling partial Baysian knowl...
Tomer Michaeli, Yonina C. Eldar
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 1 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
15 years 8 months ago
Apply ant colony optimization to Tetris
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
Xingguo Chen, Hao Wang, Weiwei Wang, Yinghuan Shi,...