IDSS Special Seminar


list_alt
  • Topics in Information and Inference Seminar

    On October 18, 2018 at 4:00 pm till 5:00 pm
    Guy Bresler (MIT)
    32-D677

    This seminar consists of a series of lectures each followed by a period of informal discussion and social. The topics are at the nexus of information theory, inference, causality, estimation, and non-convex optimization. The lectures are intended to be tutorial in nature with the goal of learning about interesting and exciting topics rather than merely hearing about the most recent results. The topics are driven by the interests of the speakers, and with the exception of the two lectures on randomness and information, there is no planned coherence or dependency among them. Ad hoc follow-on meetings about any of the topics presented are highly encouraged.

    Find out more »: Topics in Information and Inference Seminar
  • Topics in Information and Inference Seminar

    On October 25, 2018 at 4:00 pm till 5:00 pm
    Abbas El Gamal (Stanford University)

    This seminar consists of a series of lectures each followed by a period of informal discussion and social. The topics are at the nexus of information theory, inference, causality, estimation, and non-convex optimization. The lectures are intended to be tutorial in nature with the goal of learning about interesting and exciting topics rather than merely hearing about the most recent results. The topics are driven by the interests of the speakers, and with the exception of the two lectures on randomness and information, there is no planned coherence or dependency among them. Ad hoc follow-on meetings about any of the topics presented are highly encouraged.

    Find out more »: Topics in Information and Inference Seminar
  • Topics in Information and Inference Seminar

    On July 7, 2025

    This seminar consists of a series of lectures each followed by a period of informal discussion and social. The topics are at the nexus of information theory, inference, causality, estimation, and non-convex optimization. The lectures are intended to be tutorial in nature with the goal of learning about interesting and exciting topics rather than merely hearing about the most recent results. The topics are driven by the interests of the speakers, and with the exception of the two lectures on randomness and information, there is no planned coherence or dependency among them. Ad hoc follow-on meetings about any of the topics presented are highly encouraged.

    Find out more »: Topics in Information and Inference Seminar
  • Topics in Information and Inference Seminar

    On November 1, 2018 at 4:00 pm till 5:00 pm
    Abbas El Gamal (Stanford University)

    *This lecture is the second of two. The first lecture was given Thursday, October 25th. 

    Title: Randomness and Information I and II

    Abstract: Exact or approximate generation of random variables with prescribed statistics from a given randomness source has many important applications, including random number generation from physical sources, Monte Carlo simulations, and randomized algorithms, e.g., for cryptography, optimization, and machine learning. It is also closely related to several fundamental questions in information theory, CS theory, and quantum information. The framework, measures, and techniques of information theory have played a key role in determining the fundamental limits on various settings in this area. In these two lectures, I will give a tutorial on the basic results in randomness generation (generating random variables from fair coin flips) and extraction (generating fair coin flips from a random process) with emphasis on their fundamental limits. In the first lecture I will show that (as in compression) entropy naturally arises as the limit on both exact and approximate generation and extraction. I will present classic results on exact generation by Knuth and Yao and on exact extraction by van Neumann and Elias, as well as some follow on work. I will then discuss the basic results on approximate randomness generation and extraction, including the use of random coding and binning to show the existence of optimal schemes. However, I will only briefly touch on the vast literature on approximate extraction and its applications in computer science. The second lecture will deal with multi terminal generation and extraction settings. I will first present classic results on approximate simulation of channel output statistics (resolvability) by Han and Verdú and on approximate distributed generation by Wyner. We will see that mutual information arises as a natural limit in both settings. I will then present results on exact distributed randomness generation and on exact distributed random key extraction from correlated sources. Finally I will discuss several natural common randomness measures that arise from these results. I will provide proofs for several of the results presented albeit not always in their most general or complete forms. I will be giving a third lecture on our recent results on distributed randomness generation (mostly based on work with Cheuk Ting Li) in the LIDS seminar on November 13.

    The full schedule of this Seminar series can be viewed here: http://stellar.mit.edu/S/project/infoandinf/

    This seminar consists of a series of lectures each followed by a period of informal discussion and social. The topics are at the nexus of information theory, inference, causality, estimation, and non-convex optimization. The lectures are intended to be tutorial in nature with the goal of learning about interesting and exciting topics rather than merely hearing about the most recent results. The topics are driven by the interests of the speakers, and with the exception of the two lectures on randomness and information, there is no planned coherence or dependency among them. Ad hoc follow-on meetings about any of the topics presented are highly encouraged.

    Find out more »: Topics in Information and Inference Seminar
  • Topics in Information and Inference Seminar

    On November 8, 2018 at 4:00 pm till 5:00 pm
    Suvrit Sra (MIT)
    32-D677

    This seminar consists of a series of lectures each followed by a period of informal discussion and social. The topics are at the nexus of information theory, inference, causality, estimation, and non-convex optimization. The lectures are intended to be tutorial in nature with the goal of learning about interesting and exciting topics rather than merely hearing about the most recent results. The topics are driven by the interests of the speakers, and with the exception of the two lectures on randomness and information, there is no planned coherence or dependency among them. Ad hoc follow-on meetings about any of the topics presented are highly encouraged.

    Find out more »: Topics in Information and Inference Seminar
  • Topics in Information and Inference Seminar

    On November 15, 2018 at 4:00 pm till 5:00 pm
    Devavrat Shah (MIT)
    32-D677

    This seminar consists of a series of lectures each followed by a period of informal discussion and social. The topics are at the nexus of information theory, inference, causality, estimation, and non-convex optimization. The lectures are intended to be tutorial in nature with the goal of learning about interesting and exciting topics rather than merely hearing about the most recent results. The topics are driven by the interests of the speakers, and with the exception of the two lectures on randomness and information, there is no planned coherence or dependency among them. Ad hoc follow-on meetings about any of the topics presented are highly encouraged.

    Find out more »: Topics in Information and Inference Seminar
  • Using Computer Vision to Study Society: Methods and Challenges

    On March 11, 2019 at 4:00 pm till 5:00 pm
    Timnit Gebru (Google)
    Microsoft NERD Center

    Abstract:
    Targeted socio-economic policies require an accurate understanding of a country’s demographic makeup. To that end, the United States spends more than 1 billion dollars a year gathering census data such as race, gender, education, occupation and unemployment rates. Compared to the traditional method of collecting surveys across many years which is costly and labor intensive, data-driven, machine learning driven approaches are cheaper and faster–with the potential ability to detect trends in close to real time. In this work, we leverage the ubiquity of Google Street View images and develop a computer vision pipeline to predict income, per capita carbon emission, crime rates and other city attributes from a single source of publicly available visual data. We first detect cars in 50 million images across 200 of the largest US cities and train a model to determine demographic attributes using the detect cars. To facilitate our work, we used a graph based algorithm to collect a challenging fine-grained dataset consisting of over 2600 classes of cars comprised of images from Google Street View and other web sources. Our prediction results correlate well with ground truth income (r=0.82), race, education, voting, sources investigating crime rates, income segregation, per capita carbon emission, and other market research. Data mining based works such as this one can be used for many types of applications–some ethical and others not. I will finally discuss work (inspired by my experiences while working on this project), on auditing and exposing biases found in computer vision systems. Using recent work on exposing the gender and skin type bias found in commercial gender classification systems as a case study, I will discuss how the lack of standardization and documentation in AI is leading to biased systems used in high stakes scenarios. I will end with the concept of AI datasheets for datasets, and model cards for model reporting to standardize information for datasets and pre-trained models, to push the field as a whole towards transparency and accountability. Host: Antonio Torralba.

    Bio:
    Timnit Gebru is a research scientist in the Ethical AI team at Google and just finished her postdoc in the Fairness Accountability Transparency and Ethics (FATE) group at Microsoft Research, New York. Prior to that, she was a PhD student in the Stanford Artificial Intelligence Laboratory, studying computer vision under Fei-Fei Li. Her main research interest is in data mining large-scale, publicly available images to gain sociological insight, and working on computer vision problems that arise as a result, including fine-grained image recognition, scalable annotation of images, and domain adaptation. She is currently studying the ethical considerations underlying any data mining project, and methods of auditing and mitigating bias in sociotechnical systems. The New York Times, MIT Tech Review and others have recently covered her work. As a cofounder of the group Black in AI, she works to both increase diversity in the field and reduce the negative impacts of racial bias in training data used for human-centric machine learning models.

    Find out more »: Using Computer Vision to Study Society: Methods and Challenges
  • Local Geometric Analysis and Applications

    On October 11, 2018 at 4:00 pm till 5:00 pm
    Lizhong Zheng (MIT)
    32-D677

    Abstract: Local geometric analysis is a method to define a coordinate system in a small neighborhood in the space of distributions over a given alphabet. It is a powerful technique since the notions of distance, projection, and inner product defined this way are useful in the optimization problems involving distributions, such as regressions. It has been used in many places in the literature such as correlation analysis, correspondence analysis. In this talk, we will go through some of the basic setups and properties, and discuss a few applications in information theory, dimension reduction and softmax regression.

    About this Seminar: This seminar consists of a series of lectures each followed by a period of informal discussion and social. The topics are at the nexus of information theory, inference, causality, estimation, and non-convex optimization. The lectures are intended to be tutorial in nature with the goal of learning about interesting and exciting topics rather than merely hearing about the most recent results. The topics are driven by the interests of the speakers, and with the exception of the two lectures on randomness and information, there is no planned coherence or dependency among them. Ad hoc follow-on meetings about any of the topics presented are highly encouraged.

    Find out more »: Local Geometric Analysis and Applications