paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
JG

Jingru Gan

COLM 2026×2KDD 2026×2检索与知识推理智能体与工具多模态效率与系统
新星分贡献者
74
一作贡献0
核心/参与49
方向广度13
合作网络12
0 一作 · 4 篇 · COLM 2026 / KDD 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

4
作者位次 #2/11COLM 2026Poster· Poster Session 6· Imperial Ballroom· #43

RetroAgent: Harnessing LLMs to Search Over Structured Memory for Agentic Retrosynthesis Planning

Yanqiao Zhu · Jingru Gan · Xiaoqi Sun · Fang Sun · Yidan Shi · Md Mofijul Islam · Chao Shang · Wenhao Gao · Connor W. Coley · Yizhou Sun · Wei Wang

A structured-memory harness lets an LLM agent learn to search over reaction graphs for retrosynthesis planning

摘要

Multi-step retrosynthesis planning seeks to decompose a target molecule into commercially available building blocks through a sequence of feasible reactions. The vast combinatorial search space makes this task challenging even for expert chemists. Traditional methods combine tree search with offline-trained value networks that score candidates in isolation, without reasoning about complete multi-step routes. Recent work leverages Large Language Models (LLMs) for this task, but relies on simple interfaces that limit exploration of the full search space. We introduce RetroAgent, an LLM agent that bridges symbolic search and neural reasoning through a harness with structured memory. Through memory and chemistry tools, the agent observes the full search state, including explored routes, available alternatives, and properties of intermediates, enabling informed decisions grounded in both global progress and domain knowledge. Experiments on in-distribution and out-of-distribution benchmarks demonstrate that RETROAGENT delivers strong performance and generalization.

检索与知识推理智能体与工具retrosynthesis planningtool-use agentsAND-OR graph searchmulti-step planningOpenReview
作者位次 #2/8COLM 2026Poster· Poster Session 4· Imperial Ballroom· #51

CrystalSTAR: Structured Action Orchestration with Trio-Reflection for Constrained Novel Crystal Discovery

Chenyi Tong · Jingru Gan · Yanqiao Zhu · Kaiqiao Han · Haixin Wang · Yizhou Sun · Wei Wang · Xiao Luo

Grounding LLM-based materials search in executable crystal operators and hierarchical reflection doubles hit rate over prior methods on tightly constrained discovery tasks.

摘要

This paper studies the problem of constrained novel crystal discovery, which aims to identify a set of physical feasible and property-aligned material candidates within a complicated search space. Existing approaches typically integrate large language models (LLMs) with domain knowledge of material properties and constraints for material discovery. However, these approaches usually adopt shallow memory mechanisms or unstructured toolsets, leading to suboptimal performance. Towards this end, we propose a novel approach named Structured Action Orchestration with Trio-Reflection (CrystalSTAR) for constrained novel crystal discovery. The core of our CrystalSTAR is to incorporate hierarchical memories into a structured action orchestration from modification scopes and dominant components, facilitating a smooth and efficient crystal discovery procedure. In particular, our CrystalSTAR first formulates the toolset as a structured action space along two orthogonal dimensions, resulting in four complementary tools for material exploration. More importantly, we adopt a trio-reflection mechanism to guide the trial process in a hierarchical manner. Here, our bottom-up memory records local anomalies, stuck trajectories, and cross-run knowledge, enabling effective strategy planning with grounding evidence. Extensive experiments across multiple benchmark datasets validate the effectiveness of our proposed CrystalSTAR in comparison to extensive state-of-the-art approaches. Our codebase is open-sourced at https://github.com/oldwizard7/CrystalSTAR

检索与知识推理智能体与工具materials discoverycrystal generationtool-augmented agentshierarchical memoryOpenReview

常见合作者