activity
20162024
most citedTemporal Feature Selection on Networked Time Series

2 citations · 4 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IR2024

Graph Stochastic Neural Process for Inductive Few-shot Knowledge Graph Completion

Zicheng Zhao, Linhao Luo, Shirui Pan +2

Knowledge graphs (KGs) store enormous facts as relationships between entities. Due to the long-tailed distribution of relations and the incompleteness of KGs, there is growing inte…

cs.LG2024

What Hides behind Unfairness? Exploring Dynamics Fairness in Reinforcement Learning

Zhihong Deng, Jing Jiang, Guodong Long +1

In sequential decision-making problems involving sensitive attributes like race and gender, reinforcement learning (RL) agents must carefully consider long-term fairness while maxi…

cs.LG2024

Transductive Reward Inference on Graph

Bohao Qu, Xiaofeng Cao, Qing Guo +3

In this study, we present a transductive inference approach on that reward information propagation graph, which enables the effective estimation of rewards for unlabelled data in o…

cs.CL20231 cited

Improving the Robustness of Summarization Systems with Dual Augmentation

Xiuying Chen, Guodong Long, Chongyang Tao +4

A robust summarization system should be able to capture the gist of the document, regardless of the specific word choices or noise in the input. In this work, we first explore the…

cs.LG20231 cited

Does Continual Learning Equally Forget All Parameters?

Haiyan Zhao, Tianyi Zhou, Guodong Long +2

Distribution shift (e.g., task or domain shift) in continual learning (CL) usually results in catastrophic forgetting of neural networks. Although it can be alleviated by repeatedl…

cs.LG2023

Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for Downstream Tasks

Haiyan Zhao, Tianyi Zhou, Guodong Long +2

As a few large-scale pre-trained models become the major choices of various applications, new challenges arise for model pruning, e.g., can we avoid pruning the same model from scr…