Seminars

Vasileios Kalantzis develops iterative linear algebra algorithms that tolerate incomplete matrix-vector products in controller-worker cloud systems. Richardson and Chebyshev schemes solve linear systems using randomly available product entries, replacing missing entries with zero. For dominant eigenvectors, modified power iterations substitute zeros, previous entries, or averages of partial iterates for delayed components. The talk presents convergence results in expectation and numerical experiments on sparse matrices for both problem classes.

Evan Coleman studies how asynchronous solvers can recover convergence quality while tolerating stale data, stragglers, and variable delays. At the coordinator, Anderson acceleration connects asynchronous stationary iterations to Krylov methods with changing preconditioners and flexible GMRES. Controlled-delay experiments on high-performance computing infrastructure show that its effectiveness depends on the iteration's coupling density. At the worker, residual-weighted randomized coordinate descent includes Boltzmann weights that interpolate between uniform and greedy selection while preserving convergence guarantees. Both approaches seek better use of computation when information is inconsistent.

Daniel Szyld extends randomized point and block Gauss-Seidel and Gauss-Southwell convergence results from Hermitian positive-definite matrices to certain non-Hermitian classes, including overlapping variables in domain decomposition. The analysis treats a range of sampling probabilities and greedy selection strategies and identifies choices that optimize the bounds. The best expected convergence bounds for randomized methods match those of more expensive deterministic Gauss-Southwell algorithms. These results establish a convergence rate for asynchronous iterations. Joint work with Andreas Frommer.

Erik Boman discusses preconditioning for asynchronous linear solvers. Inner products create synchronization requirements in Krylov methods, while preconditioners can also improve iterations such as Richardson's method. The talk focuses on asynchronous incomplete factorizations and introduces ATS-ILU, an iterative incomplete LU method with synchronous and asynchronous versions that performs competitively with ParILU.

Paritosh Ramanan presents algorithm–hardware co-design for reliable linear algebra and optimization on resistive-memory in-memory computing systems. The distributed MELISO simulation framework supports multiple hardware models, while multilevel error correction makes noisy, low-energy devices useful for matrix-vector multiplication. Simulations report energy improvements of up to five orders of magnitude and latency reductions of up to two for high-dimensional linear algebra. A distributed primal-dual hybrid gradient solver for linear programs combines convergence analysis under device noise with simulated gains of up to two orders in latency and three in energy over GPU baselines on medium-scale problems. Preliminary randomized Kaczmarz results use online signal-to-noise estimates to select rows, comparing this strategy with offline alternatives. The talk closes with open problems in in-memory computation.

Edmond Chow examines how asynchronous updates improve parallel iterative computation. The first part covers asynchronous versions of classical first- and second-order linear iterations, Chebyshev methods, and multigrid, with attention to efficiency and fault tolerance. The second introduces reinforcement learning and asynchronous state-value estimation for finding optimal policies. When the state space is too large to enumerate, these updates focus computational effort on frequently visited regions.

Reward expectations – one’s prediction about the likelihood of future outcomes - play a central role in shaping the satisfaction derived from those outcomes. Most existing research treats expectations as static, assuming they remain fixed in time. However, real-life expectations are often dynamic, fluctuating as new information becomes available. For example, during a soccer game, your expectations of seeing your team winning will likely rise and fall as the game unfolds. In the main part of this talk, I will present a series of studies demonstrating that human expectations can be tracked at sub-second timescales. Using slot machines as a case study, we leverage the continuous deceleration of the reels to elicit moment-by-moment fluctuations in rewardexpectations. To capture these dynamics, we take complementary approaches: we use the high temporal resolution of electroencephalography (EEG) to track neural signatures of evolving expectations, and we develop a novel behavioral paradigm (“Slot or Not”) designed to measure changes in expectations via betting behavior. Across four studies, we show that expectations fluctuate continuously and can be tracked both behaviorally and neurally. Extending these findings, a subsequent intracranial study shows that the human orbitofrontal cortex (OFC) encodes the moment-by-moment changes of reward expectations. In the second part of this talk, I will return to the relationship between expectations andsatisfaction. If expectations shape satisfaction, and if they are best conceptualized as dynamic trajectories rather than static quantities, a key question arises: does the trajectory leading up to an outcome influence how that outcome is evaluated? I will outline a new research direction aimed at formalizing this relationship using computational modeling. This is ongoing work, and I welcome feedback on how best to formalize these ideas. Finally, I will discuss potential extensions of this framework to psychopathology, asking whether alterations in dynamic expectations may characterize conditions such as Major Depressive Disorder and Gambling disorder. Together, this work introduces a new framework for studying expectations as dynamic processes, offering a richer understanding Presented in the van Vreeswijk Theoretical Neuroscience Seminar series (formerly WWTNS) on 2026-04-29. Recording duration: 00:42:25.

