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

Ruohui Wang

dblp:23/9712 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0002-6386-6106ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

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 · 74% Probabilistic and Bayesian machine learning · 17% Multi-agent systems · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
0.812024
Differentiable Model Scaling using Differentiable Topk · ICML 2024
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
0.812024
Differentiable Model Scaling using Differentiable Topk · ICML 2024
Machine learning › Efficient and distributed learning › model compression
pruning
0.812024
Differentiable Model Scaling using Differentiable Topk · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian nonparametric model
0.312017
Scalable Estimation of Dirichlet Process Mixture Models on Distributed Data · IJCAI 2017
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian nonparametric model
dirichlet process mixture model
0.312017
Scalable Estimation of Dirichlet Process Mixture Models on Distributed Data · IJCAI 2017
Knowledge, reasoning and agents › Multi-agent systems
distributed estimation
0.312017
Scalable Estimation of Dirichlet Process Mixture Models on Distributed Data · IJCAI 2017
Machine learning › Efficient and distributed learning
distributed inference
0.112017
Scalable Estimation of Dirichlet Process Mixture Models on Distributed Data · IJCAI 2017
Machine learning › Efficient and distributed learning
distributed training
0.112017
Scalable Estimation of Dirichlet Process Mixture Models on Distributed Data · IJCAI 2017

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

differentiable top-k · 0.8variational inference · 0.3probabilistic consolidation · 0.3
YearPublicationVenuePosition
2024 Differentiable Model Scaling using Differentiable Topk
abstract
Over the past few years, as large language models have ushered in an era of intelligence emergence, there has been an intensified focus on scaling networks. Although Neural Architecture Search (NAS) methods have been proposed to automate this process, they suffer from low search efficiency. This study introduces Differentiable Model Scaling (DMS), increasing the efficiency for searching optimal width and depth in networks. DMS can model both width and depth in a direct and fully differentiable way, making it easy to optimize. We have evaluated our DMS across diverse tasks, ranging from vision tasks to NLP tasks and various network architectures, including CNNs and Transformers. Results consistently indicate that our DMS can find improved structures and outperforms state-of-the-art NAS methods. Specifically, for image classification on ImageNet, our DMS improves the top-1 accuracy of EfficientNet-B0 and Deit-Tiny by 1.4% and 0.6%, respectively, and outperforms the state-of-the-art zero-shot NAS method, ZiCo, by 1.3% while requiring only 0.4 GPU days for searching. For object detection on COCO, DMS improves the mAP of Yolo-v8-n by 2.0%. For language modeling, our pruned Llama-7B outperforms the prior method with lower perplexity and higher zero-shot classification accuracy. Our code is available at https://github.com/LKJacky/Differentiable-Model-Scaling.
Ruohui Wang, Jianfei Gao 0003, Kai Chen 0026
ICML2
2018 T-CNN: Tubelets With Convolutional Neural Networks for Object Detection From Videos
abstract
The state-of-the-art performance for object detection has been significantly improved over the past two years. Besides the introduction of powerful deep neural networks, such as GoogleNet and VGG, novel object detection frameworks, such as R-CNN and its successors, Fast R-CNN, and Faster R-CNN, play an essential role in improving the state of the art. Despite their effectiveness on still images, those frameworks are not specifically designed for object detection from videos. Temporal and contextual information of videos are not fully investigated and utilized. In this paper, we propose a deep learning framework that incorporates temporal and contextual information from tubelets obtained in videos, which dramatically improves the baseline performance of existing still-image detection frameworks when they are applied to videos. It is called T-CNN, i.e., tubelets with convolutional neueral networks. The proposed framework won newly introduced an object-detection-from-video task with provided data in the ImageNet Large-Scale Visual Recognition Challenge 2015. Code is publicly available athttps://github.com/myfavouritekk/T-CNN.
Kai Kang 0006, Hongsheng Li 0001, Xingyu Zeng, Bin Yang 0022, Tong Xiao 0003, Cong Zhang 0005, Zhe Wang 0006, Ruohui Wang, Xiaogang Wang 0001, Wanli Ouyang
IEEE Trans. Circuits Syst. Video Technol.9
2017 Scalable Estimation of Dirichlet Process Mixture Models on Distributed Data
abstract
We consider the estimation of Dirichlet Process Mixture Models (DPMMs) in distributed environments, where data are distributed across multiple computing nodes. A key advantage of Bayesian nonparametric models such as DPMMs is that they allow new components to be introduced on the fly as needed. This, however, posts an important challenge to distributed estimation -- how to handle new components efficiently and consistently. To tackle this problem, we propose a new estimation method, which allows new components to be created locally in individual computing nodes. Components corresponding to the same cluster will be identified and merged via a probabilistic consolidation scheme. In this way, we can maintain the consistency of estimation with very low communication cost. Experiments on large real-world data sets show that the proposed method can achieve high scalability in distributed and asynchronous environments without compromising the mixing performance.
Ruohui Wang, Dahua Lin
IJCAI1
2016 Edge Detection Using Convolutional Neural Network
Ruohui Wang
ISNN1