BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200205T163000
DTEND;TZID=America/New_York:20200205T173000
DTSTAMP:20240507T204003Z
CREATED:20240212T090826Z
LAST-MODIFIED:20240507T204003Z
UID:10001902-1580920200-1580923800@cmsa.fas.harvard.edu
SUMMARY:Gentle Measurement of Quantum States and Differential Privacy
DESCRIPTION:Speaker: Scott Aaronson (University of Texas at Austin) \nTitle: Gentle Measurement of Quantum States and Differential Privacy \nAbstract: I’ll discuss a recent connection between two seemingly unrelated problems: how to measure a collection of quantum states without damaging them too much (“gentle measurement”)\, and how to provide statistical data without leaking too much about individuals (“differential privacy\,” an area of classical CS). This connection leads\, among other things\, to a new protocol for “shadow tomography” of quantum states (that is\, answering a large number of questions about a quantum state given few copies of it). Based on joint work with Guy Rothblum (arXiv:1904.08747).
URL:https://cmsa.fas.harvard.edu/event/2-5-2020-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-02.05.20-1-1-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200207T163000
DTEND;TZID=America/New_York:20200207T173000
DTSTAMP:20240507T203547Z
CREATED:20240212T090243Z
LAST-MODIFIED:20240507T203547Z
UID:10001899-1581093000-1581096600@cmsa.fas.harvard.edu
SUMMARY:A Compact\, Logical Approach to Large-Market Analysis
DESCRIPTION:Speaker: Scott Duke Kominers (Harvard)\n\nTitle: A Compact\, Logical Approach to Large–Market Analysis\n\nAbstract: In game theory\, we often use infinite models to represent “limit” settings\, such as markets with a large number of agents or games with a long time horizon. Yet many game-theoretic models incorporate finiteness assumptions that\, while introduced for simplicity\, play a real role in the analysis. Here\, we show how to extend key results from (finite) models of matching\, games on graphs\, and trading networks to infinite models by way of Logical Compactness\, a core result from Propositional Logic. Using Compactness\, we prove the existence of man-optimal stable matchings in infinite economies\, as well as strategy-proofness of the man-optimal stable matching mechanism. We then use Compactness to eliminate the need for a finite start time in a dynamic matching model. Finally\, we use Compactness to prove the existence of both Nash equilibria in infinite games on graphs and Walrasian equilibria in infinite trading networks.
URL:https://cmsa.fas.harvard.edu/event/2-12-2020-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-02.12.20-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200219T163000
DTEND;TZID=America/New_York:20200219T173000
DTSTAMP:20240507T202728Z
CREATED:20240212T081736Z
LAST-MODIFIED:20240507T202728Z
UID:10001886-1582129800-1582133400@cmsa.fas.harvard.edu
SUMMARY:The Cubical Route to Understanding Groups
DESCRIPTION:Speaker: Daniel Wise (McGill University)\n\nTitle: The Cubical Route to Understanding Groups\n\nAbstract: Cube complexes have come to play an increasingly central role within geometric group theory\, as their connection to right-angled Artin groups provides a powerful combinatorial bridge between geometry and algebra. This talk will introduce nonpositively curved cube complexes\, and then describe the developments that culminated in the resolution of the virtual Haken conjecture for 3-manifolds and simultaneously dramatically extended our understanding of many infinite groups.
URL:https://cmsa.fas.harvard.edu/event/02-21-2020-colloquium/
LOCATION:MA
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-2.26.20-1583x2048-1-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200219T171500
DTEND;TZID=America/New_York:20200219T181500
DTSTAMP:20240507T203004Z
CREATED:20240212T082420Z
LAST-MODIFIED:20240507T203004Z
UID:10001888-1582132500-1582136100@cmsa.fas.harvard.edu
SUMMARY:Quantum Money from Lattices
DESCRIPTION:Speaker: Peter Shor (MIT)\n\nTitle: Quantum Money from Lattices\n\nAbstract: Quantum money is a cryptographic protocol for quantum computers. A quantum money protocol consists of a quantum state which can be created (by the mint) and verified (by anybody with a quantum computer who knows what the “serial number” of the money is)\, but which cannot be duplicated\, even by somebody with a copy of the quantum state who knows the verification protocol. Several previous proposals have been made for quantum money protocols. We will discuss the history of quantum money and give a protocol which cannot be broken unless lattice cryptosystems are insecure.
URL:https://cmsa.fas.harvard.edu/event/02-19-2020-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/P.ShorColloquium-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200228T164500
DTEND;TZID=America/New_York:20200228T174500
DTSTAMP:20240507T203156Z
CREATED:20240212T082705Z
LAST-MODIFIED:20240507T203156Z
UID:10001889-1582908300-1582911900@cmsa.fas.harvard.edu
SUMMARY:Derandomizing Algorithms via Spectral Graph Theory
DESCRIPTION:Speaker: Salil Vadhan (Harvard) \nTitle: Derandomizing Algorithms via Spectral Graph Theory\n\nAbstract: Randomization is a powerful tool for algorithms; it is often easier to design efficient algorithms if we allow the algorithms to “toss coins” and output a correct answer with high probability.  However\, a longstanding conjecture in theoretical computer science is that every randomized algorithm can be efficiently “derandomized” — converted into a deterministic algorithm (which always outputs the correct answer) with only a polynomial increase in running time and only a constant-factor increase in space (i.e. memory usage).  In this talk\, I will describe an approach to proving the space (as opposed to time) version of this conjecture via spectral graph theory.  Specifically\, I will explain how randomized space-bounded algorithms are described by random walks on directed graphs\, and techniques in algorithmic spectral graph theory (e.g. solving Laplacian systems) have yielded deterministic space-efficient algorithms for approximating the behavior of such random walks on undirected graphs and Eulerian directed graphs (where every vertex has the same in-degree as out-degree).  If these algorithms can be extended to general directed graphs\, then the aforementioned conjecture about derandomizing space-efficient algorithms will be resolved.\nJoint works with Jack Murtagh\, Omer Reingold\, Aaron Sidford\,  AmirMadhi Ahmadinejad\, Jon Kelner\, and John Peebles.
URL:https://cmsa.fas.harvard.edu/event/3-4-2020-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-03.04.20-1.png
END:VEVENT
END:VCALENDAR