Demo Data from EDBT 2026 / reviewers in the wild / expert
Aye Phyu Phyu Aung
dblp:266/4628
· DBLP profile ↗
5ranked-venue papers
3as first author
5since 2021 · last 2025
0000-0001-9064-1730ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 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.
| Artificial intelligence
2 papers |
Generative modeling · 50% Trustworthy machine learning · 38% Multi-agent systems · 12% | |
| Theoretical computer science
2 papers |
Algorithmic game theory and mechanism design · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
generative adversarial network |
1.4 | 2 | 2025 | Double Oracle Neural Architecture Search for Game Theoretic Deep Learning Models · IEEE Trans. Image Process. 2025 DO-GAN: A Double Oracle Framework for Generative Adversarial Networks · CVPR 2022 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.9 | 1 | 2025 | Double Oracle Neural Architecture Search for Game Theoretic Deep Learning Models · IEEE Trans. Image Process. 2025 |
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training |
0.9 | 1 | 2025 | Double Oracle Neural Architecture Search for Game Theoretic Deep Learning Models · IEEE Trans. Image Process. 2025 |
Machine learning › Generative modeling › generative adversarial network
neural architecture search for GANs |
0.9 | 1 | 2025 | Double Oracle Neural Architecture Search for Game Theoretic Deep Learning Models · IEEE Trans. Image Process. 2025 |
Algorithmic game theory and mechanism design › equilibrium computation
double oracle algorithm |
0.9 | 1 | 2025 | Double Oracle Neural Architecture Search for Game Theoretic Deep Learning Models · IEEE Trans. Image Process. 2025 |
Knowledge, reasoning and agents › Multi-agent systems
double oracle |
0.6 | 1 | 2022 | DO-GAN: A Double Oracle Framework for Generative Adversarial Networks · CVPR 2022 |
Algorithmic game theory and mechanism design › equilibrium computation
nash equilibrium computation |
0.2 | 1 | 2022 | DO-GAN: A Double Oracle Framework for Generative Adversarial Networks · CVPR 2022 |
Methods — techniques the papers use, named apart from their topics
linear programming · 2.9nash equilibrium · 1.7double oracle framework · 1.7best response oracle · 1.7pruning · 1.1double oracle · 1.1continual learning · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Caption, Create, Continue: Continual Learning with Pre-trained Generative Vision-Language Models
Indu Solomon, Aye Phyu Phyu Aung, Uttam Kumar 0001, J. Senthilnath 0001 |
CIKM | 2 |
| 2025 | Double Oracle Neural Architecture Search for Game Theoretic Deep Learning ModelsabstractIn this paper, we propose a new approach to train deep learning models using game theory concepts including Generative Adversarial Networks (GANs) and Adversarial Training (AT) where we deploy a double-oracle framework using best response oracles. GAN is essentially a two-player zero-sum game between the generator and the discriminator. The same concept can be applied to AT with attacker and classifier as players. Training these models is challenging as a pure Nash equilibrium may not exist and even finding the mixed Nash equilibrium is difficult as training algorithms for both GAN and AT have a large-scale strategy space. Extending our preliminary model DO-GAN, we propose the methods to apply the double oracle framework concept to Adversarial Neural Architecture Search (NAS for GAN) and Adversarial Training (NAS for AT) algorithms. We first generalize the players' strategies as the trained models of generator and discriminator from the best response oracles. We then compute the meta-strategies using a linear program. For scalability of the framework where multiple network models of best responses are stored in the memory, we prune the weakly-dominated players' strategies to keep the oracles from becoming intractable. Finally, we conduct experiments on MNIST, CIFAR-10 and TinyImageNet for DONAS-GAN. We also evaluate the robustness under FGSM and PGD attacks on CIFAR-10, SVHN and TinyImageNet for DONAS-AT. We show that all our variants have significant improvements in both subjective qualitative evaluation and quantitative metrics, compared with their respective base architectures. Aye Phyu Phyu Aung, Xinrun Wang, Hau Chan, Bo An 0001, Xiaoli Li 0001, J. Senthilnath 0001 |
IEEE Trans. Image Process. | 1 |
| 2024 | U-Tell: Unsupervised Task Expert Lifelong LearningabstractContinual learning (CL) models are designed to learn new tasks arriving sequentially without re-training the network. However, real-world ML applications have very limited label information and these models suffer from catastrophic forgetting. To address these issues, we propose an unsupervised CL model with task experts called Unsupervised Task Expert Lifelong Learning (U-TELL) to continually learn the data arriving in a sequence addressing catastrophic forgetting. During training of U-TELL, we introduce a new expert on arrival of a new task. Our proposed architecture has task experts, a structured data generator and a task assigner. Each task expert is composed of 3 blocks; i) a variational autoencoder to capture the task distribution and perform data abstraction, ii) a k-means clustering module, and iii) a structure extractor to preserve latent task data signature. During testing, task assigner selects a suitable expert to perform clustering. U-TELL does not store or replay task samples, instead, we use generated structured samples to train the task assigner. We compared U-TELL with five SOTA CL methods. U-TELL outperformed all baselines on seven benchmarks and one industry dataset for various CL scenarios with a training time over 6 times faster than the best performing baseline. Indu Solomon, Aye Phyu Phyu Aung, Uttam Kumar 0001, J. Senthilnath 0001 |
ICIP | 2 |
| 2022 | DO-GAN: A Double Oracle Framework for Generative Adversarial NetworksabstractIn this paper, we propose a new approach to train Gen-erative Adversarial Networks (GANs) where we deploy a double-oracle framework using the generator and discrim-inator oracles. GAN is essentially a two-player zero-sum game between the generator and the discriminator. Training GANs is challenging as a pure Nash equilibrium may not exist and even finding the mixed Nash equilibrium is difficult as GANs have a large-scale strategy space. In DO-GAN, we extend the double oracle framework to GANs. We first generalize the players' strategies as the trained models of generator and discriminator from the best response or-acles. We then compute the meta-strategies using a linear program. For scalability of the framework where multi-ple generators and discriminator best responses are stored in the memory, we propose two solutions: 1) pruning the weakly-dominated players' strategies to keep the oracles from becoming intractable; 2) applying continual learning to retain the previous knowledge of the networks. We apply our framework to established GAN architectures such as vanilla GAN, Deep Convolutional GAN, Spectral Normalization GAN and Stacked GAN. Finally, we conduct experiments on MNIST, CIFAR-10 and CelebA datasets and show that DO-GAN variants have significant improvements in both subjective qualitative evaluation and quantitative metrics, compared with their respective GAN architectures. Aye Phyu Phyu Aung, Xinrun Wang, Runsheng Yu, Bo An 0001, J. Senthilnath 0001, Xiaoli Li 0001 |
CVPR | 1 |
| 2022 | Planning sequential interventions to tackle depression in large uncertain social networks using deep reinforcement learning
Aye Phyu Phyu Aung, J. Senthilnath 0001, Xiaoli Li 0001, Bo An 0001 |
Neurocomputing | 1 |