Yu Zhang
Research Subjects
Yu Zhang has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Jiaming Sun
DV.ai, Hangzhou, China
3 shared publications - Xiaowei Zhou
State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China
3 shared publications - Ke Tang
Southern University of Science and Technology
2 shared publications - Yinji ShenTu
State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China
2 shared publications - Yudong Jin
State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China
2 shared publications - Aleš Leonardis
University of Birmingham
1 shared publication
Latest Publications
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
RealMe: Immersive Volumetric Video from Minimal Captures
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessRealMe: Immersive Volumetric Video from Minimal Captures
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Track4D-Calib: Track-Driven Geometric Closure for 4D Camera-Array Calibration
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessTrack4D-Calib: Track-Driven Geometric Closure for 4D Camera-Array Calibration
- Open Access
- 10 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-2
InfiniteStudio: 4D Volumetric Capture for Film Making and Beyond
- 10 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessInfiniteStudio: 4D Volumetric Capture for Film Making and Beyond
- 19 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 18 (3) , 14-28
How Good is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem
Traditional solvers for tackling combinatorial optimization (CO) problems are usually designed by human experts. Recently, there has been a surge of interest in utilizing deep learning, especially deep reinforcement learning, to automatically learn effective solvers for CO. The resultant new paradigm is termed neural combinatorial optimization (NCO). However, the advantages and disadvantages of NCO relative to other approaches have not been empirically or theoretically well studied. This work presents a comprehensive comparative study of NCO solvers and alternative solvers. Specifically, taking the traveling salesman problem as the testbed problem, the performance of the solvers is assessed in five aspects, i.e., effectiveness, efficiency, stability, scalability, and generalization ability. Our results show that the solvers learned by NCO approaches, in general, still fall short of traditional solvers in nearly all these aspects. A potential benefit of NCO solvers would be their superior time and energy efficiency for small-size problem instances when sufficient training instances are available. Hopefully, this work would help with a better understanding of the strengths and weaknesses of NCO and provide a comprehensive evaluation protocol for further benchmarking NCO approaches in comparison to other approaches.
- 19 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 18 (3) , 14-28
How Good is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem
Traditional solvers for tackling combinatorial optimization (CO) problems are usually designed by human experts. Recently, there has been a surge of interest in utilizing deep learning, especially deep reinforcement learning, to automatically learn effective solvers for CO. The resultant new paradigm is termed neural combinatorial optimization (NCO). However, the advantages and disadvantages of NCO relative to other approaches have not been empirically or theoretically well studied. This work presents a comprehensive comparative study of NCO solvers and alternative solvers. Specifically, taking the traveling salesman problem as the testbed problem, the performance of the solvers is assessed in five aspects, i.e., effectiveness, efficiency, stability, scalability, and generalization ability. Our results show that the solvers learned by NCO approaches, in general, still fall short of traditional solvers in nearly all these aspects. A potential benefit of NCO solvers would be their superior time and energy efficiency for small-size problem instances when sufficient training instances are available. Hopefully, this work would help with a better understanding of the strengths and weaknesses of NCO and provide a comprehensive evaluation protocol for further benchmarking NCO approaches in comparison to other approaches.
- Top Cited Papers
- 24 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 5 (5) , 726-742
A Survey on Neural Network Interpretability
Along with the great success of deep neural networks, there is also growing concern about their black-box nature. The interpretability issue affects people's trust on deep learning systems. It is also related to many ethical problems, e.g., algorithmic discrimination. Moreover, interpretability is a desired property for deep networks to become powerful tools in other research fields, e.g., drug discovery and genomics. In this survey, we conduct a comprehensive review of the neural network interpretability research. We first clarify the definition of interpretability as it has been used in many different contexts. Then we elaborate on the importance of interpretability and propose a novel taxonomy organized along three dimensions: type of engagement (passive vs. active interpretation approaches), the type of explanation, and the focus (from local to global interpretability). This taxonomy provides a meaningful 3D view of distribution of papers from the relevant literature as two of the dimensions are not simply categorical but allow ordinal subcategories. Finally, we summarize the existing interpretability evaluation methods and suggest possible research directions inspired by our new taxonomy.
- 24 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 5 (5) , 726-742
Top Cited PapersA Survey on Neural Network Interpretability
Along with the great success of deep neural networks, there is also growing concern about their black-box nature. The interpretability issue affects people's trust on deep learning systems. It is also related to many ethical problems, e.g., algorithmic discrimination. Moreover, interpretability is a desired property for deep networks to become powerful tools in other research fields, e.g., drug discovery and genomics. In this survey, we conduct a comprehensive review of the neural network interpretability research. We first clarify the definition of interpretability as it has been used in many different contexts. Then we elaborate on the importance of interpretability and propose a novel taxonomy organized along three dimensions: type of engagement (passive vs. active interpretation approaches), the type of explanation, and the focus (from local to global interpretability). This taxonomy provides a meaningful 3D view of distribution of papers from the relevant literature as two of the dimensions are not simply categorical but allow ordinal subcategories. Finally, we summarize the existing interpretability evaluation methods and suggest possible research directions inspired by our new taxonomy.