Skip to main content Skip to navigation

Computer Science Colloquium

The Computer Science Colloquium features external speakers from all areas of computer science. If you have any questions, please contact the organisers, Markus Brill and Yu Guan.

For visiting the department, see the map of campus, directions, and accommodation recommendations.

Upcoming Events

CS Colloquium: Complexity in the Era of AI and Data-Driven Computing (Lance Fortnow - Illinois Institute of Technology)

Date Mon, 02 Mar
Location CS1.04

Complexity in the Era of AI and Data-Driven Computing

Lance Fortnow

Illinois Institute of Technology

In 2013 I wrote a book chapter on an imagined world where P = NP. A world with advances in medicine, translation, video recognition and generation, and much more. With the advances we’ve seen in computing power, optimization, data-driven algorithms, and of course remarkable advances in artificial intelligence, much of this world is coming true. We’ve made dramatic progress on problems thought unsolvable a decade ago. With one major exception, our cryptographic protocols have remained secure.

How did we get to this seemingly impossible world I call Optiland where we can solve many difficult problems quickly in practice while our secrets remain secure, and what does it mean for our understanding and role of computational complexity?

We’ll give a (mostly) non-technical overview that takes a step back and rethinks complexity in light of these advances, what AI tells us about complexity, and what complexity tells us about AI.

Lance Fortnow


Lance Fortnow

Biography

Lance Fortnow is a professor in Computer Science at the Illinois Institute of Technology. He founded the College of Computing at Illinois Tech and served as its inaugural dean from June 2020 to June 2025, after starting as the Dean of Science in 2019.

Fortnow received his Ph.D. in Applied Mathematics at MIT in 1989 under the supervision of Michael Sipser. Before he joined Illinois Tech, Fortnow was the chair of the School of Computer Science at the Georgia Institute of Technology and previously was a professor at Northwestern University and the University of Chicago, a senior research scientist at the NEC Research Institute and a one-year visitor at CWI and the University of Amsterdam. From 2007 to 2018 Fortnow held an adjoint professorship at the Toyota Technological Institute at Chicago.

Fortnow's research spans computational complexity and its applications. His work on interactive proof systems and time-space lower bounds for satisfiability have led to his election as a 2007 ACM Fellow. In addition he was an NSF Presidential Faculty Fellow from 1992-1998 and a Fulbright Scholar to the Netherlands in 1996-97. His current research focuses on how artificial intelligence changes the way we think about both the theory and applications of computing.

Among his many activities, Fortnow served as the founding editor-in-chief of the ACM Transaction on Computation Theory, served as chair of ACM SIGACT and on the Computing Research Association board of directors. He served as chair of the IEEE Conference on Computational Complexity from 2000-2006. Fortnow originated and co-authors the Computational Complexity weblog since 2002, the first major theoretical computer science blog. He has over six thousand social media followers.

Fortnow's survey The Status of the P versus NP Problem is one of the CACM's most downloaded article. Fortnow has written a popular science book The Golden Ticket: P, NP and the Search for the Impossible loosely based on that article.

Past Events

CS Colloquium + Foundations of AI Seminar: Arthur Gretton (UCL)

Date Tue, 15 Oct

Title: Causal Effect Estimation with Context and Confounders

Abstract: A fundamental causal modelling task is to predict the effect of an intervention (or treatment) on an outcome, given context/covariates. Examples include predicting the effect of a medical treatment on patient health given patient symptoms and demographic information, or predicting the effect of ticket pricing on airline sales given seasonal fluctuations in demand. The problem becomes especially challenging when the treatment and context are complex (for instance, "treatment" might be a web ad design or a radiotherapy plan), and when only observational data is available (i.e., we have access to historical data, but cannot intervene ourselves). The challenge is greater still when the covariates are not observed, and constitute a hidden source of confounding.

I will give an overview of some practical tools and methods for estimating causal effects of complex, high dimensional treatments from observational data. The approach is based on conditional feature means, which represent conditional expectations of relevant model features. These features can be deep neural nets (adaptive, finite dimensional, learned from data), or kernel features (fixed, infinite dimensional, enforcing smoothness). When hidden confounding is present, a neural net implementation of instrumental variable regression can be used to correct for this confounding. The methods will be applied to modelling employment outcomes for the US Job Corps program for Disadvantaged Youth, and in policy evaluation for reinforcement learning.

