Apply to the PIBBSS × Iliad Research Residency
TL;DR: PIBBSS and Iliad are announcing a Research Residency in applied mathematics and AI alignment. Competitive candidates are PhD or postdoctoral (or equally experienced) researchers in math, physics, or a related field. Our target outcome is for Researchers-in-Residence to continue research after the Residency by securing philanthropic funding to either start new research groups or to support other research projects.
Duration:
6 weeks, full-time
January 5–February 13, 2026
Application Deadline:
Rolling
Stipend:
$6,000–$15,000
depending on seniority
Apply early to have higher chances to be selected for Winter and Summer 2026
The Residency
Researchers-in-Residence will explore mathematical approaches to AI alignment, in collaboration with established Mentors with proven track records of connecting deep mathematics with empirical machine learning.
Duration: 6 weeks, full-time, January 5–February 13, 2026, next cohort will be June-August 2026 for 2-3 months.
Location: The London Initiative for Safe AI (LISA), London, in person (with a remote option for exceptional applicants, for compatibility with existing academic roles)
Stipend: $6,000–$15,000, depending on seniority for the first cohort.
The Residency will include speaker events and a research retreat.
What You’ll Be Doing
Researchers-in-Residence will, by default, spend 6 weeks in person in London at LISA working on AI alignment, in collaboration with Mentors. Project Mentors are established researchers in mathematics and AI alignment.
Individual projects will differ in scope and content, depending on the Resident’s research background; projects will begin lines of research in mathematical AI alignment. The intended end product of the Residency is a fleshed-out research proposal. You will spend 6 weeks doing mathematical research that builds on your existing research background, with the support of a project Mentor. You will work inside of or develop a new direction of applied-mathematical AI alignment research in order to assemble the research proposal deliverable.
At the end of the Residency, Iliad will help Researchers-in-Residence submit proposals to outside funders to spin up new research groups or to support other research projects (at PIBBSS, in academia, or independent). The funding ecosystem for technical academic researchers pivoting into AI alignment is vast. AI alignment is a ballooning field of research that is just crystallizing its earliest general theoretical results. Academics are extremely well positioned to contribute to this crystallization of the formal machinery; funders recognize this, and Iliad aims to facilitate that connection between academics branching into AI alignment and philanthropic donors (including state actors) supporting that research work. We are here to help you get a grip on this ecosystem, in the belief that great researchers with high academic standards are a crucial input in growing AI alignment into a fully developed scientific field. We will guide Residents in developing research proposals for submission to organizations such as Open Philanthropy, the Survival and Flourishing Fund, Schmidt Sciences, and the UK AI Security Institute (AISI); we aim to secure independent funding for projects for an additional 6–24 months.
Projects
Project descriptions are below. These are generally not binding, though some directions (*) are currently more developed than others, and these more established directions may involve working with existing teams. The remaining projects leave the field more open and are for you to develop.
Abstract: The no free lunch theorems imply that no learning can occur without inductive biases. However, Solomonoff induction proposes an alternative view by imposing a simplicity prior under which shorter descriptions are exponentially more likely. Relatedly, because many descriptions collapse to the same effective structure (padding/dead code; coding theorem), degeneracy and simplicity often coincide. This leads to a crucial question: To what extent do modern LLMs approximate Solomonoff induction? Following these ideas, this project will combine theoretical arguments with toy neural network examples, highlighting how degeneracy underpins simplicity in both algorithmic and practical learning contexts.
Keywords: simplicity, degeneracy, no free lunch theorems, Solomonoff induction, coding theorem, padding arguments, dead code, simplicity prior, large language models, approximate induction, neural networks, inductive bias
Abstract: This project studies the theory of universal prediction under different paradigms: the Minimum Description Length (MDL) principle, Solomonoff induction, resource-bounded Solomonoff predictors, and logical inductors, and their connections to generalization theory. The aim is to understand how compression, algorithmic probability, and logical uncertainty provide foundations for prediction, calibration, and reasoning under computational constraints. The project aims to investigate the potential of these ideas to explore classical regret bounds and in-distribution vs. out-of-distribution error.
Keywords: MDL, Solomonoff induction, logical induction, algorithmic probability, compression, regret bounds, resource-bounded reasoning, out-of-distribution generalization, distribution shift, logical inductors
Abstract: This project surveys causality as a foundation for learning, abstraction, and alignment. Building on Pearl’s structural causal models, Rubin’s potential outcomes, and recent developments in causal representation learning, the project will investigate how causal structure enables robust generalization under distribution shift. Topics include identifiability, causal abstraction, invariance principles, and interventions in reinforcement learning. Optional subjects may include causal factor sets and algorithmic information theory approaches to causality. Connections will be drawn to algorithmic information theory, rate–distortion, and selection theorems, positioning causality as a unifying lens for learning systems that must operate safely in dynamic and uncertain environments.
Keywords: causality, structural causal models, potential outcomes, causal abstraction, invariance, interventions, distribution shift, generalization, causal representation learning, reinforcement learning, Causal Incentives, factored sets
Abstract: This project builds a common ground unifying the diverse formalizations of abstraction across different disciplines. The project will build a comprehensive survey of approaches to abstraction, exploring concepts such as frequentist and Bayesian sufficient statistics, information bottlenecks and other methods for “leaky abstractions”, causal abstractions for robustness under interventions, and algorithmic-information-theoretic approaches. The project will also cover different approaches to explain the relevance of abstractions, including Wentworth’s Natural Abstraction program and the work of George Konidaris on the need for abstractions in multi-purpose systems, and investigate the potential of abstractions to understand capabilities and generalization.
Keywords: sufficient statistics, Bayesian inference, algorithmic information theory, causal abstraction, supervised learning, reinforcement learning, interpretability, Eisenstat condensation, latent abstractions, Koopman–Pitman–Darmois theorem, Shalizi macrostates, thermodynamics, exponential families, Minimum Description Length (MDL) principle, lossless compression, lossy compression
Abstract: This project investigates sparse coding and its deep connections to rate–distortion theory as frameworks for efficient representation. Sparse coding posits that data can be represented by a small number of active components from an overcomplete basis, yielding efficient and interpretable representations. The project will situate this principle within classical rate–distortion theory, algorithmic rate–distortion, and the information bottleneck method, extending to causal rate–distortion frameworks that incorporate dynamics and interventions. Further connections will be drawn to geometric compression tools like the Johnson–Lindenstrauss lemma, as well as error-correcting codes that balance redundancy with efficiency. The overarching aim is to synthesize sparsity and rate–distortion as dual principles of representation, generalization, and interpretability in AI and learning systems.
Keywords: sparse coding, rate–distortion theory, information bottleneck, algorithmic rate–distortion, causal rate–distortion, Johnson–Lindenstrauss lemma, error-correcting codes, efficient representation, interpretability, generalization, compression
Abstract: This project will provide a comprehensive overview of computational mechanics, with a particular focus on James Crutchfield’s program and Simplex’s “belief state geometry” agenda. Computational mechanics develops minimal predictive models (ε-machines) that capture the causal states of stochastic processes, distinguishing between generative and predictive complexity. The project will survey entropy rate, predictive efficiency, the mixed-state presentation, causal state reconstruction, and the geometry of belief states, and evaluate how these concepts can be applied to AI systems, especially transformers and reinforcement learning. The aim is to establish computational mechanics as a rigorous tool for analyzing internal representations and emergent behavior in modern machine learning.
Keywords: computational mechanics, ε-machines, belief state geometry, predictive complexity, generative complexity, causal states, entropy rate, predictive efficiency, transformers, mixed-state presentation, meromorphic functional calculus, interpretability
Abstract: This project explores the framework of algorithmic statistics, which connects Kolmogorov complexity, sufficient statistics, and model selection. Algorithmic statistics defines a sufficient statistic as the simplest model 𝑆 that explains a given string 𝑥 without losing predictive information. The project will cover the basics of algorithmic statistics, the relation to the MDL principle, the role of sophistication and the K-structure function, and explicit examples in deep linear networks (DLNs) and ReLU networks. A major focus will be the resource-bounded setting, where distinctions emerge between enumerative and decision complexity. This extension reframes algorithmic statistics as a theory of “simple explanations under computational constraints,” with implications for both statistical learning and complexity theory.
Keywords: algorithmic statistics, Kolmogorov complexity, sufficient statistic, MDL principle, sophistication, K-structure function, nonstochastic strings, PSPACE, KT-complexity, resource-bounded complexity, generative vs. decision complexity, deep linear networks, ReLU networks
Abstract: This project develops the theory of heuristic arguments as a relaxed notion of proof, combining ARC’s recent work on heuristic estimators with the “No Coincidence Principle” (NCP). The ARC agenda formalizes heuristic estimators with coherence properties like linearity, composition, and covariance propagation, yielding tractable approximations to otherwise intractable inference. The NCP reframes this: when an event 𝑅 seems like an “outrageous coincidence,” there must exist a structure or statistic 𝑆 such that 𝑝(𝑅∣𝑆) is high, even if 𝑝(𝑅) is low. This generalizes proofs, explanations, and reasons as sufficient statistics, balancing description length against probability gain. The project situates heuristic arguments at the interface of logic and probability, connects them to free energy functionals, OOD generalization, and mechanistic anomaly detection, and explores their role as a practical substitute for formal proofs in alignment contexts.
Keywords: heuristic arguments, No Coincidence Principle, probabilistic reasoning, ARC heuristic estimators, sufficient statistics, free energy functional, calibration, relaxed proofs, generalization, anomaly detection, low-probability estimation, interpretability, AI alignment
Abstract: This project investigates the loss landscapes of deep linear and ReLU neural networks using polyhedral geometry and hyperplane arrangements. It seeks to decompose landscapes into two structures: a chamber complex defined by activation boundaries and a critical locus governed by combinatorial partitions. By systematically analyzing deep linear networks, affine networks, bias-free ReLU models, and full ReLU MLPs, the project will build a comprehensive “atlas” that unifies algebraic and combinatorial geometry with learning theory. The goal is to produce a foundational text that describes minima, saddles, local learning coefficients, and canonical subspaces, with implications for both interpretability and learning dynamics.
Keywords: loss landscapes, deep linear networks, ReLU MLPs, hyperplane arrangements, polyhedral complexes, partitions, critical locus, singular learning theory, tropical geometry, generating functions, saddle points, learning coefficient, matroids, moduli spaces, activation boundaries
Abstract: This project studies gradient flow dynamics in deep linear networks through the lens of Morse theory, with an emphasis on singular loss landscapes. Classical Morse theory, which analyzes critical points via smooth functions, must be extended to handle singularities common in neural network losses. The main focus is both empirical and theoretical analysis of gradient flows and their Morse structure in deep linear networks. Tools include semi-classical approximations, Freidlin–Wentzell quasipotentials, and action functionals, which connect the geometry of the landscape to the stochastic stability of training paths. The project aims to clarify how minima, saddles, and escape paths are organized in singular settings and how these structures govern learning dynamics.
Keywords: gradient flow, singular Morse theory, deep linear networks, critical points, topology of loss landscapes, stable and unstable manifolds, semi-classical approximation, Freidlin–Wentzell quasipotential, action functional, optimization dynamics, learning dynamics
Abstract: This project surveys how structure emerges in neural networks from gradient descent optimization. Despite their high dimensionality, training often unfolds along effectively low-dimensional subspaces, proceeding through distinct transitions related to sudden improvement of capabilities. Emphasis will be placed on anomalous noise diffusion patterns (sub- and super-diffusion), phase transitions related to the sequential learning of features, and oscillatory regimes where training hovers near criticality. The goal is to survey these theoretical and empirical perspectives into a coherent and unified account.
Keywords: training dynamics, low-dimensional manifolds, Hessian spectrum, phase transitions, grokking, anomalous diffusion, sub-diffusion, super-diffusion, gradient descent, learning modes, emergent capabilities
Abstract: This project explores the connections between free energy functionals from singular learning theory and conductance-based analysis from Markov chain theory, extended to modern tools in stochastic optimization. Free energy, particularly in Watanabe’s framework, decomposes learning into energy–entropy contributions that determine generalization error and learning coefficients. At the same time, the Jordan–Kinderlehrer–Otto (JKO) scheme interprets Langevin dynamics and the Fokker–Planck equation as gradient flows of free energy in the Wasserstein (earthmover) metric space. Conductance, Cheeger inequalities, and electrical-network analogies instead capture bottlenecks, metastability, and mixing times in Markov processes. The project aims to unify energy–entropy functionals, Wasserstein gradient flows, and conductance bounds as complementary ways of analyzing SGD dynamics, escape from flat minima, and the stability of learned representations.
Keywords: free energy, singular learning theory, JKO functional, Langevin dynamics, Fokker–Planck, Wasserstein metric, earthmover distance, conductance, Markov chains, Cheeger inequality, electrical networks, energy–entropy decomposition, learning coefficient, metastability, stochastic optimization
Abstract: This project surveys studies of SGD dynamics through Fokker–Planck operators on singular landscapes. Special focus will be placed on the relevance of spectral gaps, metastability, hypocoercivity, Witten Laplacians, and non-reversible dynamics, connecting spectra to convergence, mixing, and escape behavior. The goal is to provide a rigorous operator-theoretic account of SGD’s behavior on realistic loss landscapes.
Keywords: Fokker–Planck, SGD, Langevin, spectral gap, metastability, Witten Laplacian, hypocoercivity, mixing times
Abstract: This project investigates the potential of renormalization techniques from physics for interpretability and AI safety by treating neural networks as multi-scale systems whose behavior changes across levels of abstraction. By importing renormalization group (RG) methods, the aim is to develop tools for coarse-graining neural representations, identifying universal structures, and distinguishing safe from unsafe features across scales. Ultimately, this research will connect QFT-inspired methods with the neural tangent kernel (NTK) and modern interpretability efforts, providing a principled framework for multi-level analysis. The goal is to develop RG-based tools that coarse-grain neural representations, identify universal structures, and separate safe from unsafe features.
Keywords: renormalization, RG flow, coarse-graining, universality, scale separation, interpretability, AI safety, effective theories, fixed points, feature abstraction, QFT methods, multi-scale modeling, representation space, implicit renormalization, explicit renormalization, Neural Tangent Kernel
Abstract: This project aims to compile and contextualize the canonical theorems that characterize the behavior of an ideal Bayesian reasoner. These include de Finetti’s coherence theorem (immunity to Dutch books), Dawid’s calibration theorem, the law of iterated expectations (dynamic consistency), the martingale property of posteriors, Blackwell–Dubins’ merging of opinions, Schwartz’s posterior consistency, Wald’s complete class theorem, and related results. The goal is to create a structured compendium of these results, explaining both their formal statements and intuitive consequences, and to highlight how they serve as a gold standard against which real-world and computationally bounded agents can be compared. This reference will clarify the assumptions needed for ideal rationality and serve as a benchmark for reasoning under uncertainty in AI systems.
Keywords: Bayesian reasoning, coherence, calibration, dynamic consistency, martingales, merging of opinions, posterior consistency, complete class theorem, likelihood principle, proper scoring rules, rationality
Abstract: This project examines relaxations of Bayesianism, focusing on frameworks that move beyond the assumptions of ideal Bayesian reasoners. Chief among these are infra-Bayesianism and imprecise probability, where beliefs are represented as sets or markets rather than single probability measures. Logical inductors, Shafer–Vovk game-theoretic probability, and related “markets of beliefs” provide additional lenses for reasoning under uncertainty. The project will revisit the canonical Bayesian theorems (coherence, calibration, dynamic consistency, complete class theorems) in these generalized contexts, examining which properties survive and which fail. The outcome will be a systematic map of how rationality results deform when agents reason under partial, adversarial, or resource-bounded uncertainty.
Keywords: irrational beliefs, infra-Bayesianism, imprecise probability, markets of beliefs, logical induction, Shafer–Vovk theory, coherence relaxations, calibration relaxations, dynamic consistency, complete class theorems, bounded rationality
Abstract: This project develops the theory of rational preferences, focusing on representation theorems that embed preferences into utility functions. Classical results include the von Neumann–Morgenstern theorem, Savage’s theorem, and Arrow–Debreu general equilibrium. Beyond these, the project will examine the Fishburn–Koopman theorem on dynamic consistency under exponential discounting, which characterizes stable temporal preferences. Related results such as money-pumping arguments demonstrate the exploitability of incoherent preferences. A key focus is the type signature of preferences, including consequentialism (preferences over states), deontology (preferences over trajectories), and virtue ethics (preferences over policies). This classification clarifies what it means for preferences to be “rational” at different abstraction levels, and how alignment frameworks should interpret agent values.
Keywords: rational preferences, expected utility, von Neumann–Morgenstern, Savage axioms, Arrow–Debreu, Fishburn–Koopman, exponential discounting, dynamic consistency, money pumping, consequentialism, deontology, virtue ethics, utility representation
Abstract: This project studies generalizations of preference representation beyond the von Neumann–Morgenstern framework, focusing on what happens when rationality axioms are relaxed. Different alternatives will be considered: Dropping completeness, which leads to vetocracies and infra-utility, where some choices remain incomparable. Dropping transitivity, leading to inconsistent preferences, modeled by Helmholtz–Hodge decompositions and preference cycles. Dropping continuity, which can trigger surreal utilities that accommodate lexicographic or non-Archimedean orderings. Dropping independence fostering geometric/Boltzmann rationality, where probabilistic choice is determined by energy-like structures. The project also covers hyperbolic discounting and other temporal pathologies, and investigates how to systematize these irrationalities into coherent frameworks. It emphasizes again the type signature of preferences (states, trajectories, policies) and their ethical analogues (consequentialism, deontology, virtue ethics).
Keywords: irrational preferences, preference cycles, Helmholtz–Hodge decomposition, surreal utilities, infra-utility, vetocracies, Boltzmann rationality, hyperbolic discounting, non-Archimedean preferences, states vs. trajectories vs. policies
Abstract: This project will study agents as compositions and coalitions. A subagent is an internal module with its own objective or policy that interacts with sibling modules through interfaces; a superagent is a coalition or institution formed by multiple agents or copies. The project will formalize when a system can be decomposed/aggregated without loss (modularity, separability), how incentives flow across boundaries (contracts, delegation, credit assignment), and what guarantees prevent internal money-pumps or instability (dynamic consistency). Tools include factored MDPs and hierarchical RL (for structure), mechanism design and principal–agent models (for incentives), coalitional game theory and bargaining (for cooperation), and control/cybernetics notions of controllability and feedback across interfaces.
Keywords: subagents, superagents, modularity, interfaces, factored MDPs, mechanism design, principal–agent, coalitional game theory, bargaining, delegation, dynamic consistency, value decomposition, Shapley value and credit assignment, Markov blankets, controllability, Harsanyi theorem, Why Not Subagents
Abstract: This project surveys the concept of universal agency, focusing on AIXI and its theoretical descendants, which aim to develop artificial intelligences capable of optimal decision-making in any computable environment. It will explore foundational principles such as Solomonoff induction for predicting futures, Levin search for identifying optimal actions, and the challenges of computational intractability and real-world applicability.
Keywords: AIXI, Universal Artificial Intelligence, general intelligence, optimal rationality, Solomonoff induction, Levin search, reinforcement learning, artificial general intelligence (AGI), computational complexity, bounded rationality, meta-learning, value alignment, AI safety
Abstract: Classical decision theory assumes a clean separation between agent and world, but real-world AI systems must operate within environments that contain them, reason about themselves, and interact with other powerful agents. This project addresses the challenges of embedded agency, which captures how agents interact and are part of the environments they reason about. Topics include logical uncertainty, reflective stability, tiling agents, Löb’s theorem and its obstacles, and bounded versions of provability logic. The project will also consider decision-theoretic frameworks such as functional decision theory (FDT), evidential decision theory (EDT), and causal decision theory (CDT), and how they adapt or fail in embedded contexts. Overall, the aim is to map the state-of-the-art relevant to understanding self-reference, reflection, and decision-making for embedded agents, with implications for alignment, delegation, and safe self-improvement.
Keywords: embedded agency, decision theory, tiling agents, Löb’s theorem, reflective stability, logical uncertainty, FDT, CDT, EDT, bounded provability, logical induction, self-reference, iterated delegation, alignment
Abstract: This project explores factored latent models as a way to represent complex systems by decomposing latent states and dynamics into simpler, interacting subcomponents. The project will investigate commonalities in factored hidden Markov models, factored Markov Decision Processes, and factored belief state models, and will also cover causal latent models accounting for the effects of interventions. By doing this, the project will look for common criteria of what makes good latents, establish a comprehensive framework for using factorization to improve computational efficiency, enhance interpretability, and facilitate knowledge transfer. The project will also cover methods to infer factored latent models from data, exploring their identifiability under observational and interventional data.
Keywords: factored latent models, factored MDPs, FHMMs, belief states, graphical models, conditional independence, model factorization, state-space modeling, efficiency, interpretability, modularity, transfer learning
Abstract: This project surveys the foundational theorems that connect beliefs, values, and actions into coherent decision-making frameworks. Savage’s theorem and the Jeffrey–Bolker theorem characterize when qualitative preferences and probabilistic beliefs jointly determine expected-utility representations. The project will explore when and how beliefs can be distinguished from values, when this distinction collapses, and how this is related to the emergence of boundaries between agents. Interfaces are examined through epsilon-transducers, MDPs, and computational mechanics, which formalize the interaction between states, actions, and outcomes. A recurring theme is clarifying where the boundaries of agentic systems lie, and how different formalisms (belief-first, value-first, reward-first) articulate this interface. Connections to alignment are explicit: distinguishing reward, value, and policy-level objectives is crucial for understanding alignment failures.
Keywords: Savage theorem, Jeffrey–Bolker theorem, beliefs, values, preferences, boundaries of agency, epsilon-transducers, MDPs, computational mechanics, interfaces, reward vs. value, alignment
Abstract: Selection theorems are theoretical results that characterize the properties or “type signatures” agents acquire through various selection processes like natural selection, machine learning training, or economic competition. This project aims to survey existing selection theorems and develop new and improved ones. The core idea is to understand the general regularities that selection pressures reliably produce in agents, rather than focusing on the specifics of an optimizer. For example, coherence theorems, a type of selection theorem, demonstrate that sufficiently optimal agents must behave as if they maximize a utility function, regardless of their internal architecture. The project will also particularly investigate “Doom theorems,” which are conditions that lead to misalignment. The research plan includes surveying various selection theorems, such as those by Turner, Wentworth, Christiano, Richens, Kosoy, and Murfet, as well as incorporating results from the cybernetic literature like the Internal Model Principle, separation principle, and the Good(er) Regulator Theorem. The project will critically evaluate these ideas, assess their technical foundations, and explore whether recent technical developments could strengthen them.
Keywords: selection theorems, coherence theorems, instrumental convergence, misalignment, coherence, power-seeking, cybernetics, regulator theorems, Wentworth toy coherence theorem
Abstract: This project aims to unify reinforcement learning algorithms under an operator-theoretic framework based on generalized policy iteration. At the core are two operators: policy evaluation (approximating the Bellman operator) and policy improvement (greedy or soft-greedy updates). By parameterizing evaluation depth, improvement strength, and entropy regularization, the framework recovers classical value iteration, policy iteration, Q-learning, TD learning, actor–critic, PPO, and soft actor–critic as special cases. The project will also connect discrete-time Bellman operators to continuous-time Hamilton–Jacobi–Bellman PDEs, soft Bellman operators to maximum-entropy RL, and operator theory to convergence guarantees. The ultimate goal is to systematize RL algorithms as points in a single operator landscape, clarifying their relationships and trade-offs.
Keywords: Bellman operator, policy iteration, generalized policy iteration, soft Bellman operator, temporal difference learning, Q-learning, actor–critic, PPO, maximum entropy RL, Hamilton–Jacobi–Bellman, stochastic approximation, operator theory
Abstract: This project surveys universal agency models and the role of metacognition in agents that must operate in trapped or non-ergodic environments, challenging the assumptions of episodic or ergodic reinforcement learning. Survey metacognitive agent frameworks such as Vanessa Kosoy’s recent agenda, the Gödel Machine, OOPS, PowerPlay, Levin Search, and universal learning theories. It will also examine “Grain of Truth” environments and Oesterheld’s Auctioneer model, probing how classical theorems—like optimality, convergences, and exploration guarantees—break down in self-referential or non-ergodic contexts. The goal is to understand how universal agents need metacognition to maintain coherence, adaptivity, and alignment in adversarial or constrained environments.
Keywords: universal agency, AIXI, AIXItl, metacognition, embedded agents, trapped environments, universal search, OOPS, Gödel Machine, PowerPlay, Levin search, Grain of Truth environments, auctioneer model, meta-reasoning, non-ergodic RL, alignment
Abstract: This project surveys the theoretical and practical limits of interpretability in the presence of cryptographic backdoors. Cryptographic constructions show that models can be modified in ways that make backdoors computationally undetectable, even with full parameter access, undermining interpretability as a safety guarantee. The survey will synthesize results from Goldwasser et al. on undetectable backdoors, Christiano et al. on defendability, Velegkas et al. on obfuscated neural networks, and Gluch and Goldwasser on mitigation vs. detection. It will also examine defense strategies that remove or neutralize backdoors without detection. The outcome will be a structured roadmap for understanding where interpretability can or cannot certify model safety under computational hardness assumptions and substantiate formally the need for an interpretability-over-training for safety guarantees.
Keywords: interpretability, cryptographic backdoors, defendability, indistinguishability, obfuscation, undetectable triggers, mitigation vs. detection, learning theory, evaluation protocols, alignment robustness, AI security
Abstract: This project develops a theoretical survey of reward learning, focusing on the outer alignment problem of specifying what AI systems should optimize. Standard (inverse) reinforcement learning assumes scalar, stationary, and Markovian rewards, but real human preferences are non-stationary, multi-dimensional, and partially observable. The project will analyze identifiability issues. It will also explore deception risks, non-Boltzmann human feedback, and stability over time. The outcome will be a structured agenda clarifying the theoretical foundations of reward learning, limitations of current methods, and research directions for robustly aligning learned rewards with human intent. As a result, reward functions should not be identified with optimization targets: the true optimization is of a free energy functional, which balances reward-like terms with information and complexity. The project will survey identifiability issues (multiple reward functions fitting the same data), the error–regret mismatch that emerges during policy optimization, and the difficulty of aggregating heterogeneous human reward signals.
Keywords: reward learning, inverse reinforcement learning, outer alignment, identifiability, error–regret mismatch, human preferences, aggregation, non-stationary rewards, partial observability, deception, AI safety
Abstract: This project surveys voting theory, focusing on normative desiderata, impossibility theorems, and probabilistic aggregation methods. It begins with Arrow’s theorem, the Gibbard–Satterthwaite theorem, and related no-go results, then examines probabilistic voting rules with emphasis on maximal lotteries, which generalize the Condorcet winner to distributions over outcomes. The project will also consider extensions like “maximal lottery lotteries” (Garrabrant) and geometric–algebraic approaches like Hodge–Helmholtz decompositions for preference flows. Beyond political elections, the relevance lies in AI alignment: aggregating noisy or conflicting human preferences into a reward function faces the same theoretical limits as social choice. The survey will highlight both impossibility barriers and probabilistic workarounds.
Keywords: social choice theory, voting, Arrow’s theorem, Gibbard–Satterthwaite, Condorcet consistency, maximal lotteries, probabilistic voting, preference aggregation, Hodge–Helmholtz decomposition
Abstract: This project will study goal misgeneralization: systems trained to minimize loss on familiar data learn proxies that match the target in training but pursue the wrong goal under distribution shift. The canonical case is humans preferring sex (a proximate goal) over reproduction (the trained/selected objective). The project aims to formalize and investigate this phenomenon through the lens of modern learning theory—viewing loss minimization as free-energy minimization with implicit simplicity & degeneracy bias.
Keywords: goal misgeneralization, distribution shift, proxy objectives, simplicity bias, MDL, algorithmic information theory, singular learning theory, learning coefficient (RLCT), free-energy optimization, invariance/causal tests, outer vs. inner alignment
Abstract: This project surveys results that show how optimization and learning processes can converge to deceptive or misaligned behaviors under broad conditions. Topics include mesa-optimization and deceptive alignment, formalizations of power-seeking, Goodhart’s law variants, malign universal priors, and bargaining-theoretic failures. The survey also integrates connections to learning dynamics: backpropagation, Bellman equations, discount rates, and the conditions under which optimization creates incentives for deceptive or adversarial strategies. The project will also draw from bargaining theory and economics, where equilibria may be strategically misleading. The outcome will be a structured map of doom-theorem–style results across learning theory, economics, and AI alignment.
Keywords: doom theorems, deception, mesa-optimization, deceptive alignment, power-seeking, Goodhart’s law, malign priors, selection pressure, backpropagation, Bellman operators, discount rates, bargaining theory, misalignment
Abstract: This project investigates the theory of control across dynamic systems, extending from classical linear control to distributional and probabilistic control relevant for modern AI systems. It covers the Kalman algebraic framework and advances into nonlinear and stochastic control methods (e.g., Hermann–Krener and Lie bracket formalisms), alongside Todorov’s duality between prediction and control. The project explores the role of optimal control in shaping distributions over model weights—both in static equilibrium (Bayesian posteriors) and dynamic training trajectories—using metrics such as the Wasserstein (earthmover) distance to quantify susceptibility to interventions. It also examines the use of susceptibilities, as being developed in theoretical interpretability agendas like Timaeus, to measure sensitivity of learning systems to perturbations.
Keywords: steering, controllability, control theory, Kalman framework, nonlinear control, Lie brackets, prediction–control duality, optimal control, Bayesian posterior, distributional control, Wasserstein metric/earthmover distance, susceptibility, cybernetics, feedback, alignment, regulation, principal-agent problem
Abstract: This project surveys “AI Safety via Debate” as a scalable oversight paradigm. Debate leverages adversarial interactions between AI systems, where one agent surfaces flaws in the other’s arguments and a human judge decides the winner. The project covers the theoretical analogy to interactive proofs (debate reaching PSPACE vs. direct supervision at NP), empirical studies of debate protocols, and recent advances like doubly-efficient debate and prover–estimator debate, which address obfuscation and computational asymmetry. It will also integrate the AISI debate sequence, focusing on robustness to systematic human error and exploration failures. The goal is to evaluate debate’s theoretical guarantees, practical viability, and open questions as a foundation for scalable oversight.
Keywords: AI safety via debate, scalable oversight, interactive proofs, PSPACE analogy, obfuscation, systematic human error, exploration hacking, doubly-efficient debate, prover–estimator debate, debate protocols, oversight
Abstract: This project explores how agents reason about and safely delegate to stronger successors while preserving consistency over time. It surveys tiling agents and the Löbian obstacle (showing the limits of proof-based self-modification), Vingean reflection (focused on trusting successor competence without full prediction), and probabilistic reflection—including Payor’s lemma—that supports bounded, statistically derived self-trust. The syllabus also includes reflective oracles, logical induction, bounded Löb logics, and iterated delegation schemes like IDA, HCH, and debate. A central concern is dynamic consistency—ensuring agents remain stable over time, avoiding value drift—and the law of iterated expectations, which ensures that off-policy or future beliefs align coherently. The project aims to build a unified survey showing how reflective reasoning structures, despite paradoxes, offer pathways to scalable delegation and aligned self-modification.
Keywords: tiling agents, Löb’s theorem, Löbian obstacle, Vingean reflection, probabilistic reflection, Payor’s lemma, reflective oracles, logical induction, bounded Löb, iterated delegation, IDA, HCH, debate, dynamic consistency, value drift, law of iterated expectations, reflective reasoning, AI alignment
Abstract: This project explores what humans would want if they were more ideal and how to align advanced AI systems with this extrapolated ideal. It will survey theoretical frameworks for understanding and formalizing human values, the challenges of aggregating diverse preferences, and methods for ensuring AI behavior remains consistent with EV as AI capabilities increase. It also considers the ethical and philosophical implications of defining and implementing a universal human volition for artificial agents.
Keywords: extrapolated volition, AI alignment, human values, value loading, preference aggregation, AI ethics, artificial general intelligence (AGI), machine ethics, moral philosophy, idealized humans, Bellman equations, tiling agents
About You
Our competitive applicant is a PhD or postdoctoral researcher in mathematics, theoretical physics, theoretical computer science, or a related discipline, or someone with equivalent research experience. We welcome applicants with substantially greater research experience as well, and will tailor scope and compensation to suit that background.
If you have substantial research experience but are unsure about your fit, we encourage you to err on the side of applying!
About Iliad
Iliad’s founders helped found the Timaeus and Simplex alignment research organizations. Iliad organizes the eponymous ILIAD Conference on AI alignment.
Apply
Apply here for either the winter or summer cohorts in 2026. Applications are on a rolling basis and will be closed once spots are full, so apply as soon as you can for highest chances of acceptance.
The Residency is most centrally aimed at PhD and postdoctoral researchers. However, we encourage interested individuals with substantial prior research experience in their field of expertise to apply, regardless of credentials. The first stage of the application is designed to be easy to complete.