File size: 2,993 Bytes
14bba32
 
 
 
841feac
 
14bba32
 
b24d06b
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
841feac
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
b24d06b
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
841feac
b24d06b
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
---
base_model:
- meta-llama/Llama-3.2-1B-Instruct
license: mit
pipeline_tag: text-generation
library_name: transformers
---

# Sequential-Light-Critic-Llama3.2-1B

[๐ŸŒ Project Page](https://recursivemas.github.io) | [๐Ÿ’ป Code](https://github.com/RecursiveMAS/RecursiveMAS) | [๐Ÿ“„ Paper](https://arxiv.org/abs/2604.25917)

We introduce RecursiveMAS, a multi-agent framework that scales agent collaboration through latent-space recursion.
RecursiveMAS treats a multi-agent system as a unified recursive computation, where heterogeneous agents iteratively exchange, refine, and evolve their latent states across recursion rounds. In the Sequential-Light setting, the Critic Agent is responsible for reviewing and refining the initial plan produced by the Planner Agent, which is then passed to the Solver Agent for final solution generation.

## Model Details

| Item | Description |
|---|---|
| Model | Sequential-Light-Critic-Llama3.2-1B |
| Collaboration Style | Sequential-Light |
| Agent Role | Critic Agent |
| Base Model | Llama3.2-1B |

โš ๏ธ **Note:** This checkpoint is a **role-specific agent** in [**RecursiveMAS**](https://arxiv.org/abs/2604.25917), rather than a standalone model intended for plain-text generation.  

## Sample Usage

You can load the entire MAS pipeline using the code provided in the [GitHub repository](https://github.com/RecursiveMAS/RecursiveMAS):

```python
from system_loader import load_mas_system

mas = load_mas_system(
    style="sequential_light",
    device="cuda",
    trust_remote_code=True,
)

planner = mas.agents["planner"].model
critic = mas.agents["critic"].model
solver = mas.agents["solver"].model
```

For detailed usage instructions, please refer to the [GitHub repository](https://github.com/RecursiveMAS/RecursiveMAS).

## Model Collections for RecursiveMAS

| Style | Model Collection |
|---|---|
| Sequential-Style | [๐Ÿค— HuggingFace](https://huggingface.co/collections/RecursiveMAS/sequential-style-recursivemas) |
| Mixture-Style | [๐Ÿค— HuggingFace](https://huggingface.co/collections/RecursiveMAS/mixture-style-recursivemas) |
| Distillation-Style | [๐Ÿค— HuggingFace](https://huggingface.co/collections/RecursiveMAS/distillation-style-recursivemas) |
| Deliberation-Style | [๐Ÿค— HuggingFace](https://huggingface.co/collections/RecursiveMAS/deliberation-style-recursivemas) |

## Experiment Results

<p align="center">
  <img src="https://raw.githubusercontent.com/RecursiveMAS/RecursiveMAS/main/assets/hero_fig.png" width="95%" alt="RecursiveMAS Experiment Results">
</p>

## Citation

```bibtex
@misc{recursivemas,
      title={Recursive Multi-Agent Systems}, 
      author={Xiyuan Yang and Jiaru Zou and Rui Pan and Ruizhong Qiu and Pan Lu front and Shizhe Diao and Jindong Jiang and Hanghang Tong and Tong Zhang and Markus J. Buehler and Jingrui He and James Zou},
      year={2026},
      eprint={2604.25917},
      archivePrefix={arXiv},
      primaryClass={cs.AI},
      url={https://arxiv.org/abs/2604.25917}, 
}
```