Portrait of Anna (Cheng-Zhi) Huang

Anna (Cheng-Zhi) Huang

Core Industry Member
Canada CIFAR AI Chair
Adjunct professor, Université de Montréal, Department of Computer Science and Operations Research
Research Scientist, Google Brain

Biography

Anna Huang is a research scientist at Google DeepMind, where she works on the Magenta Project. She is also an adjunct professor at Université de Montréal. Her research focuses on designing generative models and interfaces to support music making and, more generally, the creative process. Her work lies at the intersection of machine learning, human-computer interaction and music.

Huang is the creator of Music Transformer and Coconet, the ML model that powered Google’s first AI Doodle, the Bach Doodle, which in two days harmonized 55 million melodies from users around the world. She has been an organizer and judge for the international AI Song Contest for the past few years, and was a guest editor for TISMIR's special issue on AI and musical creativity.

Huang has a PhD from Harvard University, an MSc from the MIT Media Lab, and a dual bachelor's degree in computer science and music composition from the University of Southern California.

Current Students

Master's Research - Université de Montréal
PhD - Université de Montréal
Co-supervisor :

Publications

Grammar Generative Models for Music Notation
Deep generative models have been successfully applied in many learning experiments with digital data, such as images or audio. In the field … (see more)of music, they can also be used to generate symbolic representations, in the context of problems such as automatic music generation or transcription [1-3]. A significant challenge for generating structured symbolic data in general is obtaining well-formed results. This is especially true in the case of music. It is indeed widely accepted that musical notation represents, well beyond simple sequences of notes, a hierarchical organization of melodic and harmonic information, inducing non-local dependencies between musical objects [4]. A good representation of this information is essential for the interpretation and analysis of music pieces.
Improving Source Separation by Explicitly Modeling Dependencies between Sources
Ethan Manilow
Curtis Hawthorne
Bryan Pardo
Jesse Engel
We propose a new method for training a supervised source separation system that aims to learn the interdependent relationships between all c… (see more)ombinations of sources in a mixture. Rather than independently estimating each source from a mix, we reframe the source separation problem as an Orderless Neural Autoregressive Density Estimator (NADE), and estimate each source from both the mix and a random subset of the other sources. We adapt a standard source separation architecture, Demucs, with additional inputs for each individual source, in addition to the input mixture. We randomly mask these input sources during training so that the network learns the conditional dependencies between the sources. By pairing this training method with a blocked Gibbs sampling procedure at inference time, we demonstrate that the network can iteratively improve its separation performance by conditioning a source estimate on its earlier source estimates. Experiments on two source separation datasets show that training a Demucs model with an Orderless NADE approach and using Gibbs sampling (up to 512 steps) at inference time strongly outperforms a Demucs baseline that uses a standard regression loss and direct (one step) estimation of sources.
Improving Source Separation by Explicitly Modeling Dependencies between Sources
Ethan Manilow
Curtis Hawthorne
Bryan A. Pardo
Jesse Engel
We propose a new method for training a supervised source separation system that aims to learn the interdependent relationships between all c… (see more)ombinations of sources in a mixture. Rather than independently estimating each source from a mix, we reframe the source separation problem as an Orderless Neural Autoregressive Density Estimator (NADE), and estimate each source from both the mix and a random subset of the other sources. We adapt a standard source separation architecture, Demucs, with additional inputs for each individual source, in addition to the input mixture. We randomly mask these input sources during training so that the network learns the conditional dependencies between the sources. By pairing this training method with a blocked Gibbs sampling procedure at inference time, we demonstrate that the network can iteratively improve its separation performance by conditioning a source estimate on its earlier source estimates. Experiments on two source separation datasets show that training a Demucs model with an Orderless NADE approach and using Gibbs sampling (up to 512 steps) at inference time strongly outperforms a Demucs baseline that uses a standard regression loss and direct (one step) estimation of sources.