Xiang Li

ORCID: 0000-0003-0945-145X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Neural Networks
  • Topic Modeling
  • Natural Language Processing Techniques
  • Privacy-Preserving Technologies in Data
  • Advanced Clustering Algorithms Research
  • Domain Adaptation and Few-Shot Learning
  • Stochastic Gradient Optimization Techniques
  • Multimodal Machine Learning Applications
  • Recommender Systems and Techniques
  • Semantic Web and Ontologies
  • Data Mining Algorithms and Applications
  • Face and Expression Recognition
  • Text and Document Classification Technologies
  • Advanced Neural Network Applications
  • Advanced Bandit Algorithms Research
  • Video Surveillance and Tracking Methods
  • Adversarial Robustness in Machine Learning
  • Color perception and design
  • Data Management and Algorithms
  • Human Motion and Animation
  • Graph Theory and Algorithms
  • Machine Learning in Healthcare
  • Evaluation Methods in Various Fields
  • Speech and dialogue systems
  • Human Pose and Action Recognition

Tsinghua University
2024

East China Normal University
2020-2024

University of Hong Kong
2020

Carleton College
2020

Chinese University of Hong Kong
2020

Hong Kong University of Science and Technology
2020

Łukasiewicz Research Network - Institute of Aviation
2016

Zhengzhou University of Aeronautics
2016

Aviation Industry Corporation of China (China)
2016

Beijing Jiaotong University
2011

Generative graph self-supervised learning (SSL) aims to learn node representations by reconstructing the input data. However, most existing methods focus on unsupervised tasks only and very few work has shown its superiority over state-of-the-art contrastive (GCL) models, especially classification task. While a recent model been proposed bridge gap, performance is still unknown. In this paper, comprehensively enhance of generative SSL against other GCL models both supervised tasks, we...

10.1145/3543507.3583245 article EN Proceedings of the ACM Web Conference 2022 2023-04-26

Federated Learning (FL) has emerged as a de facto machine learning area and received rapid increasing research interests from the community. However, catastrophic forgetting caused by data heterogeneity partial participation poses distinctive challenges for FL, which are detrimental to performance. To tackle problems, we propose new FL approach (namely GradMA), takes inspiration continual simultaneously correct server-side worker-side update directions well take full advantage of server's...

10.1109/cvpr52729.2023.00361 article EN 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2023-06-01

Knowledge distillation on graph neural networks is a novel and practical model enhancement technique that has attracted widespread attention. However, literature methods mostly work in the manner of same teacher/student architecture. In fact, knowledge provided by identical teacher may be insufficient, leading to lack diversity consequently limiting capabilities student GNNs. this paper, we innovatively propose Distinct Multi-teacher Distillation method, namely DMKD, fully exploit...

10.2139/ssrn.5084903 preprint EN 2025-01-01

10.1016/j.ins.2011.09.032 article EN Information Sciences 2011-10-15

In federated learning (FL), malicious clients could manipulate the predictions of trained model through backdoor attacks, posing a significant threat to security FL systems. Existing research primarily focuses on attacks and defenses within generic scenario, where all collaborate train single global model. A recent study conducted by Qin et al. [ 24 ] marks initial exploration personalized (pFL) each client constructs based its local data. Notably, demonstrates that pFL methods with...

10.1145/3649316 article EN ACM Transactions on Knowledge Discovery from Data 2024-02-23

A heterogeneous information network (HIN) is one whose nodes model objects of different types and links objects' relationships. To enrich its information, in an HIN are typically associated with additional attributes. We call such <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Attributed HIN</i> or AHIN. study the problem clustering AHIN, taking into account similarities respect to both object attribute values their structural connectedness...

10.1109/tkde.2020.2997938 article EN IEEE Transactions on Knowledge and Data Engineering 2020-05-27

In recent years, self-supervised learning has emerged as a promising approach in addressing the issues of label dependency and poor generalization performance traditional GNNs. However, existing methods have limited effectiveness on heterophilic graphs, due to homophily assumption that results similar node representations for connected nodes. this work, we propose multi-view contrastive model namely, MUSE. Specifically, construct two views capture information ego its neighborhood by GNNs...

10.1145/3583780.3614985 article EN 2023-10-21

We propose knowledge internalization (KI), which aims to complement the lexical into neural dialog models. Instead of further conditioning knowledge-grounded (KGD) models on externally retrieved knowledge, we seek integrate about each input token internally model's parameters. To tackle challenge due large scale adopt contrastive learning approach and create an effective token-level retriever that requires only weak supervision mined from Wikipedia. demonstrate effectiveness general...

