317 citations · 2.2k across the 59 of their papers we have counts for
10 papers · 1 filter
General Lower Bounds based on Computer Generated Higher Order Expansions
Martijn Leisink, Hilbert Kappen
In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to…
Approximate Inference and Constrained Optimization
Tom Heskes, Kees Albers, Hilbert Kappen
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspond…
Learning Price-Elasticity of Smart Consumers in Power Distribution Systems
Vicenç Gómez, Michael Chertkov, Scott Backhaus +1
Demand Response is an emerging technology which will transform the power grid of tomorrow. It is revolutionary, not only because it will enable peak load shaving and will add resou…
Sufficient conditions for convergence of Loopy Belief Propagation
Joris Mooij, Hilbert Kappen
We derive novel sufficient conditions for convergence of Loopy Belief Propagation (also known as the Sum-Product algorithm) to a unique fixed point. Our results improve upon previo…
Stochastic Optimal Control in Continuous Space-Time Multi-Agent Systems
Wim Wiegerinck, Bart van den Broek, Hilbert Kappen
Recently, a theory for stochastic optimal control in non-linear dynamical systems in continuous space-time has been developed (Kappen, 2005). We apply this theory to collaborative…
On the Sample Complexity of Reinforcement Learning with a Generative Model
Mohammad Gheshlaghi Azar, Remi Munos, Bert Kappen
We consider the problem of learning the optimal action-value function in the discounted-reward Markov decision processes (MDPs). We prove a new PAC bound on the sample-complexity o…