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

Miaoyun Zhao

dblp:146/8434 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 8 · 4 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 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
5 papers
Probabilistic and Bayesian machine learning · 24% Optimization for machine learning · 24% Generative modeling · 22%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
generative adversarial network
0.922020
GAN Memory with No Forgetting · NeurIPS 2020
On Leveraging Pretrained GANs for Generation with Limited Data · ICML 2020
Machine learning › Optimization for machine learning › second-order optimization
hessian approximation
0.512021
GO Hessian for Expectation-Based Objectives · AAAI 2021
Machine learning › Optimization for machine learning
second-order optimization
0.512021
GO Hessian for Expectation-Based Objectives · AAAI 2021
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training
0.412020
Bridging Maximum Likelihood and Adversarial Learning via α-Divergence · AAAI 2020
Machine learning › Probabilistic and Bayesian machine learning › divergence measure
alpha-divergence
0.412020
Bridging Maximum Likelihood and Adversarial Learning via α-Divergence · AAAI 2020
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.412020
GAN Memory with No Forgetting · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › divergence minimization
divergence-based training
0.412020
Bridging Maximum Likelihood and Adversarial Learning via α-Divergence · AAAI 2020
Machine learning › Learning paradigms
lifelong learning
0.412020
GAN Memory with No Forgetting · NeurIPS 2020
Machine learning › Generative modeling
maximum likelihood learning
0.412020
Bridging Maximum Likelihood and Adversarial Learning via α-Divergence · AAAI 2020
Machine learning › Transfer learning and domain adaptation › foundation model adaptation
pre-trained model adaptation
0.412020
On Leveraging Pretrained GANs for Generation with Limited Data · ICML 2020
Machine learning › Optimization for machine learning
gradient estimation
0.412019
GO Gradient for Expectation-Based Objectives · ICLR (Poster) 2019

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

hessian approximation · 0.5gauss-newton · 0.5α-divergence · 0.4transfer learning · 0.4style modulation · 0.4maximum likelihood estimation · 0.4generative replay · 0.4adversarial training · 0.4adaptive filter modulation · 0.4
YearPublicationVenuePosition
2024 Text Feature Adversarial Learning for Text Generation With Knowledge Transfer From GPT2
abstract
Text generation is a key component of many natural language tasks. Motivated by the success of generative adversarial networks (GANs) for image generation, many text-specific GANs have been proposed. However, due to the discrete nature of text, these text GANs often use reinforcement learning (RL) or continuous relaxations to calculate gradients during learning, leading to high-variance or biased estimation. Furthermore, the existing text GANs often suffer from mode collapse (i.e., they have limited generative diversity). To tackle these problems, we propose a new text GAN model named text feature GAN (TFGAN), where adversarial learning is performed in a continuous text feature space. In the adversarial game, GPT2 provides the "true" features, while the generator of TFGAN learns from them. TFGAN is trained by maximum likelihood estimation on text space and adversarial learning on text feature space, effectively combining them into a single objective, while alleviating mode collapse. TFGAN achieves appealing performance in text generation tasks, and it can also be used as a flexible framework for learning text representations.
Hao Zhang 0050, Yulai Cong, Zhengjue Wang, Miaoyun Zhao, Liqun Chen 0001, Shijing Si, Ricardo Henao, Lawrence Carin
IEEE Trans. Neural Networks Learn. Syst.5
2021 GO Hessian for Expectation-Based Objectives
Yulai Cong, Miaoyun Zhao, Jianqiao Li, Junya Chen, Lawrence Carin
AAAI2
2020 Bridging Maximum Likelihood and Adversarial Learning via α-Divergence
abstract
Maximum likelihood (ML) and adversarial learning are two popular approaches for training generative models, and from many perspectives these techniques are complementary. ML learning encourages the capture of all data modes, and it is typically characterized by stable training. However, ML learning tends to distribute probability mass diffusely over the data space, e.g., yielding blurry synthetic images. Adversarial learning is well known to synthesize highly realistic natural images, despite practical challenges like mode dropping and delicate training. We propose an α-Bridge to unify the advantages of ML and adversarial learning, enabling the smooth transfer from one to the other via the α-divergence. We reveal that generalizations of the α-Bridge are closely related to approaches developed recently to regularize adversarial learning, providing insights into that prior work, and further understanding of why the α-Bridge performs well in practice.
Miaoyun Zhao, Yulai Cong, Shuyang Dai, Lawrence Carin
AAAI1
2020 On Leveraging Pretrained GANs for Generation with Limited Data
abstract
Recent work has shown generative adversarial networks (GANs) can generate highly realistic images, that are often indistinguishable (by humans) from real images. Most images so generated are not contained in the training dataset, suggesting potential for augmenting training sets with GAN-generated data. While this scenario is of particular relevance when there are limited data available, there is still the issue of training the GAN itself based on that limited data. To facilitate this, we leverage existing GAN models pretrained on large-scale datasets (like ImageNet) to introduce additional knowledge (which may not exist within the limited data), following the concept of transfer learning. Demonstrated by natural-image generation, we reveal that low-level filters (those close to observations) of both the generator and discriminator of pretrained GANs can be transferred to facilitate generation in a perceptually-distinct target domain with limited training data. To further adapt the transferred filters to the target domain, we propose adaptive filter modulation (AdaFM). An extensive set of experiments is presented to demonstrate the effectiveness of the proposed techniques on generation with limited data.
Miaoyun Zhao, Yulai Cong, Lawrence Carin
ICML1
2020 GAN Memory with No Forgetting
abstract
As a fundamental issue in lifelong learning, catastrophic forgetting is directly caused by inaccessible historical data; accordingly, if the data (information) were memorized perfectly, no forgetting should be expected. Motivated by that, we propose a GAN memory for lifelong learning, which is capable of remembering a stream of datasets via generative processes, with \emph{no} forgetting. Our GAN memory is based on recognizing that one can modulate the ``style'' of a GAN model to form perceptually-distant targeted generation. Accordingly, we propose to do sequential style modulations atop a well-behaved base GAN model, to form sequential targeted generative models, while simultaneously benefiting from the transferred base knowledge. The GAN memory -- that is motivated by lifelong learning -- is therefore itself manifested by a form of lifelong learning, via forward transfer and modulation of information from prior tasks. Experiments demonstrate the superiority of our method over existing approaches and its effectiveness in alleviating catastrophic forgetting for lifelong classification problems. Code is available at \url{https://github.com/MiaoyunZhao/GANmemory_LifelongLearning}.
Yulai Cong, Miaoyun Zhao, Jianqiao Li, Lawrence Carin
NeurIPS2
2019 GO Gradient for Expectation-Based Objectives
Yulai Cong, Miaoyun Zhao, Ke Bai 0001, Lawrence Carin
ICLR (Poster)2
2018 Craniomaxillofacial Bony Structures Segmentation from MRI with Deep-Supervision Adversarial Learning
Miaoyun Zhao, Li Wang 0026, Jiawei Chen 0001, Dong Nie, Yulai Cong, Sahar Ahmad, Angela Ho, Peng Yuan 0001, Steve H. Fung, Hannah H. Deng, James J. Xia, Dinggang Shen
MICCAI (4)1
2016 Classification and saliency detection by semi-supervised low-rank representation
Miaoyun Zhao, Licheng Jiao, Wenping Ma 0001, Hongying Liu 0001, Shuyuan Yang 0001
Pattern Recognit.1
2014 A simplified low rank and sparse graph for semi-supervised learning
Miaoyun Zhao, Licheng Jiao, Jie Feng 0003
Neurocomputing1