10.18653/v1/2022.acl-long.547 article EN cc-by Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) 2022-01-01

We study the problem of applying spectral clustering to cluster multi-scale data, which is data whose clusters are various sizes and densities. Traditional techniques discover by processing a similarity matrix that reflects proximity objects. For distance-based not effective because objects sparse could be far apart while those dense have sufficiently close. Following [16], we solve on integrating concept objects' "reachability similarity" with given derive an coefficient matrix. propose...

10.1145/3394486.3403086 article EN 2020-08-20

Monocular Semantic Occupancy Prediction aims to infer the complete 3D geometry and semantic information of scenes from only 2D images. It has garnered significant attention, particularly due its potential enhance perception autonomous vehicles. However, existing methods rely on a complex cascaded framework with relatively limited restore scenes, including dependency supervision solely whole network's output, single-frame input, utilization small backbone. These challenges, in turn, hinder...

10.48550/arxiv.2403.08766 preprint EN arXiv (Cornell University) 2024-03-13

Federated learning (FL) on heterogeneous data (non-IID data) has recently received great attention. Most existing methods focus studying the convergence guarantees for global objective. While these can guarantee decrease of objective in each communication round, they fail to ensure risk client. In this paper, we propose FedCOME, which introduces a consensus mechanism aiming decreased client after training round. particular, allow slight adjustment client's gradient server-side, producing an...

10.1109/icassp48485.2024.10446892 article EN ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2024-03-18

The task of vision-based 3D occupancy prediction aims to reconstruct geometry and estimate its semantic classes from 2D color images, where the 2D-to-3D view transformation is an indispensable step. Most previous methods conduct forward projection, such as BEVPooling VoxelPooling, both which map image features into grids. However, current grid representing within a certain height range usually introduces many confusing that belong other ranges. To address this challenge, we present Deep...

10.48550/arxiv.2409.07972 preprint EN arXiv (Cornell University) 2024-09-12

Text-to-video generation has evolved rapidly in recent years, delivering remarkable results. Training typically relies on video-caption paired data, which plays a crucial role enhancing performance. However, current video captions often suffer from insufficient details, hallucinations and imprecise motion depiction, affecting the fidelity consistency of generated videos. In this work, we propose novel instance-aware structured caption framework, termed InstanceCap, to achieve instance-level...

10.48550/arxiv.2412.09283 preprint EN arXiv (Cornell University) 2024-12-12

A heterogeneous information network (HIN) has as vertices objects of different types and edges the relations between objects, which are also various types. We study problem classifying in HINs. Most existing methods perform poorly when given scarce labeled training sets, that improve classification accuracy under such scenarios often computationally expensive. To address these problems, we propose ConCH, a graph neural model. ConCH formulates multi-task learning combines semi-supervised with...

10.48550/arxiv.2012.10024 preprint EN cc-by-nc-nd arXiv (Cornell University) 2020-01-01

The initial clustering center of traditional K-means algorithm is selected at random that different will get results, which have great randomicity and poor stability.To improve the optimized by adopting local outlier index, we adopt a positive approach calculating index all data samples.Then k dense points with furthest mutual distance were as center.At last, in this paper eliminate effects using improved algorithm.The experimental results showed enhanced could reduce susceptibility to...

10.2991/aiie-16.2016.17 article EN cc-by-nc 2016-01-01

Session-based recommendation (SBR) is a task that aims to predict items based on anonymous sequences of user behaviors in session. While there are methods leverage rich context information sessions for SBR, most them have the following limitations: 1) they fail distinguish item-item edge types when constructing global graph exploiting cross-session contexts; 2) learn fixed embedding vector each item, which lacks flexibility reflect variation interests across sessions; 3) generally use...

10.1109/ickg59574.2023.00010 article EN 2023-12-01

While generating better negative samples for contrastive learning has been widely studied in the areas of CV and NLP, very few work focused on graph-structured data. Recently, Mixup introduced to synthesize hard graph (GCL). However, due unsupervised nature GCL, without help soft labels, directly mixing representations could inadvertently lead information loss original further adversely affect quality newly generated harder negative. To address problem, this paper, we propose a novel method...

10.1109/icdmw60847.2023.00145 article EN 2022 IEEE International Conference on Data Mining Workshops (ICDMW) 2023-12-04
Coming Soon ...