The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, January 16 until 2:00 AM ET on Friday, January 17 due to maintenance. We apologize for the inconvenience.
Explore Research Products in the PAR It may take a few hours for recently added research products to appear in PAR search results.
Cayci, Semih, Satpathi, Siddhartha, He, Niao, and Srikant, R. Sample Complexity and Overparameterization Bounds for Temporal-Difference Learning With Neural Network Approximation. Retrieved from https://par.nsf.gov/biblio/10410556. IEEE Transactions on Automatic Control 68.5 Web. doi:10.1109/TAC.2023.3234234.
Cayci, Semih, Satpathi, Siddhartha, He, Niao, and Srikant, R.
"Sample Complexity and Overparameterization Bounds for Temporal-Difference Learning With Neural Network Approximation". IEEE Transactions on Automatic Control 68 (5). Country unknown/Code not available. https://doi.org/10.1109/TAC.2023.3234234.https://par.nsf.gov/biblio/10410556.
@article{osti_10410556,
place = {Country unknown/Code not available},
title = {Sample Complexity and Overparameterization Bounds for Temporal-Difference Learning With Neural Network Approximation},
url = {https://par.nsf.gov/biblio/10410556},
DOI = {10.1109/TAC.2023.3234234},
abstractNote = {},
journal = {IEEE Transactions on Automatic Control},
volume = {68},
number = {5},
author = {Cayci, Semih and Satpathi, Siddhartha and He, Niao and Srikant, R.},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.