← Search

Robert Tjarko Lange

15 accepted papers

2026

Darwin Gödel Machine: Open-Ended Evolution of Self-Improving Agents

ICLR 2026poster

Most of today's AI systems are constrained by human-designed, fixed architectures and cannot autonomously and continuously improve themselves. The scientific method, on the other hand, is a cumulative and open-ended system, where each innovation builds upon previous artifacts, enabling future discov…

Cited by 0SourcecodeScholar
2026

ShinkaEvolve: Towards Open-Ended and Sample-Efficient Program Evolution

ICLR 2026poster

We introduce ShinkaEvolve: a new framework leveraging large language models (LLMs) to advance scientific discovery with state-of-the-art performance and efficiency. The field of LLM-driven scientific discovery has seen significant progress, but has yet to overcome a critical limitation: sample ineff…

Cited by 0SourcecodeScholar
2025

NAVIX: Scaling MiniGrid Environments with JAX

NeurIPS 2025poster

As Deep Reinforcement Learning (Deep RL) research moves towards solving large-scale worlds, efficient environment simulations become crucial for rapid experimentation. However, most existing environments struggle to scale to high throughput, setting back meaningful progress. Interactions are typical…

Cited by 0SourcecodeScholar
2025

Text-to-LoRA: Instant Transformer Adaption

ICML 2025poster

While Foundation Models provide a general tool for rapid content creation, they regularly require task-specific adaptation. Traditionally, this exercise involves careful curation of datasets and repeated fine-tuning of the underlying model. Fine-tuning techniques enable practitioners to adapt found…

2024

Behaviour Distillation

ICLR 2024poster

Dataset distillation aims to condense large datasets into a small number of synthetic examples that can be used as drop-in replacements when training new models. It has applications to interpretability, neural architecture search, privacy, and continual learning. Despite strong successes in supervis…

2024

Discovering Preference Optimization Algorithms with and for Large Language Models

NeurIPS 2024poster

Offline preference optimization is a key method for enhancing and controlling the quality of Large Language Model (LLM) outputs. Typically, preference optimization is approached as an offline supervised learning task using manually crafted convex loss functions. While these methods are based on theo…

Cited by 16SourcePDFScholar
2024

Discovering Temporally-Aware Reinforcement Learning Algorithms

ICLR 2024poster

Recent advancements in meta-learning have enabled the automatic discovery of novel reinforcement learning algorithms parameterized by surrogate objective functions. To improve upon manually designed algorithms, the parameterization of this learned objective function must be expressive enough to repr…

2024

JaxMARL: Multi-Agent RL Environments and Algorithms in JAX

NeurIPS 2024poster

Benchmarks are crucial in the development of machine learning algorithms, significantly influencing reinforcement learning (RL) research through the available environments. Traditionally, RL environments run on the CPU, which limits their scalability with the computational resources typically availa…

2024

Position: Leverage Foundational Models for Black-Box Optimization

ICML 2024poster

Undeniably, Large Language Models (LLMs) have stirred an extraordinary wave of innovation in the machine learning research domain, resulting in substantial impact across diverse fields such as reinforcement learning, robotics, and computer vision. Their incorporation has been rapid and transformativ…

Cited by 7SourcePDFScholar
2023

Discovering Evolution Strategies via Meta-Black-Box Optimization

ICLR 2023poster

Optimizing functions without access to gradients is the remit of black-box meth- ods such as evolution strategies. While highly general, their learning dynamics are often times heuristic and inflexible — exactly the limitations that meta-learning can address. Hence, we propose to discover effective…

2023

Lottery Tickets in Evolutionary Optimization: On Sparse Backpropagation-Free Trainability

ICML 2023poster

Is the lottery ticket phenomenon an idiosyncrasy of gradient-based training or does it generalize to evolutionary optimization? In this paper we establish the existence of highly sparse trainable initializations for evolution strategies (ES) and characterize qualitative differences compared to gradi…

2023

NeuroEvoBench: Benchmarking Evolutionary Optimizers for Deep Learning Applications

NeurIPS 2023poster

Recently, the Deep Learning community has become interested in evolutionary optimization (EO) as a means to address hard optimization problems, e.g. meta-learning through long inner loop unrolls or optimizing non-differentiable operators. One core reason for this trend has been the recent innovation…

2022

On Lottery Tickets and Minimal Task Representations in Deep Reinforcement Learning

ICLR 2022spotlight

The lottery ticket hypothesis questions the role of overparameterization in supervised deep learning. But how is the performance of winning lottery tickets affected by the distributional shift inherent to reinforcement learning problems? In this work, we address this question by comparing sparse age…

Cited by 30SourcePDFScholar