default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClement Gehring
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Mahan Fathi, Clement Gehring, Jonathan Pilault, David Kanaa, Pierre-Luc Bacon, Ross Goroshin:
Course Correcting Koopman Representations. ICLR 2024- [c9]Tianwei Ni, Benjamin Eysenbach, Erfan Seyedsalehi, Michel Ma, Clement Gehring, Aditya Mahajan, Pierre-Luc Bacon:
Bridging State and History Representations: Understanding Self-Predictive RL. ICLR 2024 - [c8]Michel Ma, Tianwei Ni, Clement Gehring, Pierluca D'Oro, Pierre-Luc Bacon:
Do Transformer World Models Give Better Policy Gradients? ICML 2024 - [i6]Tianwei Ni, Benjamin Eysenbach
, Erfan Seyedsalehi, Michel Ma, Clement Gehring, Aditya Mahajan, Pierre-Luc Bacon:
Bridging State and History Representations: Understanding Self-Predictive RL. CoRR abs/2401.08898 (2024) - [i5]Michel Ma, Tianwei Ni, Clement Gehring, Pierluca D'Oro, Pierre-Luc Bacon:
Do Transformer World Models Give Better Policy Gradients? CoRR abs/2402.05290 (2024) - 2023
- [i4]Mahan Fathi, Clement Gehring, Jonathan Pilault, David Kanaa, Pierre-Luc Bacon, Ross Goroshin:
Course Correcting Koopman Representations. CoRR abs/2310.15386 (2023) - 2022
- [b1]Clement Gehring:
Efficient reinforcement learning via singular value decomposition, end-to-end model-based methods and reward shaping. MIT, USA, 2022 - [c7]Clement Gehring, Masataro Asai, Rohan Chitnis, Tom Silver, Leslie Pack Kaelbling, Shirin Sohrabi, Michael Katz:
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators. ICAPS 2022: 588-596 - 2021
- [c6]Jing Yu, Clement Gehring, Florian Schäfer, Animashree Anandkumar:
Robust Reinforcement Learning: A Constrained Game-theoretic Approach. L4DC 2021: 1242-1254 - [c5]Clement Gehring, Kenji Kawaguchi, Jiaoyang Huang, Leslie Pack Kaelbling:
Understanding End-to-End Model-Based Reinforcement Learning Methods as Implicit Parameterization. NeurIPS 2021: 703-714 - [i3]Clement Gehring, Masataro Asai, Rohan Chitnis, Tom Silver, Leslie Pack Kaelbling, Shirin Sohrabi, Michael Katz:
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators. CoRR abs/2109.14830 (2021)
2010 – 2019
- 2018
- [c4]Zi Wang, Clement Gehring, Pushmeet Kohli, Stefanie Jegelka:
Batched Large-scale Bayesian Optimization in High-dimensional Spaces. AISTATS 2018: 745-754 - [c3]Clement Gehring, Leslie Pack Kaelbling, Tomás Lozano-Pérez:
Adaptable replanning with compressed linear action models for learning from demonstrations. CoRL 2018: 432-442 - 2017
- [i2]Zi Wang, Clement Gehring, Pushmeet Kohli, Stefanie Jegelka:
Batched Large-scale Bayesian Optimization in High-dimensional Spaces. CoRR abs/1706.01445 (2017) - 2016
- [c2]Clement Gehring, Yangchen Pan, Martha White:
Incremental Truncated LSTD. IJCAI 2016: 1505-1511 - 2015
- [i1]Clement Gehring, Martha White:
Incremental Truncated LSTD. CoRR abs/1511.08495 (2015) - 2013
- [c1]Clement Gehring, Doina Precup:
Smart exploration in reinforcement learning using absolute temporal difference errors. AAMAS 2013: 1037-1044
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-10-07 21:24 CEST 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:
