Loading video...

Video Failed to Load

Go Home

As AI agents face increasingly long and complex tasks, decomposing them into subtasks becomes increasingly appealing. But how do we discover such temporal structure? Hierarchical RL provides a natural formalism-yet many questions remain open. Here's our overview of the field🧵

36,008 views • 1 year ago •via X (Twitter)

11 Comments

Martin Klissarov's profile picture
Martin Klissarov1 year ago

Humans constantly leverage temporal structure: we actuate muscles each millisecond, yet our plans can span days, months and even years. Computers are built on this same principle. How will AI agents discover and use such structure? What is "good" structure in the first place?

Martin Klissarov's profile picture
Martin Klissarov1 year ago

In this 80+ pages manuscript, we cover the rich, diverse and many-decades old literature studying temporal structure discovery in AI. When and in what way should we expect these methods to benefit agents? What are the trade-offs involved?

Martin Klissarov's profile picture
Martin Klissarov1 year ago

We cover methods that learn: (1) directly from experience, (2) through offline datasets and (3) with foundation models (LLMs). We present each methods through the fundamental challenges of decision making, namely: (a) exploration (b) credit assignment and (c) transferability

Martin Klissarov's profile picture
Martin Klissarov1 year ago

We often get bogged down by differences in formalisms (goal-direction RL, options, feudal RL, skills …) -- we unite these core ideas through a single perspective. We believe hierarchical RL is fundamentally about the algorithm through which we discover temporal structure.

Martin Klissarov's profile picture
Martin Klissarov1 year ago

We hope this work provides a good introduction to the field. Finding temporal structure is challenging. As such, we carefully laid down some of the most pressing questions in the field. We also identified domains that are particularly promising, e.g. open-ended systems.

Martin Klissarov's profile picture
Martin Klissarov1 year ago

This work was done over the course of many friendly virtual calls with @akhil_bagaria and @RayZiyan41307, and under the thoughtful guidance of researchers that have spent decades working on these problems, namely George Konidaris, Doina Precup and @MarlosCMachado

Martin Klissarov's profile picture
Martin Klissarov1 year ago

We are looking to continue to improve this manuscript, please share your feedback!

Arsen Ibragimov's profile picture
Arsen Ibragimov1 year ago

Always been fascinated by how HRL tackles the problem of breaking complex tasks into manageable steps. The fields huge potential imo, but yeah, still feels like we’re just scratching the surface of what’s possible

Abhranil Chandra's profile picture
Abhranil Chandra1 year ago

Very interesting work @MartinKlissarov !!!

harsh satija's profile picture
harsh satija1 year ago

Great work!! Thanks for the much needed unified overview - looking forward to reading it.

Martin Klissarov's profile picture
Martin Klissarov1 year ago

Thanks for the kind words Harsh!

Related Videos

Can AI agents adapt zero-shot, to complex multi-step language instructions in open-ended environments? We present MaestroMotif, a method for AI-assisted skill design that produces highly capable and steerable hierarchical agents. To the best of our knowledge, it is the first method that, without expert labeled datasets, solves compositional tasks requiring hundreds of steps for completion. All the modules within MaestroMotif are learned from interaction: from the highest level of planning to the lowest-level of sensorimotor control. On the open-ended domain of NetHack, it surpasses existing approaches, including those that are fine-tuned specifically for each task. At the heart of MaestroMotif is the idea that decomposing a task into subtasks significantly helps decision making. MaestroMotif leverages an agent designer's intuition about a domain to identify important skills and describe them in natural language. These short descriptions then get converted into adaptable hierarchical agents through AI feedback and in-context learning. Our paper was recently published at ICLR 2025 and we open-source the whole project including the code, prompts and pre-trained models. Paper: Code: NotebookLM Podcast: This work was done with the amazing Mikael Henaff, Roberta Raileanu, Shagun Sodhani, Pascal Vincent, Amy Zhang, Pierre-Luc Bacon, Doina Precup, with equal supervision by Marlos C. Machado and Pierluca D'Oro. Take a look at the following thread:

