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

Ling Tang 0002

dblp:10/5446-2 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0002-1801-2603ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
3 papers
Deep learning architectures and training · 28% Trustworthy machine learning · 26% Representation and self-supervised learning · 22%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › model intellectual property protection
model ownership verification
0.912025
Towards the Resistance of Neural Network Fingerprinting to Fine-tuning · NeurIPS 2025
Security and privacy of machine learning › model intellectual property protection
model watermarking
0.912025
Towards the Resistance of Neural Network Fingerprinting to Fine-tuning · NeurIPS 2025
Security and privacy of machine learning › model intellectual property protection › model ownership verification › model fingerprinting
neural network fingerprinting
0.912025
Towards the Resistance of Neural Network Fingerprinting to Fine-tuning · NeurIPS 2025
Machine learning › Deep learning architectures and training › normalization
batch normalization
0.812024
Batch Normalization Is Blind to the First and Second Derivatives of the Loss · AAAI 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Batch Normalization Is Blind to the First and Second Derivatives of the Loss · AAAI 2024
Machine learning › Deep learning architectures and training
loss landscape
0.812024
Batch Normalization Is Blind to the First and Second Derivatives of the Loss · AAAI 2024
Machine learning › Trustworthy machine learning
frequency-domain analysis
0.712023
Defects of Convolutional Decoder Networks in Frequency Representation · ICML 2023
Machine learning › Representation and self-supervised learning › representation learning › spectral representation learning
frequency representation
0.712023
Defects of Convolutional Decoder Networks in Frequency Representation · ICML 2023
Robotics › Autonomous driving › perception
perception robustness
0.612022
Graph Neural Network Based Relation Learning for Abnormal Perception Information Detection in Self-Driving Scenarios · ICRA 2022
Computer vision › Segmentation and scene understanding
scene understanding
0.612022
Graph Neural Network Based Relation Learning for Abnormal Perception Information Detection in Self-Driving Scenarios · ICRA 2022
Machine learning › Representation and self-supervised learning › representation learning › spatio-temporal representation learning
spatio-temporal relation learning
0.612022
Graph Neural Network Based Relation Learning for Abnormal Perception Information Detection in Self-Driving Scenarios · ICRA 2022

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

