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

Shaoyi Chen

dblp:266/4969 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
0009-0001-8582-1363ORCID · corroborated

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

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

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
Information extraction and text analysis · 70% Efficient and distributed learning · 22% Language models and text generation · 8%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
event extraction
0.512021
Text2Event: Controllable Sequence-to-Structure Generation for End-to-end Event Extraction · ACL/IJCNLP (1) 2021
Natural language and speech › Information extraction and text analysis › text classification
active learning for text classification
0.412020
Active Learning with Query Generation for Cost-Effective Text Classification · AAAI 2020
Machine learning › Efficient and distributed learning › data-efficient learning
label-efficient learning
0.412020
Active Learning with Query Generation for Cost-Effective Text Classification · AAAI 2020
Natural language and speech › Information extraction and text analysis
text classification
0.412020
Active Learning with Query Generation for Cost-Effective Text Classification · AAAI 2020

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

sequence-to-structure generation · 0.5sparse reconstruction · 0.4query generation · 0.4active learning · 0.4
YearPublicationVenuePosition
2022 An Ultra Energy Efficient Streaming-based FPGA Accelerator for Lightweight Neural Network
abstract
Convolutional Neural Networks (CNN) is widely applied in modern machine learning and pattern recognition area. Streaming hardware accelerator is an efficient design that reduces power dissipation by lowering off-chip memory access. Streaming architecture requires putting the entire network on-chip, which is a challenging task for resource-constrained embedded systems. This paper presents a streaming hardware accelerator to implement SkyNet, a lightweight neural network to address real-time object detection. The net is retrained and quantized to a very low bit in order to put all the weights into the on-chip BRAMs. We designed a highly balanced pipeline based on each layer’s calculation to improve resource utilization. We demonstrate the streaming-based accelerator on the Ultra96v2 board and achieve a throughput of 536 frames per second (FPS) at 333MHz and intersection over Union (IoU) of 73.1% on the DAC-SDC dataset. The overall computational efficiency of our accelerator is 98%. Compared to the state-of-the-art, our work achieves 2.5× throughput, 2.7× energy efficiency.
Shaoyi Chen, Zhiqi Zhou, Yajun Ha
ISCAS1
2021 Text2Event: Controllable Sequence-to-Structure Generation for End-to-end Event Extraction
abstract
Yaojie Lu, Hongyu Lin, Jin Xu, Xianpei Han, Jialong Tang, Annan Li, Le Sun, Meng Liao, Shaoyi Chen. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2021.
Yaojie Lu 0001, Jin Xu 0014, Xianpei Han, Jialong Tang, Annan Li, Le Sun 0001, Meng Liao, Shaoyi Chen
ACL/IJCNLP (1)9
2020 Active Learning with Query Generation for Cost-Effective Text Classification
abstract
Labeling a text document is usually time consuming because it requires the annotator to read the whole document and check its relevance with each possible class label. It thus becomes rather expensive to train an effective model for text classification when it involves a large dataset of long documents. In this paper, we propose an active learning approach for text classification with lower annotation cost. Instead of scanning all the examples in the unlabeled data pool to select the best one for query, the proposed method automatically generates the most informative examples based on the classification model, and thus can be applied to tasks with large scale or even infinite unlabeled data. Furthermore, we propose to approximate the generated example with a few summary words by sparse reconstruction, which allows the annotators to easily assign the class label by reading a few words rather than the long document. Experiments on different datasets demonstrate that the proposed approach can effectively improve the classification performance while significantly reduce the annotation cost.
Sheng-Jun Huang, Shaoyi Chen, Meng Liao, Jin Xu 0014
AAAI3