# Non-parametric Approximate Dynamic Programming via the Kernel Method

##### Citations

43 citations

37 citations

### Cites background from "Non-parametric Approximate Dynamic ..."

...Following a slightly different line of work, Bhat et al. (2012) propose to kernelize the linear programming formulation of dynamic programming....

[...]

29 citations

21 citations

21 citations

### Cites methods from "Non-parametric Approximate Dynamic ..."

...…Farias and Van Roy, 2000; Tsitsiklis and Roy, 1996; Tsitsiklis and Van Roy, 1999; Geramifard et al., 2013), approximate linear programming (De Farias and Van Roy, 2003; De Farias and Van Roy, 2004; Desai et al., 2012a), and nonparametric methods are used (Ormoneit and Sen, 2002; Bhat et al., 2012)....

[...]

##### References

10,834 citations

7,880 citations

### "Non-parametric Approximate Dynamic ..." refers background in this paper

...For certain sets S, Mercer’s theorem provides another important construction of such a Hilbert space. more examples can be found in the text of Scholkopf and Smola (2001)....

[...]

...The Gaussian kernel is known to be full-dimensional (see, e.g., Theorem 2.18, Scholkopf and Smola, 2001), so that employing such a kernel in our setting would correspond to working with an infinite dimensional approximation architecture....

[...]

...more examples can be found in the text of Scholkopf and Smola (2001)....

[...]

5,667 citations

3,018 citations

### "Non-parametric Approximate Dynamic ..." refers methods in this paper

...Max-Weight (Tassiulas and Ephremides, 1992)....

[...]

...We prepare the ground for the proof by developing appropriate uniform concentration guarantees for appropriate function classes....

[...]

2,535 citations