Uploaded October 2026 | Updated November 2026, 3 days ago
Pradeep Ravikumar (Carnegie Mellon University)
https://simons.berkeley.edu/talks/pradeep-ravikumar-carnegie-mellon-university-2026-10-05
Trustworthy AI: From Hallucinations to Reliable Autonomy
Modern AI systems can achieve remarkable predictive and generative performance while remaining unreliable under distribution shift, novel compositions, or intervention. A fundamental reason is non-identifiability: many different internal representations and mechanisms can explain the same observed data and training objective, while implying very different behavior outside the training distribution. Thus, before asking whether a learned representation is interpretable, truthful, or causally meaningful, we should ask a more basic question: what aspects of what the model has learned are actually determined by the available evidence?
I will discuss a line of work that uses identifiability and causality as organizing principles for reliable representation learning. The central idea is that additional structure, such as sparsity, variation across environments, weak supervision, and assumptions about how causal mechanisms change, can turn otherwise underdetermined latent representations into recoverable, semantically meaningful abstractions. I will describe examples ranging from discovering latent causal variables and mechanisms to identifying interpretable concepts inside foundation models, where controlled contrasts and environmental variation can distinguish causally active concepts from merely correlated directions.
This perspective suggests a route from prediction to reliable autonomy: rather than relying solely on increasingly capable models together with post-hoc checks, we can ask what latent variables, concepts, and mechanisms are identifiable; what interventions they support; and which aspects of their behavior can therefore be expected to remain stable as the world changes.
Pradeep Ravikumar (Carnegie Mellon University)
https://simons.berkeley.edu/talks/pradeep-ravikumar-carnegie-mellon-university-2026-10-05
Trustworthy AI: From Hallucinations to Reliable Autonomy
Modern AI systems can achieve remarkable predictive and generative performance while remaining unreliable under distribution shift, novel compositions, or intervention. A fundamental reason is non-identifiability: many different internal representations and mechanisms can explain the same observed data and training objective, while implying very different behavior outside the training distribution. Thus, before asking whether a learned representation is interpretable, truthful, or causally meaningful, we should ask a more basic question: what aspects of what the model has learned are actually determined by the available evidence?
I will discuss a line of work that uses identifiability and causality as organizing principles for reliable representation learning. The central idea is that additional structure, such as sparsity, variation across environments, weak supervision, and assumptions about how causal mechanisms change, can turn otherwise underdetermined latent representations into recoverable, semantically meaningful abstractions. I will describe examples ranging from discovering latent causal variables and mechanisms to identifying interpretable concepts inside foundation models, where controlled contrasts and environmental variation can distinguish causally active concepts from merely correlated directions.
This perspective suggests a route from prediction to reliable autonomy: rather than relying solely on increasingly capable models together with post-hoc checks, we can ask what latent variables, concepts, and mechanisms are identifiable; what interventions they support; and which aspects of their behavior can therefore be expected to remain stable as the world changes.
![Ground Energy estimation of Quantum Impurity model is in BQP
Jiaqing Jiang (UC Berkeley)
https://simons.berkeley.edu/talks/jiaqing-jiang-uc-berkeley-2026-07-24
Quantum Summer Cluster Final Workshop
Estimating the ground-state energy of quantum many-body systems is a leading application of quantum computing. For general Hamiltonians, however, the problem is QMA-complete and is therefore unlikely to admit an efficient quantum algorithm. This motivates the search for natural classes of Hamiltonians whose ground-energy problem lies in BQP but is not known to lie in BPP.
In this talk, we identify quantum impurity Hamiltonians as one such class. These Hamiltonians are central to dynamical mean-field theory (DMFT), widely regarded as a gold-standard framework for studying strongly interacting quantum systems. Specifically, by explicitly constructing a guiding state, we give a polynomial-time quantum algorithm that estimates the ground-state energy of quantum impurity Hamiltonians to any inverse polynomial precision. Previously, the best unconditional upper bounds were a quasi-polynomial-time classical algorithm and containment of the corresponding decision problem in QCMA [Bravyi&Gosset arxiv:1609.00735]. Ground Energy estimation of Quantum Impurity model is in BQP](https://i.ytimg.com/vi/krqOy27VIu0/mqdefault.jpg)









