Demo Data from VLDB 2026 / reviewers in the wild / expert
Yiyang Yu
dblp:91/9099
· DBLP profile ↗
6ranked-venue papers
2as first author
5since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Theory of computation · 1 · 1 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 |
Quantum computing and quantum information · 100% | |
| Artificial intelligence
2 papers |
Trustworthy machine learning · 47% Kernel, tree and ensemble methods · 36% Efficient and distributed learning · 18% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information
quantum communication |
1.0 | 1 | 2026 | Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network · IEEE Trans. Commun. 2026 |
Quantum computing and quantum information
quantum network |
1.0 | 1 | 2026 | Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network · IEEE Trans. Commun. 2026 |
Quantum computing and quantum information › quantum network
quantum repeater |
1.0 | 1 | 2026 | Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network · IEEE Trans. Commun. 2026 |
Quantum computing and quantum information › quantum communication
quantum teleportation |
1.0 | 1 | 2026 | Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network · IEEE Trans. Commun. 2026 |
Machine learning › Trustworthy machine learning
interpretability |
0.9 | 1 | 2025 | From Mechanistic Interpretability to Mechanistic Biology: Training, Evaluating, and Interpreting Sparse Autoencoders on Protein Language Models · ICML 2025 |
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
sparse autoencoder |
0.9 | 1 | 2025 | From Mechanistic Interpretability to Mechanistic Biology: Training, Evaluating, and Interpreting Sparse Autoencoders on Protein Language Models · ICML 2025 |
Bioinformatics and computational biology › protein sequence analysis › protein sequence representation
protein language model |
0.9 | 1 | 2025 | From Mechanistic Interpretability to Mechanistic Biology: Training, Evaluating, and Interpreting Sparse Autoencoders on Protein Language Models · ICML 2025 |
Machine learning › Kernel, tree and ensemble methods
ensemble learning |
0.7 | 1 | 2023 | WildWood: A New Random Forest Algorithm · IEEE Trans. Inf. Theory 2023 |
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | WildWood: A New Random Forest Algorithm · IEEE Trans. Inf. Theory 2023 |
Machine learning › Kernel, tree and ensemble methods › ensemble learning › tree ensembles
random forest |
0.7 | 1 | 2023 | WildWood: A New Random Forest Algorithm · IEEE Trans. Inf. Theory 2023 |
Methods — techniques the papers use, named apart from their topics
sparse autoencoder · 1.7linear probing · 1.7evolution-inspired augmentation · 0.8deep neural network · 0.8exponential weighting · 0.7context tree weighting · 0.7bootstrap out-of-bag sampling · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network
Xiaofeng Jiang, Tianze Zhu, Sen Kuang, Yiyang Yu, Luying Zhang, Shuangwu Chen, Huasen He, Jian Yang 0014 |
IEEE Trans. Commun. | 4 |
| 2025 | From Mechanistic Interpretability to Mechanistic Biology: Training, Evaluating, and Interpreting Sparse Autoencoders on Protein Language ModelsabstractProtein language models (pLMs) are powerful predictors of protein structure and function, learning through unsupervised training on millions of protein sequences. pLMs are thought to capture common motifs in protein sequences, but the specifics of pLM features are not well understood. Identifying these features would not only shed light on how pLMs work, but potentially uncover novel protein biologystudying the model to study the biology. Motivated by this, we train sparse autoencoders (SAEs) on the residual stream of a pLM, ESM-2. By characterizing SAE features, we determine that pLMs use a combination of generic features and family-specific features to represent a protein. In addition, we demonstrate how known sequence determinants of properties such as thermostability and subcellular localization can be identified by linear probing of SAE features. For predictive features without known functional associations, we hypothesize their role in unknown mechanisms and provide visualization tools to aid their interpretation. Our study gives a better understanding of the limitations of pLMs, and demonstrates how SAE features can be used to help generate hypotheses for biological mechanisms. We release our code, model weights, and feature visualizer. Etowah Adams, Liam Bai, Yiyang Yu, Mohammed AlQuraishi |
ICML | 4 |
| 2024 | EvoAug-TF: extending evolution-inspired data augmentations for genomic deep learning to TensorFlowabstractSUMMARY: Deep neural networks (DNNs) have been widely applied to predict the molecular functions of the non-coding genome. DNNs are data hungry and thus require many training examples to fit data well. However, functional genomics experiments typically generate limited amounts of data, constrained by the activity levels of the molecular function under study inside the cell. Recently, EvoAug was introduced to train a genomic DNN with evolution-inspired augmentations. EvoAug-trained DNNs have demonstrated improved generalization and interpretability with attribution analysis. However, EvoAug only supports PyTorch-based models, which limits its applications to a broad class of genomic DNNs based in TensorFlow. Here, we extend EvoAug's functionality to TensorFlow in a new package, we call EvoAug-TF. Through a systematic benchmark, we find that EvoAug-TF yields comparable performance with the original EvoAug package. AVAILABILITY AND IMPLEMENTATION: EvoAug-TF is freely available for users and is distributed under an open-source MIT license. Researchers can access the open-source code on GitHub (https://github.com/p-koo/evoaug-tf). The pre-compiled package is provided via PyPI (https://pypi.org/project/evoaug-tf) with in-depth documentation on ReadTheDocs (https://evoaug-tf.readthedocs.io). The scripts for reproducing the results are available at (https://github.com/p-koo/evoaug-tf_analysis). Yiyang Yu, Shivani Muthukumar, Peter K. Koo |
Bioinform. | 1 |
| 2023 | Gain Enhancement of Antenna-on-Chip at 94 GHz with an Integrated Artificial Magnetic Conductor for 6G System-on-ChipabstractSilicon-based complementary metal oxide semiconductor (CMOS) process has become one of the most popular processes to realize system-on-chip (SoC). However, as one of the essential components of wireless SoC, antennas are typically suffering from the poor radiation because of the highly conductive silicon substrate. Such antennas are known as antenna-on-chip (AoC). To enhance the radiation performance of AoC, artificial magnetic conductors (AMC) with double periodic strip structure layers has been proposed in this paper that can not only provide in-phase reflection but also isolate the antenna from the lossy silicon substrate. The proposed AMC shows a gain enhancement of 4.5 dB. The AMC-backed AoC is well-matched within 77-125 GHz and provides a boresight gain of 2 dBi at 94 GHz. Yiyang Yu, Atif Shamim |
VLSI-SoC | 1 |
| 2023 | WildWood: A New Random Forest AlgorithmabstractWe introduce WildWood (WW), a new ensemble algorithm for supervised learning of Random Forest (RF) type. While standard RF algorithms use bootstrap out-of-bag samples to compute out-of-bag scores, WW uses these samples to produce improved predictions given by an aggregation of the predictions of all possible subtrees of each fully grown tree in the forest. This is achieved by aggregation with exponential weights computed over out-of-bag samples, that are computed exactly and very efficiently thanks to an algorithm called context tree weighting. This improvement, combined with a histogram strategy to accelerate split finding, makes WW fast and competitive compared with other well-established ensemble methods, such as standard RF and extreme gradient boosting algorithms. Stéphane Gaïffas, Ibrahim Merad, Yiyang Yu |
IEEE Trans. Inf. Theory | 3 |
| 2020 | ZiMM: A deep learning model for long term and blurry relapses with non-clinical claims dataabstractInternational audience Anastasiia Kabeshova, Yiyang Yu, Bertrand Lukacs, Emmanuel Bacry, Stéphane Gaïffas |
J. Biomed. Informatics | 2 |