539 search results - page 31 / 108 » Learning Monotonic Linear Functions |
126
Voted
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity. We present approaches that ...
146
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
127
Voted
IPCO
2010
15 years 4 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
122
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
130
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...