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

Tianyang Tao

dblp:200/8883 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0003-1122-5785ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 since 2021Security and privacy · 2 · 2 since 2021Artificial intelligence and machine learning · 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.

Network and information security
2 papers
Digital forensics and information hiding · 46% Cryptographic primitives and cryptanalysis · 46% Cryptographic protocols and secure computation · 7%
Artificial intelligence
1 paper
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
polynomial commitment
0.912025
DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs · USENIX Security Symposium 2025
Cryptographic primitives and cryptanalysis › coding theory › error-correcting codes
reed-solomon codes
0.912025
DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs · USENIX Security Symposium 2025
Digital forensics and information hiding › watermarking
robust watermarking
0.912025
Provably Robust Multi-bit Watermarking for AI-generated Text · USENIX Security Symposium 2025
Digital forensics and information hiding
watermarking
0.912025
Provably Robust Multi-bit Watermarking for AI-generated Text · USENIX Security Symposium 2025
Machine learning › Reinforcement learning
multi-task reinforcement learning
0.712023
PiCor: Multi-Task Deep Reinforcement Learning with Policy Correction · AAAI 2023
Machine learning › Reinforcement learning
sample efficiency
0.712023
PiCor: Multi-Task Deep Reinforcement Learning with Policy Correction · AAAI 2023
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.312025
DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs · USENIX Security Symposium 2025
Machine learning › Reinforcement learning
continuous control
0.212023
PiCor: Multi-Task Deep Reinforcement Learning with Policy Correction · AAAI 2023

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

policy correction · 0.7performance constraint · 0.7deep reinforcement learning · 0.7
YearPublicationVenuePosition
2025 Provably Robust Multi-bit Watermarking for AI-generated Text
Wenjie Qu 0001, Wengrui Zheng, Tianyang Tao, Yanze Jiang, Zhihua Tian, Jinyuan Jia 0001, Jiaheng Zhang
USENIX Security Symposium3
2025 DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs
Yanpei Guo, Xuanming Liu, Kexi Huang, Wenjie Qu 0001, Tianyang Tao, Jiaheng Zhang
USENIX Security Symposium5
2023 PiCor: Multi-Task Deep Reinforcement Learning with Policy Correction
abstract
Multi-task deep reinforcement learning (DRL) ambitiously aims to train a general agent that masters multiple tasks simultaneously. However, varying learning speeds of different tasks compounding with negative gradients interference makes policy learning inefficient. In this work, we propose PiCor, an efficient multi-task DRL framework that splits learning into policy optimization and policy correction phases. The policy optimization phase improves the policy by any DRL algothrim on the sampled single task without considering other tasks. The policy correction phase first constructs an adaptive adjusted performance constraint set. Then the intermediate policy learned by the first phase is constrained to the set, which controls the negative interference and balances the learning speeds across tasks. Empirically, we demonstrate that PiCor outperforms previous methods and significantly improves sample efficiency on simulated robotic manipulation and continuous control tasks. We additionally show that adaptive weight adjusting can further improve data efficiency and performance.
Fengshuo Bai, Hongming Zhang 0003, Tianyang Tao, Yanna Wang, Bo Xu 0002
AAAI3
2019 Robust Dynamic 3D Shape Measurement with Hybrid Fourier-Transform Phase-Shifting Profilometry
Jiaming Qian, Tianyang Tao, Shijie Feng, Qian Chen 0002, Chao Zuo 0001
ICIG (3)2
2019 Fast Stereo 3D Imaging Based on Random Speckle Projection and Its FPGA Implementation
Yuhao Shang, Shijie Feng, Tianyang Tao, Qian Chen 0002, Chao Zuo 0001
ICIG (3)4
2019 System Calibration for Panoramic 3D Measurement with Plane Mirrors
Shijie Feng, Tianyang Tao, Qian Chen 0002, Chao Zuo 0001
ICIG (2)4