Furui Liu

Furui Liu

Auto-generated profile, based on publicly available information

Furui Liu

Zhejiang Lab, Hangzhou, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 September 2023 in Nature Machine Intelligence
Verified
Journal Article
Closed access
PDF file
OZOdin Zhang
Odin Zhang
JZJintu Zhang
Jintu Zhang
JJJieyu Jin
Jieyu Jin
XZXujun Zhang
Xujun Zhang
RHRenLing Hu
RenLing Hu
THTingjun Hou
Tingjun Hou

1 October 2023
Verified
Conference Paper
Open access
HCHao Chen
Hao Chen
JWJiaze Wang
Jiaze Wang
KSKun Shao
Kun Shao
FLFurui Liu
Furui Liu
HJHao JianYe
Hao JianYe
PHPheng-Ann Heng
Pheng-Ann Heng
Trajectory prediction has been a crucial task in building a reliable autonomous driving system by anticipating possible dangers. One key issue is to generate consistent trajectory predictions without colliding. To overcome the challenge, we propose an efficient masked autoencoder for trajectory prediction (Traj-MAE) that better represents the complicated behaviors of agents in the driving environment. Specifically, our Traj-MAE employs diverse masking strategies to pre-train the trajectory encoder and map encoder, allowing for the capture of social and temporal information among agents while leveraging the effect of environment from multiple granularities. To address the catastrophic forgetting problem that arises when pre-training the network with multiple masking strategies, we introduce a continual pre-training framework, which can help Traj-MAE learn valuable and diverse information from various strategies efficiently. Our experimental results in both multi-agent and single-agent settings demonstrate that Traj-MAE achieves competitive results with state-of-the-art methods and significantly outperforms our baseline model. Project page: https://jiazewang.com/projects/trajmae.html.

12 December 2022 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YWYunqi Wang
Yunqi Wang
FLFurui Liu
Furui Liu
ZCZhitang Chen
Zhitang Chen
YWYik-Chung Wu
Yik-Chung Wu
JHJianye Hao
Jianye Hao
PHPheng-Ann Heng
Pheng-Ann Heng
Domain generalization aims to learn knowledge invariant across different distributions while semantically meaningful for downstream tasks from multiple source domains, to improve the model’s generalization ability on unseen target domains. The fundamental objective is to understand the underlying ”invariance” behind these observational distributions and such invariance has been shown to have a close connection to causality. While many existing approaches make use of the property that causal features are invariant across domains, we consider the invariance of the average causal effect of the features to the labels. This invariance regularizes our training approach in which interventions are performed on features to enforce stability of the causal prediction by the classifier across domains. Our work thus sheds some light on the domain generalization problem by introducing invariance of the mechanisms into the learning process. Experiments on several benchmark datasets demonstrate the performance of the proposed method against SOTAs. The codes are available at: https://github.com/lithostark/Contrastive-ACE .

1 May 2016 in Neural Computation
Verified
Journal Article
Closed access
FLFurui Liu
Furui Liu
LCLaiwan Chan
Laiwan Chan
In this article, we deal with the problem of inferring causal directions when the data are on discrete domain. By considering the distribution of the cause [ ] and the conditional distribution mapping cause to effect [ ] as independent random variables, we propose to infer the causal direction by comparing the distance correlation between [ ] and [ ] with the distance correlation between [ ] and [ ]. We infer that X causes Y if the dependence coefficient between [ ] and [ ] is smaller. Experiments are performed to show the performance of the proposed method.

21 April 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
MYMengyue Yang
Mengyue Yang
GCGuohao Cai
Guohao Cai
FLFurui Liu
Furui Liu
JJJiarui Jin
Jiarui Jin
ZDZhenhua Dong
Zhenhua Dong
XCXu Chen
Xu Chen
Debiased recommendation has recently attracted increasing attention from both industry and academic communities. Traditional models mostly rely on the inverse propensity score (IPS), which can be hard to estimate and may suffer from the high variance issue. To alleviate these problems, in this article, we propose a novel debiased recommendation framework based on user feature balancing. The general idea is to introduce a projection function to adjust user feature distributions, such that the ideal unbiased learning objective can be upper bounded by a solvable objective purely based on the offline dataset. In the upper bound, the projected user distributions are expected to be equal given different items. From the causal inference perspective, this requirement aims to remove the causal relation from the user to the item, which enables us to achieve unbiased recommendation, bypassing the computation of IPS. To efficiently balance the user distributions upon each item pair, we propose three strategies, including clipping, sampling, and adversarial learning to improve the training process. For more robust optimization, we deploy an explicit model to capture the potential latent confounders in recommendation systems. To the best of our knowledge, this article is the first work on debiased recommendation based on confounder balancing. In the experiments, we compare our framework with many state-of-the-art methods based on synthetic, semi-synthetic, and real-world datasets. Extensive experiments demonstrate that our model is effective in promoting the recommendation performance.

18 July 2017 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
FLFurui Liu
Furui Liu
LCLai-Wan Chan
Lai-Wan Chan
In this paper, we deal with the problem of inferring causal relations for multidimensional data. Based on the postulate that the distribution of the cause and the conditional distribution of the effect given cause are generated independently, we show that the covariance matrix of the mean embedding of the cause in reproducing kernel Hilbert space (RKHS) is free independent with the covariance matrix of the conditional embedding of the effect given cause. This, called freeness condition, induces a cause-effect asymmetry that a designed measurement is $0$ in the causal direction but smaller than $0$ in the anticausal direction, and it uncovers the causal direction. One important novel aspect of this paper is that we interpret the independence as a freeness condition between covariance matrices of RKHS distribution embeddings, and it has a wide applicability. We show that our freeness condition-based inference method succeeds in scenarios like additive noise cases, where other methods fail, by theoretical analysis and experimental results.