default search action
Martin Klissarov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Martin Klissarov, Pierluca D'Oro, Shagun Sodhani, Roberta Raileanu, Pierre-Luc Bacon, Pascal Vincent, Amy Zhang, Mikael Henaff:
Motif: Intrinsic Motivation from Artificial Intelligence Feedback. ICLR 2024 - [c7]David Venuto, Mohammad Sami Nur Islam, Martin Klissarov, Doina Precup, Sherry Yang, Ankit Anand:
Code as Reward: Empowering Reinforcement Learning with VLMs. ICML 2024 - [i9]David Venuto, Mohammad Sami Nur Islam, Martin Klissarov, Doina Precup, Sherry Yang, Ankit Anand:
Code as Reward: Empowering Reinforcement Learning with VLMs. CoRR abs/2402.04764 (2024) - [i8]Martin Klissarov, R. Devon Hjelm, Alexander Toshev, Bogdan Mazoure:
On the Modeling Capabilities of Large Language Models for Sequential Decision Making. CoRR abs/2410.05656 (2024) - 2023
- [c6]Martin Klissarov, Marlos C. Machado:
Deep Laplacian-based Options for Temporally-Extended Exploration. ICML 2023: 17198-17217 - [i7]Martin Klissarov, Marlos C. Machado:
Deep Laplacian-based Options for Temporally-Extended Exploration. CoRR abs/2301.11181 (2023) - [i6]Martin Klissarov, Pierluca D'Oro, Shagun Sodhani, Roberta Raileanu, Pierre-Luc Bacon, Pascal Vincent, Amy Zhang, Mikael Henaff:
Motif: Intrinsic Motivation from Artificial Intelligence Feedback. CoRR abs/2310.00166 (2023) - 2022
- [c5]Martin Klissarov, Rasool Fakoor, Jonas W. Mueller, Kavosh Asadi, Taesup Kim, Alexander J. Smola:
Adaptive Interest for Emphatic Reinforcement Learning. NeurIPS 2022 - 2021
- [c4]Martin Klissarov, Doina Precup:
Flexible Option Learning. NeurIPS 2021: 4632-4646 - [i5]Martin Klissarov, Doina Precup:
Flexible Option Learning. CoRR abs/2112.03097 (2021) - 2020
- [c3]Khimya Khetarpal, Martin Klissarov, Maxime Chevalier-Boisvert, Pierre-Luc Bacon, Doina Precup:
Options of Interest: Temporal Abstraction with Interest Functions. AAAI 2020: 4444-4451 - [c2]Martin Klissarov, Doina Precup:
Reward Propagation Using Graph Convolutional Networks. NeurIPS 2020 - [i4]Khimya Khetarpal, Martin Klissarov, Maxime Chevalier-Boisvert, Pierre-Luc Bacon, Doina Precup:
Options of Interest: Temporal Abstraction with Interest Functions. CoRR abs/2001.00271 (2020) - [i3]Martin Klissarov, Doina Precup:
Reward Propagation Using Graph Convolutional Networks. CoRR abs/2010.02474 (2020)
2010 – 2019
- 2018
- [c1]Jean Harb, Pierre-Luc Bacon, Martin Klissarov, Doina Precup:
When Waiting Is Not an Option: Learning Options With a Deliberation Cost. AAAI 2018: 3165-3172 - 2017
- [i2]Jean Harb, Pierre-Luc Bacon, Martin Klissarov, Doina Precup:
When Waiting is not an Option : Learning Options with a Deliberation Cost. CoRR abs/1709.04571 (2017) - [i1]Martin Klissarov, Pierre-Luc Bacon, Jean Harb, Doina Precup:
Learnings Options End-to-End for Continuous Action Tasks. CoRR abs/1712.00004 (2017)
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-19 20:46 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: