EDBT 2026 Demo / reviewers in the wild / expert
Yixiu Zhao
dblp:215/4397
· DBLP profile ↗
4ranked-venue papers
3as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 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 |
Generative modeling · 59% Probabilistic and Bayesian machine learning · 13% Deep learning architectures and training · 10% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 16 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.9 | 1 | 2025 | Informed Correctors for Discrete Diffusion Models · NeurIPS 2025 |
Machine learning › Generative modeling › diffusion model
diffusion sampling |
0.9 | 1 | 2025 | Informed Correctors for Discrete Diffusion Models · NeurIPS 2025 |
Machine learning › Generative modeling › diffusion model
discrete diffusion model |
0.9 | 1 | 2025 | Informed Correctors for Discrete Diffusion Models · NeurIPS 2025 |
Bioinformatics and computational biology › neuroscience › neuroinformatics
neural data analysis |
0.9 | 1 | 2025 | Extracting task-relevant preserved dynamics from contrastive aligned neural recordings · NeurIPS 2025 |
Bioinformatics and computational biology › computational neuroscience
neural decoding |
0.9 | 1 | 2025 | Extracting task-relevant preserved dynamics from contrastive aligned neural recordings · NeurIPS 2025 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
approximate bayesian inference |
0.7 | 1 | 2023 | Revisiting Structured Variational Autoencoders · ICML 2023 |
Machine learning › Deep learning architectures and training
autoencoder |
0.7 | 1 | 2023 | Revisiting Structured Variational Autoencoders · ICML 2023 |
Machine learning › Graph learning › graph neural network
message passing |
0.7 | 1 | 2023 | Revisiting Structured Variational Autoencoders · ICML 2023 |
Machine learning › Generative modeling › variational autoencoder
structured variational autoencoder |
0.7 | 1 | 2023 | Revisiting Structured Variational Autoencoders · ICML 2023 |
Machine learning › Generative modeling
variational autoencoder |
0.7 | 1 | 2023 | Revisiting Structured Variational Autoencoders · ICML 2023 |
Bioinformatics and computational biology › structural biology
cryo-electron tomography |
0.3 | 1 | 2018 | An integration of fast alignment and maximum-likelihood methods for electron subtomogram averaging and classification · Bioinform. 2018 |
Bioinformatics and computational biology
structural biology |
0.3 | 1 | 2018 | An integration of fast alignment and maximum-likelihood methods for electron subtomogram averaging and classification · Bioinform. 2018 |
Bioinformatics and computational biology › structural biology › cryo-electron tomography
subtomogram classification |
0.3 | 1 | 2018 | An integration of fast alignment and maximum-likelihood methods for electron subtomogram averaging and classification · Bioinform. 2018 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.3 | 1 | 2025 | Extracting task-relevant preserved dynamics from contrastive aligned neural recordings · NeurIPS 2025 |
Natural language and speech › Language models and text generation
text generation |
0.3 | 1 | 2025 | Informed Correctors for Discrete Diffusion Models · NeurIPS 2025 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models |
0.2 | 1 | 2023 | Revisiting Structured Variational Autoencoders · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
contrastive learning · 1.7predictor-corrector sampling · 0.9linear dynamical systems · 0.9linear dynamical system · 0.9hollow transformer · 0.9self-supervised training · 0.7message passing · 0.7automatic differentiation · 0.7maximum likelihood · 0.3fast alignment · 0.3expectation-maximization · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Extracting task-relevant preserved dynamics from contrastive aligned neural recordingsabstractRecent work indicates that low-dimensional dynamics of neural and behavioral data are often preserved across days and subjects. However, extracting these preserved dynamics remains challenging: high-dimensional neural population activity and the recorded neuron populations vary across recording sessions. While existing modeling tools can improve alignment between neural and behavioral data, they often operate on a per-subject basis or discretize behavior into categories, disrupting its natural continuity and failing to capture the underlying dynamics. We introduce $\underline{\text{C}}$ontrastive $\underline{\text{A}}$ligned $\underline{\text{N}}$eural $\underline{\text{D}}$$\underline{\text{Y}}$namics (CANDY), an end‑to‑end framework that aligns neural and behavioral data using rank-based contrastive learning, adapted for continuous behavioral variables, to project neural activity from different sessions onto a shared low-dimensional embedding space. CANDY fits a shared linear dynamical system to the aligned embeddings, enabling an interpretable model of the conserved temporal structure in the latent space. We validate CANDY on synthetic and real-world datasets spanning multiple species, behaviors, and recording modalities. Our results show that CANDY is able to learn aligned latent embeddings and preserved dynamics across neural recording sessions and subjects, and it achieves improved cross-session behavior decoding performance. We further show that the latent linear dynamical system generalizes to new sessions and subjects, achieving comparable or even superior behavior decoding performance to models trained from scratch. These advances enable robust cross‑session behavioral decoding and offer a path towards identifying shared neural dynamics that underlie behavior across individuals and recording conditions. The code and two-photon imaging data of striatal neural activity that we acquired here are available at https://github.com/schnitzer-lab/CANDY-public.git. Yiqi Jiang, Kaiwen Sheng, Estefany Kelly Buchanan, Yu Shikano, Seung Je Woo, Yixiu Zhao, Tony Hyun Kim, Fatih Dinc, Scott W. Linderman, Mark J. Schnitzer |
NeurIPS | 7 |
| 2025 | Informed Correctors for Discrete Diffusion ModelsabstractDiscrete diffusion has emerged as a powerful framework for generative modeling in discrete domains, yet efficiently sampling from these models remains challenging. Existing sampling strategies often struggle to balance computation and sample quality when the number of sampling steps is reduced, even when the model has learned the data distribution well. To address these limitations, we propose a predictor-corrector sampling scheme where the corrector is informed by the diffusion model to more reliably counter the accumulating approximation errors. To further enhance the effectiveness of our informed corrector, we introduce complementary architectural modifications based on hollow transformers and a simple tailored training objective that leverages more training signal. We use a synthetic example to illustrate the failure modes of existing samplers and show how informed correctors alleviate these problems. On the Text8 dataset, the informed corrector improves sample quality by generating text with significantly fewer errors than the baselines. On tokenized ImageNet 256x256, this approach consistently produces superior samples with fewer steps, achieving improved FID scores for discrete diffusion models. These results underscore the potential of informed correctors for fast and high-fidelity generation using discrete diffusion. Yixiu Zhao, Jiaxin Shi, Feng Chen 0046, Shaul Druckmann, Lester Mackey, Scott W. Linderman |
NeurIPS | 1 |
| 2023 | Revisiting Structured Variational AutoencodersabstractStructured variational autoencoders (SVAEs) combine probabilistic graphical model priors on latent variables, deep neural networks to link latent variables to observed data, and structure-exploiting algorithms for approximate posterior inference. These models are particularly appealing for sequential data, where the prior can capture temporal dependencies. However, despite their conceptual elegance, SVAEs have proven difficult to implement, and more general approaches have been favored in practice. Here, we revisit SVAEs using modern machine learning tools and demonstrate their advantages over more general alternatives in terms of both accuracy and efficiency. First, we develop a modern implementation for hardware acceleration, parallelization, and automatic differentiation of the message passing algorithms at the core of the SVAE. Second, we show that by exploiting structure in the prior, the SVAE learns more accurate models and posterior distributions, which translate into improved performance on prediction tasks. Third, we show how the SVAE can naturally handle missing data, and we leverage this ability to develop a novel, self-supervised training approach. Altogether, these results show that the time is ripe to revisit structured variational autoencoders. Yixiu Zhao, Scott W. Linderman |
ICML | 1 |
| 2018 | An integration of fast alignment and maximum-likelihood methods for electron subtomogram averaging and classificationabstractMotivation: Cellular Electron CryoTomography (CECT) is an emerging 3D imaging technique that visualizes subcellular organization of single cells at sub-molecular resolution and in near-native state. CECT captures large numbers of macromolecular complexes of highly diverse structures and abundances. However, the structural complexity and imaging limits complicate the systematic de novo structural recovery and recognition of these macromolecular complexes. Efficient and accurate reference-free subtomogram averaging and classification represent the most critical tasks for such analysis. Existing subtomogram alignment based methods are prone to the missing wedge effects and low signal-to-noise ratio (SNR). Moreover, existing maximum-likelihood based methods rely on integration operations, which are in principle computationally infeasible for accurate calculation. Results: Built on existing works, we propose an integrated method, Fast Alignment Maximum Likelihood method (FAML), which uses fast subtomogram alignment to sample sub-optimal rigid transformations. The transformations are then used to approximate integrals for maximum-likelihood update of subtomogram averages through expectation-maximization algorithm. Our tests on simulated and experimental subtomograms showed that, compared to our previously developed fast alignment method (FA), FAML is significantly more robust to noise and missing wedge effects with moderate increases of computation cost. Besides, FAML performs well with significantly fewer input subtomograms when the FA method fails. Therefore, FAML can serve as a key component for improved construction of initial structural models from macromolecules captured by CECT. Availability and implementation: http://www.cs.cmu.edu/mxu1. Yixiu Zhao, Min Xu 0009 |
Bioinform. | 1 |