Bio: Arthur Gretton is a Professor with the Gatsby Computational Neuroscience Unit, and director of the Centre for Computational Statistics and Machine Learning (CSML) at UCL; and a research scientist at Google Deepmind. His recent research interests include causal inference and representation learning, design and training of generative models, and nonparametric hypothesis testing.

Arthur has been an associate editor at IEEE Transactions on Pattern Analysis and Machine Intelligence, an Action Editor for JMLR, a Senior Area Chair for NeurIPS (2018,2021) and ICML (2022), a member of the COLT Program Committee in 2013, and a member of Royal Statistical Society Research Section Committee since January 2020. Arthur was program co-chair for AISTATS in 2016, tutorials co-chair for ICML 2018, workshops co-chair for ICML 2019, program co-chair for the Dali workshop in 2019, and co-organsier of the Machine Learning Summer School 2019 in London.

See also https://faiseminarswarwick.github.io/speakers/a-gretton.html

CS Colloquium: Francis Bach (INRIA)

Date Tue, 18 Jun
Location MB0.07

Physics-informed machine learning as a kernel method

CS Colloquium: Valentina Donzella (WMG, Warwick)

Date Wed, 15 May
Location MB0.01

What Automated Vehicles need to learn? The dark side of sensor data

CS Colloquium: Prof. Huiyu Zhou (Leicester)

Date Wed, 08 May
Location MB2.23

Low-light image enhancement using cell vibration model

CS Colloquium: Juan Ye (St Andrews)

Date Wed, 24 Apr
Location MB2.23

Title: Continual learning in sensor-based human activity recognition

CS Colloquium: Budi Arief (Kent)

Date Wed, 20 Mar
Location CS1.01

Ransomware and Us: A Socio-technical Look into Ransomware

CS Colloquium: Cecilia Pasquini (Fondazione Bruno Kessler)

Date Wed, 13 Mar
Location MB3.17

Video-based identity proofing

CS Colloquium: Prof. Chenggang Wu, (Chinese Academy of Sciences)

Date Fri, 08 Mar
Location MSB 2.22

Enhancing software security through compartmentalization and isolation

CS Colloquium: Matthias Caro (FU Berlin)

Date Wed, 14 Feb
Location CS1.04

Learning quantum states and unitaries of bounded gate complexity

CS Colloquium: Zoltan Szabó (LSE)

Date Mon, 12 Feb
Location CS1.01

Generalized Mean and Variance for Sample-Efficient Data Science

CS Colloquium: Wenda Li (Heriot Watt University)

Date Wed, 31 Jan
Location CS1.04

Practice of RF Sensing for Digital Health

CS Colloquium: Haixing Duan (Tsinghua University)

Date Thu, 30 Nov
Location MB2.22

Cyber-Cannon: Collaborating Cloud Service for Distributed Denial of Service(DDoS) Attacks

CS Colloquium: Vitomir Struc (University of Ljubljana)

Date Wed, 29 Nov
Location CS1.01

Face Image Quality Assessment (FIQA): Recent Advancements and Future Challenges

CS Colloquium: Sebastian Wild (Liverpool)

Date Wed, 15 Nov
Location CS1.01

Quicksort, Timsort, Powersort: Algorithmic ideas, engineering tricks, and trivia behind CPython’s new sorting algorithm

CS Colloquium: Evangelos Pournaras (Leeds)

Date Wed, 08 Nov
Location CS1.01

