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

Yiran Sun

dblp:240/6911 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
4since 2021 · last 2025
0009-0009-8275-5514ORCID · reported

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

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

Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › distributed optimization
asynchronous parallel optimization
0.512021
Async-RED: A Provably Convergent Asynchronous Block Parallel Stochastic Method using Deep Denoising Priors · ICLR 2021
Mathematical optimization › continuous optimization
convex optimization
0.512021
Async-RED: A Provably Convergent Asynchronous Block Parallel Stochastic Method using Deep Denoising Priors · ICLR 2021
Mathematical optimization
nonconvex optimization
0.512021
Async-RED: A Provably Convergent Asynchronous Block Parallel Stochastic Method using Deep Denoising Priors · ICLR 2021
Mathematical optimization
riemannian optimization
0.512021
Async-RED: A Provably Convergent Asynchronous Block Parallel Stochastic Method using Deep Denoising Priors · ICLR 2021
Mathematical optimization
stochastic optimization
0.512021
Async-RED: A Provably Convergent Asynchronous Block Parallel Stochastic Method using Deep Denoising Priors · ICLR 2021

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

deep denoising prior · 0.5block parallel stochastic method · 0.5
YearPublicationVenuePosition
2025 Adding Before Pruning: Sparse Filter Fusion for Deep Convolutional Neural Networks via Auxiliary Attention
abstract
Filter pruning is a significant feature selection technique to shrink the existing feature fusion schemes (especially on convolution calculation and model size), which helps to develop more efficient feature fusion models while maintaining state-of-the-art performance. In addition, it reduces the storage and computation requirements of deep neural networks (DNNs) and accelerates the inference process dramatically. Existing methods mainly rely on manual constraints such as normalization to select the filters. A typical pipeline comprises two stages: first pruning the original neural network and then fine-tuning the pruned model. However, choosing a manual criterion can be somehow tricky and stochastic. Moreover, directly regularizing and modifying filters in the pipeline suffer from being sensitive to the choice of hyperparameters, thus making the pruning procedure less robust. To address these challenges, we propose to handle the filter pruning issue through one stage: using an attention-based architecture that adaptively fuses the filter selection with filter learning in a unified network. Specifically, we present a pruning method named adding before pruning (ABP) to make the model focus on the filters of higher significance by training instead of man-made criteria such as norm, rank, etc. First, we add an auxiliary attention layer into the original model and set the significance scores in this layer to be binary. Furthermore, to propagate the gradients in the auxiliary attention layer, we design a specific gradient estimator and prove its effectiveness for convergence in the graph flow through mathematical derivation. In the end, to relieve the dependence on the complicated prior knowledge for designing the thresholding criterion, we simultaneously prune and train the filters to automatically eliminate network redundancy with recoverability. Extensive experimental results on the two typical image classification benchmarks, CIFAR-10 and ILSVRC-2012, illustrate that the proposed approach performs favorably against previous state-of-the-art filter pruning algorithms.
Guanzhong Tian, Yiran Sun, Yuang Liu, Xianfang Zeng, Mengmeng Wang 0005, Yong Liu 0007, Jiangning Zhang, Jun Chen 0023
IEEE Trans. Neural Networks Learn. Syst.2
2024 An overlap estimation guided feature metric approach for real point cloud registration
Fukai Zhang, Tiancheng He, Yiran Sun, Shan Zhao 0009, Xueliang Zhao, Weiye Zhao
Comput. Graph.4
2023 Prior-based 3D U-Net: A model for knee-cartilage segmentation in MRI images
Hao Liu 0029, Yiran Sun, Xiangyun Cheng
Comput. Graph.2
2021 Async-RED: A Provably Convergent Asynchronous Block Parallel Stochastic Method using Deep Denoising Priors
Yu Sun 0022, Jiaming Liu 0001, Yiran Sun, Brendt Wohlberg, Ulugbek Kamilov
ICLR3
2019 ObjectFusion: An object detection and segmentation framework with RGB-D SLAM and convolutional neural networks
Guanzhong Tian, Liang Liu 0007, JongHyok Ri, Yong Liu 0007, Yiran Sun
Neurocomputing5