Martin Klissarov

80,217 views • 1 year ago

part 4 Gsenti Sentient Sentient Chat Explaining ROMA – Recursive Open Meta-Agent 1. What is ROMA? ROMA is an open-source framework for building meta-agents — systems that can orchestrate multiple smaller agents and tools to solve complex tasks. Instead of letting one AI model handle an entire large problem (which often fails due to complexity), ROMA applies a recursive approach: Parent nodes break a big goal into subtasks. Child nodes handle those subtasks and return results. All results are then combined into a final solution. 2. How does ROMA work? The architecture has four main components: Atomizer – decides whether a task is simple or requires decomposition. Planner – splits the complex task into smaller subtasks. Executor – runs the right tools/agents to complete each subtask. Aggregator – collects and synthesizes all results into one coherent answer. Because each node follows the same recursive logic, ROMA naturally scales as tasks become more complex. 3. Example Use Case – Deep Research Question: “Who are the top 5 NBA players by PPG in a season that have won both an NCAA and an NBA championship?” How ROMA handles it: Atomizer → identifies it as complex → needs decomposition. Planner → breaks it down: (1) find top NBA PPG seasons, (2) check NCAA champions, (3) check NBA champions, (4) combine filters. Executor → runs each search/tool for data. Aggregator → merges the results into the final answer. This creates a transparent, step-by-step reasoning process, unlike “black box” answers. 4. What Problem Does ROMA Solve? In long-horizon tasks, errors accumulate. A model may be 99% accurate at one step. But over 10 steps, success rates collapse due to compounding errors. Current agents are often opaque — hard to see where and why they failed. ROMA solves this by: Breaking tasks into clear logic chains, Making every step traceable, verifiable, and fixable. 5. Why ROMA Matters Open-source → available for anyone to build upon. Community-driven → empowering developers to create advanced multi-agent systems. Scalable → recursive logic adapts naturally to any task complexity. This makes ROMA not just a framework, but a foundation for the next wave of decentralized, transparent AI systems. 6. Learn More 📖 Technical blog: 💻 GitHub repo:

thoai66.ip

16,298 views • 10 months ago

New Short Course: Building AI Browser Agents! Learn how to build AI agents that interact and take actions on websites in this course, created in partnership with and taught by and @namangarg0, Co-founders of AGI Inc. AI browser agents can log into websites, fill out forms, click through web pages, or even place orders online for you. They use both visual information, like screenshots, and structural data, like the HTML or Document Object Model (DOM) of a web page, to reason and take action. With the complexity of webpages and multiple possible actions at each step, it can be challenging for an AI browser agent to complete an assigned task. Because these agents run long action sequences, a single error—like clicking the wrong button or misreading a field—can lead to unexpected outcomes or errors that compound over time. In this course, you'll understand how autonomous web agents work, their current limitations, and how AgentQ enables them to improve through self-correction. In detail, you'll: - Learn what web agents are, how they automate tasks online, their architecture, key components, limitations, and an overview of their decision-making strategies. - Build a web agent that can scrape website and return course recommendations in a structured output format. - Build an autonomous web agent that can execute multiple tasks, such as finding and summarizing webpages, filling out a form, and signing up for a newsletter. - Explore AgentQ, a framework that enables agents to self-correct by combining Monte Carlo Tree Search (MCTS), a self-critique mechanism for continuous improvement, and Direct Preference Optimization (DPO). - Deep dive into MCTS, learn how it finds an effective path, illustrated by an example of Gridworld animation, and use AgentQ to complete web tasks. - Understand AI agents' current state and future directions—including key factors shaping their evolution, such as hardware, algorithm innovation, and data availability. By the end of this course, you will have hands-on experience building browser agents and a deeper understanding of how to make them more robust and reliable. Please sign up here:

Andrew Ng

186,031 views • 1 year ago