A `Swiss Army Knife' for Direct Democracy - On Voting Design and AI support for Legitimacy

CS Colloquium: Pengpeng Hu (Coventry University)

Date Wed, 18 Oct
Location CS1.01

Deep learning-based 3D human body shape reconstruction from point clouds

CS Colloquium: Debankur Mukherjee (Georgia Tech)

Date Mon, 09 Oct
Location CS1.01

Load Balancing under Data Locality: Extending Mean-Field Framework to Constrained Large-Scale Systems

CS Colloquium: Lirong Xia (Rensselaer Polytechnic Institute)

Date Fri, 07 Jul
Location MB0.01

AI-Powered Group Decision Making

CS Colloquium: Irene Amerini (Sapienza Università di Roma)

Date Wed, 21 Jun
Location MB0.07

Advances in Multimedia forensics to counter misinformation

CS Colloquium: Yuan-Fang Li (Monash)

Date Fri, 09 Jun
Location CS1.01

Turning information into knowledge: challenges & solutions

CS Colloquium: Yali Du (King's College London)

Date Wed, 24 May
Location MB0.07

Reinforcement Learning with Human Values

CS Colloquium: Sergii Strelchuk (Cambridge)

Date Tue, 23 May
Location MB0.07

Insights in quantum complexity from classical simulation of quantum computation

CS Colloquium: Petar Velickovic (Deepmind)

Date Tue, 21 Mar
Location CS1.04

Reasoning Algorithmically: from Toy Experiments to AGI Modules

CS Colloquium: Debmalya Mandal (Max Planck Institute)

Date Fri, 10 Mar
Location MB2.23

AI for Societal Decision-Making

CS Colloquium: Jose Camacho-Collados (Cardiff)

Date Wed, 08 Mar
Location CS1.01

Natural Language Processing and Social Media: Challenges, Applications and TweetNLP

CS Colloquium: Matthias Caro (Caltech)

Date Fri, 24 Feb
Location CS1.01

Quantum Computing Meets Machine Learning - A Math/TCS Perspective

CS Colloquium: Grzegorz Lisowski (Warwick) - Viva Special

Date Thu, 23 Feb
Location MB2.22

An Algorithmic Analysis of Deliberation and Representation in Collective Behaviour

DIMAP Seminar + DCS Colloquium: Adi Shamir (Weizmann Institute of Science)

Date Tue, 17 Jan
Location R0.21

Adi Shamir is the Paul and Marlene Borman Professor of Applied Mathematics at the Weizmann Institute of Science. He is a co-inventor of the RSA algorithm (along with Ron Rivest and Len Adleman), a co-inventor of the Feige–Fiat–Shamir identification scheme (along with Uriel Feige and Amos Fiat), one of the inventors of differential cryptanalysis and has made numerous contributions to the fields of cryptography and computer science.

Adi is receiving an honorary degree in the January congregation, managed by WMG.

CS Colloquium: Jose Collados (Cardiff)

Date Wed, 16 Nov

CS Colloquium: Dongwon Lee (Penn State)

Date Wed, 02 Nov

CS Colloquium: Cambyse Rouze (TU Munchen)

Date Wed, 19 Oct

CS Colloquium: Nikos Aletras (Sheffield)

Date Wed, 05 Oct

CS Colloquium: Anindya De (UPenn)

Date Tue, 23 Aug
Location MB 3.17

CS Colloquium: Shay Moran (Technion)

Date Thu, 09 Jun

CS Colloquium: Jessica Sorrell (UPenn)

Date Thu, 26 May

CS Colloquium: Dominic Orchard (Kent)

Date Thu, 10 Mar

CS Colloquium: Claus Brabrand (ITU Copenhagen)

Date Thu, 25 Nov

CS Colloquium Divyakant Agrawal (UC Santa Barbara)

Date Thu, 04 Nov

CS Colloquium: Milan Vojnovic (LSE)

Date Thu, 21 Oct

CS Colloquium: Mohamed Abdelfattah (Cornel Tech)

Date Thu, 07 Oct

CS Colloquium: Yves-Alexandre de Montjoye (Imperial College)

Date Thu, 01 Jul

CS Colloquium: Tobias Weinzierl (Durham)

Date Thu, 24 Jun

CS Colloquium: Ueli Maurer (ETH)

Date Thu, 27 May

CS Colloquium: Eiko Yonecki (Cambridge)

Date Thu, 13 May

CS Colloquium: Amanda Prorok (Cambridge)

Date Mon, 15 Mar

CS Colloquium: Arthur Gervais (Imperial College; Liquidity Network)

Date Thu, 21 Jan

Let us know you agree to cookies