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

Yitao Zheng

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

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

Artificial intelligence and machine learning · 4 · 4 since 2021Systems, architecture and hardware · 1Security and privacy · 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.

Artificial intelligence
2 papers
Reinforcement learning · 80% Robot manipulation · 12% Motion planning and robot control · 4%
Network and information security
1 paper
Security and privacy of machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › offline reinforcement learning
model-based offline reinforcement learning
0.912025
Video-Enhanced Offline Reinforcement Learning: A Model-Based Approach · ICML 2025
Machine learning › Reinforcement learning
offline reinforcement learning
0.912025
Video-Enhanced Offline Reinforcement Learning: A Model-Based Approach · ICML 2025
Machine learning › Reinforcement learning
transfer learning in reinforcement learning
0.912025
Video-Enhanced Offline Reinforcement Learning: A Model-Based Approach · ICML 2025
Machine learning › Reinforcement learning
long-horizon control
0.812024
Model-Based Reinforcement Learning With Isolated Imaginations · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Reinforcement learning
model-based reinforcement learning
0.812024
Model-Based Reinforcement Learning With Isolated Imaginations · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Robotics › Robot manipulation
visuomotor control
0.812024
Model-Based Reinforcement Learning With Isolated Imaginations · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Reinforcement learning › model-based reinforcement learning
world model
0.812024
Model-Based Reinforcement Learning With Isolated Imaginations · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Data mining › text mining › topic modeling
latent dirichlet allocation
0.512021
EvaLDA: Efficient Evasion Attacks Towards Latent Dirichlet Allocation · AAAI 2021
Data mining › text mining
topic model
0.512021
EvaLDA: Efficient Evasion Attacks Towards Latent Dirichlet Allocation · AAAI 2021
Security and privacy of machine learning
adversarial attack
0.512021
EvaLDA: Efficient Evasion Attacks Towards Latent Dirichlet Allocation · AAAI 2021
Security and privacy of machine learning › adversarial attack
evasion attack
0.512021
EvaLDA: Efficient Evasion Attacks Towards Latent Dirichlet Allocation · AAAI 2021
Robotics › Motion planning and robot control
robot learning
0.312025
Video-Enhanced Offline Reinforcement Learning: A Model-Based Approach · ICML 2025
Security and privacy of machine learning › adversarial attack
adversarial perturbation
0.112021
EvaLDA: Efficient Evasion Attacks Towards Latent Dirichlet Allocation · AAAI 2021

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

