The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Value Function Approximation in Reinforcement Learning Using the Fourier Basis
Open accessAbstract
We describe the Fourier basis, a linear value function approximation scheme based on the Fourier series. We empirically demonstrate that it performs well compared to radial basis functions and the polynomial basis, the two most popular fixed bases for linear value function approximation, and is competitive with learned proto-value functions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Minimization of functions having Lipschitz continuous first partial derivatives
Armijo, L. (1966) · Pacific Journal of Mathematics · doi:10.2140/pjm.1966.16.1 · Cited by 1,983
Mahadevan, S., & Maggioni, M. (2007) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · doi:10.5555/1314498.1314570 · Cited by 374
FOR LEAST-SQUARES POLICY ITERATION
Schwab, D. (2016) · Cited by 372
On-Line Learning in Neural Networks
MTW, & Saad, D. (2000) · Journal of the American Statistical Association · doi:10.2307/2669811 · Cited by 260
Regularization and feature selection in least-squares temporal difference learning
Kolter, J. Z., & Ng, A. Y. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553442 · Cited by 176
RL-Glue: Language-Independent Software for Reinforcement-Learning Experiments
Tanner, B. K., & White, A. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1755857 · Cited by 119
Mahadevan, S. (2005) · International Conference on Machine Learning · doi:10.1145/1102351.1102421 · Cited by 104
Cited by
Reinforcement learning in robotics: A survey
Kober, J., Bagnell, J. A., & Peters, J. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913495721 · Cited by 3,160
Robot learning from demonstration by constructing skill trees
Konidaris, G., Kuindersma, S., Grupen, R., & Barto, A. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911428653 · Cited by 286
Self-citationDeep reinforcement learning and its neuroscientific implications
Botvinick, M., Wang, J. X., Dabney, W., Miller, K. J., & Kurth-Nelson, Z. (2020) · Neuron · doi:10.1016/j.neuron.2020.06.014 · Cited by 269
Cellular Network Traffic Scheduling With Deep Reinforcement Learning
Chinchali, S., Hu, P., Chu, T., Sharma, M., Bansal, M., Misra, R., Pavone, M., & Katti, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11339 · Cited by 218
“Our work heavily applies recent developments in deep RL (Mnih et al. 2013; Silver et al. 2014), which draw inspiration from several other approximate RL methods (Konidaris, Osentoski, and Thomas 2011; Kakade and Langford 2002).”
Method
Metadata
- Authors
- Konidaris, G., Osentoski, S., & Thomas, P.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2011-08-04
- Volume
- 25
- Issue
- 1
- Pages
- 380-385
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2106261932
- Cited by
- 267
- References
- 14
- FWCI
- 13.57
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Value Function Approximation in Reinforcement Learning Using the Fourier Basis. https://app.cochat.ai/papers/10.1609/aaai.v25i1.7903
- The paper
- Konidaris, G., Osentoski, S., & Thomas, P. (2011). Value Function Approximation in Reinforcement Learning Using the Fourier Basis. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v25i1.7903
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.