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

Sufeng Niu

dblp:156/7511 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
2since 2021 · last 2021
0000-0002-2826-0301ORCID · corroborated

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

Artificial intelligence and machine learning · 7 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
3 papers
Graph learning · 70% Reinforcement learning · 30%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
0.512021
Performance-Adaptive Sampling Strategy Towards Fast and Accurate Graph Neural Networks · KDD 2021
Machine learning › Graph learning
graph sampling
0.512021
Performance-Adaptive Sampling Strategy Towards Fast and Accurate Graph Neural Networks · KDD 2021
Machine learning › Graph learning › graph neural network
scalable graph neural network
0.512021
Performance-Adaptive Sampling Strategy Towards Fast and Accurate Graph Neural Networks · KDD 2021
Machine learning › Reinforcement learning › policy optimization
policy gradient
0.412020
Learning to Navigate The Synthetically Accessible Chemical Space Using Reinforcement Learning · ICML 2020
Machine learning › Graph learning › graph neural network
graph convolution
0.312018
Generalized Value Iteration Networks: Life Beyond Lattices · AAAI 2018
Machine learning › Reinforcement learning › value-based reinforcement learning
value iteration network
0.312018
Generalized Value Iteration Networks: Life Beyond Lattices · AAAI 2018
Bioinformatics and computational biology › drug discovery › drug design
de novo drug design
0.112020
Learning to Navigate The Synthetically Accessible Chemical Space Using Reinforcement Learning · ICML 2020
Bioinformatics and computational biology
drug discovery
0.112020
Learning to Navigate The Synthetically Accessible Chemical Space Using Reinforcement Learning · ICML 2020

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

reinforcement learning · 0.9policy gradient · 0.9sampling · 0.5graph convolutional network · 0.5value iteration · 0.3q-learning · 0.3graph convolution · 0.3
YearPublicationVenuePosition
2021 Systematic Evaluation and Enhancement of Speech Recognition in Operational Medical Environments
abstract
Operational medical environments require reliable hands-free solutions to extract data from audio captured under noisy scenarios during rescue missions and provide timely information. However, approaches using automatic speech recognition (ASR) and natural language processing (NLP) techniques are complex as these conversations have a wide range of noise, involve medical terms from multiple speakers, and occur in high-stress environments, among others. These are further complicated by the lack of large training datasets for operational medical scenarios. To address these issues, we developed a platform that enables resilient hands-free data collection, preserves complete documentation through stages of care, and presents the information in near real-time, critical for the medical operation. Our work uniquely focused on systematic evaluation and improvement of a deep neural network-based ASR system by leveraging realistic testing data obtained from medical simulations of battlefield scenarios, which to our knowledge have not been addressed in any prior work. The system performance is shown to improve significantly using multi-style training, language model adaptation for the medical domain, speech enhancement, and NLP techniques.
Snigdhaswin Kar, Prabodh Mishra, Ju Lin, Minjae Woo, Nicholas Deas, Caleb Linduff, Sufeng Niu, Jerome McClendon, D. Hudson Smith, Melissa C. Smith, Ronald W. Gimbel, Kuang-Ching Wang
IJCNN7
2021 Performance-Adaptive Sampling Strategy Towards Fast and Accurate Graph Neural Networks
abstract
The main challenge of adapting Graph convolutional networks (GCNs) to large-scale graphs is the scalability issue due to the uncontrollable neighborhood expansion in the aggregation stage. Several sampling algorithms have been proposed to limit the neighborhood expansion. However, these algorithms focus on minimizing the variance in sampling to approximate the original aggregation. This leads to two critical problems: 1) low accuracy because the sampling policy is agnostic to the performance of the target task, and 2) vulnerability to noise or adversarial attacks on the graph.
Minji Yoon, Théophile Gervet, Baoxu Shi, Sufeng Niu, Qi He 0002, Jaewon Yang
KDD4
2020 Learning to Navigate The Synthetically Accessible Chemical Space Using Reinforcement Learning
abstract
Over the last decade, there has been significant progress in the field of machine learning for de novo drug design, particularly in generative modeling of novel chemical structures. However, current generative approaches exhibit a significant challenge: they do not ensure that the proposed molecular structures can be feasibly synthesized nor do they provide the synthesis routes of the proposed small molecules, thereby seriously limiting their practical applicability. In this work, we propose a novel reinforcement learning (RL) setup for de novo drug design: Policy Gradient for Forward Synthesis (PGFS), that addresses this challenge by embedding the concept of synthetic accessibility directly into the de novo drug design system. In this setup, the agent learns to navigate through the immense synthetically accessible chemical space by subjecting initial commercially available molecules to valid chemical reactions at every time step of the iterative virtual synthesis process. The proposed environment for drug discovery provides a highly challenging test-bed for RL algorithms owing to the large state space and high-dimensional continuous action space with hierarchical actions. PGFS achieves state-of-the-art performance in generating structures with high QED and clogP. Moreover, we validate PGFS in an in-silico proof-of-concept associated with three HIV targets. Finally, we describe how the end-to-end training conceptualized in this study represents an important paradigm in radically expanding the synthesizable chemical space and automating the drug discovery process.
Sai Krishna Gottipati, Boris Sattarov, Sufeng Niu, Yashaswi Pathak, Shengchao Liu, Simon Blackburn, Karam M. J. Thomas, Connor W. Coley, Jian Tang 0005, Sarath Chandar, Yoshua Bengio
ICML3
2020 Improved Speech Enhancement Using a Time-Domain GAN with Mask Learning
abstract
Speech enhancement is an essential component in robust automatic speech recognition (ASR) systems. Most speech enhancement methods are nowadays based on neural networks that use feature-mapping or mask-learning. This paper proposes a novel speech enhancement method that integrates time-domain feature mapping and mask learning into a unified framework using a Generative Adversarial Network (GAN). The proposed framework processes the received waveform and decouples speech and noise signals, which are fed into two short-time Fourier transform (STFT) convolution 1-D layers that map the waveforms to spectrograms in the complex domain. These speech and noise spectrograms are then used to compute the speech mask loss. The proposed method is evaluated using the TIMIT data set for seen and unseen signal-to-noise ratio conditions. It is shown that the proposed method outperforms the speech enhancement methods that use Deep Neural Network (DNN) based speech enhancement or a Speech Enhancement Generative Adversarial Network (SEGAN).
Ju Lin, Sufeng Niu, Adriaan J. de Lind van Wijngaarden, Jerome McClendon, Melissa C. Smith, Kuang-Ching Wang
INTERSPEECH2
2019 PCT: Large-Scale 3d Point Cloud Representations Via Graph Inception Networks with Applications to Autonomous Driving
abstract
We present a novel graph-neural-network-based system to effectively represent large-scale 3D point clouds with the applications to autonomous driving. Many previous works studied the representations of 3D point clouds based on two approaches, voxelization, which causes discretization errors and learning, which is hard to capture huge variations in large-scale scenarios. In this work, we combine voxelization and learning: we discretize the 3D space into voxels and propose novel graph inception networks to represent 3D points in each voxel. This combination makes the system avoid discretization errors and work for large-scale scenarios. The entire system for large-scale 3D point clouds acts like the blocked discrete cosine transform for 2D images; we thus call it the point cloud neural transform (PCT). We further apply the proposed PCT to represent real-time LiDAR sweeps produced by self-driving cars and the PCT with graph inception networks significantly outperforms its competitors.
Siheng Chen, Sufeng Niu, Baoan Liu
ICIP2
2019 Speech Enhancement Using Forked Generative Adversarial Networks with Spectral Subtraction
Ju Lin, Sufeng Niu, Zice Wei, Adriaan J. de Lind van Wijngaarden, Melissa C. Smith, Kuang-Ching Wang
INTERSPEECH2
2018 Generalized Value Iteration Networks: Life Beyond Lattices
abstract
In this paper, we introduce a generalized value iteration network (GVIN), which is an end-to-end neural network planning module. GVIN emulates the value iteration algorithm by using a novel graph convolution operator, which enables GVIN to learn and plan on irregular spatial graphs. We propose three novel differentiable kernels as graph convolution operators and show that the embedding-based kernel achieves the best performance. Furthermore, we present episodic Q-learning, an improvement upon traditional n-step Q-learning that stabilizes training for VIN and GVIN. Lastly, we evaluate GVIN on planning problems in 2D mazes, irregular graphs, and real-world street networks, showing that GVIN generalizes well for both arbitrary graphs and unseen graphs of larger scaleand outperforms a naive generalization of VIN (discretizing a spatial graph into a 2D image).
Sufeng Niu, Siheng Chen, Hanyu Guo, Colin Targonski, Melissa C. Smith, Jelena Kovacevic
AAAI1
2014 Combining Hadoop and GPU to preprocess large Affymetrix microarray data
abstract
High density oligonucleotide array (microarray) from Affymetrix has been widely used for the measurements of gene expressions. Currently, public data repositories, such as Gene Expression Omnibus (GEO) of the National Center for Biotechnology Information (NCBI), have accumulated large amounts of microarray data. Efficient integrative analysis of those microarray data will provide significant knowledge about biological systems. None of the existing microarray preprocessing and quality assessment tools can handle very large microarray datasets with tens of thousands of experiments. The preprocessing and quality assessment of microarray datasets contain both data-intensive and compute-intensive tasks. In this paper, we develop a new set of tools using a mix of the Hadoop (for data intensive tasks) and the General-Purpose Graphics Processing Units (GPGPUs) (for compute intensive tasks) to efficiently process large microarray data. Evaluation of our new tools on large microarray datasets with ten thousands of experiments showed promising superior performance. We demonstrate that the combination of Hadoop and GPGPU computation is effective for complex scientific applications that contain both data-intensive and compute-intensive tasks. Our new tool set will make it possible to utilize valuable large microarray data in the public repositories.
Sufeng Niu, Nilim Sarma, Pengfei Xuan, Melissa C. Smith, Pradip K. Srimani, Feng Luo 0001
IEEE BigData1