logo stampa

BemacsTalks

Since its conception, this program has invited outstanding guest speakers from academia and the business world to provide insight on various topics related to Data Science. Starting this year, these talks have been divided into two separate branches: BEMACS Lectures and BEMACS Networking.

BEMACS Lectures

This series of presentations is held by distinguished academics from around the world, who describe their research and its impact on science and society in an accessible way. BEMACS Lecturers include Sir David Spiegelhalter (former Winton Professor of the Public Understanding of Risk at Cambridge), who talks about “trustworthiness” in the context of Data Science, Alessio Figalli (Fields Medal 2018, ETH Zurich), who shows applications of optimal transport from nature to Machine Learning, and David C. Parkes (Harvard), who discusses Deep Learning for economic discovery.

Upcoming BEMACS Lecture

Game Theory Meets Deep Learning - 31 May

Constantinos Daskalakis Avanessians Professor of Electrical Engineering and Computer Science, MIT

Deep Learning has delivered significant advances in learning challenges across various data modalities including speech, image and language, much of that progress being fueled by the success of gradient descent-based optimization methods in computing good solutions to non-convex optimization problems. From playing complex board games at super-human level to robustifying Deep Neural Net-based classifiers against adversarial attacks, training deep generative models, and training DNN-based models to interact with each other and with humans, many outstanding challenges in Deep Learning now lie at its interface with Game Theory. Since these applications involve multiple agents, the role of single-objective optimization is played by equilibrium computation. On this front, however, the Deep Learning toolkit has been less successful. Gradient-descent based methods struggle to converge, let alone lead to good solutions, and due to non-convexities, standard game-theoretic equilibrium concepts fail to exist. So how does one train DNNs to be strategic? And what is even the goal of the training? We shed light on these challenges through a combination of learning-theoretic, complexity-theoretic, game-theoretic and topological techniques, presenting obstacles and opportunities for Deep Learning and Game Theory going forward.


Past BEMACS Lectures

Can We Trust Statistics and Algorithms?

David Spiegelhalter Emeritus Professor of Statistics, Statistical Laboratory, University of Cambridge
19 April 2023
The Covid pandemic has emphasized the key role that statistics play in understanding what is going on in the world.  But how do we decide whether to trust the numbers that get put in front of us?  Are they being used to inform or persuade? Using a wide range of examples, the lecture looks at the way that statistics can be used to try and persuade audiences to think or act in a certain way, contrast this with efforts to make communication 'trustworthy', and list the questions that you should ask whenever you are presented with claims based on numbers.  Similar ideas can be used to judge claims made both about algorithms, and by algorithms, whether they are called 'AI' or not. It is argued that 'trustworthiness' should be a vital concern of data science.

Tie-Breaker Designs

Art B. Owen Max H. Stein Professor of Statistics, Stanford University
February 2022
Companies may offer incentives to their best customers and philanthropists may offer scholarships to the strongest students. They can evaluate the impact of these treatments later using a regression discontinuity analysis. Unfortunately, regression discontinuity analyses have high variance. It is possible to get much more statistical efficiency using a tie-breaker design that works by triage: top subjects get the treatment, bottom subjects do not, and those in between have their treatment randomized. Statistical efficiency increases monotonically with the amount of randomization, causing an exploration versus exploitation tradeoff. This holds in a simple two line regression model and also with nonparametric kernel regression based methods. The conclusion is that when it is possible (and ethical) to randomize for a group of subjects, it is wise to do so. Some new work studies optimal design of tie-breakers when the treatment is rare as well as extensions to multiple regression.
Watch it on youtube

Deep Learning for Economic Discovery

David C. Parkes George F. Colony Professor of Computer Science, Harvard University
28 October 2021
This talk introduces and provides illustrations of the use of differentiable representations of economic rules, together with suitable objectives, architectures, and constraints, with which to use the methods of deep learning to discover incentive-aligned mechanisms that approximately optimize various kinds of desiderata. This approach is illustrated to the design of auctions and two-sided matching mechanisms.
Watch it on youtube

Optimal Transport: From Nature to Machine Learning

Alessio Figalli FIM Director and Chaired Professor, ETH Zurich
2 March 2021
We are in a golden age for mathematics. The technology we have now would not exist if there had not been research in 'pure' mathematics. This fact is now clear and many companies are investing more and more in 'fundamental' research. On the other hand, the challenges of today's society are an inexhaustible source of mathematical problems.
In order to exploit the information hidden in data it is necessary to use quantitative modeling extensively, with disciplines such as mathematics, statistics and computer science that merge to go deep into the problems and find solutions that are not only robust but often surprising and elegant.
Watch it on youtube


BEMACS Networking
This is a new series of presentations by leading professionals from the Data Science industry, who present the type of work they carry out on their teams and discuss current and future priorities and opportunities.



Last modified 11/03/2024 - 17:26:17