Math and Machine Learning Program Discussion
CMSA Room G10 CMSA, 20 Garden Street, Cambridge, MA, United StatesMath and Machine Learning Program Discussion
Math and Machine Learning Program Discussion
Colloquium Speaker: Pavel Etingof (MIT) Title: Periodic pencils of flat connections and their p-curvature A periodic pencil of flat connections on a smooth algebraic variety is a linear family of flat connections , where are local coordinates on and are matrix-valued regular functions. A pencil is periodic if it is generically invariant under the shifts up to isomorphism. I will […]
Topics in Deep Learning Theory Eli Grigsby
Open Discussion/Tea
Geometry and Quantum Theory Seminar Speaker: Keyou Zeng (CMSA) Title: Mathematics around Twisted Holography Abstract: The holography principle is an important idea in physics and has been widely studied since the 90s. Twisted holography offers a way to simplify physical holography models through the procedure called twisting. In the first part of the talk, I’ll […]
https://youtu.be/1QwTqfiqxTw CMSA/Tsinghua Math-Science Literature Lecture Date: Wednesday, September 18, 2024 Time: 9:00 - 10:30 am ET Location: Via Zoom Webinar Register for Zoom Webinar Speaker: Marc Lackenby, University of Oxford Title: The complexity of knots Abstract: In his final paper in 1954, Alan Turing wrote `No systematic method is yet known by which one can […]
Math and Machine Learning Program Discussion
CMSA Q&A Seminar Speaker: Noam Elkies, Harvard Math Topic: How to show E8 and Leech lattices have optimal sphere packings?
Mathematical Physics and Algebraic Geometry Seminar Speaker: Minghao Wang (Boston University) Title: Feynman graph integrals from topological holomorphic theories Abstract: Feynman graph integrals from topological theories were developed by M. Kontsevich, S. Axelrod and I. M. Singer in 1990s. These integrals have many mathematical applications, such as knot invariants, operad theory and formality theorems. In […]
Topics in Deep Learning Theory Eli Grigsby
Math and Machine Learning Program Discussion
Member Seminar Speaker: Tomer Ezra (CMSA) Title: Communication Complexity of Combinatorial Auctions Abstract: We study the communication complexity of welfare maximization in combinatorial auctions with m items and two subadditive bidders. A 2-approximation can be guaranteed by a trivial randomized protocol with zero communication, or a trivial deterministic protocol with O(1) communication. We show that […]