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

Peter G. Chang

dblp:368/8481 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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
Probabilistic and Bayesian machine learning · 57% Trustworthy machine learning · 22% Learning theory · 22%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
inductive bias
0.912025
What Has a Foundation Model Found? Using Inductive Bias to Probe for World Models · ICML 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
What Has a Foundation Model Found? Using Inductive Bias to Probe for World Models · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.812024
Bayesian Online Natural Gradient (BONG) · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
recursive bayesian estimation
0.812024
Bayesian Online Natural Gradient (BONG) · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.812024
Bayesian Online Natural Gradient (BONG) · NeurIPS 2024
Mathematical optimization
continuous optimization
0.812024
Bayesian Online Natural Gradient (BONG) · NeurIPS 2024
Mathematical optimization › continuous optimization › convex optimization › first-order methods › gradient-based optimization
natural gradient
0.812024
Bayesian Online Natural Gradient (BONG) · NeurIPS 2024

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

variational bayes · 1.5natural gradient descent · 1.5gaussian approximation · 1.5inductive bias probe · 0.9
YearPublicationVenuePosition
2025 What Has a Foundation Model Found? Using Inductive Bias to Probe for World Models
abstract
Foundation models are premised on the idea that sequence prediction can uncover deeper domain understanding, much like how Kepler's predictions of planetary motion later led to the discovery of Newtonian mechanics. However, evaluating whether these models truly capture deeper structure remains a challenge. We develop a technique for evaluating foundation models that examines how they adapt to synthetic datasets generated from some postulated world model. Our technique measures whether the foundation model's inductive bias aligns with the world model, and so we refer to it as an inductive bias probe. Across multiple domains, we find that foundation models can excel at their training tasks yet fail to develop inductive biases towards the underlying world model when adapted to new tasks. We particularly find that foundation models trained on orbital trajectories consistently fail to apply Newtonian mechanics when adapted to new physics tasks. Further analysis reveals that these models behave as if they develop task-specific heuristics that fail to generalize.
Keyon Vafa, Peter G. Chang, Ashesh Rambachan, Sendhil Mullainathan
ICML2
2024 Bayesian Online Natural Gradient (BONG)
abstract
We propose a novel approach to sequential Bayesian inference based on variational Bayes (VB). The key insight is that, in the online setting, we do not need to add the KL term to regularize to the prior (which comes from the posterior at the previous timestep); instead we can optimize just the expected log-likelihood, performing a single step of natural gradient descent starting at the prior predictive. We prove this method recovers exact Bayesian inference if the model is conjugate. We also show how to compute an efficient deterministic approximation to the VB objective, as well as our simplified objective, when the variational distribution is Gaussian or a sub-family, including the case of a diagonal plus low-rank precision matrix. We show empirically that our method outperforms other online VB methods in the non-conjugate setting, such as online learning for neural networks, especially when controlling for computational costs.
Matt Jones 0002, Peter G. Chang, Kevin Murphy 0002
NeurIPS2