Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yaorui Shi

dblp:359/3135 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Language models and text generation · 43% Graph learning · 24% Generative modeling · 22%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › molecular generation
3d molecule generation
0.912025
NExT-Mol: 3D Diffusion Meets 1D Language Modeling for 3D Molecule Generation · ICLR 2025
Machine learning › Generative modeling
diffusion model
0.912025
NExT-Mol: 3D Diffusion Meets 1D Language Modeling for 3D Molecule Generation · ICLR 2025
Natural language and speech › Language models and text generation
instruction tuning
0.912025
SciLitLLM: How to Adapt LLMs for Scientific Literature Understanding · ICLR 2025
Natural language and speech › Language models and text generation › pre-trained language model › domain-specific language model
molecular language model
0.912025
NExT-Mol: 3D Diffusion Meets 1D Language Modeling for 3D Molecule Generation · ICLR 2025
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.912025
Search and Refine During Think: Facilitating Knowledge Refinement for Improved Retrieval-Augmented Reasoning · NeurIPS 2025
Natural language and speech › Question answering and dialogue systems
retrieval-augmented reasoning
0.912025
Search and Refine During Think: Facilitating Knowledge Refinement for Improved Retrieval-Augmented Reasoning · NeurIPS 2025
Information retrieval
retrieval models
0.912025
Search and Refine During Think: Facilitating Knowledge Refinement for Improved Retrieval-Augmented Reasoning · NeurIPS 2025
Machine learning › Graph learning
graph tokenization
0.712023
Rethinking Tokenizer and Decoder in Masked Graph Modeling for Molecules · NeurIPS 2023
Machine learning › Graph learning › graph self-supervised learning
masked graph modeling
0.712023
Rethinking Tokenizer and Decoder in Masked Graph Modeling for Molecules · NeurIPS 2023
Machine learning › Graph learning › molecular representation learning › molecular graph learning
molecular graph representation learning
0.712023
Rethinking Tokenizer and Decoder in Masked Graph Modeling for Molecules · NeurIPS 2023
Bioinformatics and computational biology
drug discovery
0.312025
NExT-Mol: 3D Diffusion Meets 1D Language Modeling for 3D Molecule Generation · ICLR 2025

Methods — techniques the papers use, named apart from their topics

