Title: Why things don’t work — On the foundations of mathematics and methodological barriers in computations and AI

Thumbnail

Event details

Date 21.09.2021
Hour 14:1515:00
Speaker Anders Hansen leads the Applied Functional and Harmonic Analysis group within the Cambridge Centre for Analysis at DAMTP. He is a Reader (Associate Professor) in mathematics at DAMTP, Professor of Mathematics at the University of Oslo, a Royal Society University Research Fellow and also a Fellow of Peterhouse.

His interests include Functional Analysis (applied), Foundations of Computations, Artificial Intelligence, Compressed Sensing, Optimisation, Operator/Spectral Theory, Numerical Analysis, Computational Harmonic Analysis, Mathematical Signal Processing, Sampling Theory, Inverse Problems, Medical Imaging, Geometric Integration, Operator Algebras
Location Online
Category Conferences - Seminars
Event Language English

Abstract: The alchemists wanted to create gold, Hilbert wanted an algorithm to solve Diophantine equations, researchers want to make deep learning robust in AI, MATLAB wants (but fails) to detect when it provides wrong solutions to linear programs etc. Why does one not succeed in so many of these fundamental cases? The reason is typically methodological barriers. The history of science is full of methodological barriers — reasons for why we never succeed in reaching certain goals. In many cases, this is due to the foundations of mathematics. We will present a new program on methodological barriers and foundations of mathematics, where — in this talk — we will focus on two basic problems: (1) The instability problem in deep learning: Why do researchers fail to produce stable neural networks in basic classification and computer vision problems that can easily be handled by humans — when one can prove that there exist stable and accurate neural networks? Moreover, AI algorithms can typically not detect when they are wrong, which becomes a serious issue when striving to create trustworthy AI. The problem is more general, as for example MATLAB's linprog routine is incapable of certifying correct solutions of basic linear programs. Thus, we’ll answer the following question: (2) Why are algorithms (in AI and computations in general) incapable of determining when they are wrong? 

Practical information

  • Informed public
  • Free
  • This event is internal

Organizer

  • Martin Vetterli

Contact

  • Michalina Pacholska, Nicoletta Isaac

Event broadcasted in

Share