VLDB 2026 Research / reviewers in the wild / expert
Haoyuan Mu
dblp:237/9651
· DBLP profile ↗
5ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-9498-4375ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 since 2021Artificial intelligence and machine learning · 3Systems, architecture and hardware · 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 |
Efficient and distributed learning · 100% | |
| Computer graphics and multimedia
2 papers |
Image and video processing · 57% Rendering · 43% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering
global illumination |
0.7 | 1 | 2023 | Neural Global Illumination: Interactive Indirect Illumination Prediction Under Dynamic Area Lights · IEEE Trans. Vis. Comput. Graph. 2023 |
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search |
0.5 | 2 | 2020 | Single Path One-Shot Neural Architecture Search with Uniform Sampling · ECCV (16) 2020 MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning · ICCV 2019 |
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
one-shot neural architecture search |
0.4 | 1 | 2020 | Single Path One-Shot Neural Architecture Search with Uniform Sampling · ECCV (16) 2020 |
Machine learning › Efficient and distributed learning
parameter sharing |
0.4 | 1 | 2020 | Single Path One-Shot Neural Architecture Search with Uniform Sampling · ECCV (16) 2020 |
Machine learning › Efficient and distributed learning › model compression › pruning › structured pruning
channel pruning |
0.4 | 1 | 2019 | MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning · ICCV 2019 |
Machine learning › Efficient and distributed learning
model compression |
0.4 | 1 | 2019 | MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning · ICCV 2019 |
Image and video processing › super-resolution › image super-resolution
arbitrary-scale super-resolution |
0.4 | 1 | 2019 | Meta-SR: A Magnification-Arbitrary Network for Super-Resolution · CVPR 2019 |
Image and video processing › super-resolution › image super-resolution
single image super-resolution |
0.4 | 1 | 2019 | Meta-SR: A Magnification-Arbitrary Network for Super-Resolution · CVPR 2019 |
Image and video processing
super-resolution |
0.4 | 1 | 2019 | Meta-SR: A Magnification-Arbitrary Network for Super-Resolution · CVPR 2019 |
Rendering
interactive rendering |
0.2 | 1 | 2023 | Neural Global Illumination: Interactive Indirect Illumination Prediction Under Dynamic Area Lights · IEEE Trans. Vis. Comput. Graph. 2023 |
Methods — techniques the papers use, named apart from their topics
meta-learning · 0.8screen-space neural buffer · 0.7positional encoding · 0.7deep rendering network · 0.7uniform sampling · 0.4stochastic structure sampling · 0.4evolutionary search · 0.4dynamic filter prediction · 0.4convolutional neural network · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Neural Global Illumination: Interactive Indirect Illumination Prediction Under Dynamic Area LightsabstractWe propose neural global illumination, a novel method for fast rendering full global illumination in static scenes with dynamic viewpoint and area lighting. The key idea of our method is to utilize a deep rendering network to model the complex mapping from each shading point to global illumination. To efficiently learn the mapping, we propose a neural-network-friendly input representation including attributes of each shading point, viewpoint information, and a combinational lighting representation that enables high-quality fitting with a compact neural network. To synthesize high-frequency global illumination effects, we transform the low-dimension input to higher-dimension space by positional encoding and model the rendering network as a deep fully-connected network. Besides, we feed a screen-space neural buffer to our rendering network to share global information between objects in the screen-space to each shading point. We have demonstrated our neural global illumination method in rendering a wide variety of scenes exhibiting complex and all-frequency global illumination effects such as multiple-bounce glossy interreflection, color bleeding, and caustics. Duan Gao, Haoyuan Mu, Kun Xu 0003 |
IEEE Trans. Vis. Comput. Graph. | 2 |
| 2021 | Dynamic Programming Assisted Quantization Approaches for Compressing Normal and Robust DNN ModelsabstractIn this work, we present effective quantization approaches for compressing the deep neural networks (DNNs). A key ingredient is a novel dynamic programming (DP) based algorithm to obtain the optimal solution of scalar K-means clustering. Based on the approaches with regularization and quantization function, two weight quantization approaches called DPR and DPQ for compressing normal DNNs are proposed respectively. Experiments show that they produce models with higher inference accuracy than recently proposed counterparts while achieving same or larger compression. They are also extended for compressing robust DNNs, and the relevant experiments show 16X compression of the robust ResNet-18 model with less than 3% accuracy drop on both natural and adversarial examples. Dingcheng Yang, Wenjian Yu, Haoyuan Mu, Gary Yao |
ASP-DAC | 3 |
| 2020 | Single Path One-Shot Neural Architecture Search with Uniform Sampling
Zichao Guo, Xiangyu Zhang 0005, Haoyuan Mu, Wen Heng, Zechun Liu, Jian Sun 0001 |
ECCV (16) | 3 |
| 2019 | Meta-SR: A Magnification-Arbitrary Network for Super-ResolutionabstractRecent research on super-resolution has achieved great success due to the development of deep convolutional neural networks (DCNNs). However, super-resolution of arbitrary scale factor has been ignored for a long time. Most previous researchers regard super-resolution of differentscale factors as independent tasks. They train a specific model for each scale factor which is inefficient in computing, and prior work only take the super-resolution of several integer scale factors into consideration. In this work,we propose a novel method called Meta-SR to firstly solve super-resolution of arbitrary scale factor (including non-integer scale factors) with a single model. In our Meta-SR,the Meta-Upscale Module is proposed to replace the traditional upscale module. For arbitrary scale factor, the Meta-Upscale Module dynamically predicts the weights of the up-scale filters by taking the scale factor as input and use these weights to generate the HR image of arbitrary size. For any low-resolution image, our Meta-SR can continuously zoomin it with arbitrary scale factor by only using a single model.We evaluated the proposed method through extensive experiments on widely used benchmark datasets on single image super-resolution. The experimental results show the superiority of our Meta-Upscale. Xuecai Hu, Haoyuan Mu, Xiangyu Zhang 0005, Zilei Wang, Tieniu Tan, Jian Sun 0001 |
CVPR | 2 |
| 2019 | MetaPruning: Meta Learning for Automatic Neural Network Channel PruningabstractIn this paper, we propose a novel meta learning approach for automatic channel pruning of very deep neural networks. We first train a PruningNet, a kind of meta network, which is able to generate weight parameters for any pruned structure given the target network. We use a simple stochastic structure sampling method for training the PruningNet. Then, we apply an evolutionary procedure to search for good-performing pruned networks. The search is highly efficient because the weights are directly generated by the trained PruningNet and we do not need any finetuning at search time. With a single PruningNet trained for the target network, we can search for various Pruned Networks under different constraints with little human participation. Compared to the state-of-the-art pruning methods, we have demonstrated superior performances on MobileNet V1/V2 and ResNet. Codes are available on https://github.com/liuzechun/MetaPruning. Zechun Liu, Haoyuan Mu, Xiangyu Zhang 0005, Zichao Guo, Xin Yang 0008, Kwang-Ting Cheng, Jian Sun 0001 |
ICCV | 2 |