transfer learning · 1.7reinforcement learning · 1.7language modeling · 1.7group relative policy optimization · 1.7diffusion · 1.7synthetic instruction generation · 0.9supervised fine-tuning · 0.9continual pre-training · 0.9self-supervised learning · 0.7graph neural network · 0.7
YearPublicationVenuePosition
2025 SciLitLLM: How to Adapt LLMs for Scientific Literature Understanding
abstract
Scientific literature understanding is crucial for extracting targeted information and garnering insights, thereby significantly advancing scientific discovery. Despite the remarkable success of Large Language Models (LLMs), they face challenges in scientific literature understanding, primarily due to (1) a lack of scientific knowledge and (2) unfamiliarity with specialized scientific tasks. To develop an LLM specialized in scientific literature understanding, we propose a hybrid strategy that integrates continual pre-training (CPT) and supervised fine-tuning (SFT), to simultaneously infuse scientific domain knowledge and enhance instruction-following capabilities for domain-specific tasks. In this process, we identify two key challenges: (1) constructing high-quality CPT corpora, and (2) generating diverse SFT instructions. We address these challenges through a meticulous pipeline, including PDF text extraction, parsing content error correction, quality filtering, and synthetic instruction creation. Applying this strategy, we present a suite of LLMs: SciLitLLM, specialized in scientific literature understanding. These models demonstrate promising performance on scientific literature understanding benchmarks. (1) We present an effective framework that integrates CPT and SFT to adapt LLMs to scientific literature understanding, which can also be easily adapted to other domains. (2) We propose an LLM-based synthesis method to generate diverse and high-quality scientific instructions, resulting in a new instruction set -- SciLitIns -- for less-represented scientific domains. (3) SciLitLLM achieves promising performance in scientific literature understanding benchmarks.
Sihang Li 0002, Jin Huang 0001, Jiaxi Zhuang, Yaorui Shi, Xiaochen Cai, Mingjun Xu, Xiang Wang 0010, Linfeng Zhang 0002, Guolin Ke, Hengxing Cai
ICLR4
2025 NExT-Mol: 3D Diffusion Meets 1D Language Modeling for 3D Molecule Generation
abstract
3D molecule generation is crucial for drug discovery and material design. While prior efforts focus on 3D diffusion models for their benefits in modeling continuous 3D conformers, they overlook the advantages of 1D SELFIES-based Language Models (LMs), which can generate 100\% valid molecules and leverage the billion-scale 1D molecule datasets. To combine these advantages for 3D molecule generation, we propose a foundation model -- NExT-Mol: 3D Diffusion Meets 1D Language Modeling for 3D Molecule Generation. NExT-Mol uses an extensively pretrained molecule LM for 1D molecule generation, and subsequently predicts the generated molecule's 3D conformers with a 3D diffusion model. We enhance NExT-Mol's performance by scaling up the LM's model size, refining the diffusion neural architecture, and applying 1D to 3D transfer learning. Notably, our 1D molecule LM significantly outperforms baselines in distributional similarity while ensuring validity, and our 3D diffusion model achieves leading performances in conformer prediction. Given these improvements in 1D and 3D modeling, NExT-Mol achieves a 26\% relative improvement in 3D FCD for de novo 3D generation on GEOM-DRUGS, and a 13\% average relative gain for conditional 3D generation on QM9-2014. Our codes and pretrained checkpoints are available at https://github.com/acharkq/NExT-Mol.
Zhiyuan Liu 0001, Yanchen Luo, Enzhi Zhang, Sihang Li 0002, Junfeng Fang, Yaorui Shi, Xiang Wang 0010, Kenji Kawaguchi, Tat-Seng Chua
ICLR7
2025 Search and Refine During Think: Facilitating Knowledge Refinement for Improved Retrieval-Augmented Reasoning
abstract
Large language models have demonstrated impressive reasoning capabilities but are inherently limited by their knowledge reservoir. Retrieval-augmented reasoning mitigates this limitation by allowing LLMs to query external resources, but existing methods often retrieve irrelevant or noisy information, hindering accurate reasoning. In this paper, we propose **AutoRefine**, a reinforcement learning post-training framework that adopts a new "search-and-refine-during-think" paradigm. AutoRefine introduces explicit knowledge refinement steps between successive search calls, enabling the model to iteratively filter, distill, and organize evidence before generating an answer. Furthermore, we incorporate tailored retrieval-specific rewards alongside answer correctness rewards using group relative policy optimization. Experiments on single-hop and multi-hop QA benchmarks demonstrate that AutoRefine significantly outperforms existing approaches, particularly in complex, multi-hop reasoning scenarios. Detailed analysis shows that AutoRefine issues frequent, higher-quality searches and synthesizes evidence effectively.
Yaorui Shi, Sihang Li 0002, Chang Wu 0003, Zhiyuan Liu 0001, Junfeng Fang, Hengxing Cai, An Zhang 0003, Xiang Wang 0010
NeurIPS1
2025 Dual Graph Attention Networks for Multi-View Visual Manipulation Relationship Detection and Robotic Grasping
abstract
Visual manipulation relationship detection facilitates robots to achieve safe, orderly, and efficient grasping tasks. However, most existing algorithms only model object-level or relational-level dependency individually, lacking sufficient global information, which is difficult to handle different types of reasoning errors, especially in complex environments with multi-object stacking and occlusion. To solve the above problems, we propose Dual Graph Attention Networks (Dual-GAT) for visual manipulation relationship detection, with an object-level graph network for capturing object-level dependencies and a relational-level graph network for capturing relational triplets-level interactions. The attention mechanism assigns different weights to different dependencies, obtains more accurate global context information for reasoning, and gets a manipulation relationship graph. In addition, we use multi-view feature fusion to improve the occluded object features, then enhance the relationship detection performance in multi-object scenes. Finally, our method is deployed on the robot to construct a multi-object grasping system, which can be well applied to stacking environments. Experimental results on the datasets VMRD and REGRAD show that our method significantly outperforms others. Note to Practitioners—The motivation of this research paper is to design efficient and accurate visual manipulation relationship reasoning methods to accomplish relevant grasping tasks in complex stacked scenes with multiple objects. The problem requires judging the positional relationship between objects in a stacked scene and determining the appropriate grasping order. In order to accurately grasp the target objects, this paper proposes a Dual Graph Attention Network for visual manipulation relationship detection, which utilizes object-level and relationship-level dependencies to obtain accurate global information for better performance. Meanwhile, multi-view feature fusion effectively improves the object occlusion problem. Our method can be combined with grasping detection to realize the robot grasping task in a real environment with multiple objects stacked in cluttered scenes. Practitioners can apply our method to real-time robot operating systems.
Mengyuan Ding, Yaorui Shi, Xuguang Lan, Nanning Zheng 0001
IEEE Trans Autom. Sci. Eng.3
2023 Rethinking Tokenizer and Decoder in Masked Graph Modeling for Molecules
abstract
Masked graph modeling excels in the self-supervised representation learning of molecular graphs. Scrutinizing previous studies, we can reveal a common scheme consisting of three key components: (1) graph tokenizer, which breaks a molecular graph into smaller fragments (\ie subgraphs) and converts them into tokens; (2) graph masking, which corrupts the graph with masks; (3) graph autoencoder, which first applies an encoder on the masked graph to generate the representations, and then employs a decoder on the representations to recover the tokens of the original graph. However, the previous MGM studies focus extensively on graph masking and encoder, while there is limited understanding of tokenizer and decoder. To bridge the gap, we first summarize popular molecule tokenizers at the granularity of node, edge, motif, and Graph Neural Networks (GNNs), and then examine their roles as the MGM's reconstruction targets. Further, we explore the potential of adopting an expressive decoder in MGM. Our results show that a subgraph-level tokenizer and a sufficiently expressive decoder with remask decoding have a \yuan{large impact on the encoder's representation learning}. Finally, we propose a novel MGM method SimSGT, featuring a Simple GNN-based Tokenizer (SGT) and an effective decoding strategy. We empirically validate that our method outperforms the existing molecule self-supervised learning methods. Our codes and checkpoints are available at https://github.com/syr-cn/SimSGT.
Zhiyuan Liu 0001, Yaorui Shi, An Zhang 0003, Enzhi Zhang, Kenji Kawaguchi, Xiang Wang 0010, Tat-Seng Chua
NeurIPS2