optimization · 1.0NP-hardness proof · 1.0world model · 0.9behavior guidance · 0.9policy optimization · 0.8inverse dynamics optimization · 0.8decoupled latent imagination · 0.8
YearPublicationVenuePosition
2025 Video-Enhanced Offline Reinforcement Learning: A Model-Based Approach
abstract
Offline reinforcement learning (RL) enables policy optimization using static datasets, avoiding the risks and costs of extensive real-world exploration. However, it struggles with suboptimal offline behaviors and inaccurate value estimation due to the lack of environmental interaction. We present Video-Enhanced Offline RL (VeoRL), a model-based method that constructs an interactive world model from diverse, unlabeled video data readily available online. Leveraging model-based behavior guidance, our approach transfers commonsense knowledge of control policy and physical dynamics from natural videos to the RL agent within the target domain. VeoRL achieves substantial performance gains (over 100% in some cases) across visual control tasks in robotic manipulation, autonomous driving, and open-world video games. Project page: https://panmt.github.io/VeoRL.github.io.
Minting Pan, Yitao Zheng, Jiajian Li, Yunbo Wang, Xiaokang Yang 0001
ICML2
2024 Model-Based Reinforcement Learning with Multi-task Offline Pretraining
Minting Pan, Yitao Zheng, Yunbo Wang, Xiaokang Yang 0001
ECML/PKDD (7)2
2024 Model-Based Reinforcement Learning With Isolated Imaginations
abstract
World models learn the consequences of actions in vision-based interactive systems. However, in practical scenarios like autonomous driving, noncontrollable dynamics that are independent or sparsely dependent on action signals often exist, making it challenging to learn effective world models. To address this issue, we propose Iso-Dream++, a model-based reinforcement learning approach that has two main contributions. First, we optimize the inverse dynamics to encourage the world model to isolate controllable state transitions from the mixed spatiotemporal variations of the environment. Second, we perform policy optimization based on the decoupled latent imaginations, where we roll out noncontrollable states into the future and adaptively associate them with the current controllable state. This enables long-horizon visuomotor control tasks to benefit from isolating mixed dynamics sources in the wild, such as self-driving cars that can anticipate the movement of other vehicles, thereby avoiding potential risks. On top of our previous work (Pan et al. 2022), we further consider the sparse dependencies between controllable and noncontrollable states, address the training collapse problem of state decoupling, and validate our approach in transfer learning setups. Our empirical study demonstrates that Iso-Dream++ outperforms existing reinforcement learning models significantly on CARLA and DeepMind Control.
Minting Pan, Xiangming Zhu 0002, Yitao Zheng, Yunbo Wang, Xiaokang Yang 0001
IEEE Trans. Pattern Anal. Mach. Intell.3
2022 Transferable adversarial examples can efficiently fool topic models
Zhen Wang 0013, Yitao Zheng
Comput. Secur.2
2021 EvaLDA: Efficient Evasion Attacks Towards Latent Dirichlet Allocation
abstract
As one of the most powerful topic models, Latent Dirichlet Allocation (LDA) has been used in a vast range of tasks, including document understanding, information retrieval and peer-reviewer assignment. Despite its tremendous popularity, the security of LDA has rarely been studied. This poses severe risks to security-critical tasks such as sentiment analysis and peer-reviewer assignment that are based on LDA. In this paper, we are interested in knowing whether LDA models are vulnerable to adversarial perturbations of benign document examples during inference time. We formalize the evasion attack to LDA models as an optimization problem and prove it to be NP-hard. We then propose a novel and efficient algorithm, EvaLDA to solve it. We show the effectiveness of EvaLDA via extensive empirical evaluations. For instance, in the NIPS dataset, EvaLDA can averagely promote the rank of a target topic from 10 to around 7 by only replacing 1% of the words with similar words in a victim document. Our work provides significant insights into the power and limitations of evasion attacks to LDA models.
Qi Zhou 0012, Haipeng Chen 0001, Yitao Zheng, Zhen Wang 0013
AAAI3
2020 Cyberbullying detection in social media text based on character-level convolutional neural network with shortcuts
abstract
Summary As people spend increasingly more time on social networks, cyberbullying has become a social problem that needs to be solved by machine learning methods. Our research focuses on textual cyberbullying detection because text is the most common form of social media. However, the content information in social media is short, noisy, and unstructured with incorrect spellings and symbols, and this impacts the performance of some traditional machine learning methods based on vocabulary knowledge. For this reason, we propose a Char‐CNNS (Character‐levelConvolutionalNeuralNetwork withShortcuts) model to identify whether the text in social media contains cyberbullying. We use characters as the smallest unit of learning, enabling the model to overcome spelling errors and intentional obfuscation in real‐world corpora. Shortcuts are utilized to stitch different levels of features to learn more granular bullying signals, and a focal loss function is adopted to overcome the class imbalance problem. We also provide a new ChineseWeibocomment dataset specifically for cyberbullying detection, and experiments are performed on both the Chinese Weibo dataset and the English Tweet dataset. The experimental results show that our approach is competitive with state‐of‐the‐art techniques on cyberbullying detection task.
Nijia Lu, Guohua Wu 0001, Yitao Zheng, Yizhi Ren, Kim-Kwang Raymond Choo
Concurr. Comput. Pract. Exp.4