Jiawei Li

Dr. Jiawei Li

Tsinghua University, Beijing, China
orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
24 October 2020 in Entropy
Verified
Journal Article
Open access
PDF file
JLJiawei Li
Jiawei Li
YLYiming Li
Yiming Li
XXXingchun Xiang
Xingchun Xiang
Shu-Tao XiaShu-Tao Xia
Shu-Tao Xia
SDSiyi Dong
Siyi Dong
YCYun Cai
Yun Cai
Deep Neural Networks (DNNs) usually work in an end-to-end manner. This makes the trained DNNs easy to use, but they remain an ambiguous decision process for every test case. Unfortunately, the interpretability of decisions is crucial in some scenarios, such as medical or financial data mining and decision-making. In this paper, we propose a Tree-Network-Tree (TNT) learning framework for explainable decision-making, where the knowledge is alternately transferred between the tree model and DNNs. Specifically, the proposed TNT learning framework exerts the advantages of different models at different stages: (1) a novel James–Stein Decision Tree (JSDT) is proposed to generate better knowledge representations for DNNs, especially when the input data are in low-frequency or low-quality; (2) the DNNs output high-performing prediction result from the knowledge embedding inputs and behave as a teacher model for the following tree model; and (3) a novel distillable Gradient Boosted Decision Tree (dGBDT) is proposed to learn interpretable trees from the soft labels and make a comparable prediction as DNNs do. Extensive experiments on various machine learning tasks demonstrated the effectiveness of the proposed method.

26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
YHYujun Huang
Yujun Huang
BCBin Chen
Bin Chen
SQShiyu Qin
Shiyu Qin
JLJiawei Li
Jiawei Li
YWYaowei Wang
Yaowei Wang
Shu-Tao XiaShu-Tao Xia
Shu-Tao Xia
Beyond achieving higher compression efficiency over classical image compression codecs, deep image compression is expected to be improved with additional side information, e.g., another image from a different perspective of the same scene. To better utilize the side information under the distributed compression scenario, the existing method only implements patch matching at the image domain to solve the parallax problem caused by the difference in viewing points. However, the patch matching at the image domain is not robust to the variance of scale, shape, and illumination caused by the different viewing angles, and can not make full use of the rich texture information of the side information image. To resolve this issue, we propose Multi-Scale Feature Domain Patch Matching (MSFDPM) to fully utilizes side information at the decoder of the distributed image compression model. Specifically, MSFDPM consists of a side information feature extractor, a multi-scale feature domain patch matching module, and a multi-scale feature fusion network. Furthermore, we reuse inter-patch correlation from the shallow layer to accelerate the patch matching of the deep layer. Finally, we find that our patch matching in a multi-scale feature domain further improves compression rate by about 20% compared with the patch matching method at image domain.

28 October 2024
Verified
Conference Paper
Open access
BJBolin Jiang
Bolin Jiang
YXYuqiu Xie
Yuqiu Xie
JLJiawei Li
Jiawei Li
NLNaiqi Li
Naiqi Li
BCBin Chen
Bin Chen
Shu-Tao XiaShu-Tao Xia
Shu-Tao Xia
Pose-agnostic anomaly detection refers to the situation where the pose of test samples is inconsistent with the training dataset, allowing anomalies to appear at any position in any pose. We propose a novel method IGSPAD to address this challenge. Specifically, we employ 3D Gaussian splatting to represent the normal information from the training dataset. To accurately determine the pose of the test sample, we introduce an approach termed Inverting 3D Gaussian Splatting (IGS) to address the challenge of 6D pose estimation for anomalous images. The pose derived from IGS is utilized to render a normal image well-aligned with the test sample. Subsequently, the image encoder of the Segment Anything Model is employed to identify discrepancies between the rendered image and the test sample, predicting the location of anomalies. Experimental results on the MAD dataset demonstrate that the proposed method significantly surpasses the existing state-of-the-art method in terms of precision (from 97.8% to 99.7% at pixel level and from 90.9% to 98.0% at image level) and efficiency.

21 October 2020 in arXiv
Verified
Preprint
Open access
PDF file
XXXingchun Xiang
Xingchun Xiang
QTQingtao Tang
Qingtao Tang
HZHuaixuan Zhang
Huaixuan Zhang
TDTao Dai
Tao Dai
JLJiawei Li
Jiawei Li
SXShu-Tao Xia
Shu-Tao Xia
Regression tree (RT) has been widely used in machine learning and data mining community. Given a target data for prediction, a regression tree is first constructed based on a training dataset before making prediction for each leaf node. In practice, the performance of RT relies heavily on the local mean of samples from an individual node during the tree construction/prediction stage, while neglecting the global information from different nodes, which also plays an important role. To address this issue, we propose a novel regression tree, named James-Stein Regression Tree (JSRT) by considering global information from different nodes. Specifically, we incorporate the global mean information based on James-Stein estimator from different nodes during the construction/predicton stage. Besides, we analyze the generalization error of our method under the mean square error (MSE) metric. Extensive experiments on public benchmark datasets verify the effectiveness and efficiency of our method, and demonstrate the superiority of our method over other RT prediction methods.

9 December 2019
Verified
Book Chapter
Closed access
PDF file
TGTaian Guo
Taian Guo
TDTao Dai
Tao Dai
JLJiawei Li
Jiawei Li
Shu-Tao XiaShu-Tao Xia
Shu-Tao Xia