activity
20212026
most citedAutoGEL: An Automated Graph Neural Network with Explicit Link Information

9 citations · 21 across the 19 of their papers we have counts for

collaborators

19 papers

cs.AI2026

Beyond Final Decisions: A Process-Centric Benchmark for Transparent AI-Assisted Peer Review

Siming Yuan, Xueyi Zhang, Wangze Ni +7

Peer review is central to quality control in science. However, existing evaluations of AI-assisted peer review mainly focus on the overall quality of generated reviews or the accur…

cs.AI2026

TravelEval: A Comprehensive Benchmarking Framework for Evaluating LLM-Powered Travel Planning Agents

Weiyi Chen, Shuaixiong Wang, Ziyun Gao +5

The development of Large Language Models (LLMs) has significantly improved travel planning applications, yet evaluating such models is limited by existing benchmarks' limitations:…

cs.AI2026★ 1 cited

When AI reviews science: Can we trust the referee?

Jialiang Wang, Yuchen Liu, Hang Xu +7

The volume of scientific submissions continues to climb, outpacing the capacity of qualified human referees and stretching editorial timelines. At the same time, modern large langu…

cs.LG2026

RxnNano:Training Compact LLMs for Chemical Reaction and Retrosynthesis Prediction via Hierarchical Curriculum Learning

Ran Li, Shimin Di, Haowei LI +4

Chemical reaction prediction is pivotal for accelerating drug discovery and synthesis planning. Despite advances in data-driven models, current approaches are hindered by an overem…

cs.LG2025

Understanding the Embedding Models on Hyper-relational Knowledge Graph

Yubo Wang, Shimin Di, Zhili Wang +4

Recently, Hyper-relational Knowledge Graphs (HKGs) have been proposed as an extension of traditional Knowledge Graphs (KGs) to better represent real-world facts with additional qua…

cs.LG2025

Beyond Model Base Retrieval: Weaving Knowledge to Master Fine-grained Neural Network Design

Jialiang Wang, Hanmo Liu, Shimin Di +4

Designing high-performance neural networks for new tasks requires balancing optimization quality with search efficiency. Current methods fail to achieve this balance: neural archit…

cs.CL2025

Beyond path selection: Better LLMs for Scientific Information Extraction with MimicSFT and Relevance and Rule-induced(R)GRPO

Ran Li, Shimin Di, Yuchen Liu +3

Previous study suggest that powerful Large Language Models (LLMs) trained with Reinforcement Learning with Verifiable Rewards (RLVR) only refines reasoning path without improving t…

cs.ET2025

Learning Towards Emergence: Paving the Way to Induce Emergence by Inhibiting Monosemantic Neurons on Pre-trained Models

Jiachuan Wang, Shimin Di, Tianhao Tang +4

Emergence, the phenomenon of a rapid performance increase once the model scale reaches a threshold, has achieved widespread attention recently. The literature has observed that mon…

cs.LG2025

A Selective Learning Method for Temporal Graph Continual Learning

Hanmo Liu, Shimin Di, Haoyang Li +3

Node classification is a key task in temporal graph learning (TGL). Real-life temporal graphs often introduce new node classes over time, but existing TGL methods assume a fixed se…

cs.AI2025

A Pilot Empirical Study on When and How to Use Knowledge Graphs as Retrieval Augmented Generation

Xujie Yuan, Yongxu Liu, Shimin Di +6

The integration of Knowledge Graphs (KGs) into the Retrieval Augmented Generation (RAG) framework has attracted significant interest, with early studies showing promise in mitigati…

cs.LG2024

Class-aware and Augmentation-free Contrastive Learning from Label Proportion

Jialiang Wang, Ning Zhang, Shimin Di +2

Learning from Label Proportion (LLP) is a weakly supervised learning scenario in which training data is organized into predefined bags of instances, disclosing only the class label…

cs.LG2024

Proficient Graph Neural Network Design by Accumulating Knowledge on Large Language Models

Jialiang Wang, Hanmo Liu, Shimin Di +4

High-level automation is increasingly critical in AI, driven by rapid advances in large language models (LLMs) and AI agents. However, LLMs, despite their general reasoning power,…

cs.LG2024★ 1 cited

Cardinality Estimation on Hyper-relational Knowledge Graphs

Fei Teng, Haoyang Li, Shimin Di +1

Cardinality Estimation (CE) for query is to estimate the number of results without execution, which is an effective index in query optimization. Recently, CE for queries over knowl…

q-bio.GN2023★ 2 cited

Single-Cell RNA-seq Synthesis with Latent Diffusion Model

Yixuan Wang, Shuangyin Li, Shimin DI +1

The single-cell RNA sequencing (scRNA-seq) technology enables researchers to study complex biological systems and diseases with high resolution. The central challenge is synthesizi…

cs.LG2023

Learning from Emergence: A Study on Proactively Inhibiting the Monosemantic Neurons of Artificial Neural Networks

Jiachuan Wang, Shimin Di, Lei Chen +1

Recently, emergence has received widespread attention from the research community along with the success of large-scale models. Different from the literature, we hypothesize a key…

cs.LG2023★ 1 cited

Search to Fine-tune Pre-trained Graph Neural Networks for Graph-level Tasks

Zhili Wang, Shimin Di, Lei Chen +1

Recently, graph neural networks (GNNs) have shown its unprecedented success in many graph-related tasks. However, GNNs face the label scarcity issue as other neural networks do. Th…

cs.LG2021★ 9 cited

AutoGEL: An Automated Graph Neural Network with Explicit Link Information

Zhili Wang, Shimin Di, Lei Chen

Recently, Graph Neural Networks (GNNs) have gained popularity in a variety of real-world scenarios. Despite the great success, the architecture design of GNNs heavily relies on man…

cs.LG2021★ 4 cited

Efficient Relation-aware Scoring Function Search for Knowledge Graph Embedding

Shimin Di, Quanming Yao, Yongqi Zhang +1

The scoring function, which measures the plausibility of triplets in knowledge graphs (KGs), is the key to ensure the excellent performance of KG embedding, and its design is also…

cs.LG2021★ 3 cited

Searching to Sparsify Tensor Decomposition for N-ary Relational Data

Shimin Di, Quanming Yao, Lei Chen

Tensor, an extension of the vector and matrix to the multi-dimensional case, is a natural way to describe the N-ary relational data. Recently, tensor decomposition methods have bee…