Researcher profile

Jianbo Lin

Jianbo Lin contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 15 - UnverifiedVerification L1Unclaimed author
3works
0followers
4topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

ICRL: Learning to Internalize Self-Critique with Reinforcement Learning

Large language model-based agents make mistakes, yet critique can often guide the same model toward correct behavior. However, when critique is removed, the model may fail again on the same query, indicating that it has not internalized the critique's guidance into its underlying capability. Meanwhile, a frozen critic cannot improve its feedback quality over time, limiting the potential for iterative self-improvement. To address this, we propose learning to internalize self-critique with reinforcement learning(ICRL), a novel framework that jointly trains a solver and a critic from a shared backbone to convert critique-induced success into unassisted solver ability. The critic is rewarded based on the solver's subsequent performance gain, incentivizing actionable feedback. To address the distribution shift between critique-conditioned and critique-free behavior, ICRL introduces a distribution-calibration re-weighting ratio that selectively transfers critique-guided improvements compatible with the solver's own prompt distribution. Additionally, a role-wise group advantage estimation stabilizes joint optimization across the two roles. Together, these mechanisms ensure that the solver learns to improve itself without external critique, rather than becoming dependent on critique-conditioned behavior. We evaluate ICRL on diverse benchmarks spanning agentic and mathematical reasoning tasks, using Qwen3-4B and Qwen3-8B as backbones. Results show consistent improvements, with average gains of 6.4 points over GRPO on agentic tasks, and 7.0 points on mathematical reasoning. Notably, the learned 8B critic is comparable to 32B critics while using substantially fewer tokens. The code is available at https://github.com/brick-pid/ICRL.

preprint2021arXiv

Unsupervised learning-based structural analysis: Search for a characteristic low-dimensional space by local structures in atomistic simulations

Owing to the advances in computational techniques and the increase in computational power, atomistic simulations of materials can simulate large systems with higher accuracy. Complex phenomena can be observed in such state-of-the-art atomistic simulations. However, it has become increasingly difficult to understand what is actually happening and mechanisms, for example, in molecular dynamics (MD) simulations. We propose an unsupervised machine learning method to analyze the local structure around a target atom. The proposed method, which uses the two-step locality preserving projections (TS-LPP), can find a low-dimensional space wherein the distributions of datapoints for each atom or groups of atoms can be properly captured. We demonstrate that the method is effective for analyzing the MD simulations of crystalline, liquid, and amorphous states and the melt-quench process from the perspective of local structures. The proposed method is demonstrated on a silicon single-component system, a silicon-germanium binary system, and a copper single-component system.

preprint2020arXiv

Large scale and linear scaling DFT with the CONQUEST code

We survey the underlying theory behind the large-scale and linear scaling DFT code, Conquest, which shows excellent parallel scaling and can be applied to thousands of atoms with exact solutions, and millions of atoms with linear scaling. We give details of the representation of the density matrix and the approach to finding the electronic ground state, and discuss the implementation of molecular dynamics with linear scaling. We give an overview of the performance of the code, focussing in particular on the parallel scaling, and provide examples of recent developments and applications.