• CMSA Colloquium 9/15/2021 – 5/25/2022

    CMSA 20 Garden Street, Cambridge, MA, United States

    During the 2021–22 academic year, the CMSA will be hosting a Colloquium, organized by Du Pei, Changji Xu, and Michael Simkin. It will take place on Wednesdays at 9:30am – 10:30am (Boston time). The […]

  • Hypergraph decompositions and their applications

    Speaker: Peter Keevash, Oxford Title: Hypergraph decompositions and their applications Abstract: Many combinatorial objects can be thought of as a hypergraph decomposition, i.e. a partition of (the edge set of) one hypergraph […]

  • Universal relations between entanglement, symmetries, and entropy

    Member Seminar Speaker: Gabriel Wong  Title: Universal relations between entanglement, symmetries, and entropy Abstract: Entanglement is an essential property of quantum systems that distinguishes them from classical ones.   It is responsible […]

  • Curve counting on surfaces and topological strings

    Speaker: Andrea Brini, U Sheffield Title: Curve counting on surfaces and topological strings Abstract: Enumerative geometry is a venerable subfield of Mathematics, with roots dating back to Greek Antiquity and a present […]

  • The Hitchin connection for parabolic G-bundles

    Speaker: Richard Wentworth, University of Maryland Title: The Hitchin connection for parabolic G-bundles Abstract: For a simple and simply connected complex group G, I will discuss some elements of the proof of […]

  • The Principles of Deep Learning Theory

    Virtual

    https://youtu.be/wXZKoHEzASg Speaker: Dan Roberts, MIT & Salesforce Title: The Principles of Deep Learning Theory Abstract: Deep learning is an exciting approach to modern artificial intelligence based on artificial neural networks. The […]

  • Black Holes, 2D Gravity, and Random Matrices

    Member Seminar Speaker: Dan Kapec Title: Black Holes, 2D Gravity, and Random Matrices Abstract: I will discuss old and new connections between black hole physics, 2D quantum gravity, and random matrix theory. […]

  • Induced subgraphs and tree decompositions

    Speaker: Maria Chudnovsky, Princeton Title: Induced subgraphs and tree decompositions Abstract: Tree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the […]

  • Hierarchical Transformers are More Efficient Language Models

    Virtual

    https://youtu.be/soqWNyrdjkw Speaker: Piotr Nawrot, University of Warsaw Title: Hierarchical Transformers are More Efficient Language Models Abstract: Transformer models yield impressive results on many NLP and sequence modeling tasks. Remarkably, Transformers can […]

  • On the solution space of the Ising perceptron model

    Member Seminar Speaker: Changji Xu Title: On the solution space of the Ising perceptron model Abstract:  Consider the discrete cube $\{-1,1\}^N$ and a random collection of half spaces which includes each […]