Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Changdong Li

dblp:83/5492 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 4 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 56% Graph learning · 44%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
distributionally robust optimization
0.912025
Advancing Loss Functions in Recommender Systems: A Comparative Study with a Rényi Divergence-Based Solution · AAAI 2025
Recommender systems
loss function design
0.912025
Advancing Loss Functions in Recommender Systems: A Comparative Study with a Rényi Divergence-Based Solution · AAAI 2025
Machine learning › Graph learning
graph neural network
0.812024
Distributionally Robust Graph-based Recommendation System · WWW 2024
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift
0.812024
Distributionally Robust Graph-based Recommendation System · WWW 2024
Recommender systems
graph-based recommendation
0.812024
Distributionally Robust Graph-based Recommendation System · WWW 2024
Machine learning › Trustworthy machine learning › robustness
distributionally robust optimization
0.212024
Distributionally Robust Graph-based Recommendation System · WWW 2024

Methods — techniques the papers use, named apart from their topics

perturbation · 1.5graph neural network · 1.5distributionally robust optimization · 1.5softmax loss · 0.9rényi divergence · 0.9distributional robust optimization · 0.9cosine contrastive loss · 0.9
YearPublicationVenuePosition
2025 Advancing Loss Functions in Recommender Systems: A Comparative Study with a Rényi Divergence-Based Solution
abstract
Loss functions play a pivotal role in optimizing recommendation models. Among various loss functions, Softmax Loss (SL) and Cosine Contrastive Loss (CCL) are particularly effective. Their theoretical connections and differences warrant in-depth exploration. This work conducts comprehensive analyses of these losses, yielding significant insights: 1) Common strengths --- both can be viewed as augmentations of traditional losses with Distributional Robust Optimization (DRO), enhancing robustness to distributional shifts; 2) Respective limitations --- stemming from their use of different distribution distance metrics in DRO optimization, SL exhibits high sensitivity to false negative instances, whereas CCL suffers from low data utilization. To address these limitations, this work proposes a new loss function, DrRL, which generalizes SL and CCL by leveraging Rényi-divergence in DRO optimization. DrRL incorporates the advantageous structures of both SL and CCL, and can be demonstrated to effectively mitigate their limitations. Extensive experiments have been conducted to validate the superiority of DrRL on both recommendation accuracy and robustness.
Shengjia Zhang, Jiawei Chen 0007, Changdong Li, Sheng Zhou 0004, Qihao Shi, Chun Chen 0001, Can Wang 0001
AAAI3
2025 Corrections to "Accelerating Cross-Scene Co-Seismic Landslide Detection Through Progressive Transfer Learning and Lightweight Deep Learning Strategies"
abstract
Presents corrections to the paper, (Corrections to “Accelerating Cross-Scene Co-Seismic Landslide Detection Through Progressive Transfer Learning and Lightweight Deep Learning Strategies”).
Aonan Dong, Jie Dou, Changdong Li, Zeqiang Chen, Jian Ji 0001, Jie Zhang 0132, Hamza Daud
IEEE Trans. Geosci. Remote. Sens.3
2024 Distributionally Robust Graph-based Recommendation System
abstract
With the capacity to capture high-order collaborative signals, Graph Neural Networks (GNNs) have emerged as powerful methods in Recommender Systems (RS). However, their efficacy often hinges on the assumption that training and testing data share the same distribution (\aka IID assumption), and exhibits significant declines under distribution shifts. Distribution shifts commonly arises in RS, often attributed to the dynamic nature of user preferences or ubiquitous biases during data collection in RS. Despite its significance, researches on GNN-based recommendation against distribution shift are still sparse. To bridge this gap, we propose Distributionally Robust GNN (DR-GNN) that incorporates Distributional Robust Optimization (DRO) into the GNN-based recommendation. DR-GNN addresses two core challenges: 1) To enable DRO to cater to graph data intertwined with GNN, we reinterpret GNN as a graph smoothing regularizer, thereby facilitating the nuanced application of DRO; 2) Given the typically sparse nature of recommendation data, which might impede robust optimization, we introduce slight perturbations in the training distribution to expand its support. Notably, while DR-GNN involves complex optimization, it can be implemented easily and efficiently. Our extensive experiments validate the effectiveness of DR-GNN against three typical distribution shifts. The code is available at https://github.com/WANGBohaO-jpg/DR-GNN.
Bohao Wang 0001, Jiawei Chen 0007, Changdong Li, Sheng Zhou 0004, Qihao Shi, Yang Gao 0001, Chun Chen 0001, Can Wang 0001
WWW3
2024 Accelerating Cross-Scene Co-Seismic Landslide Detection Through Progressive Transfer Learning and Lightweight Deep Learning Strategies
abstract
Sudden co-seismic landslides strike, causing widespread devastation and demanding a rapid response. The swift and accurate acquisition of landslide information is essential for effective disaster relief. Deep learning (DL)-based computer-aided interpretation methods have emerged as cutting-edge tools for landslide detection. Nevertheless, traditional DL approaches face limitations, such as high annotation costs, slow processing speeds, and low generalizability, rendering them unsuitable for rapid co-seismic landslide recognition tasks. This study presents a progressive approach for co-seismic landslide detection. First, we develop a Multi-scale Feature Fusion Lightweight Neural Network (MFFLnet), achieving exceptional generalizability and speed while maintaining precision. Second, we employ the deep transfer learning (TL) strategy, enabling MFFLnet to leverage prior landslide knowledge from a source domain and a refined data augmentation algorithm to combat overfitting. The proposed methodology is implemented in two co-seismic landslide scenes in Hokkaido, Japan, and Luding, China. Experimental results demonstrate that the proposed method exhibits outstanding performance in regional landslide recognition and robust performance across different co-seismic landslide detection scenarios. Our approach proves competitive in efficient co-seismic landslide disaster recognition and cross-scene identification, showcasing significant applicability in the face of rapid response demands.
Aonan Dong, Jie Dou, Changdong Li, Zeqiang Chen, Jian Ji 0001, Jie Zhang 0132, Hamza Daud
IEEE Trans. Geosci. Remote. Sens.3
2024 MS-Former: Memory-Supported Transformer for Weakly Supervised Change Detection With Patch-Level Annotations
abstract
Fully supervised change detection methods have achieved significant advancements in performance, yet they depend severely on acquiring costly pixel-level labels. Considering that the patch-level annotations also contain abundant information corresponding to both changed and unchanged objects in bi-temporal images, an intuitive solution is to segment the changes with patch-level annotations. How to capture the semantic variations associated with the changed and unchanged regions from the patch-level annotations to obtain promising change results is the critical challenge for the weakly supervised change detection task. In this paper, we propose a memory-supported transformer (MS-Former), a novel framework consisting of a bi-directional attention block (BAB) and a patch-level supervision scheme (PSS) tailored for weakly supervised change detection with patch-level annotations. More specifically, the BAB captures contexts associated with the changed and unchanged regions from the temporal difference features to construct informative prototypes stored in the memory bank. On the other hand, the BAB extracts useful information from the prototypes as supplementary contexts to enhance the temporal difference features, thereby better distinguishing changed and unchanged regions. After that, the PSS guides the network learning valuable knowledge from the patch-level annotations, thus further elevating the performance. Experimental results on three benchmark datasets demonstrate the effectiveness of our proposed method in the change detection task. The demo code for our work will be publicly available at https://github.com/guanyuezhen/MS-Former.
Zhenglai Li, Chang Tang, Xinwang Liu 0002, Changdong Li, Xianju Li, Wei Zhang 0049
IEEE Trans. Geosci. Remote. Sens.4