default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDForest Agostinelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Forest Agostinelli, Misagh Soltani:
Learning Discrete World Models for Heuristic Search. RLJ 4: 1781-1792 (2024)- [c10]Forest Agostinelli
, Rojina Panta, Vedant Khandelwal:
Specifying Goals to Deep Neural Networks with Answer Set Programming. ICAPS 2024: 2-10 - [i7]Kausik Lakkaraju, Vedant Khandelwal, Biplav Srivastava, Forest Agostinelli, Hengtao Tang, Prathamjeet Singh, Dezhi Wu, Matthew Irvin, Ashish Kundu:
Trust and ethical considerations in a multi-modal, explainable AI-driven chatbot tutoring system: The case of collaboratively solving Rubik's Cube. CoRR abs/2402.01760 (2024) - [i6]Vedant Khandelwal, Amit P. Sheth, Forest Agostinelli:
Towards Learning Foundation Models for Heuristic Functions to Solve Pathfinding Problems. CoRR abs/2406.02598 (2024) - 2023
- [i5]Hamed Damirchi, Forest Agostinelli, Pooyan Jamshidi:
Independent Modular Networks. CoRR abs/2306.01316 (2023) - [i4]Bharath Muppasani, Vishal Pallagani, Biplav Srivastava, Forest Agostinelli:
On Solving the Rubik's Cube with Domain-Independent Planners Using Standard Representations. CoRR abs/2307.13552 (2023) - 2022
- [j6]Muntaha Samad, Forest Agostinelli, Tomoki Sato, Kohei Shimaji, Pierre Baldi:
CircadiOmics: circadian omic web portal. Nucleic Acids Res. 50(W1): 183-190 (2022) - [c9]Kausik Lakkaraju, Thahimum Hassan, Vedant Khandelwal, Prathamjeet Singh, Cassidy Bradley, Ronak Shah, Forest Agostinelli, Biplav Srivastava, Dezhi Wu:
ALLURE: A Multi-Modal Guided Environment for Helping Children Learn to Solve a Rubik's Cube with Automatic Solving and Interactive Explanations. AAAI 2022: 13185-13187 - [c8]Dezhi Wu, Hengtao Tang, Cassidy Bradley, Brittany Capps, Prathamjeet Singh, Katelyn Wyandt, Karen Wong, Matthew Irvin, Forest Agostinelli, Biplav Srivastava:
AI-Driven User Interface Design for Solving a Rubik's Cube: A Scaffolding Design Perspective. HCI (41) 2022: 490-498 - [c7]Cassidy Bradley, Dezhi Wu, Hengtao Tang, Ishu Singh, Katelyn Wydant, Brittany Capps, Karen Wong, Forest Agostinelli, Matthew Irvin, Biplav Srivastava:
Explainable Artificial Intelligence (XAI) User Interface Design for Solving a Rubik's Cube. HCI (49) 2022: 605-612 - [d1]Babak Shahbaba, Lingge Li, Forest Agostinelli, Mansi Saraf, Keiland W. Cooper, Derenik Haghverdian, Gabriel A. Elias, Pierre Baldi, Norbert J. Fortin:
Hippocampal ensembles represent sequential relationships among an extended sequence of nonspatial events. Zenodo, 2022
- 2021
- [j5]Mohammadamin Tavakoli, Forest Agostinelli, Pierre Baldi:
SPLASH: Learnable activation functions for improving accuracy and adversarial robustness. Neural Networks 140: 1-12 (2021) - [c6]Forest Agostinelli, Mihir Mavalankar, Vedant Khandelwal, Hengtao Tang, Dezhi Wu, Barnett Berry, Biplav Srivastava, Amit P. Sheth, Matthew Irvin:
Designing Children's New Learning Partner: Collaborative Artificial Intelligence for Learning to Solve the Rubik's Cube. IDC 2021: 610-614 - [i3]Forest Agostinelli, Alexander Shmakov, Stephen McAleer, Roy Fox, Pierre Baldi:
A* Search Without Expansions: Learning Heuristic Functions with Deep Q-Networks. CoRR abs/2102.04518 (2021) - 2020
- [i2]Mohammadamin Tavakoli, Forest Agostinelli, Pierre Baldi:
SPLASH: Learnable Activation Functions for Improving Accuracy and Adversarial Robustness. CoRR abs/2006.08947 (2020)
2010 – 2019
- 2019
- [j4]Forest Agostinelli, Stephen McAleer, Alexander Shmakov, Pierre Baldi:
Solving the Rubik's cube with deep reinforcement learning and search. Nat. Mach. Intell. 1(8): 356-363 (2019) - [c5]Stephen McAleer, Forest Agostinelli, Alexander Shmakov, Pierre Baldi:
Solving the Rubik's Cube with Approximate Policy Iteration. ICLR (Poster) 2019 - 2018
- [j3]Nicholas Ceglia, Yu Liu, Siwei Chen, Forest Agostinelli, Kristin Eckel-Mahan, Paolo Sassone-Corsi, Pierre Baldi:
CircadiOmics: circadian omic web portal. Nucleic Acids Res. 46(Webserver-Issue): W157-W162 (2018) - [i1]Stephen McAleer, Forest Agostinelli, Alexander Shmakov, Pierre Baldi:
Solving the Rubik's Cube Without Human Knowledge. CoRR abs/1805.07470 (2018) - 2017
- [c4]Forest Agostinelli, Guillaume Hocquet, Sameer Singh, Pierre Baldi:
From Reinforcement Learning to Deep Reinforcement Learning: An Overview. Braverman Readings in Machine Learning 2017: 298-328 - 2016
- [j2]Forest Agostinelli, Nicholas Ceglia, Babak Shahbaba, Paolo Sassone-Corsi, Pierre Baldi:
What time is it? Deep learning approaches for circadian rhythms. Bioinform. 32(12): 8-17 (2016) - [j1]Forest Agostinelli, Nicholas Ceglia, Babak Shahbaba, Paolo Sassone-Corsi, Pierre Baldi:
What time is it? Deep learning approaches for circadian rhythms. Bioinform. 32(19): 3051 (2016) - [c3]Tianlin Shi, Forest Agostinelli, Matthew Staib, David P. Wipf, Thomas Moscibroda:
Improving Survey Aggregation with Sparsely Represented Signals. KDD 2016: 1845-1854 - 2015
- [c2]Forest Agostinelli, Matthew D. Hoffman, Peter J. Sadowski, Pierre Baldi:
Learning Activation Functions to Improve Deep Neural Networks. ICLR (Workshop) 2015 - 2013
- [c1]Forest Agostinelli, Michael R. Anderson, Honglak Lee:
Adaptive Multi-Column Deep Neural Networks with Application to Robust Image Denoising. NIPS 2013: 1493-1501
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