Arterial spin labeling (ASL) MRI has become a vital tool in clinical neuroimaging, enabling noninvasive assessment of cerebral perfusion across a range of conditions including stroke, vascular malformations, and brain tumors. With broader clinical adoption, its practical strengths — as well as important limitations — have become increasingly clear.

Sharan Banagiri uses gravitational-wave observations to investigate how stellar-mass binary black holes form. The first part of the fourth LIGO–Virgo–KAGRA observing run more than doubled the number of detections, revealing new population features and clarifying earlier ones. The talk surveys notable and puzzling subpopulations, relates them to formation channels, and connects the evidence with transient phenomena and compact-object astrophysics. As the sample grows, these identifiable subpopulations can support a broader physical account of binary black-hole formation.

Lisa Dang explores how observations reveal the three-dimensional atmospheres and climates of close-in exoplanets. Kepler and TESS have established a diverse population that tests theories of planetary formation and evolution. Tidally locked short-period planets offer strong atmospheric signals but their large day–night contrasts make one-dimensional interpretations inadequate. Measurements from JWST and precise ground-based observatories can expose these spatial differences and determine whether an atmosphere is present. The talk reviews discoveries about intensely irradiated planets and explains how the same observational techniques now investigate temperate rocky worlds and their potential habitability.

Optimal transport is a mathematical method to define a distance between probability distributions. This is particularly useful in various domains, including physics, biology, machine learning, and economics, among others. After introducing the Optimal Transport (OT) problem at finite temperature, we show how it can be formulated as a statistical physics problem. This approach allows us to derive very efficient algorithms to effectively compute the distance between two probability distributions. The a priori unrelated Schrödinger bridge (SB) problem is presented, and it is shown to be a dynamical version of the optimal transport problem. Indeed, the Schrodinger bridge looks for the most probable path in probability distribution space, which connects two given probabilities. The Schrodinger bridge problem, originally devised for freely diffusing particles, can be generalized to the case of interacting particles. It can be formulated in terms of functional integrals over bosonic fields, which allows us to derive partial differential equations that characterize the most probable paths in probability space. CARL VAN VREESWIJK MEMORIAL LECTURE 2026. Presented in the van Vreeswijk Theoretical Neuroscience Seminar series (formerly WWTNS) on 2026-04-15. Recording duration: 00:55:05.

Benjamin Safdi studies the axion mass constraints obtained when grand unification and string theory are considered together with the QCD axion. Unitarity reasoning and explicit string compactifications, including examples from the Kreuzer–Skarke type-IIB ensemble, favor masses between 10^-11 and 10^-8 electronvolts. The talk explains how these theoretical frameworks combine to restrict a candidate extension of the Standard Model.

Pratika Dayal examines galaxy and black-hole formation during the first billion years, when the first galaxies ended the cosmic dark ages and began reionizing intergalactic hydrogen. JWST has revealed unexpectedly abundant, massive black holes, reaching about one hundred million solar masses within the first six hundred million years, challenging formation models. These observations can constrain the progress and spatial structure of reionization in preparation for 21-centimeter measurements. Early galaxies also test alternatives to cold dark matter. The talk considers the gravitational-wave event rates that early black holes could produce for the future LISA mission.

