← Search

Chen Ling

11 accepted papers

2026

Deep Identification of Propagation Trees in Graph Diffusion

IJCAI 2026

Understanding how information or influence propagates through a network, such as during an epidemic outbreak or the spread of misinformation, is a fundamental yet challenging problem. While prior works have focused on cascade prediction (forecasting future infected nodes), network inference (recover

Cited by 0Scholar
2026

LFQA-E: Carefully Benchmarking Long-form QA Evaluation

ICLR 2026poster

Long-Form Question Answering (LFQA) involves generating comprehensive, paragraph-level responses to open-ended questions, which poses a significant challenge for evaluation due to the richness of information and flexible response format. Existing LFQA-evaluation benchmarks often lack reference answe…

Cited by 0SourceScholar
2025

GRAG: Graph Retrieval-Augmented Generation

NAACL 2025findings

Naive Retrieval-Augmented Generation (RAG) focuses on individual documents during retrieval and, as a result, falls short in handling networked documents which are very popular in many applications such as citation graphs, social media, and knowledge graphs. To overcome this limitation, we introduce…

2024

ELAD: Explanation-Guided Large Language Models Active Distillation

ACL 2024findings

The deployment and application of Large Language Models (LLMs) is hindered by their memory inefficiency, computational demands, and the high costs of API inferences. Traditional distillation methods, which transfer the capabilities of LLMs to smaller models, often fail to determine whether the knowl…

Cited by 6SourcePDFScholar
2024

MIM-Reasoner: Learning with Theoretical Guarantees for Multiplex Influence Maximization

AISTATS 2024poster

Multiplex influence maximization (MIM) asks us to identify a set of seed users such as to maximize the expected number of influenced users in a multiplex network. MIM has been one of central research topics, especially in nowadays social networking landscape where users participate in multiple onlin…

2024

SparseLLM: Towards Global Pruning of Pre-trained Language Models

NeurIPS 2024poster

The transformative impact of large language models (LLMs) like LLaMA and GPT on natural language processing is countered by their prohibitive computational demands. Pruning has emerged as a pivotal compression strategy, introducing sparsity to enhance both memory and computational efficiency. Yet, t…

2024

TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs

NeurIPS 2024poster

Text-Attributed Graphs (TAGs) augment graph structures with natural language descriptions, facilitating detailed depictions of data and their interconnections across various real-world settings. However, existing TAG datasets predominantly feature textual information only at the nodes, with edges ty…

2024

Uncertainty Quantification for In-Context Learning of Large Language Models

NAACL 2024long

In-context learning has emerged as a groundbreaking ability of Large Language Models (LLMs) and revolutionized various fields by providing a few task-relevant demonstrations in the prompt. However, trustworthy issues with LLM’s response, such as hallucination, have also been actively discussed. Exis…

2023

Deep Graph Representation Learning and Optimization for Influence Maximization

ICML 2023poster

Influence maximization (IM) is formulated as selecting a set of initial users from a social network to maximize the expected number of influenced users. Researchers have made great progresses to design various traditional methods, yet both theoretical design and performance gain are close to their l…

2023

Open-ended Commonsense Reasoning with Unrestricted Answer Candidates

EMNLP 2023long findings

Open-ended Commonsense Reasoning is defined as solving a commonsense question without providing 1) a short list of answer candidates and 2) a pre-defined answer scope. Conventional ways of formulating the commonsense question into a question-answering form or utilizing external knowledge to learn re…

Cited by 0SourceScholar
2023

Temporal Domain Generalization with Drift-Aware Dynamic Neural Networks

ICLR 2023top-5%

Temporal domain generalization is a promising yet extremely challenging area where the goal is to learn models under temporally changing data distributions and generalize to unseen data distributions following the trends of the change. The advancement of this area is challenged by: 1) characterizing…