Skip to content

Commit 1b5d13b

Browse files
authored
Add BnB code (#410)
1 parent 0050b2d commit 1b5d13b

2 files changed

Lines changed: 5 additions & 0 deletions

File tree

source/_data/SymbioticLab.bib

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2173,6 +2173,7 @@ @Article{branchandbrowse:arxiv25
21732173
url = {https://arxiv.org/abs/2510.19838},
21742174
publist_confkey = {arXiv:2510.19838},
21752175
publist_link = {paper || https://arxiv.org/abs/2510.19838},
2176+
publist_link = {code || https://github.com/SymbioticLab/Branch-and-Browse},
21762177
publist_topic = {Systems + AI},
21772178
publist_abstract = {
21782179
Autonomous web agents powered by large language models (LLMs) show strong potential for performing goal-oriented tasks such as information retrieval, report generation, and online transactions. These agents mark a key step toward practical embodied reasoning in open web environments. However, existing approaches remain limited in reasoning depth and efficiency: vanilla linear methods fail at multi-step reasoning and lack effective backtracking, while other search strategies are coarse-grained and computationally costly. We introduce Branch-and-Browse, a fine-grained web agent framework that unifies structured reasoning-acting, contextual memory, and efficient execution. It (i) employs explicit subtask management with tree-structured exploration for controllable multi-branch reasoning, (ii) bootstraps exploration through efficient web state replay with background reasoning, and (iii) leverages a page action memory to share explored actions within and across sessions. On the WebArena benchmark, Branch-and-Browse achieves a task success rate of 35.8% and reduces execution time by up to 40.4% relative to state-of-the-art methods. These results demonstrate that Branch-and-Browse is a reliable and efficient framework for LLM-based web agents.
@@ -2448,6 +2449,7 @@ @InProceedings{branchandbrowse:acl26
24482449
month = {July},
24492450
publist_confkey = {ACL'26},
24502451
publist_link = {paper || branchandbrowse-acl26.pdf},
2452+
publist_link = {code || https://github.com/SymbioticLab/Branch-and-Browse},
24512453
publist_topic = {Systems + AI},
24522454
publist_abstract = {
24532455
Autonomous web agents powered by large language models (LLMs) show strong potential for performing goal-oriented tasks such as information retrieval, report generation, and online transactions. These agents mark a key step toward practical embodied reasoning in open web environments. However, existing approaches remain limited in reasoning depth and efficiency: vanilla linear methods fail at multi-step reasoning and lack effective backtracking, while other search strategies are coarse-grained and computationally costly. We introduce Branch-and-Browse, a fine-grained web agent framework that unifies structured reasoning-acting, contextual memory, and efficient execution. It (i) employs explicit subtask management with tree-structured exploration for controllable multi-branch reasoning, (ii) bootstraps exploration through efficient web state replay with background reasoning, and (iii) leverages a page action memory to share explored actions within and across sessions. On the WebArena benchmark, Branch-and-Browse achieves a task success rate of 35.8% and reduces execution time by up to 40.4% relative to state-of-the-art methods. These results demonstrate that Branch-and-Browse is a reliable and efficient framework for LLM-based web agents.

source/open-source/index.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -63,6 +63,9 @@ sections:
6363

6464
- title: "Selected Software Artifacts"
6565
items:
66+
- name: "Branch-and-Browse"
67+
github_url: "https://github.com/SymbioticLab/Branch-and-Browse"
68+
description: "Efficient and controllable web exploration for LLM agents."
6669
- name: "Kareus"
6770
github_url: "https://github.com/ml-energy/kareus"
6871
description: "Train large models with less energy and time."

0 commit comments

Comments
 (0)