Sciweavers

224 search results - page 26 / 45
» Bounding Learning Time in XCS
Sort
View
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 3 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 3 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
NECO
1998
100views more  NECO 1998»
13 years 8 months ago
Memory Maintenance via Neuronal Regulation
Since their conception half a century ago Hebbian cell assemblies have become a basic term in the Neurosciences, and the idea that learning takes place through synaptic modi catio...
David Horn, Nir Levy, Eytan Ruppin
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
13 years 10 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh
FOCS
2010
IEEE
13 years 6 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan