Demo Data from VLDB 2026 / reviewers in the wild / expert
Yang Liu 0097
dblp:51/3710-97
· DBLP profile ↗
8ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5 · 1 first-authorArtificial intelligence and machine learning · 3 · 1 first-authorGraphics, 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.
| Interdisciplinary, comprehensive, and emerging computing
4 papers |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
2 papers |
Efficient and distributed learning · 42% Reinforcement learning · 37% Probabilistic and Bayesian machine learning · 21% |
Topics — the 12 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
protein engineering |
0.4 | 1 | 2020 | Evolutionary Context-Integrated Deep Sequence Modeling for Protein Engineering · RECOMB 2020 |
Bioinformatics and computational biology › protein sequence analysis
protein sequence modeling |
0.4 | 1 | 2020 | Evolutionary Context-Integrated Deep Sequence Modeling for Protein Engineering · RECOMB 2020 |
Machine learning › Efficient and distributed learning › adaptive computation
adaptive inference |
0.3 | 1 | 2018 | Energy-efficient Amortized Inference with Cascaded Deep Classifiers · IJCAI 2018 |
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference
amortized inference |
0.3 | 1 | 2018 | Energy-efficient Amortized Inference with Cascaded Deep Classifiers · IJCAI 2018 |
Machine learning › Efficient and distributed learning
model compression |
0.3 | 1 | 2018 | Energy-efficient Amortized Inference with Cascaded Deep Classifiers · IJCAI 2018 |
Bioinformatics and computational biology › protein structure analysis
protein structure search |
0.3 | 1 | 2018 | Learning structural motif representations for efficient protein structure search · Bioinform. 2018 |
Bioinformatics and computational biology › systems bioinformatics › pathway analysis
signaling pathway analysis |
0.3 | 1 | 2018 | Deciphering Signaling Specificity with Deep Neural Networks · RECOMB 2018 |
Machine learning › Reinforcement learning
deep reinforcement learning |
0.3 | 1 | 2017 | Learning to Play in a Day: Faster Deep Reinforcement Learning by Optimality Tightening · ICLR (Poster) 2017 |
Machine learning › Reinforcement learning
sample efficiency |
0.3 | 1 | 2017 | Learning to Play in a Day: Faster Deep Reinforcement Learning by Optimality Tightening · ICLR (Poster) 2017 |
Bioinformatics and computational biology
protein structure analysis |
0.1 | 1 | 2018 | Learning structural motif representations for efficient protein structure search · Bioinform. 2018 |
Bioinformatics and computational biology › protein structure analysis
structural similarity search |
0.1 | 1 | 2018 | Learning structural motif representations for efficient protein structure search · Bioinform. 2018 |
Energy-efficient computing
energy-efficient machine learning |
0.1 | 1 | 2018 | Energy-efficient Amortized Inference with Cascaded Deep Classifiers · IJCAI 2018 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 0.7REINFORCE · 0.7deep sequence modeling · 0.4meta-learning · 0.4deep neural network · 0.3deep learning · 0.3deep convolutional neural network · 0.3optimality tightening · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Evolutionary Context-Integrated Deep Sequence Modeling for Protein Engineering
Yunan Luo, Lam Vo, Hantian Ding, Yufeng Su, Yang Liu 0097, Wesley Wei Qian, Huimin Zhao 0007, Jian Peng 0001 |
RECOMB | 5 |
| 2019 | Mitigating Data Scarcity in Protein Binding Prediction Using Meta-Learning
Yunan Luo, Jianzhu Ma, Xiaoming Zhao 0001, Yufeng Su, Yang Liu 0097, Trey Ideker, Jian Peng 0001 |
RECOMB | 5 |
| 2019 | Integrating thermodynamic and sequence contexts improves protein-RNA binding predictionabstractPredicting RNA-binding protein (RBP) specificity is important for understanding gene expression regulation and RNA-mediated enzymatic processes. It is widely believed that RBP binding specificity is determined by both the sequence and structural contexts of RNAs. Existing approaches, including traditional machine learning algorithms and more recently, deep learning models, have been extensively applied to integrate RNA sequence and its predicted or experimental RNA structural probabilities for improving the accuracy of RBP binding prediction. Such models were trained mostly on the large-scale in vitro datasets, such as the RNAcompete dataset. However, in RNAcompete, most synthetic RNAs are unstructured, which makes machine learning methods not effectively extract RBP-binding structural preferences. Furthermore, RNA structure may be variable or multi-modal according to both theoretical and experimental evidence. In this work, we propose ThermoNet, a thermodynamic prediction model by integrating a new sequence-embedding convolutional neural network model over a thermodynamic ensemble of RNA secondary structures. First, the sequence-embedding convolutional neural network generalizes the existing k-mer based methods by jointly learning convolutional filters and k-mer embeddings to represent RNA sequence contexts. Second, the thermodynamic average of deep-learning predictions is able to explore structural variability and improves the prediction, especially for the structured RNAs. Extensive experiments demonstrate that our method significantly outperforms existing approaches, including RCK, DeepBind and several other recent state-of-the-art methods for predictions on both in vitro and in vivo data. The implementation of ThermoNet is available at https://github.com/suyufeng/ThermoNet. Yufeng Su, Yunan Luo, Xiaoming Zhao 0001, Yang Liu 0097, Jian Peng 0001 |
PLoS Comput. Biol. | 4 |
| 2018 | Energy-efficient Amortized Inference with Cascaded Deep ClassifiersabstractDeep neural networks have been remarkable successful in various AI tasks but often cast high computation and energy cost for energy-constrained applications such as mobile sensing. We address this problem by proposing a novel framework that optimizes the prediction accuracy and energy cost simultaneously, thus enabling effective cost-accuracy trade-off at test time. In our framework, each data instance is pushed into a cascade of deep neural networks with increasing sizes, and a selection module is used to sequentially determine when a sufficiently accurate classifier can be used for this data instance. The cascade of neural networks and the selection module are jointly trained in an end-to-end fashion by the REINFORCE algorithm to optimize a trade-off between the computational cost and the predictive accuracy. Our method is able to simultaneously improve the accuracy and efficiency by learning to assign easy instances to fast yet sufficiently accurate classifiers to save computation and energy cost, while assigning harder instances to deeper and more powerful classifiers to ensure satisfiable accuracy. Moreover, we demonstrate our method's effectiveness with extensive experiments on CIFAR-10/100, ImageNet32x32 and original ImageNet dataset. Jiaqi Guan, Yang Liu 0097, Qiang Liu 0001, Jian Peng 0001 |
IJCAI | 2 |
| 2018 | Deciphering Signaling Specificity with Deep Neural Networks
Yunan Luo, Jianzhu Ma, Yang Liu 0097, Trey Ideker, Jian Peng 0001 |
RECOMB | 3 |
| 2018 | Learning structural motif representations for efficient protein structure searchabstractMotivation: Given a protein of unknown function, fast identification of similar protein structures from the Protein Data Bank (PDB) is a critical step for inferring its biological function. Such structural neighbors can provide evolutionary insights into protein conformation, interfaces and binding sites that are not detectable from sequence similarity. However, the computational cost of performing pairwise structural alignment against all structures in PDB is prohibitively expensive. Alignment-free approaches have been introduced to enable fast but coarse comparisons by representing each protein as a vector of structure features or fingerprints and only computing similarity between vectors. As a notable example, FragBag represents each protein by a 'bag of fragments', which is a vector of frequencies of contiguous short backbone fragments from a predetermined library. Despite being efficient, the accuracy of FragBag is unsatisfactory because its backbone fragment library may not be optimally constructed and long-range interacting patterns are omitted. Results: Here we present a new approach to learning effective structural motif presentations using deep learning. We develop DeepFold, a deep convolutional neural network model to extract structural motif features of a protein structure. We demonstrate that DeepFold substantially outperforms FragBag on protein structural search on a non-redundant protein structure database and a set of newly released structures. Remarkably, DeepFold not only extracts meaningful backbone segments but also finds important long-range interacting motifs for structural comparison. We expect that DeepFold will provide new insights into the evolution and hierarchical organization of protein structural motifs. Availability and implementation: https://github.com/largelymfs/DeepFold. Yang Liu 0097, Liwei Wang 0009, Jian Peng 0001 |
Bioinform. | 1 |
| 2017 | Learning to Play in a Day: Faster Deep Reinforcement Learning by Optimality Tightening
Frank S. He, Yang Liu 0097, Alexander G. Schwing, Jian Peng 0001 |
ICLR (Poster) | 2 |
| 2017 | Stein Variational Policy Gradient
Yang Liu 0097, Prajit Ramachandran, Qiang Liu 0001, Jian Peng 0001 |
UAI | 1 |