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

Tao Long 0002

dblp:94/6980-2 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0002-1422-5529ORCID · verified

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Artificial intelligence
2 papers
Graph learning · 38% Efficient and distributed learning · 38% Representation and self-supervised learning · 24%
Computer networks
1 paper
Content delivery and video streaming · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
0.912025
Generalizing Personalized Federated Graph Augmentation via Min-max Adversarial Learning · KDD (1) 2025
Machine learning › Graph learning
graph augmentation
0.912025
Adversarial Contrastive Graph Augmentation with Counterfactual Regularization · AAAI 2025
Machine learning › Representation and self-supervised learning › contrastive learning
graph contrastive learning
0.912025
Adversarial Contrastive Graph Augmentation with Counterfactual Regularization · AAAI 2025
Machine learning › Graph learning
graph representation learning
0.912025
Generalizing Personalized Federated Graph Augmentation via Min-max Adversarial Learning · KDD (1) 2025
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
0.912025
Generalizing Personalized Federated Graph Augmentation via Min-max Adversarial Learning · KDD (1) 2025
Content delivery and video streaming
360-degree video streaming
0.912025
Optimizing Mobile-Friendly Viewport Prediction for Live 360-Degree Video Streaming · IEEE Trans. Mob. Comput. 2025
Content delivery and video streaming
adaptive video streaming
0.912025
Optimizing Mobile-Friendly Viewport Prediction for Live 360-Degree Video Streaming · IEEE Trans. Mob. Comput. 2025
Content delivery and video streaming
bitrate adaptation
0.912025
Optimizing Mobile-Friendly Viewport Prediction for Live 360-Degree Video Streaming · IEEE Trans. Mob. Comput. 2025
Content delivery and video streaming › 360-degree video streaming
viewport prediction
0.912025
Optimizing Mobile-Friendly Viewport Prediction for Live 360-Degree Video Streaming · IEEE Trans. Mob. Comput. 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.312025
Adversarial Contrastive Graph Augmentation with Counterfactual Regularization · AAAI 2025
Image and video processing
saliency detection
0.312025
Optimizing Mobile-Friendly Viewport Prediction for Live 360-Degree Video Streaming · IEEE Trans. Mob. Comput. 2025

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

saliency prediction model · 1.7model-agnostic meta-learning · 1.7LSTM · 1.7min-max adversarial learning · 0.9graph augmentation · 0.9generative model · 0.9counterfactual regularization · 0.9adversarial augmentation · 0.9
YearPublicationVenuePosition
2025 Adversarial Contrastive Graph Augmentation with Counterfactual Regularization
abstract
With the advancement of graph representation learning, self-supervised graph contrastive learning (GCL) has emerged as a key technique in the field. In GCL, positive and negative samples are generated through data augmentation. While recent works have introduced model-based methods to enhance positive graph augmentations, they often overlook the importance of negative samples, relying instead on rule-based methods that can fail to capture meaningful graph patterns. To address this issue, we propose a novel model-based adversarial contrastive graph augmentation (ACGA) method that automatically generates both positive graph samples with minimal sufficient information and hard negative graph samples. Additionally, we provide a theoretical framework to analyze the process of positive and negative graph augmentation in self-supervised GCL. We evaluate our ACGA method through extensive experiments on representative benchmark datasets, and the results demonstrate that ACGA outperforms state-of-the-art baselines.
Tao Long 0002, Lei Zhang 0066, Liang Zhang 0042, Laizhong Cui
AAAI1
2025 Generalizing Personalized Federated Graph Augmentation via Min-max Adversarial Learning
abstract
Federated learning (FL) enables the training of a global machine learning model among multiple local clients in a collaborative fashion without directly sharing the details of their data. Due to this advantage, it has been utilized in a wide range of applications where privacy is a critical concern and has attracted great attention for graph representation learning (GRL). Despite the offered advances, there still exist two major challenges in the FL for GRL across distributed graph data, including heterogeneity and complementarity. In order to tackle these challenges, a novel personalized federated graph augmentation (PFGA) framework is proposed in this work. Unlike existing techniques, it utilizes generative models as bridges to enable information sharing among clients, thereby facilitating the collaborative training of GRL models. Instead of directly using the generative model trained on each client individually, we aggregate them into the globally generative model to gain a global view of the entire graph, which effectively alleviates the heterogeneity and complementarity issues simultaneously. We formulate the training of the generative and GRL models as a min-max adversarial learning problem and theoretically prove the convergence. Furthermore, the effectiveness of the method is demonstrated using experimental results on six real-world datasets.
Liang Zhang 0042, Tao Long 0002, Yang Liu 0017, Lei Zhang 0066, Laizhong Cui, Qingjiang Shi
KDD (1)2
2025 Optimizing Mobile-Friendly Viewport Prediction for Live 360-Degree Video Streaming
abstract
Viewport prediction is the crucial task for adaptive 360-degree video streaming, as the bitrate control algorithms usually require the knowledge of the user's viewing portions of the frames. Various methods are studied and adopted for viewport prediction from less accurate statistic tools to highly calibrated deep neural networks. Conventionally, it is difficult to implement sophisticated deep learning methods on mobile devices, which have limited computation capability. In this work, we propose an advanced learning-based viewport prediction approach and carefully design it to minimize transmission and computation overhead for mobile terminals. To improve viewport prediction accuracy, we utilize both spatial information through a saliency prediction model and temporal information through a modified LSTM model. Different computations introduced by the neural network models are distributed across the network to keep the computation light on mobile devices. To better adapt to the content dynamics in live streaming, we employ the model-agnostic meta-learning (MAML) method for video saliency prediction. The learned saliency prediction model with optimized initialization via offline meta-training can be fast fine-tuned online using a few samples. We further discuss how to integrate this mobile-friendly viewport prediction (MFVP) approach into a typical 360-degree video live streaming system by formulating and solving the bitrate adaptation problem. Extensive experiment results demonstrate that our approach achieves real-time prediction for live video streaming and surpasses existing methods in prediction accuracy on mobile terminals, which, together with our bitrate adaptation algorithm, significantly improves the streaming QoE from various aspects. Compared to baseline methods, MFVP achieves a 4.7–28.7% improvement in accuracy and demonstrates faster adaptability to dynamic content changes, enabling rapid fine-tuning and adjustment. When integrated into a streaming system and paired with our adaptive bitrate allocation algorithm, MFVP enhances overall video quality by 5.6–12.9% and reduces quality fluctuations by 33.3–50.9%.
Lei Zhang 0066, Peng Chen 0041, Cong Zhang 0002, Tao Long 0002, Weizhen Xu, Laizhong Cui, Jiangchuan Liu
IEEE Trans. Mob. Comput.5