Sciweavers

263 search results - page 15 / 53
» Regret Bounds for Prediction Problems
Sort
View
CIMCA
2008
IEEE
14 years 4 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
AAAI
1998
13 years 11 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
ICASSP
2011
IEEE
13 years 1 months ago
Online anomaly detection with expert system feedback in social networks
In this paper, we propose examining the participants in various meetings or communications within a social network, and using sequential inference based on these participant lists...
Corinne Horn, Rebecca Willett
VR
2010
IEEE
154views Virtual Reality» more  VR 2010»
13 years 8 months ago
On error bound estimation for motion prediction
A collaborative virtual environment (CVE) allows remote users to access and modify shared data through networks, such as the Internet. However, when the users are connected via th...
Rynson W. H. Lau, Kenneth Lee
ALT
2004
Springer
14 years 6 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster