Seminars

Liver toxicity can emerge late in drug development when early assays fail to capture human biology, exposure or injury mechanisms. This webinar introduces Axiom’s hepatic profiling approach, combining multicellular liver systems, high-content imaging, transcriptomics, proteomics and ADME measurements. Its reasoning agent integrates those results with partner assays, chemical-series context, exposure estimates and clinical evidence to assess mechanistic liver-safety risks. Rather than using a single cell-toxicity score, the approach develops interpretable, series-specific structure–toxicity hypotheses, compares analogues, ranks compounds and suggests follow-up experiments or structural changes. Performance on established liver-injury reference compounds and newer molecules is examined through case studies, showing how multimodal evidence can inform medicinal-chemistry decisions and predicted therapeutic index.

Deep networks are often thought of as black boxes. Their ability to encompass vast swathes of knowledge indeed makes them hard to explain. Yet many of their behaviours — generalization under overparametrization, grokking, OOD failures, neural scaling laws — recur across architectures and scales, and each, however surprising, can be reproduced and explained in controlled settings. I will review these efforts to identify and explain the universal phenomena of deep learning, and suggest that an LLM may amount to a sum of such tractable sub-phenomena, interpolative in nature. Finally, leaving scientific rigor aside, I'll argue that what separates this prosaic picture from the apparent magic of LLMs may well be the industrial scale of compute and human labour behind it, and that AGI in its deeper extrapolative sense may be much further away than claimed.

Jan Kosinski explains how AlphaFold-style methods predict protein complexes and why their reliance on evolutionary information makes interactions between host and pathogen proteins especially difficult. The talk reviews large-scale studies, interpreting both successful predictions and failures rather than treating reported success rates as universal performance. It then examines ways to improve predictions through broader sampling, altered sequence alignments and experimental restraints, including crosslinking mass spectrometry, with influenza A virus as a worked research example. The session is suitable for students and researchers interested in host-pathogen interactions and structural bioinformatics; basic knowledge of protein structures and sequence alignments is useful, but prior AlphaFold experience is unnecessary.

Robot missions require both collision-free trajectories and logical task ordering, such as collecting a resource before entering a restricted region. Augmented graphs of convex sets combine continuous trajectory optimization and discrete task sequencing in one problem. A layered graph constructed from an exact convex partition of free space selects an optimal task order and trajectory through a shortest-path calculation, exact up to finite Bézier parameterization. Its structure corresponds to Bellman–Held–Karp dynamic programming for the travelling-salesperson problem, retaining singly exponential worst-case complexity and improving exponentially on general temporal-logic tools. A library of specifications covers ordered collection, alternative keys, combined prerequisites, timing and conditional logic with correctness guarantees. Numerical benchmarks demonstrate exponential speedups and near-global optimality. Possible extensions include moving environments, safety-aware planning with conformal prediction sets and a large galactic-survey benchmark.

Yixuan He (Arizona State University) considers graph neural networks for social, financial and biological networks in which edge signs and directions contain information needed for clustering and prediction. After an introduction to graph neural networks, the talk explains how signed and directed methods preserve relationships lost when every connection is treated as unsigned and undirected. The seminar then asks when a representation learned before the final task can transfer to a different graph or to a setting with few labels. Two theoretical perspectives address transfer across graph domains and the use of link prediction for linear community detection. TopoDIG and TopoSIGN combine encoders that preserve edge structure with persistent topological features, enabling pre-training and prompt-based adaptation on directed and signed networks.

Ivo D. Dinov examines augmented intelligence as a partnership between people and computational systems. The talk traces the technical and philosophical development of neural networks, then introduces complex-time, or kime, representations and the inference methods they support. Applications include medical imaging, healthcare and economic forecasting. It also considers the academic mission, societal consequences of AI and tensions between rapid technical development and human values, framing mathematical AI methods as extensions of human reasoning. Free hybrid seminar hosted by Wayne State University's Institute for AI and Data Science, AIDaS: CAD Seminar Series. Wednesday 30 September 2026, 14:30–15:30 EDT (America/Detroit; UTC−4). Attend in Room 1146, Faculty/Administration Building, 656 W. Kirby, Detroit, MI 48202, USA, or use the Zoom link on the official event page. Researchers, practitioners, students and faculty are welcome; the organizer encourages in-person attendance.

Irene Rombel discusses how artificial intelligence and machine learning can address bottlenecks, quality issues, and production costs in cell, gene, and RNA therapy manufacturing. The seminar focuses on real-world process-development applications that improve reproducibility, speed, and cost effectiveness.

