Sciweavers

509 search results - page 52 / 102
» Compositional Models for Reinforcement Learning
Sort
View
CIG
2005
IEEE
15 years 5 months ago
Nannon: A Nano Backgammon for Machine Learning Research
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
Jordan B. Pollack
ACMICEC
2007
ACM
102views ECommerce» more  ACMICEC 2007»
15 years 3 months ago
Learning to trade with insider information
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
Sanmay Das
ECAL
2003
Springer
15 years 5 months ago
Learning Biases for the Evolution of Linguistic Structure: An Associative Network Model
Abstract. Structural hallmarks of language can be explained in terms of adaptation, by language, to pressures arising during its cultural transmission. Here I present a model which...
Kenny Smith
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
15 years 3 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur
JMLR
2012
13 years 2 months ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin