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.
Berend, Daniel, Kontorovich, Aryeh, Reyzin, Lev, and Robinson, Thomas. On biased random walks, corrupted intervals, and learning under adversarial design. Retrieved from https://par.nsf.gov/biblio/10187491. Annals of Mathematics and Artificial Intelligence 88.8 Web. doi:10.1007/s10472-020-09696-1.
Berend, Daniel, Kontorovich, Aryeh, Reyzin, Lev, & Robinson, Thomas. On biased random walks, corrupted intervals, and learning under adversarial design. Annals of Mathematics and Artificial Intelligence, 88 (8). Retrieved from https://par.nsf.gov/biblio/10187491. https://doi.org/10.1007/s10472-020-09696-1
Berend, Daniel, Kontorovich, Aryeh, Reyzin, Lev, and Robinson, Thomas.
"On biased random walks, corrupted intervals, and learning under adversarial design". Annals of Mathematics and Artificial Intelligence 88 (8). Country unknown/Code not available. https://doi.org/10.1007/s10472-020-09696-1.https://par.nsf.gov/biblio/10187491.
@article{osti_10187491,
place = {Country unknown/Code not available},
title = {On biased random walks, corrupted intervals, and learning under adversarial design},
url = {https://par.nsf.gov/biblio/10187491},
DOI = {10.1007/s10472-020-09696-1},
abstractNote = {},
journal = {Annals of Mathematics and Artificial Intelligence},
volume = {88},
number = {8},
author = {Berend, Daniel and Kontorovich, Aryeh and Reyzin, Lev and Robinson, Thomas},
}
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.