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

Michael S. Yao

dblp:327/9549 · DBLP profile ↗
← Back
3ranked-venue papers
2as 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 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
3 papers
Optimization for machine learning · 54% Trustworthy machine learning · 20% Transfer learning and domain adaptation · 12%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
model-based optimization
1.622025
Diversity By Design: Leveraging Distribution Matching for Offline Model-Based Optimization · ICML 2025
Generative Adversarial Model-Based Optimization via Source Critic Regularization · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation
distribution matching
0.912025
Diversity By Design: Leveraging Distribution Matching for Offline Model-Based Optimization · ICML 2025
Machine learning › Optimization for machine learning › model-based optimization
offline model-based optimization
0.912025
Diversity By Design: Leveraging Distribution Matching for Offline Model-Based Optimization · ICML 2025
Machine learning › Trustworthy machine learning › adversarial machine learning › adversarial defense
adversarial regularization
0.812024
Generative Adversarial Model-Based Optimization via Source Critic Regularization · NeurIPS 2024
Machine learning › Generative modeling › computational creativity › creative generation
design generation
0.812024
Generative Adversarial Model-Based Optimization via Source Critic Regularization · NeurIPS 2024
Machine learning › Optimization for machine learning › optimization
offline optimization
0.812024
Generative Adversarial Model-Based Optimization via Source Critic Regularization · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
A Textbook Remedy for Domain Shifts: Knowledge Priors for Medical Image Analysis · NeurIPS 2024
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
surrogate model
0.812024
Generative Adversarial Model-Based Optimization via Source Critic Regularization · NeurIPS 2024
Medical and health informatics › medical imaging
medical image analysis
0.812024
A Textbook Remedy for Domain Shifts: Knowledge Priors for Medical Image Analysis · NeurIPS 2024
Natural language and speech › Language models and text generation
retrieval-augmented language models
0.212024
A Textbook Remedy for Domain Shifts: Knowledge Priors for Medical Image Analysis · NeurIPS 2024

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

retrieval-augmented language model · 1.5concept bottleneck model · 1.5distribution matching · 0.9adversarial optimization · 0.9bayesian optimization · 0.8adversarial regularization · 0.8
YearPublicationVenuePosition
2025 Diversity By Design: Leveraging Distribution Matching for Offline Model-Based Optimization
abstract
The goal of offline model-based optimization (MBO) is to propose new designs that maximize a reward function given only an offline dataset. However, an important desiderata is to also propose a *diverse* set of final candidates that capture many optimal and near-optimal design configurations. We propose **D**iversit**y** I**n** **A**dversarial **M**odel-based **O**ptimization (**DynAMO**) as a novel method to introduce design diversity as an explicit objective into any MBO problem. Our key insight is to formulate diversity as a *distribution matching problem* where the distribution of generated designs captures the inherent diversity contained within the offline dataset. Extensive experiments spanning multiple scientific domains show that DynAMO can be used with common optimization methods to significantly improve the diversity of proposed designs while still discovering high-quality candidates.
Michael S. Yao, James C. Gee, Osbert Bastani
ICML1
2024 A Textbook Remedy for Domain Shifts: Knowledge Priors for Medical Image Analysis
abstract
While deep networks have achieved broad success in analyzing natural images, when applied to medical scans, they often fail in unexcepted situations. We investigate this challenge and focus on model sensitivity to domain shifts, such as data sampled from different hospitals or data confounded by demographic variables such as sex, race, etc, in the context of chest X-rays and skin lesion images. A key finding we show empirically is that existing visual backbones lack an appropriate prior from the architecture for reliable generalization in these settings. Taking inspiration from medical training, we propose giving deep networks a prior grounded in explicit medical knowledge communicated in natural language. To this end, we introduce Knowledge-enhanced Bottlenecks (KnoBo), a class of concept bottleneck models that incorporates knowledge priors that constrain it to reason with clinically relevant factors found in medical textbooks or PubMed. KnoBo uses retrieval-augmented language models to design an appropriate concept space paired with an automatic training procedure for recognizing the concept. We evaluate different resources of knowledge and recognition architectures on a broad range of domain shifts across 20 datasets. In our comprehensive evaluation with two imaging modalities, KnoBo outperforms fine-tuned models on confounded datasets by 32.4% on average. Finally, evaluations reveal that PubMed is a promising resource for making medical models less sensitive to domain shift, outperforming other resources on both diversity of information and final prediction performance.
Yue Yang 0006, Mona Gandhi, Michael S. Yao, Chris Callison-Burch, James C. Gee, Mark Yatskar
NeurIPS5
2024 Generative Adversarial Model-Based Optimization via Source Critic Regularization
abstract
Offline model-based optimization seeks to optimize against a learned surrogate model without querying the true oracle objective function during optimization. Such tasks are commonly encountered in protein design, robotics, and clinical medicine where evaluating the oracle function is prohibitively expensive. However, inaccurate surrogate model predictions are frequently encountered along offline optimization trajectories. To address this limitation, we propose *generative adversarial model-based optimization* using **adaptive source critic regularization (aSCR)**—a task- and optimizer- agnostic framework for constraining the optimization trajectory to regions of the design space where the surrogate function is reliable. We propose a computationally tractable algorithm to dynamically adjust the strength of this constraint, and show how leveraging aSCR with standard Bayesian optimization outperforms existing methods on a suite of offline generative design tasks. Our code is available at https://github.com/michael-s-yao/gabo.
Michael S. Yao, Yimeng Zeng, Hamsa Bastani, Jacob R. Gardner, James C. Gee, Osbert Bastani
NeurIPS1