Calendar

Confusingly for the uninitiated, experts in infinite-dimensional category theory make use of different definitions of an ∞-category, and theorems in the ∞-categorical literature are often proven “analytically”, in reference to the combinatorial specifications of a particular model. In this talk, we present a new point of view on the foundations of ∞-category theory, which allows us to develop the basic theory of ∞-categories — adjunctions, limits and colimits, co/cartesian fibrations, and pointwise Kan extensions — “synthetically” starting from axioms that describe an ∞-cosmos, the infinite-dimensional category in which ∞-categories live as objects. We demonstrate that the theorems proven in this manner are “model-independent”, i.e., invariant under change of model. Moreover, there is a formal language with the feature that any statement about ∞-categories that is expressible in that language is also invariant under change of model, regardless of whether it is proven through synthetic or analytic techniques. This is joint work with Dominic Verity.

Zoom: https://harvard.zoom.us/j/779283357?pwd=MitXVm1pYUlJVzZqT3lwV2pCT1ZUQT09

Prediction algorithms assign numbers to individuals that are popularly understood as individual “probabilities” — e.g., what is the probability of 5-year survival after cancer diagnosis? — and which increasingly form the basis for life-altering decisions. The understanding of individual probabilities in the context of such unrepeatable events has been the focus of intense study for decades within probability theory, statistics, and philosophy. Building off of notions developed in complexity theory and cryptography, we introduce and study Outcome Indistinguishability (OI). OI predictors yield a model of probabilities that cannot be efficiently refuted on the basis of the real-life observations produced by Nature.

We investigate a hierarchy of OI definitions, whose stringency increases with the degree to which distinguishers may access the predictor in question.  Our findings reveal that OI behaves qualitatively differently than previously studied notions of indistinguishability.  First, we provide constructions at all levels of the hierarchy.  Then, leveraging recently-developed machinery for proving average-case fine-grained hardness, we obtain lower bounds on the complexity of the more stringent forms of OI.  The hardness result provides scientific grounds for the political argument that, when inspecting algorithmic risk prediction instruments, auditors should be granted oracle access to the algorithm, not simply historical predictions.

Joint work with Cynthia Dwork, Omer Reingold, Guy N. Rothblum, Gal Yona; to appear at STOC 2021.

Zoom: https://harvard.zoom.us/j/98231541450

Given a smooth plane curve C defined over an arbitrary field k, we say that C is transverse-free if it has no transverse lines defined over k. If k is an infinite field, then Bertini’s theorem guarantees the existence of a transverse line defined over k, and so the transverse-free condition is interesting only in the case when k is a finite field F_q. After fixing a finite field F_q, we can ask the following question: For each degree d, what is the fraction of degree d transverse-free curves among all the degree d curves? In this talk, we will investigate an asymptotic answer to the question as d tends to infinity. This is joint work with Brian Freidin.

Zoom: https://harvard.zoom.us/j/91794282895?pwd=VFZxRWdDQ0VNT0hsVTllR0JCQytoZz09