How does a cat gracefully walk and suddenly freeze when spotting a mouse? In this talk, we look at how networks in the spinal cord generate movement. In particular, we address the fundamental yet poorly understood question of motor control: How can rhythmic movements, such as walking, be generated and stopped at any point in the cycle while posture is preserved? Since conventional models of spinal motor function rely on alternation between flexor and extensor modules, which are limited to just two phases, this question exposes the essential shortcoming of the conventional understanding: How can a system with only two phases generate and stop walking in any phase? To address this question and better understand the generation and stopping of motor activity, we use Neuropixels probes in the rat spinal cord during voluntary, freely moving locomotion. We utilize optogenetic activation of a brainstem nucleus to induce stopping. During locomotion, neuronal manifold activity exhibits robust rotational patterns that are topologically invariant with respect to speed (Linden 2022). Furthermore, this trajectory converges on a stable point-attractor precisely at the moment of arrest, and it persists until the movement is resumed. Through computational modeling, we propose that the walk-to-stop represents a bifurcation from a limit cycle to a fixed point attractor. We also propose a structural network mechanism for its physical implementation (Komi 2026). The structural mechanism entails a longitudinal projectome with a skewed Mexican hat topology, i.e., primarily local recurrent excitation and longer-range inhibition. Such a network can generate motor patterns via traveling waves, with frequency and amplitude controlled independently, and rhythm induced without requiring cellular pacemaker mechanisms. Together, our experimental observations support a new theory for the mechanism behind the generation of movement by networks in the spinal cord. Presented in the van Vreeswijk Theoretical Neuroscience Seminar series (formerly WWTNS) on 2026-03-25. Recording duration: 00:37:44.

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.

Much is known about the neural representations of current environmental location and direction within the hippocampal formation, but use of such a “cognitive map” requires the online representation of desired locations and how to get there, and the neural basis for this function has been more elusive. I will discuss how “theta sweeps” of place and grid cell firing encode the current location (at early phases of each theta cycle) while, at later phases, sampling around the forward direction during exploration and indicating the direction to desired locations during goal-directed navigation. I will show how a relatively simple attractor model captures these results, but requires inputs signalling movement-direction and goal-direction.I will discuss why it is useful to consider the hippocampus as a generative model (in which head-direction, rather than movement-direction, is required, to translate egocentric sensory inputs to allocentric latent representations and back again) in explaining its roles in both spatial cognition and memory consolidation. “Replay sequences” are thought to support offline consolidation, and likely resemble theta sweeps more than behavioural experience. I will finish (given time) by considering how human memory consolidation can be seen as extraction of latent variables from replay via self-supervised learning, and how this perspective explains aspects of human memory such as gist-based distortions, imagination and planning. Presented in the van Vreeswijk Theoretical Neuroscience Seminar series (formerly WWTNS) on 2026-02-25. Recording duration: 00:46:52.

Although stress can be considered as an ongoing process that helps an organism to cope with present and future challenges, when it is too intense or uncontrollable, it can lead to adverse consequences for physical and mental health. Social stress specifically, is a highly prevalent traumatic experience, present in multiple contexts, such as war, bullying and interpersonal violence, and it has been linked with increased risk for major depression and anxiety disorders. Nevertheless, not all individuals exposed to strong stressful events develop psychopathology, with the mechanisms of resilience and vulnerability being still under investigation. During this talk, I will identify key gaps in our knowledge about stress vulnerability and I will present our recent data from our contextual fear learning protocol based on social defeat stress in mice.

1. Can we reconstruct images that a person saw, directly from their fMRI brain recordings? 2. Can we reconstruct the training data that a deep-network trained on, directly from the parameters of the network? The answer to both of these intriguing questions is “Yes!” In this talk I will present some of our work in both domains. I will then show how combining the power of Brains and Machines can lead to significant breakthroughs in both areas, and potentially bridge the gap between Minds and Machines. Finally, I will show how combining the power of Multiple Brains (with NO shared data) may lead to new breakthrough discoveries in Brain-Science, and allow mapping of information between different brains. Presented in the van Vreeswijk Theoretical Neuroscience Seminar series (formerly WWTNS) on 2026-02-18. Recording duration: 00:50:24.