Each day, papers presented in the oral sessions also appear in that day's poster session.
Université de Montréal · 3200 Jean-Brillant
Sutton’s “The Bitter Lesson” concludes that scaling data and compute is a potent solution to many problems in RL. Achieving scale, however, requires large investments – financial and otherwise. In practical settings, one must therefore ask: “Will scaling up actually bring performance improvements?” This talk argues that solving for experimental stability (being robust to initial conditions, environment design, and so on) is an effective way to prepare for scale. I will deep dive into a few of the many facets of stability in RL, from pretraining stable representations to better experimental reproducibility. I will give examples of how our experimental protocols can sometimes mask underlying instabilities, suggesting the need for continued research in how we conduct RL experiments. I hope to convince the audience that by creating experimental stability through the right methodology, scaling up RL becomes almost easy and not at all bitter.
Humans have evolved languages over tens of thousands of years to provide useful abstractions for understanding and interacting with each other and with the physical world. Language comes in many forms. In Computer Science and in the study of AI, we have historically used knowledge representation languages and programming languages to capture our understanding of the world and to communicate unambiguously with computers. In this talk, I’ll discuss how language—both formal and natural language—provides a signal-symbol nexus for building agents that learn, plan, and remember in the context of reinforcement learning. I’ll show how we can exploit the compositional syntax and semantics of formal language and automata to aid in the specification of complex reward-worthy behaviour, to improve the sample efficiency of learning, and to help agents learn what is necessary to remember. In doing so, I argue that (formal) language can help us address some of the challenges to reinforcement learning in the real world.
Women in Machine Learning (WiML) will host an informal networking lunch during RLC, giving attendees a chance to meet others in the community, make new connections, and take a social break together during the conference.
Pick up your lunch from RLC and bring it with you to the gathering.
The event is casual—simply bring your conference lunch and join us!
Conventional RL assumes a fixed agent design, constraining exploration and causing entropy-based methods to struggle in advanced domains. This talk introduces a direction for more effective exploration: expanding search by allowing automatic variation in agent design. In this richer space, paths to successful behavior may become simpler and easier to discover. The intuition resembles kernel methods: a problem requiring a complex solution in its original representation may admit a simple solution in an expanded space.
We illustrate this idea with physical agents that can modify their embodiment while retaining the original setting as the target. We investigate whether embodiment variation can accelerate the discovery of effective behaviors and support their transfer to the original constrained setting. If performance transfers only partially to the original setting, the result is still useful for identifying essential design changes. This positions co-design as a general exploration tool.
This research program extends beyond physical embodiment. We are beginning to apply the same perspective to RL algorithms, treating possible learning procedures as a search space. This is a harder problem: algorithmic choices are open-ended and compositional, and each candidate must be assessed through its learning dynamics. Addressing it requires new frontier tools for systematic, cumulative search.
Together, these directions present co-evolution and co-design as broader lenses on exploration. The goal is to open a discussion of how co-evolution can complement entropy-based exploration, how reshaping the space of possible agents can reveal otherwise hidden paths, and how these principles can extend to automating algorithm design.