Skip to content

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#natural language process... Preprint Sep 2026

Expert-Space Exploration in MoE Reinforcement Learning

Reinforcement learning (RL) has become central to post-training of large language models. Recent advances in RL for Mixture-of-Experts (MoE) models have primarily focused on improving optimization stability and training efficiency, while treating the expert selection as a fixed component. Since routing determines the sparse computation paths that induce output distributions, expert selection offers an additional source of rollout diversity. Through empirical analysis, we find that perturbing expert routing effectively alters model output and increases rollout diversity, which is similar to increasing the decoding temperature. However, direct perturbation can activate unsuitable experts and substantially degrade rollout quality. Motivated by these observations, we introduce Expert-Space Exploration Reinforcement Learning (ESRL), an architecture-aware framework that explicitly explores the expert-routing space of MoE models. ESRL preserves high-confidence experts as anchors, and restricts stochastic routing to a plausible candidate pool, thereby retaining reliable computation paths. The perturbation strength is further adapted according to router entropy to avoid over-perturbation. To mitigate the routing mismatch introduced by perturbation, ESRL records the expert paths used during rollout and replays them during policy optimization. Experiments demonstrate that ESRL achieves the best performance across MoE backbones with top-K, top-1, and shared-expert routing, as well as across mathematics, science, and code tasks without additional sampling or computational cost. Specifically, ESRL on Qwen3-30B-A3B achieves the best among all compared methods, improving average Pass@1 and Pass@8 over GRPO by 3.2 and 4.5 percentage points, respectively. Further analyses of expert utilization and training dynamics provide insights into how exploiting MoE-specific routing structure benefits RL training.

Hong-Yi He, Zheng-Wen Lin, Xiao Liu et al. · 0 citations
Open access Jul 2026

Lightweight Adapted Retrieval-Augmented Inference Network for Legal Issues

Legal text generation and legal question-and-answer tasks impose stringent requirements on factual accuracy, evidence traceability and normative consistency. Conventional dynamic retrieval-augmented generation methods are difficult to directly adapt to legal task demands such as legal provision citation, terminology standardization and case evidence organization. Following the DRAGIN paradigm, this paper proposes LARIN (Lightweight Adapted Retrieval-Augmented Inference Network for Legal Issues), an adaptive retrieval-augmented reasoning framework tailored for legal scenarios. While maintaining the mainstream dynamic retrieval workflow, LARIN makes targeted optimizations in three key modules: retrieval triggering, query construction and evidence fusion. Specifically, LINDA identifies retrieval trigger points by comprehensively considering uncertainty, attention influence and semantic importance; JUDGE rewrites queries for legal terms and statutory expressions; MERF conducts relevance ranking, redundancy elimination and evidence fusion for legal provisions and case materials. In the CAIL2018 Chinese legal judgment prediction task, LARIN achieves a charge prediction exact-match accuracy of 0.3316, a micro-F1 score of 0.3837, and a precision of 0.3951, while the sentencing exact-match accuracy reaches 0.1575. Meanwhile, its average retrieval frequency is 1.81 and average token consumption stands at 373.15. Experimental results on CAIL2018 demonstrate that legal-oriented adaptation based on DRAGIN improves retrieval-augmented reasoning in this Chinese legal judgment prediction setting while maintaining low retrieval overhead. Cross-dataset robustness on additional legal QA or judgment benchmarks remains to be further validated.

Hongting Qian, Jiaxin Lin, Jing Tang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.