Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Lu 0001
Person information
- affiliation: University of Oxford, UK
- affiliation (former): University of California Berkeley, CA, USA
- not to be confused with: Christopher Lu 0002
Other persons with the same name
- Chris Lu 0002 — Athabasca University, School of Computing and Information Systems, Canada
- Christopher Lu 0002 — University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i21]Jake Levi, Chris Lu, Timon Willi, Christian Schröder de Witt, Jakob N. Foerster:
The Danger Of Arrogance: Welfare Equilibra As A Solution To Stackelberg Self-Play In Non-Coincidental Games. CoRR abs/2402.01088 (2024)- [i20]Carlo Alfano, Sebastian Towers, Silvia Sapora, Chris Lu, Patrick Rebeschini:
Meta-learning the mirror map in policy mirror descent. CoRR abs/2402.05187 (2024) - [i19]Kitty Fung, Qizhen Zhang, Chris Lu, Jia Wan, Timon Willi, Jakob N. Foerster:
Analysing the Sample Complexity of Opponent Shaping. CoRR abs/2402.05782 (2024) - [i18]Matthew Thomas Jackson, Chris Lu, Louis Kirsch, Robert Tjarko Lange, Shimon Whiteson, Jakob Nicolaus Foerster:
Discovering Temporally-Aware Reinforcement Learning Algorithms. CoRR abs/2402.05828 (2024) - [i17]Steven D. Morad, Chris Lu, Ryan Kortvelesy, Stephan Liwicki, Jakob N. Foerster, Amanda Prorok:
Revisiting Recurrent Reinforcement Learning with Memory Monoids. CoRR abs/2402.09900 (2024) - 2023
- [c12]Robert Tjarko Lange, Tom Schaul
, Yutian Chen, Tom Zahavy, Valentin Dalibard, Chris Lu, Satinder Singh, Sebastian Flennerhag:
Discovering Evolution Strategies via Meta-Black-Box Optimization. GECCO Companion 2023: 29-30 - [c11]Robert Tjarko Lange, Tom Schaul, Yutian Chen, Chris Lu, Tom Zahavy, Valentin Dalibard, Sebastian Flennerhag:
Discovering Attention-Based Genetic Algorithms via Meta-Black-Box Optimization. GECCO 2023: 929-937 - [c10]Sascha Yves Frey, Kang Li, Peer Nagy, Silvia Sapora, Christopher Lu, Stefan Zohren, Jakob N. Foerster, Anisoara Calinescu:
JAX-LOB: A GPU-Accelerated limit order book simulator to unlock large scale reinforcement learning for trading. ICAIF 2023: 583-591 - [c9]Robert Tjarko Lange, Tom Schaul, Yutian Chen, Tom Zahavy, Valentin Dalibard, Chris Lu, Satinder Singh, Sebastian Flennerhag:
Discovering Evolution Strategies via Meta-Black-Box Optimization. ICLR 2023 - [c8]Chris Lu, Timon Willi, Alistair Letcher, Jakob Nicolaus Foerster:
Adversarial Cheap Talk. ICML 2023: 22917-22941 - [c7]Chris Lu, Yannick Schroecker, Albert Gu, Emilio Parisotto, Jakob N. Foerster, Satinder Singh, Feryal M. P. Behbahani:
Structured State Space Models for In-Context Reinforcement Learning. NeurIPS 2023 - [c6]Matthew Thomas Jackson, Minqi Jiang, Jack Parker-Holder, Risto Vuorio, Chris Lu, Gregory Farquhar, Shimon Whiteson, Jakob N. Foerster:
Discovering General Reinforcement Learning Algorithms with Adversarial Environment Design. NeurIPS 2023 - [i16]Chris Lu, Yannick Schroecker, Albert Gu, Emilio Parisotto, Jakob N. Foerster, Satinder Singh, Feryal M. P. Behbahani:
Structured State Space Models for In-Context Reinforcement Learning. CoRR abs/2303.03982 (2023) - [i15]Chris Lu, Sebastian Towers, Jakob N. Foerster:
Arbitrary Order Meta-Learning with Simple Population-Based Evolution. CoRR abs/2303.09478 (2023) - [i14]Robert Tjarko Lange, Tom Schaul, Yutian Chen, Chris Lu, Tom Zahavy, Valentin Dalibard, Sebastian Flennerhag:
Discovering Attention-Based Genetic Algorithms via Meta-Black-Box Optimization. CoRR abs/2304.03995 (2023) - [i13]Andrew Jesson, Chris Lu, Gunshi Gupta, Angelos Filos, Jakob Nicolaus Foerster, Yarin Gal:
ReLU to the Rescue: Improve Your On-Policy Actor-Critic with Positive Advantages. CoRR abs/2306.01460 (2023) - [i12]Sascha Frey, Kang Li, Peer Nagy, Silvia Sapora, Chris Lu, Stefan Zohren, Jakob N. Foerster, Anisoara Calinescu:
JAX-LOB: A GPU-Accelerated limit order book simulator to unlock large scale reinforcement learning for trading. CoRR abs/2308.13289 (2023) - [i11]Matthew Thomas Jackson, Minqi Jiang, Jack Parker-Holder, Risto Vuorio, Chris Lu, Gregory Farquhar, Shimon Whiteson, Jakob Nicolaus Foerster:
Discovering General Reinforcement Learning Algorithms with Adversarial Environment Design. CoRR abs/2310.02782 (2023) - [i10]Alexander Rutherford, Benjamin Ellis, Matteo Gallici, Jonathan Cook, Andrei Lupu, Garðar Ingvarsson, Timon Willi, Akbir Khan, Christian Schröder de Witt, Alexandra Souly, Saptarashmi Bandyopadhyay, Mikayel Samvelyan, Minqi Jiang, Robert Tjarko Lange, Shimon Whiteson, Bruno Lacerda, Nick Hawes, Tim Rocktäschel, Chris Lu, Jakob Nicolaus Foerster:
JaxMARL: Multi-Agent RL Environments in JAX. CoRR abs/2311.10090 (2023) - [i9]Alexandra Souly, Timon Willi, Akbir Khan, Robert Kirk, Chris Lu, Edward Grefenstette, Tim Rocktäschel:
Leading the Pack: N-player Opponent Shaping. CoRR abs/2312.12564 (2023) - [i8]Akbir Khan, Timon Willi, Newton Kwan, Andrea Tacchetti, Chris Lu, Edward Grefenstette, Tim Rocktäschel, Jakob N. Foerster:
Scaling Opponent Shaping to High Dimensional Games. CoRR abs/2312.12568 (2023) - 2022
- [c5]Qizhen Zhang, Christopher Lu, Animesh Garg, Jakob N. Foerster:
Centralized Model and Exploration Policy for Multi-Agent RL. AAMAS 2022: 1500-1508 - [c4]Christopher Lu, Timon Willi, Christian A. Schröder de Witt, Jakob N. Foerster:
Model-Free Opponent Shaping. ICML 2022: 14398-14411 - [c3]Chris Lu, Jakub Grudzien Kuba, Alistair Letcher, Luke Metz, Christian Schröder de Witt, Jakob N. Foerster:
Discovered Policy Optimisation. NeurIPS 2022 - [c2]Stephen Zhao, Chris Lu, Roger B. Grosse, Jakob N. Foerster:
Proximal Learning With Opponent-Learning Awareness. NeurIPS 2022 - [i7]Christopher Lu, Timon Willi, Christian Schröder de Witt, Jakob N. Foerster:
Model-Free Opponent Shaping. CoRR abs/2205.01447 (2022) - [i6]Chris Lu, Jakub Grudzien Kuba, Alistair Letcher, Luke Metz, Christian Schröder de Witt, Jakob N. Foerster:
Discovered Policy Optimisation. CoRR abs/2210.05639 (2022) - [i5]Stephen Zhao, Chris Lu, Roger Baker Grosse, Jakob Nicolaus Foerster:
Proximal Learning With Opponent-Learning Awareness. CoRR abs/2210.10125 (2022) - [i4]Chris Lu, Timon Willi, Alistair Letcher, Jakob N. Foerster:
Adversarial Cheap Talk. CoRR abs/2211.11030 (2022) - [i3]Robert Tjarko Lange, Tom Schaul, Yutian Chen, Tom Zahavy, Valentin Dallibard, Chris Lu, Satinder Singh, Sebastian Flennerhag:
Discovering Evolution Strategies via Meta-Black-Box Optimization. CoRR abs/2211.11260 (2022) - 2021
- [i2]Qizhen Zhang, Christopher Lu, Animesh Garg, Jakob N. Foerster:
Centralized Model and Exploration Policy for Multi-Agent RL. CoRR abs/2107.06434 (2021)
2010 – 2019
- 2019
- [c1]Deepak Pathak, Christopher Lu, Trevor Darrell, Phillip Isola, Alexei A. Efros:
Learning to Control Self-Assembling Morphologies: A Study of Generalization via Modularity. NeurIPS 2019: 2292-2302 - [i1]Deepak Pathak, Christopher Lu, Trevor Darrell, Phillip Isola, Alexei A. Efros:
Learning to Control Self-Assembling Morphologies: A Study of Generalization via Modularity. CoRR abs/1902.05546 (2019)
Coauthor Index
aka: Jakob Nicolaus Foerster
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-03-16 22:52 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:
