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

Dongqi Fu

ICLR 2026×4COLM 2026×2推理智能体与工具效率与系统理论与学习动力学强化学习与后训练
新星分贡献者
77
一作贡献0
核心/参与55
方向广度13
合作网络12
0 一作 · 6 篇 · ICLR 2026 / COLM 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

6
作者位次 #7/18COLM 2026Poster· Poster Session 4· Grand Ballroom· #141

Reinforcement Routing for Mixtures of LoRAs in Parameter-Efficient LLM Finetuning

Ruizhong Qiu · Hanqing Zeng · Yinglong Xia · Yiwen Meng · Ren Chen · Jiarui Feng · Dongqi Fu · Qifan Wang · Jiayi Liu · Jun Xiao · Xiangjun Fan · Benyu Zhang · Hong Li · Zhining Liu · Hyunsik Yoo · Zhichen Zeng · Tianxin Wei · Hanghang Tong

We observe and tackle the routing weight collapse in mixtures of LoRAs for LLM finetuning via reinforcement routing.

摘要

Low-rank adapters (LoRAs) are a parameter-efficient finetuning technique that injects trainable low-rank matrices into pretrained models to adapt them to new tasks. Mixture-of-LoRAs models expand neural networks efficiently by routing each layer input to a small subset of specialized LoRAs of the layer. Existing Mixture-of-LoRAs routers assign a learned routing weight to each LoRA to enable end-to-end training of the router. Despite their empirical promise, we discover, both theoretically and empirically, that the routing weights often collapse to only one LoRA even when we activate $k>1$ LoRAs during finetuning. When one LoRA has a dominantly large weight, then the computation of the other $k-1$ LoRAs are essentially **wasted** because using $k>1$ would have similar accuracy to $k=1$. This essentially limits the number of effective LoRAs and thus severely hinders the realized expressive power of existing Mixture-of-LoRAs models. How can we address this critical weakness? In this work, we attribute this weakness to the nature of learnable routing weights and rethink the fundamental design of the router. To address this critical issue, we propose a simple yet effective router design that we call *Reinforcement Routing for Mixtures of LoRAs* (ReMix). Our key idea is using **non-learnable** routing weights to ensure all active LoRAs to be equally effective, with no single LoRA dominating the routing weights. However, such non-learnable routing weights make it infeasible to directly train routers via gradient descent. In response, we further propose an unbiased gradient estimator for the router and employ the reinforce leave-one-out (RLOO) technique to reduce the variance of the estimator. Our gradient estimator also enables to scale up training compute to boost the predictive performance of our ReMix. Extensive experiments demonstrate that our proposed ReMix significantly outperforms state-of-the-art parameter-efficient finetuning methods under a small number of activated parameters.

效率与系统理论与学习动力学强化学习与后训练mixture of LoRAsparameter-efficient finetuningOpenReview
作者位次 #3/8COLM 2026Poster· Poster Session 4· Imperial Ballroom· #52

MetaSymbO: Multi-Agent Language-Guided Metamaterial Discovery via Symbolic Latent Evolution

Jianpeng Chen · Wangzhi Zhan · Dongqi Fu · Junkai Zhang · Zian Jia · Ling Li · Wei Wang · Dawei Zhou

We present MetaSymbO, a multi-agent framework for metamaterial discovery that leverages symbolic-driven latent evolution to enable practical metamaterial discovery workflows.

摘要

Metamaterial discovery seeks microstructured materials whose geometry induces targeted mechanical behavior. Existing inverse-design methods can efficiently generate candidates, but they typically require explicit numerical property targets and are less suitable for early-stage exploration, where researchers often begin with incomplete constraints and qualitative intents expressed in natural language. Large language models can interpret such intents, but they lack geometric awareness and physical property validity. To address this gap, we propose **MetaSymbO**, a multi-agent framework for language-guided **Meta**material discovery via **Symb**olic-driven latent Ev**O**lution. Specifically, MetaSymbO contains three agents: a Designer that interprets free-form design intents and retrieves a semantically consistent *scaffold*, a Generator that synthesizes candidate microstructures in a disentangled latent space, and a Supervisor that provides fast property-aware feedback for iterative refinement. To move beyond the limitations of reproducing known samples from literature and training data, we further introduce symbolic-driven latent evolution, which applies programmable operators over disentangled latent factors to compose, modify, and refine structures at inference time. Extensive experiments demonstrate that (i) MetaSymbO improves structural validity by up to 34\% in symmetry and nearly 98\% in periodicity compared to state-of-the-art baselines; (ii) MetaSymbO achieves about 6–7\% higher language-guidance scores while maintaining superior structure novelty compared to advanced reasoning LLMs; (iii) qualitative analyses confirm the effectiveness of symbolic logic operators in enabling programmable semantic alignment; and (iv) real-world case studies on auxetic, high-stiffness metamaterial design further validate its practical capability. We publish our code on https://anonymous.4open.science/r/MetaSymbO-B48D.

检索与知识推理智能体与工具AI for ScienceMetamaterial DiscoverySymbolic LearningOpenReview 项目页

常见合作者