gradient descent analysis · 0.9fourier transform · 0.9taylor series expansion · 0.8analytic proof · 0.8discrete fourier transform · 0.7circular convolution theorem · 0.7graph neural network · 0.6
YearPublicationVenuePosition
2025 Towards the Resistance of Neural Network Fingerprinting to Fine-tuning
abstract
This paper proves a new fingerprinting method to embed the ownership information into a deep neural network (DNN) with theoretically guaranteed robustness to fine-tuning. Specifically, we prove that when the input feature of a convolutional layer only contains low-frequency components, specific frequency components of the convolutional filter will not be changed by gradient descent during the fine-tuning process, where we propose a revised Fourier transform to extract frequency components from the convolutional filter. Additionally, we also prove that these frequency components are equivariant to weight scaling and weight permutations. In this way, we design a fingerprint module to embed the fingerprint information into specific frequency components of convolutional filters. Preliminary experiments demonstrate the effectiveness of our method.
Ling Tang 0002, Yuefeng Chen, Hui Xue 0001, Quanshi Zhang
NeurIPS1
2024 Batch Normalization Is Blind to the First and Second Derivatives of the Loss
abstract
We prove that when we do the Taylor series expansion of the loss function, the BN operation will block the influence of the first-order term and most influence of the second-order term of the loss. We also find that such a problem is caused by the standardization phase of the BN operation. We believe that proving the blocking of certain loss terms provides an analytic perspective for potential detects of a deep model with BN operations, although the blocking problem is not fully equivalent to significant damages in all tasks on benchmark datasets. Experiments show that the BN operation significantly affects feature representations in specific tasks.
Zhanpeng Zhou, Wen Shen 0002, Huixin Chen, Ling Tang 0002, Yuefeng Chen, Quanshi Zhang
AAAI4
2023 Defects of Convolutional Decoder Networks in Frequency Representation
abstract
In this paper, we prove the representation defects of a cascaded convolutional decoder network, considering the capacity of representing different frequency components of an input sample. We conduct the discrete Fourier transform on each channel of the feature map in an intermediate layer of the decoder network. Then, we extend the 2D circular convolution theorem to represent the forward and backward propagations through convolutional layers in the frequency domain. Based on this, we prove three defects in representing feature spectrums. First, we prove that the convolution operation, the zero-padding operation, and a set of other settings all make a convolutional decoder network more likely to weaken high-frequency components. Second, we prove that the upsampling operation generates a feature spectrum, in which strong signals repetitively appear at certain frequencies. Third, we prove that if the frequency components in the input sample and frequency components in the target output for regression have a small shift, then the decoder usually cannot be effectively learned.
Ling Tang 0002, Wen Shen 0002, Zhanpeng Zhou, Yuefeng Chen, Quanshi Zhang
ICML1
2022 Graph Neural Network Based Relation Learning for Abnormal Perception Information Detection in Self-Driving Scenarios
abstract
Robustness and safety concerns of perception systems are of great importance for autonomous vehicle navigation applications. Recent researches demonstrate that the surrounding dynamic object detection results of current perception systems can be easily interfered or attacked to mislead the navigation performance of the victim vehicle. In this paper, we develop a GNN based relation learning network to detect the abnormal information in the vehicle perception results, by investigating the relations among the surrounding dynamic objects and also the overall scenario information. Our underlying logic is that the motion of each surrounding object is also affected by its neighbors as well as the whole traffic scenario information, so there should exist a certain amount of consistency among those agents. Learning their spatiotemporal relations provides critical information for detecting the abnormal perception information. Experimental results on the standard CARLA simulator demonstrate our effectiveness in various scenarios and scalability to unseen cases.
Kefan Jin, Hongye Wang, Changxing Liu, Ling Tang 0002
ICRA5
2022 Visuomotor Reinforcement Learning for Multirobot Cooperative Navigation
abstract
This article investigates the multirobot cooperative navigation problem based on raw visual observations. A fully end-to-end learning framework is presented, which leverages graph neural networks to learn local motion coordination and utilizes deep reinforcement learning to generate visuomotor policy that enables each robot to move to its goal without the need of environment map and global positioning information. Experimental results show that, with a few tens of robots, our approach achieves comparable performance with the state-of-the-art imitation learning-based approaches with bird-view state inputs. We also illustrate our generalizability to crowded and large environments and our scalability to ten times number of the training robots. In addition, we demonstrate that our model trained for multirobot case can also improve the success rate in the single-robot navigation task in unseen environments. Note to Practitioners—With the development of intelligent industrial and logistic systems, robotic transportation systems are widely implemented. However, existing multirobot path coordination and navigation approaches are basically under some unreasonable assumptions, which are very hard to be implemented in practical scenarios. This article aims to greatly promote the real application of learning-based multirobot cooperative navigation approach, in order to achieve the following. First, we introduce an end-to-end reinforcement learning framework instead of the commonly used imitation learning strategy, as the latter one needs exhaustive training data to cover all the scenarios and does not have the required generalizability. Second, we directly use the raw sensor data instead of the commonly used bird-eye-view semantic observations, as the latter one is generally not representative of practical application scenario from the robot perspective and cannot solve the occlusion issue. Third, we interpret our learned model to illustrate which parts of the input and shared observations contribute most to the robots’ final actions. The above interpretability ensures predictability (thus safety) of our visuomotor policy in practical applications. Our learned visuomotor policy has the ability to coordinate dozens of robots by only using raw visual observations in unknown environments without map nor global localization information, this is the first time in the literature. Our future work includes solving the sim-to-real issue and conducting physical experiments.
Zhe Liu 0022, Qiming Liu 0001, Ling Tang 0002, Kefan Jin, Hongye Wang, Ming Liu 0001, Hesheng Wang 0001
IEEE Trans Autom. Sci. Eng.3