Florian Marquardt surveys approaches to reducing the energy and computational cost of neural networks by implementing their functions in physical devices. The central question is how experiments can efficiently determine updates to adjustable parameters, allowing the hardware itself to learn. Examples include learning through time reversal, obtaining nonlinear computation from linear optical scattering, and training analog quantum simulators as neuromorphic systems. The seminar is available in person and through the registration link on the organizer’s event page.

Qihao Ye examines practical, affordable ways for individual mathematicians to use AI in literature searches, proof development and verification. The talk identifies seven recurring failure modes and introduces the open-source QED multi-agent system designed to address them. A case study on constructing Carleman weights for wave equations on the half-line shows how automated search can be combined with a researcher’s mathematical insight and rigorous checking. The organizer links both the implementation and the accompanying research paper. Online via Rutgers DIMACS Zoom. Wednesday 23 September 2026, 10:00–11:00 EDT (America/New_York; UTC−4). Use the Zoom link and passcode on the official event page. Organized by the DIMACS AI and Mathematics Seminar. This listing advertises the verified remote attendance option.

ISTA Lecture by Klaus Robert Müller (TU Berlin & Korea University, Seoul) on how machine learning and AI enable scientific research, particularly in medicine and chemistry, and on explainability techniques for extracting understanding from machine learning models.

Tal Linzen, an associate professor of linguistics and data science at New York University and a research scientist at Google, will speak in MIT's Siegel Family Quest for Intelligence seminar series. His work combines behavioral experiments and computational methods to study language learning and comprehension, alongside large-language-model post-training, evaluation, and interpretability.

Michelle M. Li examines how computational analyses can preserve the biological context of a proposed treatment, including cell type, disease state, genetic background and patient characteristics. She introduces Medea, an AI system that combines biological software, predictive models and literature retrieval while checking intermediate steps and reconciling evidence. The seminar presents evaluations involving cell-specific target selection, cancer-cell synthetic lethality and immunotherapy response. A separate yeast experiment tests predictions against previously unpublished measurements of gene-pair interactions under DNA-damaging treatments. The research addresses whether an agent can transfer useful evidence between contexts while recognizing when that transfer is unsupported. Reported comparisons cover predictive performance, computational failures and the ability to abstain. This recording retains the original seminar date.

Useful internal representations should explain the patterns of regularities and dependencies among observations. Probabilistic graphical models promise a principled way to uncover latent factors as such, but they are hard to scale to handle high-dimensional sensory observations and complicated dependencies structures. Neural-networks, on the other hand, excel at approximating complicated high-dimensional functions, but their internal representations do not easily lend themselves to a probabilistic interpretation. Despite some successes, a general unified approach is still missing for integrating the two approaches. I will describe a novel approach towards merging adaptive neural-network components into a probabilistic framework, based on three core ideas. The first is to train a set of networks to collectively perform inference, leveraging the ability of pattern-recognition methods to amortise complicated transformations. The second is to constrain the way in which the outputs of these networks are interpreted, transformed, and combined together. These constraints, together with the learning objective itself, are derived directly from probabilistic considerations encoded in a graphical model. Finally, the third core idea is that of recognition-parametrisation, allowing the inference ("recognition") procedure to directly define the model itself, without requiring an explicit "generative" decoder. Presented in the van Vreeswijk Theoretical Neuroscience Seminar series (formerly WWTNS) on 2026-03-04. Recording duration: 00:48:26.

Current machine learning systems consume vastly more energy than biological brains. Neuromorphic systems aim to overcome this difference by mimicking the brain’s information coding via discrete voltage spikes. However, it remains unclear how both artificial and natural networks of spiking neurons can learn energy-efficient information processing strategies. Here we propose Predictive Coding Light (PCL), a recurrent hierarchical spiking neural network for unsupervised representation learning. In contrast to previous predictive coding approaches, PCL does not transmit prediction errors to higher processing stages. Instead, it suppresses the most predictable spikes and transmits a compressed representation of the input. Using only biologically plausible spike-timing based learning rules, PCL reproduces a wealth of findings on information processing in visual cortex and permits strong performance in downstream classification tasks. Overall, PCL offers a new approach to predictive coding and its implementation in natural and artificial spiking neural networks

Understanding the neural mechanisms of reward-guided learning is a long-standing goal of computational neuroscience. Recent methodological innovations enable us to collect ever larger neural and behavioral datasets. This presents opportunities to achieve greater understanding of learning in the brain at scale, as well as methodological challenges. In the first part of the talk, I will discuss our recent insights into the mechanisms by which zebra finch songbirds learn to sing. Dopamine has been long thought to guide reward-based trial-and-error learning by encoding reward prediction errors. However, it is unknown whether the learning of natural behaviours, such as developmental vocal learning, occurs through dopamine-based reinforcement. Longitudinal recordings of dopamine and bird songs reveal that dopamine activity is indeed consistent with encoding a reward prediction error during naturalistic learning. In the second part of the talk, I will talk about recent work we are doing at DeepMind to develop tools for automatically discovering interpretable models of behavior directly from animal choice data. Our method, dubbed CogFunSearch, uses LLMs within an evolutionary search process in order to "discover" novel models in the form of Python programs that excel at accurately predicting animal behavior during reward-guided learning. The discovered programs reveal novel patterns of learning and choice behavior that update our understanding of how the brain solves reinforcement learning problems.

Synthetic face datasets are increasingly used to overcome the limitations of real-world biometric data, including privacy concerns, demographic imbalance, and high collection costs. However, many existing methods lack fine-grained control over identity attributes and fail to produce paired, identity-consistent images under structured capture conditions. In this talk, I will present FLUXSynID, a framework for generating high-resolution synthetic face datasets with user-defined identity attribute distributions and paired document-style and trusted live capture images. The dataset generated using FLUXSynID shows improved alignment with real-world identity distributions and greater diversity compared to prior work. I will also discuss how FLUXSynID’s dataset and generation tools can support research in face recognition and morphing attack detection (MAD), enhancing model robustness in both academic and practical applications.

In a first part of the talk, I will present Predictive Coding Light (PCL), a novel unsupervised learning architecture for spiking neural networks. In contrast to conventional predictive coding approaches, which only transmit prediction errors to higher processing stages, PCL learns inhibitory lateral and top-down connectivity to suppress the most predictable spikes and passes a compressed representation of the input to higher processing stages. We show that PCL reproduces a range of biological findings and exhibits a favorable tradeoff between energy consumption and downstream classification performance on challenging benchmarks. A second part of the talk will feature our lab’s efforts to explain how infants and toddlers might learn abstract object representations without supervision. I will present deep learning models that exploit the temporal and multimodal structure of their sensory inputs to learn representations of individual objects, object categories, or abstract super-categories such as „kitchen object“ in a fully unsupervised fashion. These models offer a parsimonious account of how abstract semantic knowledge may be rooted in children's embodied first-person experiences.

Susan Athey examines how machine learning and digital interventions can help explain and improve workers’ transitions between jobs. One project uses Swedish administrative data to identify groups whose earnings and employment are less resilient after layoffs, revealing substantial differences among workers within the same firms and labour markets. A second line of work uses transformer models and large language models to represent careers and analyse gender wage gaps, identifying settings in which large unexplained differences persist. Two further projects develop and evaluate digital interventions intended to help disadvantaged workers enter expanding occupations in information technology and data science. The lecture connects new methods for measuring labour-market disadvantage with evidence about practical interventions.

This webinar convened researchers at the intersection of Artificial Intelligence and Neuroscience to investigate how large language models (LLMs) can serve as valuable “model organisms” for understanding human language processing. Presenters showcased evidence that brain recordings (fMRI, MEG, ECoG) acquired while participants read or listened to unconstrained speech can be predicted by representations extracted from state-of-the-art text- and speech-based LLMs. In particular, text-based LLMs tend to align better with higher-level language regions, capturing more semantic aspects, while speech-based LLMs excel at explaining early auditory cortical responses. However, purely low-level features can drive part of these alignments, complicating interpretations. New methods, including perturbation analyses, highlight which linguistic variables matter for each cortical area and time scale. Further, “brain tuning” of LLMs—fine-tuning on measured neural signals—can improve semantic representations and downstream language tasks. Despite open questions about interpretability and exact neural mechanisms, these results demonstrate that LLMs provide a promising framework for probing the computations underlying human language comprehension and production at multiple spatiotemporal scales.

Recent high-profile scientific achievements by machine learning (ML) and especially deep learning (DL) systems have reinvigorated interest in ML for automated scientific discovery (eg, Wang et al. 2023). Much of this work is motivated by the thought that DL methods might facilitate the efficient discovery of phenomena, hypotheses, or even models or theories more efficiently than traditional, theory-driven approaches to discovery. This talk considers some of the more specific obstacles to automated, DL-driven discovery in frontier science, focusing on gravitational-wave astrophysics (GWA) as a representative case study. In the first part of the talk, we argue that despite these efforts, prospects for DL-driven discovery in GWA remain uncertain. In the second part, we advocate a shift in focus towards the ways DL can be used to augment or enhance existing discovery methods, and the epistemic virtues and vices associated with these uses. We argue that the primary epistemic virtue of many such uses is to decrease opportunity costs associated with investigating puzzling or anomalous signals, and that the right framework for evaluating these uses comes from philosophical work on pursuitworthiness.