BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://live-hu-cmsa-222.pantheonsite.io
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:20150308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20151101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20161106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20171105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180929T083000
DTEND;TZID=America/New_York:20180930T150000
DTSTAMP:20250328T145116Z
CREATED:20230715T084506Z
LAST-MODIFIED:20250328T145116Z
UID:10000090-1538209800-1538319600@live-hu-cmsa-222.pantheonsite.io
SUMMARY:F-Theory Workshop
DESCRIPTION:The CMSA hosted an F-Theory workshop September 29-30\, 2018. The workshop was held in room G10 of the CMSA\, located at 20 Garden Street\, Cambridge\, MA. \nYoutube Playlist  \nOrganizers: \n\nPaolo Aluffi (Florida State)\nLara B. Anderson (Virginia Tech)\nMboyo Esole (Northeastern)\nShing-Tung Yau (Harvard)\n\nSpeakers: \n\nMirjam Cvetic\, University of Pennsylvania\nTommaso de Fernex\, University of Utah\nJames Gray\, Virginia Tech\nJonathan Heckman\, University of Pennsylvania\nMonica Kang\, Harvard University\nSándor Kovács\, University of Washington\nAnatoly Libgober\, UIC\nMatilde Marcolli\, Caltech\, University of Toronto\, and Perimeter Institute\nWashington Taylor\, MIT\nCumrun Vafa\, Harvard University
URL:https://live-hu-cmsa-222.pantheonsite.io/event/f-theory-conference/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180827T092000
DTEND;TZID=America/New_York:20180828T151500
DTSTAMP:20250305T184118Z
CREATED:20230715T084116Z
LAST-MODIFIED:20250305T184118Z
UID:10000089-1535361600-1535469300@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Kickoff Workshop on Topology and Quantum Phases of Matter
DESCRIPTION:On August 27-28\, 2018\, the CMSA will be hosting a Kickoff workshop on Topology and Quantum Phases of Matter. New ideas rooted in topology have recently had a big impact on condensed matter physics\, and have highlighted new connections with high energy physics\, mathematics and quantum information theory. Additionally\, these ideas have found applications in the design of photonic systems and of materials with novel mechanical properties. The aim of this program will be to deepen these connections by fostering discussion and seeding new collaborations within and across disciplines. \nThis workshop is a part of the CMSA’s program on Program on Topological Aspects of Condensed Matter\,  and will be the first of two workshops\, in addition to a visitor program and seminars. \nThe workshop will be held in room G10 of the CMSA\, located at 20 Garden Street\, Cambridge\, MA. \nSpeakers:  \n\nZhen Bi\, MIT\nMeng Cheng\, Yale\nDima Feldman\, Brown\nDominic Else\, UCSB\nLiang Fu\, MIT\nFabian Grusdt\, Harvard\nYing Fei Gu\, Harvard\nBert Halperin\, Harvard\nAnton Kapustin\, Caltech\nPatrick Lee\, MIT\nL. Mahadevan\, Harvard\nBrad Marston\, Brown\nMax Metlitski\, MIT\nEmil V. Prodan\, Yeshiva\nAchim Rosch\, University of Cologne\nMathias Scheurer\, Harvard\nMarin Soljacic\, MIT\nX. G. Wen\, MIT\nCenke Xu\, UCSB\nFrank Zhang\, Cornell
URL:https://live-hu-cmsa-222.pantheonsite.io/event/kickoff-workshop-on-topology-and-quantum-phases-of-matter/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Topological-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180823T083000
DTEND;TZID=America/New_York:20180824T163000
DTSTAMP:20250415T154139Z
CREATED:20230715T083801Z
LAST-MODIFIED:20250415T154139Z
UID:10000086-1535013000-1535128200@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Big Data Conference 2018
DESCRIPTION:On August 23-24\, 2018 the CMSA hosted the fourth annual Conference on Big Data. The Conference featured speakers from the Harvard community as well as scholars from across the globe\, with talks focusing on computer science\, statistics\, math and physics\, and economics. \nThe talks were held in Science Center Hall B\, 1 Oxford Street. \nSpeakers:  \n\nMohammad Akbarpour\, Stanford\nEmily Breza\, Harvard\nFrancesca Dominici\, Harvard\nChiara Farronato\, Harvard\nKobi Gal\, Ben Gurion\nJonah Kallenbach\, Reverie Labs\nSamuel Kou\, Harvard\nLaura Kreidberg\, Harvard\nDanielle Li\, MIT\nLibby Mishkin\, Uber\nJosh Speagle\, Harvard\nWilliam Stein\, University of Washington\nAlex Teyltelboym\, University of Oxford\nSergiy Verstyuk\, CMSA/Harvard\n\nOrganizers:  \n\nShing-Tung Yau\, William Caspar Graustein Professor of Mathematics\, Harvard University\nScott Duke Kominers\, MBA Class of 1960 Associate Professor\, Harvard Business\nRichard Freeman\, Herbert Ascherman Professor of Economics\, Harvard University\nJun Liu\, Professor of Statistics\, Harvard University\nHorng-Tzer Yau\, Professor of Mathematics\, Harvard University
URL:https://live-hu-cmsa-222.pantheonsite.io/event/2018-big-data-conference-2/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Big Data Conference,Conference,Event
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Big-Data-2018-4.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180818T083000
DTEND;TZID=America/New_York:20180820T172000
DTSTAMP:20250304T213419Z
CREATED:20230715T083526Z
LAST-MODIFIED:20250304T213419Z
UID:10000084-1534581000-1534785600@live-hu-cmsa-222.pantheonsite.io
SUMMARY:From Algebraic Geometry to Vision and AI: A Symposium Celebrating the Mathematical Work of David Mumford
DESCRIPTION:On August 18 and 20\, 2018\, the Center of Mathematic Sciences and Applications and the Harvard University Mathematics Department hosted a conference on From Algebraic Geometry to Vision and AI: A Symposium Celebrating the Mathematical Work of David Mumford. The talks took place in Science Center\, Hall B. \nSaturday\, August 18th:  A day of talks on Vision\, AI and brain sciences \nMonday\, August 20th: a day of talks on Math \nSpeakers: \n\nStuart Geman\, Brown\nJanos Kollar\, Princeton\nTai Sing Lee\, CMU\nEmanuele Macri\, Northeastern\nJitendra Malik\, Berkeley / FAIR\nPeter Michor\, University of Vienna\nMichael Miller\, Johns Hopkins\nAaron Pixton\, MIT\nJayant Shah\, Northeastern\nJosh Tenenbaum\, MIT\nBurt Totaro\, UCLA\nAvi Wigderson\, IAS\nYing Nian Wu\, UCLA\nLaurent Younes\, Johns Hopkins\nSong-Chun Zhu\, UCLA\n\nOrganizers:\n\nChing-Li Chai\, University of Pennsylvania\nDavid Gu\, Stony Brook University\nAmnon Neeman\, Australian National University\nMark Nitzberg\, University of California at Berkeley\nYang Wang\, Hong Kong University of Science and Technology\nShing-Tung Yau\, Harvard University\nSong-Chun Zhu\, University of California\, Los Angeles\n\nPublication: \nPure and Applied Mathematics Quarterly\nSpecial Issue: In Honor of David Mumford\nGuest Editors: Ching-Li Chai\, Amnon Neeman \n 
URL:https://live-hu-cmsa-222.pantheonsite.io/event/from-algebraic-geometry-to-vision-and-ai-a-symposium-celebrating-the-mathematical-work-of-david-mumford/
LOCATION:Common Room\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Conference,Event
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Mumford-3.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180409T090000
DTEND;TZID=America/New_York:20180413T153000
DTSTAMP:20250305T214334Z
CREATED:20230717T175359Z
LAST-MODIFIED:20250305T214334Z
UID:10000079-1523264400-1523633400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Coding and Information Theory
DESCRIPTION:The workshop on coding and information theory will take place April 9-13\, 2018 at the Center of Mathematical Sciences and Applications\, located at 20 Garden Street\, Cambridge\, MA. \nThis workshop will focus on new developments in coding and information theory that sit at the intersection of combinatorics and complexity\, and will bring together researchers from several communities — coding theory\, information theory\, combinatorics\, and complexity theory — to exchange ideas and form collaborations to attack these problems. \nSquarely in this intersection of combinatorics and complexity\, locally testable/correctable codes and list-decodable codes both have deep connections to (and in some cases\, direct motivation from) complexity theory and pseudorandomness\, and recent progress in these areas has directly exploited and explored connections to combinatorics and graph theory.  One goal of this workshop is to push ahead on these and other topics that are in the purview of the year-long program.  Another goal is to highlight (a subset of) topics in coding and information theory which are especially ripe for collaboration between these communities.  Examples of such topics include polar codes; new results on Reed-Muller codes and their thresholds; coding for distributed storage and for DNA memories; coding for deletions and synchronization errors; storage capacity of graphs; zero-error information theory; bounds on codes using semidefinite programming; tensorization in distributed source and channel coding; and applications of information-theoretic methods in probability and combinatorics.  All these topics have attracted a great deal of recent interest in the coding and information theory communities\, and have rich connections to combinatorics and complexity which could benefit from further exploration and collaboration. \nParticipation: The workshop is open to participation by all interested researchers\, subject to capacity. \nA list of lodging options convenient to the Center can also be found on our recommended lodgings page. \nConfirmed participants include: \n\nEmmanuel Abbe\, Princeton University\nSimeon Ball\, Universitat Politècnica de Catalunya\nBoris Bukh\, Carnegie Mellon University\nMahdi Cheraghchi\, Imperial College London\nSivakanth Gopi\, Princeton University\nElena Grigorescu\, University of Purdue\nHamed Hassani\, University of Pennsylvania\nNavin Kashyap\, Indian Institute of Science\nYoung-Han Kim\, University of California\, San Diego\nSwastik Kopparty\, Rutgers University\nNati Linial\, Hebrew University of Jerusalem\nShachar Lovett\, University of California\, San Diego\nWilliam Martin\, Worcester Polytechnic Institute\nArya Mazumdar\, University of Massachusetts at Amherst\nOr Meir\, University of Haifa\nOlgica Milenkovic\, ECE Illinois\nChandra Nair\, Chinese University of Hong Kong\nYuval Peres\, Microsoft Research\nYury Polyanskiy\, Massachusetts Institute of Technology\nMaxim Raginsky\, University of Illinois at Urbana-Champaign\nSankeerth Rao Karingula\, UC San Diego\nAnkit Singh Rawat\, MIT\nNoga Ron-Zewi\, University of Haifa\nRon Roth\, Israel Institute of Technology\nAtri Rudra\, State University of New York\, Buffalo\nAlex Samorodnitsky\, Hebrew University of Jerusalem\nItzhak Tamo\, Tel Aviv University\nAmnon Ta-Shma\, Tel Aviv University\nHimanshu Tyagi\, Indian Institute of Science\nDavid Zuckerman\, University of Texas at Austin
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-coding-and-information-theory/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180405T090000
DTEND;TZID=America/New_York:20180407T170000
DTSTAMP:20250304T212649Z
CREATED:20230717T175058Z
LAST-MODIFIED:20250304T212649Z
UID:10000078-1522918800-1523120400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Simons Collaboration Workshop\, April 5-7\, 2018
DESCRIPTION:The CMSA will be hosting a three-day Simons Collaboration Workshop on Homological Mirror Symmetry and Hodge Theory on April 5-7\, 2018. The workshop will be held in room G10 of the CMSA\, located at 20 Garden Street\, Cambridge\, MA. \nPlease click here to register for this event.  We have space for up to 30 registrants on a first come\, first serve basis. \nWe may be able to provide some financial support for grad students and postdocs interested in this event.  If you are interested in funding\, please send a letter of support from your mentor to Hansol Hong. \nConfirmed Speakers: \n\nJacob Bourjaily (Niels Bohr Institute)\nMandy Cheung (Havard University)\nTristan Collins (Harvard University)\nYoosik Kim (Boston University)\nYu-Shen Lin (Harvard University)\nCheuk-Yu Mak (Cambridge University)\nYu Pan (MIT)\nMauricio Romo (Tsinghua University)\nShu-Heng Shao (IAS)\nZack Sylvan (Columbia University)\nDmitry Vaintrob (IAS)
URL:https://live-hu-cmsa-222.pantheonsite.io/event/simons-collaboration-workshop-april-5-7-2018/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Amplituhedron-0c.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180402T163000
DTEND;TZID=America/New_York:20180403T180000
DTSTAMP:20260218T203218Z
CREATED:20230717T174857Z
LAST-MODIFIED:20260218T203218Z
UID:10000076-1522686600-1522778400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Math Science Lectures in Honor of Raoul Bott\, April 2-3
DESCRIPTION:On April 2-3\, the CMSA will be hosting two lectures by Freddy Cachazo (Perimeter Institute) on “Geometry and Combinatorics in Particle Interactions.”  This will be the first of the new annual Bott Math Science Lecture Series hosted by the CMSA. \nThe lectures will take place from 4:30-5:30pm in Science Center\, Hall D. \n \n \n  \n 
URL:https://live-hu-cmsa-222.pantheonsite.io/event/math-science-lectures-in-honor-of-raoul-bott-april-2-3/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Event,Math Science Lectures in Honor of Raoul Bott,Special Lectures
ATTACH;FMTTYPE=image/jpeg:https://live-hu-cmsa-222.pantheonsite.io/media/Cachazo-e1519325938458.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180324T090000
DTEND;TZID=America/New_York:20180326T181500
DTSTAMP:20250304T212149Z
CREATED:20230717T174646Z
LAST-MODIFIED:20250304T212149Z
UID:10000074-1521882000-1522088100@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Geometry\, Imaging\, and Computing
DESCRIPTION:On March 24-26\, The Center of Mathematical Sciences and Applications will be hosting a workshop on Geometry\, Imaging\, and Computing\, based off  the journal of the same name. The workshop will take place in CMSA building\, G10. \nThe organizing committee consists of Yang Wang (HKUST)\, Ronald Lui (CUHK)\, David Gu (Stony Brook)\, and Shing-Tung Yau (Harvard). \nConfirmed Speakers: \n\nJianfeng Cai (HKUST)\nShikui Chen (Stony Brook)\nJerome Darbon (Brown University)\nLaurent Demanet (MIT)\nDavid Gu (Stony Brook)\nMonica Hurdal (Florida State University)\nRongjie Lai (RPI)\nYue Lu (Harvard)\nRonald Lok Ming Lui (CUHK)\nLakshminarayanan Mahadevan (Harvard)\nEric Miller (Tufts)\nAshley Prater  (AFOSR)\nLixin Shen (Syracuse University)\nAllen Tannenbaum (Stony Brook)\nGuowei Wei (Michigan State)\nStephen Wong (Houston Methodist)\nJun Zhang (University of Michigan\, Ann Arbor)\nSong Zhang (Purdue University)\nHongkai Zhao (University of California\, Irvine)
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-geometry-imaging-and-computing/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/GIC-Poster-2-e1520002551865.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180205T090000
DTEND;TZID=America/New_York:20180209T170000
DTSTAMP:20250304T211916Z
CREATED:20230717T174149Z
LAST-MODIFIED:20250304T211916Z
UID:10000044-1517821200-1518195600@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Probabilistic and Extremal Combinatorics
DESCRIPTION:The workshop on Probabilistic and Extremal Combinatorics will take place February 5-9\, 2018 at the Center of Mathematical Sciences and Applications\, located at 20 Garden Street\, Cambridge\, MA. \nExtremal and Probabilistic Combinatorics are two of the most central branches of modern combinatorial theory. Extremal Combinatorics deals with problems of determining or estimating the maximum or minimum possible cardinality of a collection of finite objects satisfying certain requirements. Such problems are often related to other areas including Computer Science\, Information Theory\, Number Theory and Geometry. This branch of Combinatorics has developed spectacularly over the last few decades. Probabilistic Combinatorics can be described informally as a (very successful) hybrid between Combinatorics and Probability\, whose main object of study is probability distributions on discrete structures. \nThere are many points of interaction between these fields. There are deep similarities in methodology. Both subjects are mostly asymptotic in nature. Quite a few important results from Extremal Combinatorics have been proven applying probabilistic methods\, and vice versa. Such emerging subjects as Extremal Problems in Random Graphs or the theory of graph limits stand explicitly at the intersection of the two fields and indicate their natural symbiosis. \nThe symposia will focus on the interactions between the above areas. These topics include Extremal Problems for Graphs and Set Systems\, Ramsey Theory\, Combinatorial Number Theory\, Combinatorial Geometry\, Random Graphs\, Probabilistic Methods and Graph Limits. \nParticipation: The workshop is open to participation by all interested researchers\, subject to capacity. \nConfirmed participants include: \n\nJozsef Balogh\, University of Illinois\, Urbana\nFan Chung (Graham)\, University of California\, San Diego\nAsaf Ferber\, Massachusetts Institute of Technology\nJacob Fox\, Stanford Unviersity\nDavid Gamarnik\, Massachusetts Institute of Technology\nPenny Haxell\, University of Waterloo\nHao Huang\, Emory University\nJeff Kahn\, Rutgers University\nPeter Keevash\, Oxford University\nMichael Krivelevich\, Tel Aviv University\nDaniela Kühn\, University of Birmingham\nShoham Letzer\, ITS Zürich\nShachar Lovett\, University of California\, San Diego\nEyal Lubetzky\, Courant Institute\nRob Morris\, IMPA\nBhargav Narayanan\, Rutgers University\nDeryk Osthus\, University of Birmingham\nJanos Pach\, NYU\nYuval Peres\, Microsoft Redmond\nAlexey Pokryovskyi\, ETH Zürich\nWojciech Samotij\, Tel Aviv University\nLisa Sauermann\, Stanford University\nMathias Schacht\, University of Hamburg\nAlexander Scott\, University of Oxford\nAsaf Shapira\, Tel Aviv University\nJozef Skokan\, London School of Economics\nJoel Spencer\, New York University\nAngelika Steger\, ETH Zurich\nJacques Verstraete\, University of California\, San Diego\nYufei Zhao\, Massachusetts Institute of Technology\nDavid Zuckerman\, University of Texas at Austin\n\nCo-organizers of this workshop include Benny Sudakov and David Conlon.  More details about this event\, including participants\, will be updated soon.
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-probabilistic-and-extremal-combinatorics/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180124T090000
DTEND;TZID=America/New_York:20180125T170000
DTSTAMP:20250305T214037Z
CREATED:20230717T173945Z
LAST-MODIFIED:20250305T214037Z
UID:10000042-1516784400-1516899600@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Blockchain Conference
DESCRIPTION:On January 24-25\, 2019 the Center of Mathematical Sciences will be hosting a conference on distributed-ledger (blockchain) technology. The conference is intended to cover a broad range of topics\, from abstract mathematical aspects (cryptography\, game theory\, graph theory\, theoretical computer science) to concrete applications (in accounting\, government\, economics\, finance\, management\, medicine). The talks will take place in Science Center\, Hall D. \nhttps://youtu.be/FyKCCutxMYo \nPhotos\n \nSpeakers: \n\nJoseph Abadi\, Princeton University\nBenedikt Bunz\, Stanford University\nJake Cacciapaglia\, Nebula Genomics/Harvard Medical School\nEduardo Castello\, Massachusetts Institute of Technology\nAlisa DiCaprio\, R3\nZhiguo He\, University of Chicago\nSteven Kou\, Boston University\nAnne Lafarre\, Tilburg University\nJacob Leshno\, University of Chicago\nBruce Schneier\, Harvard Kennedy School\nDavid Schwartz\, Ripple\nElaine Shi\, Cornell University/Thunder Research\nHong Wan\, NCSU
URL:https://live-hu-cmsa-222.pantheonsite.io/event/blockchain-conference/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Conference,Event
ATTACH;FMTTYPE=image/jpeg:https://live-hu-cmsa-222.pantheonsite.io/media/Blockchain-Final-scaled.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180110T090000
DTEND;TZID=America/New_York:20180113T170000
DTSTAMP:20250305T181650Z
CREATED:20230717T173545Z
LAST-MODIFIED:20250305T181650Z
UID:10000041-1515574800-1515862800@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Simons Collaboration Workshop
DESCRIPTION:The CMSA will be hosting a four-day Simons Collaboration Workshop on Homological Mirror Symmetry and Hodge Theory on January 10-13\, 2018. The workshop will be held in room G10 of the CMSA\, located at 20 Garden Street\, Cambridge\, MA. \n  \nConfirmed Participants: \n\nMohammed Abouzaid (Columbia University)\nSergueï Barannikov (Paris Diderot University)\nCheol-Hyun Cho (Seoul National University)\nYoung-Hoon Kiem (Seoul National University)\nThomas Lam (University of Michigan)\nSiu-Cheong Lau (Boston University)\nRadu Laza (Stony Brook University)\nSi Li (Tsinghua University)\nKaoru Ono (Kyoto University)\nTony Pantev (University of Pennsylvania)\nColleen Robles (Duke University)\nYan Soibelman (Kansas State University)\nKazushi Ueda (University of Tokyo)\nChenglong Yu (Harvard University)\nEric Zaslow (Northwestern University)
URL:https://live-hu-cmsa-222.pantheonsite.io/event/simons-collaboration-workshop-jan-10-13-2018/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
ATTACH;FMTTYPE=image/jpeg:https://live-hu-cmsa-222.pantheonsite.io/media/default-harvard-university-center-of-mathematical-sciences-and-applications.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171113T090000
DTEND;TZID=America/New_York:20171117T160000
DTSTAMP:20250304T211529Z
CREATED:20230717T173740Z
LAST-MODIFIED:20250304T211529Z
UID:10000040-1510563600-1510934400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Algebraic Methods in Combinatorics
DESCRIPTION:The workshop on Algebraic Methods in Combinatorics will take place November 13-17\, 2017 at the Center of Mathematical Sciences and Applications\, located at 20 Garden Street\, Cambridge\, MA. \nThe main focus of the workshop is the application of algebraic method to study problems in combinatorics.  In recent years there has been a large number of results in which the use of algebraic technique has resulted in significant improvements to long standing open problems. Such problems include the finite field Kakeya problem\, the distinct distance problem of Erdos and\, more recently\, the cap-set problem. The workshop will include talks on all of the above mentioned problem as well as on recent development in related areas combining combinatorics and algebra. \nConfirmed participants include: \n\nAbdul Basit\, Rutgers\nBoris Bukh\, Carnegie Mellon University\nPete L. Clark\, University of Georgia\nDavid Conlon\, University of Oxford\nFrank de Zeeuw\, EPFL\nThao Thi Thu Do\, MIT\nNoam Elkies\, Harvard University\nJordan Ellenberg\, University of Wisconsin\nDion Gijswijt\, Delft Institute of Technology\nSivankanth Gopi\, Princeton University\nVenkatesan Guruswami\, Carnegie Mellon University\nMarina Iliopoulou\, University of California\, Berkeley\nRobert Kleinberg\, Cornell University\nMichael Krivelevich\, Tel Aviv University\nVsevelod Lev\, University of Haifa at Oranim\nLászló Miklós Lovász\, UCLA\nBen Lund\, Rutgers\nPéter Pach\, Budapest University of Technology and Economics\nJános Pach\, New York University\nZuzana Patáková\, Institute of Science and Technology Austria\nOrit Raz\, Institute for Advanced Study\nOliver Roche-Newton\, Johannes Kepler University\nMisha Rudnev\, University of Bristol\nAdam Sheffer\, California Institute of Technology\nAmir Shpilka\, Tel-Aviv University\nNoam Solomon\, Harvard CMSA\nJozsef Solymosi\, University of British Columbia\nBenny Sudakov\, ETH\, Zurich\nAndrew Suk\, University of California\, San Diego\nTibor Szabó\, Freie Universität Berlin\nChris Umans\, California Institute of Technology\nAvi Wigderson\, Princeton University\nJosh Zahl\, University of British Columbia\n\nCo-organizers of this workshop include Zeev Dvir\, Larry Guth\, and Shubhangi Saraf. \nMonday\, Nov. 13 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n\n\n\n9:30-10:30am \nVideo\nJozsef Solymosi \n \n\nOn the unit distance problem \nAbstract: Erdos’ Unit Distances conjecture states that the maximum number of unit distances determined by n points in the plane is almost linear\, it is O(n^{1+c}) where c goes to zero as n goes to infinity. In this talk I will survey the relevant results and propose some questions which would imply that the maximum number of unit distances is o(n^{4/3}).  \n\n\n\n10:30-11:00am\nCoffee Break\n\n\n\n11:00-12:00pm \nVideo \n \nOrit Raz\nIntersection of linear subspaces in R^d and instances of the PIT problem  \nAbstract: In the talk I will tell about a new deterministic\, strongly polynomial time algorithm which can be viewed in two ways. The first is as solving a derandomization problem\, providing a deterministic algorithm to a new special case of the PIT (Polynomial Identity Testing) problem. The second is as computing the dimension of the span of a collection of flats in high dimensional space. The talk is based on a joint work with Avi Wigderson.\n\n\n12:00-1:30pm\nLunch\n\n\n\n1:30-2:30pm \nVideo\nAndrew Hoon Suk\n\nRamsey numbers: combinatorial and geometric \nAbstract:  In this talk\, I will discuss several results on determining the tower growth rate of Ramsey numbers arising in combinatorics and in geometry.  These results are joint work with David Conlon\, Jacob Fox\, Dhruv Mubayi\, Janos Pach\, and Benny Sudakov. \n\n\n\n2:30-3:00pm\nCoffee Break\n\n\n\n3:00-4:00pm \nVideo\nJosh Zahl\n\nCutting curves into segments and incidence geometry \n\n\n\n4:00-6:00pm\nWelcome Reception\n\n\n\n\nTuesday\, Nov. 14 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n\n\n\n9:30-10:30am \nVideo\nPéter Pál Pach\n\nPolynomials\, rank and cap sets \nAbstract: In this talk we will look at a new variant of the polynomial method which was first used to prove that sets avoiding 3-term arithmetic progressions in groups like $\mathbb{Z}_4^n$ and $\mathbb{F}_q^n$ are exponentially small (compared to the size of the group). We will discuss lower and upper bounds for the size of the extremal subsets and mention further applications of the method. \n\n\n\n10:30-11:00am\nCoffee Break\n\n\n\n11:00-12:00pm\nJordan Ellenberg\n\nThe Degeneration Method \nAbstract:  In algebraic geometry\, a very popular way to study (nice\, innocent\, nonsingular) varieties is to degenerate them to (weird-looking\, badly singular\, nonreduced) varieties (which are actually not even varieties but schemes.)  I will talk about some results in combinatorics using this approach (joint with Daniel Erman) and some ideas for future applications of the method. \n\n\n\n12:00-1:30pm\nLunch\n\n\n\n1:30-2:30pm \nVideo\nLarry Guth\nThe polynomial method in Fourier analysis \nAbstract: This will be a survey talk about how the polynomial method helps to understand problems in Fourier analysis.  We will review some applications of the polynomial method to problems in combinatorial geometry.  Then we’ll discuss some problems in Fourier analysis\, explain the analogy with combinatorial problems\, and discuss how to adapt the polynomial method to the Fourier analysis setting.\n\n\n  \n2:30-3:00pm\nCoffee Break\n\n\n\n3:00-4:00pm\nOpen Problem\n\n\n\n\nWednesday\, Nov. 15 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n\n\n\n9:30-10:30am \n \nAvi Wigderson\n\nThe “rank method” in arithmetic complexity: Lower bounds and barriers to lower bounds \nAbstract: Why is it so hard to find a hard function? No one has a clue! In despair\, we turn to excuses called barriers. A barrier is a collection of lower bound techniques\, encompassing as much as possible from those in use\, together with a  proof that these techniques cannot prove any lower bound better than the state-of-art (which is often pathetic\, and always very far from what we expect for complexity of random functions). \nIn the setting of  Boolean computation of Boolean functions (where P vs. NP is the central open problem)\,  there are several famous barriers which provide satisfactory excuses\, and point to directions in which techniques may be strengthened. \nIn the setting of Arithmetic computation of polynomials and tensors (where  VP vs. VNP is the central open problem) we have no satisfactory barriers\, despite some recent interesting  attempts. \nThis talk will describe a new barrier for the Rank Method in arithmetic complexity\, which encompass most lower bounds in this field. It also encompass most lower bounds on tensor rank in algebraic geometry (where the the rank method is called Flattening). \nI will describe the rank method\, explain how it is used to prove lower bounds\, and then explain its limits via the new barrier result. As an example\, it shows that while the best lower bound on the tensor rank of any explicit 3-dimensional tensor of side n (which is achieved by a rank method) is 2n\, no rank method can prove a lower bound which exceeds 8n \n(despite the fact that a random such tensor has rank quadratic in n). \nNo special background knowledge is assumed. The audience is expected to come up with new lower bounds\, or else\, with new excuses for their absence. \n\n\n\n10:30-11:00am\nCoffee Break\n\n\n\n11:00-12:00pm \nVideo\nVenkat Guruswami\n\nSubspace evasion\, list decoding\, and dimension expanders \n Abstract: A subspace design is a collection of subspaces of F^n (F = finite field) most of which are disjoint from every low-dimensional subspace of F^n. This notion was put forth in the context of algebraic list decoding where it enabled the construction of optimal redundancy list-decodable codes over small alphabets as well as for error-correction in the rank-metric. Explicit subspace designs with near-optimal parameters have been constructed over large fields based on polynomials with structured roots. (Over small fields\, a construction via cyclotomic function fields with slightly worse parameters is known.) Both the analysis of the list decoding algorithm as well as the subspace designs crucially rely on the *polynomial method*. \nSubspace designs have since enabled progress on linear-algebraic analogs of Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. In particular\, they yield an explicit construction of constant-degree dimension expanders over large fields. While constructions of such dimension expanders are known over any field\, they are based on a reduction to a highly non-trivial form of vertex expanders called monotone expanders. In contrast\, the subspace design approach is simpler and works entirely within the linear-algebraic realm. Further\, in recent (ongoing) work\, their combination with rank-metric codes yields dimension expanders with expansion proportional to the degree. \nThis talk will survey these developments revolving around subspace designs\, their motivation\, construction\, analysis\, and connections. \n(Based on several joint works whose co-authors include Chaoping Xing\, Swastik Kopparty\, Michael Forbes\, Nicolas Resch\, and Chen Yuan.) \n\n\n\n12:00-1:30pm\nLunch\n\n\n\n1:30-2:30pm \n \nDavid Conlon\n\nFinite reflection groups and graph norms \nAbstract: For any given graph $H$\, we may define a natural corresponding functional $\|.\|_H$. We then say that $H$ is norming if $\|.\|_H$ is a semi-norm. A similar notion $\|.\|_{r(H)}$ is defined by $\| f \|_{r(H)} := \| | f | \|_H$ and $H$ is said to be weakly norming if $\|.\|_{r(H)}$ is a norm. Classical results show that weakly norming graphs are necessarily bipartite. In the other direction\, Hatami showed that even cycles\, complete bipartite graphs\, and hypercubes are all weakly norming. Using results from the theory of finite reflection groups\, we identify a much larger class of weakly norming graphs. This result includes all previous examples of weakly norming graphs and adds many more. We also discuss several applications of our results. In particular\, we define and compare a number of generalisations of Gowers’ octahedral norms and we prove some new instances of Sidorenko’s conjecture. Joint work with Joonkyung Lee. \n \n\n\n2:30-3:00pm\nCoffee Break\n\n\n\n3:00-4:00pm \nVideo\nLaszlo Miklós Lovasz\n\nRemoval lemmas for triangles and k-cycles. \nAbstract: Let p be a fixed prime. A k-cycle in F_p^n is an ordered k-tuple of points that sum to zero; we also call a 3-cycle a triangle. Let N=p^n\, (the size of F_p^n). Green proved an arithmetic removal lemma which says that for every k\, epsilon>0 and prime p\, there is a delta>0 such that if we have a collection of k sets in F_p^n\, and the number of k-cycles in their cross product is at most a delta fraction of all possible k-cycles in F_p^n\, then we can delete epsilon times N elements from the sets and remove all k-cycles. Green posed the problem of improving the quantitative bounds on the arithmetic triangle removal lemma\, and\, in particular\, asked whether a polynomial bound holds. Despite considerable attention\, prior to our work\, the best known bound for any k\, due to Fox\, showed that 1/delta can be taken to be an exponential tower of twos of height logarithmic in 1/epsilon (for a fixed k). \nIn this talk\, we will discuss recent work on Green’s problem. For triangles\, we prove an essentially tight bound for Green’s arithmetic triangle removal lemma in F_p^n\, using the recent breakthroughs with the polynomial method. For k-cycles\, we also prove a polynomial bound\, however\, the question of the optimal exponent is still open. \nThe triangle case is joint work with Jacob Fox\, and the k-cycle case with Jacob Fox and Lisa Sauermann. \n\n\n\n\nThursday\, Nov. 16 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n\n\n\n9:30-10:30am \nVideo\nJanos Pach\nLet’s talk about multiple crossings \nAbstract: Let k>1 be a fixed integer. It is conjectured that any graph on n vertices that can be drawn in the plane without k pairwise crossing edges has O(n) edges. Two edges of a hypergraph cross each other if neither of them contains the other\, they have a nonempty intersection\, and their union is not the whole vertex set. It is conjectured that any hypergraph on n vertices that contains no k pairwise crossing edges has at most O(n) edges. We discuss the relationship between the above conjectures and explain some partial answers\, including a recent result of Kupavskii\, Tomon\, and the speaker\, improving a 40 years old bound of Lomonosov.\n\n\n10:30-11:00am\nCoffee Break\n\n\n\n11:00-12:00pm \nVideo\nMisha Rudnev\n\nFew products\, many sums \nAbstract: This is what I like calling “weak Erd\H os-Szemer\’edi conjecture”\, still wide open over the reals and in positive characteristic. The talk will focus on some recent progress\, largely based on the ideas of I. D. Shkredov over the past 5-6 years of how to use linear algebra to get the best out of the Szemer\’edi-Trotter theorem for its sum-product applications. One of the new results is strengthening (modulo the log term hidden in the $\lesssim$ symbol) the textbook Elekes inequality \n$$ \n|A|^{10} \ll |A-A|^4|AA|^4 \n$$ \nto \n$$|A|^{10}\lesssim |A-A|^3|AA|^5.$$ \nThe other is the bound  \n$$E(H) \lesssim |H|^{2+\frac{9}{20}}$$ for additive energy of sufficiently small multiplicative subgroups in $\mathbb F_p$. \n\n\n\n12:00-1:30pm\nLunch\n\n\n\n1:30-2:30pm \nVideo\nAdam Sheffer\n\nGeometric Energies: Between Discrete Geometry and Additive Combinatorics \nAbstract: We will discuss the rise of geometric variants of the concept of Additive energy. In recent years such variants are becoming more common in the study of Discrete Geometry problems. We will survey this development and then focus on a recent work with Cosmin Pohoata. This work studies geometric variants of additive higher moment energies\, and uses those to derive new bounds for several problems in Discrete Geometry.   \n\n\n\n2:30-3:00pm\nCoffee Break\n\n\n\n3:00-4:00pm \nVideo\nBoris Bukh\n\nRanks of matrices with few distinct entries \nAbstract: Many applications of linear algebra method to combinatorics rely on the bounds on ranks of matrices with few distinct entries and constant diagonal. In this talk\, I will explain some of these application. I will also present a classification of sets L for which no low-rank matrix with entries in L exists. \n\n\n\n\nFriday\, Nov. 17 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n\n\n\n9:30-10:30am \nVideo\nBenny Sudakov\n\nSubmodular minimization and set-systems with restricted intersections \nAbstract: Submodular function minimization is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly\, there is only very little known about constraint types under which it remains efficiently solvable. The arguably most relevant non-trivial constraint class for which polynomial algorithms are known are parity constraints\, i.e.\, optimizing submodular function only over sets of odd (or even) cardinality. Parity constraints capture classical combinatorial optimization problems like the odd-cut problem\, and they are a key tool in a recent technique to efficiently solve integer programs with a constraint matrix whose subdeter-minants are bounded by two in absolute value. \nWe show that efficient submodular function minimization is possible even for a significantly larger class than parity constraints\, i.e.\, over all sets (of any given lattice) of cardinality r mod m\, as long as m is a constant prime power. To obtain our results\, we combine tools from Combinatorial Optimization\, Combinatorics\, and Number Theory. In particular\, we establish an interesting connection between the correctness of a natural algorithm\, and the non-existence of set systems with specific intersection properties. \nJoint work with M. Nagele and R. Zenklusen \n\n\n\n10:30-11:00am\nCoffee Break\n\n\n\n11:00-12:00pm \nVideo\nRobert Kleinberg\n  \nExplicit sum-of-squares lower bounds via the polynomial method \nAbstract: The sum-of-squares (a.k.a. Positivstellensatz) proof system is a powerful method for refuting systems of multivariate polynomial inequalities\, i.e. proving that they have no solutions. These refutations themselves involve sum-of-squares (sos) polynomials\, and while any unsatisfiable system of inequalities has a sum-of-squares refutation\, the sos polynomials involved might have arbitrarily high degree. However\, if a system admits a refutation where all polynomials involved have degree at most d\, then the refutation can be found by an algorithm with running time polynomial in N^d\, where N is the combined number of variables and inequalities in the system. \nLow-degree sum-of-squares refutations appear throughout mathematics. For example\, the above proof search algorithm captures as a special case many a priori unrelated algorithms from theoretical computer science; one example is Goemans and Williamson’s algorithm to approximate the maximum cut in a graph. Specialized to extremal graph theory\, they become equivalent to flag algebras. They have also seen practical use in robotics and optimal control. \nTherefore\, it is of interest to identify “hard” systems of low-degree polynomial inequalities that have no solutions but also have no low-degree sum-of-squares refutations. Until recently\, the only known examples were either not explicit (i.e.\, known to exist by non-constructive means such as the probabilistic method) or not robust (i.e.\, a system is constructed which is not refutable by degree d sos polynomials\, but becomes refutable when perturbed by an amount tending to zero with d). We present a new family of instances derived from the cap-set problem\, and we show a super-constant lower bound on the degree of its sum-of-squares refutations. Our instances are both explicit and robust. \nThis is joint work with Sam Hopkins. \n\n\n\n12:00-1:30pm\nLunch\n\n\n\n\n  \n\n\n\nEvents\,Past Events\,Programs
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-algebraic-methods-in-combinatorics/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171102T170000
DTEND;TZID=America/New_York:20171102T180000
DTSTAMP:20250305T151232Z
CREATED:20230717T173530Z
LAST-MODIFIED:20250305T151232Z
UID:10000039-1509642000-1509645600@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Jennifer Chayes Public Talk
DESCRIPTION:Jennifer Chayes (Microsoft Research) will be giving a public talk on November 02\, 2017\, as part of the Program on combinatorics and complexity hosted by the CMSA during AY17-18.  The talk will be at 5:00pm in Askwith Hall\, 13 Appian Way\, Cambridge\, MA. \nTitle: Network Science: From the Online World to Cancer Genomics \nAbstract: Everywhere we turn these days\, we find that networks can be used to describe relevant interactions. In the high tech world\, we see the Internet\, the World Wide Web\, mobile phone networks\, and a variety of online social networks. In economics\, we are increasingly experiencing both the positive and negative effects of a global networked economy. In epidemiology\, we find disease spreading over our ever growing social networks\, complicated by mutation of the disease agents. In biomedical research\, we are beginning to understand the structure of gene regulatory networks\, with the prospect of using this understanding to manage many human diseases. In this talk\, I look quite generally at some of the models we are using to describe these networks\, processes we are studying on the networks\, algorithms we have devised for the networks\, and finally\, methods we are developing to indirectly infer network structure from measured data. I’ll discuss in some detail particular applications to cancer genomics\, applying network algorithms to suggest possible drug targets for certain kinds of cancer. \n 
URL:https://live-hu-cmsa-222.pantheonsite.io/event/jennifer-chayes-public-talk-11-02-17/
LOCATION:Askwith Hall\, Harvard University
CATEGORIES:Event,Public Lecture
ATTACH;FMTTYPE=application/pdf:https://live-hu-cmsa-222.pantheonsite.io/media/Chayes-public-talk.pdf
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171010T170000
DTEND;TZID=America/New_York:20171010T180000
DTSTAMP:20250328T150724Z
CREATED:20230717T173349Z
LAST-MODIFIED:20250328T150724Z
UID:10000038-1507654800-1507658400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:2017 Ding Shum Lecture
DESCRIPTION:Leslie Valiant will be giving the inaugural talk of the Ding Shum Lectures on Tuesday\, October 10 at 5:00 pm in Science Center Hall D\, Cambridge\, MA. \nLearning as a Theory of Everything \nAbstract: We start from the hypothesis that all the information that resides in living organisms was initially acquired either through learning by an individual or through evolution. Then any unified theory of evolution and learning should be able to characterize the capabilities that humans and other living organisms can possess or acquire. Characterizing these capabilities would tell us about the nature of humans\, and would also inform us about feasible targets for automation. With this purpose we review some background in the mathematical theory of learning. We go on to explain how Darwinian evolution can be formulated as a form of learning. We observe that our current mathematical understanding of learning is incomplete in certain important directions\, and conclude by indicating one direction in which further progress would likely enable broader phenomena of intelligence and cognition to be realized than is possible at present. \n 
URL:https://live-hu-cmsa-222.pantheonsite.io/event/2017-ding-shum-lecture/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Ding Shum Lecture,Event,Public Lecture,Special Lectures
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Ding-Shum-lecture-3.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171002T091500
DTEND;TZID=America/New_York:20171002T173000
DTSTAMP:20250328T150846Z
CREATED:20230717T172938Z
LAST-MODIFIED:20250328T150846Z
UID:10000036-1506935700-1506965400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:The 2017 Charles River Lectures
DESCRIPTION:Charles River with Bench at Sunset\nJointly organized by Harvard University\, Massachusetts Institute of Technology\, and Microsoft Research New England\, the Charles River Lectures on Probability and Related Topics is a one-day event for the benefit of the greater Boston area mathematics community. \nThe 2017 lectures will take place 9:15am – 5:30pm on Monday\, October 2 at Harvard University  in the Harvard Science Center. \n\n\n\n*************************************************** \nUPDATED LOCATION\nHarvard University\nHarvard Science Center (Halls C & E)\n1 Oxford Street\, Cambridge\, MA 02138 (Map)\nMonday\, October 2\, 2017\n9:15 AM – 5:30 PM\n************************************************** \nPlease note that registration has closed. \nSpeakers:\n\nPaul Bourgade (Courant Institute\, NYU)\nMassimiliano Gubinelli (University of Bonn)\nAndrea Montanari (Stanford University)\nRoman Vershynin (University of California\, Irvine)\nOfer Zeitouni (Weizmann Institute)\n\nAgenda:\nIn Harvard Science Center Hall C: \n8:45 am – 9:15 am: Coffee/light breakfast \n9:15 am – 10:15 am: Ofer Zeitouni \nTitle: Noise stability of the spectrum of large matrices \nAbstract: The spectrum of large non-normal matrices is notoriously sensitive to perturbations\, as the example of nilpotent matrices shows. Remarkably\, the spectrum of these matrices perturbed by polynomially (in the dimension) vanishing additive noise is remarkably stable. I will describe some results and the beginning of a theory. \nThe talk is based on joint work with Anirban Basak and Elliot Paquette\, and earlier works with Feldheim\, Guionnet\, Paquette and Wood.\n\n10:20 am – 11:20 am: Andrea Montanari \nTitle: Algorithms for estimating low-rank matrices  \nAbstract: Many interesting problems in statistics can be formulated as follows. The signal of interest is a large low-rank matrix with additional structure\, and we are given a single noisy view of this matrix. We would like to estimate the low rank signal by taking into account optimally the signal structure. I will discuss two types of efficient estimation procedures based on message-passing algorithms and semidefinite programming relaxations\, with an emphasis on asymptotically exact results. \n11:20 am – 11:45 am: Break \n11:45 am – 12:45 pm: Paul Bourgade \nTitle: Random matrices\, the Riemann zeta function and trees \nAbstract: Fyodorov\, Hiary & Keating have conjectured that the maximum of the characteristic polynomial of random unitary matrices behaves like extremes of log-correlated Gaussian fields. This allowed them to predict the typical size of local maxima of the Riemann zeta function along the critical axis. I will first explain the origins of this conjecture\, and then outline the proof for the leading order of the maximum\, for unitary matrices and the zeta function. This talk is based on joint works with Arguin\, Belius\, Radziwill and Soundararajan. \n1:00 pm – 2:30 pm: Lunch \nIn Harvard Science Center Hall E: \n2:45 pm – 3:45 pm: Roman Vershynin \nTitle: Deviations of random matrices and applications \nAbstract: Uniform laws of large numbers provide theoretical foundations for statistical learning theory. This lecture will focus on quantitative uniform laws of large numbers for random matrices. A range of illustrations will be given in high dimensional geometry and data science. \n3:45 pm – 4:15 pm: Break \n4:15 pm – 5:15 pm: Massimiliano Gubinelli \nTitle: Weak universality and Singular SPDEs \nAbstract: Mesoscopic fluctuations of microscopic (discrete or continuous) dynamics can be described in terms of nonlinear stochastic partial differential equations which are universal: they depend on very few details of the microscopic model. This universality comes at a price: due to the extreme irregular nature of the random field sample paths\, these equations turn out to not be well-posed in any classical analytic sense. I will review recent progress in the mathematical understanding of such singular equations and of their (weak) universality and their relation with the Wilsonian renormalisation group framework of theoretical physics. \nOrganizers:\n Alexei Borodin\, Henry Cohn\, Vadim Gorin\, Elchanan Mossel\, Philippe Rigollet\, Scott Sheffield\, and H.T. Yau
URL:https://live-hu-cmsa-222.pantheonsite.io/event/the-2017-charles-river-lectures/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Event,Public Lecture,Special Lectures
ATTACH;FMTTYPE=image/jpeg:https://live-hu-cmsa-222.pantheonsite.io/media/Charles-River-Lectures-2017-pdf.jpeg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171002T090000
DTEND;TZID=America/New_York:20171006T160000
DTSTAMP:20250304T211134Z
CREATED:20230717T173144Z
LAST-MODIFIED:20250304T211134Z
UID:10000037-1506934800-1507305600@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Additive Combinatorics\, Oct. 2-6\, 2017
DESCRIPTION:The workshop on additive combinatorics will take place October 2-6\, 2017 at the Center of Mathematical Sciences and Applications\, located at 20 Garden Street\, Cambridge\, MA. \nAdditive combinatorics is a mathematical area bordering on number theory\, discrete mathematics\, harmonic analysis and ergodic theory. It has achieved a number of successes in pure mathematics in the last two decades in quite diverse directions\, such as: \n\nThe first sensible bounds for Szemerédi’s theorem on progressions (Gowers);\nLinear patterns in the primes (Green\, Tao\, Ziegler);\nConstruction of expanding sets in groups and expander graphs (Bourgain\, Gamburd);\nThe Kakeya Problem in Euclidean harmonic analysis (Bourgain\, Katz\, Tao).\n\nIdeas and techniques from additive combinatorics have also had an impact in theoretical computer science\, for example \n\nConstructions of pseudorandom objects (eg. extractors and expanders);\nConstructions of extremal objects (eg. BCH codes);\nProperty testing (eg. testing linearity);\nAlgebraic algorithms (eg. matrix multiplication).\n\nThe main focus of this workshop will be to bring together researchers involved in additive combinatorics\, with a particular inclination towards the links with theoretical computer science. Thus it is expected that a major focus will be additive combinatorics on the boolean cube (Z/2Z)^n \, which is the object where the exchange of ideas between pure additive combinatorics and theoretical computer science is most fruitful. Another major focus will be the study of pseudorandom phenomena in additive combinatorics\, which has been an important contributor to modern methods of generating provably good randomness through deterministic methods. Other likely topics of discussion include the status of major open problems (the polynomial Freiman-Ruzsa conjecture\, inverse theorems for the Gowers norms with bounds\, explicit correlation bounds against low degree polynomials) as well as the impact of new methods such as the introduction of algebraic techniques by Croot–Pach–Lev and Ellenberg–Gijswijt. \nConfirmed participants include: \n\nArnab Bhattacharyya (Indian Institute of Science)\nThomas Bloom (University of Bristol)\nJop Briët (Centrum Wiskunde & Informatica\, Amsterdam)\nMei-Chu Chang (University of California\, Riverside)\nNoam Elkies (Harvard University)\nAsaf Ferber (MIT)\nJacob Fox (Stanford University)\nShafi Goldwasser (MIT)\nElena Grigorescu (Purdue University)\nHamed Hatami (McGill University)\nPooya Hatami (Institute for Advanced Study)\nKaave Hosseini (University of California\, San Diego)\nGuy Kindler (Hebrew University of Jerusalem)\nVsevolod Lev (University of Haifa at Oranim)\nSean Prendiville (University of Manchester)\nRonitt Rubinfeld (MIT)\nWill Sawin (ETH Zürich)\nFernando Shao (Oxford University)\nOlof Sisask (KTH Royal Institute of Technology)\nMadhur Tulsiani (University of Chicago)\nJulia Wolf (University of Bristol)\nEmanuele Viola (Northeastern University)\nYufei Zhao (MIT)\n\nCo-organizers of this workshop include Ben Green\, Swastik Kopparty\, Ryan O’Donnell\, Tamar Ziegler. \nMonday\, October 2 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n \n\n\n9:30-10:20am\nJacob Fox\nTower-type bounds for Roth’s theorem with popular differences \nAbstract: A famous theorem of Roth states that for any $\alpha > 0$ and $n$ sufficiently large in terms of $\alpha$\, any subset of $\{1\, \dots\, n\}$ with density $\alpha$ contains a 3-term arithmetic progression. Green developed an arithmetic regularity lemma and used it to prove that not only is there one arithmetic progression\, but in fact there is some integer $d > 0$ for which the density of 3-term arithmetic progressions with common difference $d$ is at least roughly what is expected in a random set with density $\alpha$. That is\, for every $\epsilon > 0$\, there is some $n(\epsilon)$ such that for all $n > n(\epsilon)$ and any subset $A$ of $\{1\, \dots\, n\}$ with density $\alpha$\, there is some integer $d > 0$ for which the number of 3-term arithmetic progressions in $A$ with common difference $d$ is at least $(\alpha^3-\epsilon)n$. We prove that $n(\epsilon)$ grows as an exponential tower of 2’s of height on the order of $\log(1/\epsilon)$. We show that the same is true in any abelian group of odd order $n$. These results are the first applications of regularity lemmas for which the tower-type bounds are shown to be necessary. \nThe first part of the talk by Jacob Fox includes an overview and discusses the upper bound. The second part of the talk by Yufei Zhao focuses on the lower bound construction and proof. These results are all joint work with Huy Tuan Pham.\n\n\n10:20-11:00am\nCoffee Break\n \n\n\n11:00-11:50am\nYufei Zhao\nTower-type bounds for Roth’s theorem with popular differences \nAbstract:  Continuation of first talk by Jacob Fox. The first part of the talk by Jacob Fox includes an overview and discusses the upper bound. The second part of the talk by Yufei Zhao focuses on the lower bound construction and proof. These results are all joint work with Huy Tuan Pham.\n\n\n12:00-1:30pm\nLunch\n \n\n\n1:30-2:20pm\nJop Briët\nLocally decodable codes and arithmetic progressions in random settings \nAbstract: This talk is about a common feature of special types of error correcting codes\, so-called locally decodable codes (LDCs)\, and two problems on arithmetic progressions in random settings\, random differences in Szemerédi’s theorem and upper tails for arithmetic progressions in a random set in particular. It turns out that all three can be studied in terms of the Gaussian width of a set of vectors given by a collection of certain polynomials. Using a matrix version of the Khintchine inequality and a lemma that turns such polynomials into matrices\, we give an alternative proof for the best-known lower bounds on LDCs and improved versions of prior results due to Frantzikinakis et al. and Bhattacharya et al. on arithmetic progressions in the aforementioned random settings. \nJoint work with Sivakanth Gopi\n\n\n2:20-3:00pm\nCoffee Break\n \n\n\n3:00-3:50pm\nFernando Shao\n\nLarge deviations for arithmetic progressions \nAbstract: We determine the asymptotics of the log-probability that the number of k-term arithmetic progressions in a random subset of integers exceeds its expectation by a constant factor. This is the arithmetic analog of subgraph counts in a random graph. I will highlight some open problems in additive combinatorics that we encountered in our work\, namely concerning the “complexity” of the dual functions of AP-counts. \n\n\n\n4:00-6:00pm\nWelcome Reception\n\n\n\n\nTuesday\, October 3 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n\n\n\n9:30-10:20am\nEmanuele Viola\nInterleaved group products \nAuthors: Timothy Gowers and Emanuele Viola \nAbstract: Let G be the special linear group SL(2\,q). We show that if (a1\,a2) and (b1\,b2) are sampled uniformly from large subsets A and B of G^2 then their interleaved product a1 b1 a2 b2 is nearly uniform over G. This extends a result of Gowers (2008) which corresponds to the independent case where A and B are product sets. We obtain a number of other results. For example\, we show that if X is a probability distribution on G^m such that any two coordinates are uniform in G^2\, then a pointwise product of s independent copies of X is nearly uniform in G^m\, where s depends on m only. Similar statements can be made for other groups as well. \nThese results have applications in computer science\, which is the area where they were first sought by Miles and Viola (2013).\n\n\n10:20-11:00am\nCoffee Break\n\n\n\n11:00-11:50am\nVsevolod Lev\nOn Isoperimetric Stability \nAbstract: We show that a non-empty subset of an abelian group with a small edge boundary must be large; in particular\, if $A$ and $S$ are finite\, non-empty subsets of an abelian group such that $S$ is independent\, and the edge boundary of $A$ with respect to $S$ does not exceed $(1-c)|S||A|$ with a real $c\in(0\,1]$\, then $|A|\ge4^{(1-1/d)c|S|}$\, where $d$ is the smallest order of an element of $S$. Here the constant $4$ is best possible. \nAs a corollary\, we derive an upper bound for the size of the largest independent subset of the set of popular differences of a finite subset of an abelian group. For groups of exponent $2$ and $3$\, our bound translates into a sharp estimate for the additive  dimension of the popular difference set. \nWe also prove\, as an auxiliary result\, the following estimate of possible independent interest: if $A\subseteq{\mathbb Z}^n$ is a finite\, non-empty downset\, then\, denoting by $w(z)$ the number of non-zero components of the vector $z\in\mathbb{Z}^n$\, we have   $$ \frac1{|A|} \sum_{a\in A} w(a) \le \frac12\\, \log_2 |A|. $$\n\n\n12:00-1:30pm\nLunch\n\n\n\n1:30-2:20pm\nElena Grigorescu\nNP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem \nAbstract: I will discuss the complexity of decoding Reed-Solomon codes\, and some results establishing NP-hardness for asymptotically smaller decoding radii than the maximum likelihood decoding radius. These results follow from the study of a generalization of the classical Subset Sum problem to higher moments\, which may be of independent interest. I will further discuss a connection with the Prouhet-Tarry-Escott problem studied in Number Theory\, which turns out to capture a main barrier in extending our techniques to smaller radii. \nJoint work with Venkata Gandikota and Badih Ghazi.\n\n\n2:20-3:00pm\nCoffee Break\n\n\n\n3:00-3:50pm\nSean Prendiville\nPartition regularity of certain non-linear Diophantine equations. \nAbstract:  We survey some results in additive Ramsey theory which remain valid when variables are restricted to sparse sets of arithmetic interest\, in particular the partition regularity of a class of non-linear Diophantine equations in many variables.\n\n\n\nWednesday\, October 4 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n \n\n\n9:30-10:20am\nOlof Sisask\nBounds on capsets via properties of spectra \nAbstract: A capset in F_3^n is a subset A containing no three distinct elements x\, y\, z satisfying x+z=2y. Determining how large capsets can be has been a longstanding problem in additive combinatorics\, particularly motivated by the corresponding question for subsets of {1\,2\,…\,N}. While the problem in the former setting has seen spectacular progress recently through the polynomial method of Croot–Lev–Pach and Ellenberg–Gijswijt\, such progress has not been forthcoming in the setting of the integers. Motivated by an attempt to make progress in this setting\, we shall revisit the approach to bounding the sizes of capsets using Fourier analysis\, and in particular the properties of large spectra. This will be a two part talk\, in which many of the ideas will be outlined in the first talk\, modulo the proof of a structural result for sets with large additive energy. This structural result will be discussed in the second talk\, by Thomas Bloom\, together with ideas on how one might hope to achieve Behrend-style bounds using this method. \nJoint work with Thomas Bloom.\n\n\n10:20-11:00am\nCoffee Break\n \n\n\n11:00-11:50am\nThomas Bloom\nBounds on capsets via properties of spectra \nThis is a continuation of the previous talk by Olof Sisask.\n\n\n12:00-1:30pm\nLunch\n \n\n\n1:30-2:20pm\nHamed Hatami\nPolynomial method and graph bootstrap percolation \nAbstract: We introduce a simple method for proving lower bounds for the size of the smallest percolating set in a certain graph bootstrap process. We apply this method to determine the sizes of the smallest percolating sets in multidimensional tori and multidimensional grids (in particular hypercubes). The former answers a question of Morrison and Noel\, and the latter provides an alternative and simpler proof for one of their main results. This is based on a joint work with Lianna Hambardzumyan and Yingjie Qian.\n\n\n2:20-3:00pm\nCoffee Break\n\n\n\n3:00-3:50pm\nArnab Bhattacharyya\nAlgorithmic Polynomial Decomposition \nAbstract: Fix a prime p. Given a positive integer k\, a vector of positive integers D = (D_1\, …\, D_k) and a function G: F_p^k → F_p\, we say a function P: F_p^n → F_p admits a (k\, D\, G)-decomposition if there exist polynomials P_1\, …\, P_k: F_p^n -> F_p with each deg(P_i) <= D_i such that for all x in F_p^n\, P(x) = G(P_1(x)\, …\, P_k(x)). For instance\, an n-variate polynomial of total degree d factors nontrivially exactly when it has a (2\, (d-1\, d-1)\, prod)-decomposition where prod(a\,b) = ab. \nWhen show that for any fixed k\, D\, G\, and fixed bound d\, we can decide whether a given polynomial P(x_1\, …\, x_n) of degree d admits a (k\,D\,G)-decomposition and if so\, find a witnessing decomposition\, in poly(n) time. Our approach is based on higher-order Fourier analysis. We will also discuss improved analyses and algorithms for special classes of decompositions. \nJoint work with Pooya Hatami\, Chetan Gupta and Madhur Tulsiani.\n\n\n\nThursday\, October 5 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n\n\n\n9:30-10:20am\nMadhur Tulsiani\nHigher-order Fourier analysis and approximate decoding of Reed-Muller codes \n Abstract: Decomposition theorems proved by Gowers and Wolf provide an appropriate notion of “Fourier transform” for higher-order Fourier analysis. I will discuss some questions and techniques that arise from trying to develop polynomial time algorithms for computing these decompositions. \nI will discuss constructive proofs of these decompositions based on boosting\, which reduce the problem of computing these decompositions to a certain kind of approximate decoding problem for codes. I will also discuss some earlier and recent works on this decoding problem. \nBased on joint works with Arnab Bhattacharyya\, Eli Ben-Sasson\, Pooya Hatami\, Noga Ron-Zewi and Julia Wolf.\n\n\n10:20-11:00am\nCoffee Break\n\n\n\n11:00-11:50am\nJulia Wolf\nStable arithmetic regularity \nThe arithmetic regularity lemma in the finite-field model\, proved by Green in 2005\, states that given a subset A of a finite-dimensional vector space over a prime field\, there exists a subspace H of bounded codimension such that A is Fourier-uniform with respect to almost all cosets of H. It is known that in general\, the growth of the codimension of H is required to be of tower type depending on the degree of uniformity\, and that one must allow for a small number of non-uniform cosets. \nOur main result is that\, under a natural model-theoretic assumption of stability\, the tower-type bound and non-uniform cosets in the arithmetic regularity lemma are not necessary.  Specifically\, we prove an arithmetic regularity lemma for k-stable subsets in which the bound on the codimension of the subspace is a polynomial (depending on k) in the degree of uniformity\, and in which there are no non-uniform cosets. \nThis is joint work with Caroline Terry. \n\n\n\n12:00-1:30pm\nLunch\n \n\n\n1:30-2:20pm\nWill Sawin\n\nConstructions of Additive Matchings \nAbstract: I will explain my work\, with Robert Kleinberg and David Speyer\, constructing large tri-colored sum-free sets in vector spaces over finite fields\, and how it shows that some additive combinatorics problems over finite fields are harder than corresponding problems over the integers.  \n\n\n\n2:20-3:00pm\nCoffee Break\n\n\n\n3:00-3:50pm\nMei-Chu Chang\nArithmetic progressions in multiplicative groups of finite fields \nAbstract:   Let G be a multiplicative subgroup of the prime field F_p of size |G|> p^{1-\kappa} and r an arbitrarily fixed positive integer. Assuming \kappa=\kappa(r)>0 and p large enough\, it is shown that any proportional subset A of G contains non-trivial arithmetic progressions of length r.\n\n\n\nFriday\, October 6 \n\n\n\nTime\nSpeaker\nTitle/Abstract\n\n\n9:00-9:30am\nBreakfast\n\n\n\n9:30-10:20am\nAsaf Ferber\nOn a resilience version of the Littlewood-Offord problem \nAbstract:  In this talk we consider a resilience version of the classical Littlewood-Offord problem. That is\, consider the sum X=a_1x_1+…a_nx_n\, where the a_i-s are non-zero reals and x_i-s are i.i.d. random variables with     (x_1=1)= P(x_1=-1)=1/2. Motivated by some problems from random matrices\, we consider the question: how many of the x_i-s  can we typically allow an adversary to change without making X=0? We solve this problem up to a constant factor and present a few interesting open problems. \nJoint with: Afonso Bandeira (NYU) and Matthew Kwan (ETH\, Zurich).\n\n\n10:20-11:00am\nCoffee Break\n\n\n\n11:00-11:50am\nKaave Hosseini\nProtocols for XOR functions and Entropy decrement \nAbstract: Let f:F_2^n –> {0\,1} be a function and suppose the matrix M defined by M(x\,y) = f(x+y) is partitioned into k monochromatic rectangles.  We show that F_2^n can be partitioned into affine subspaces of co-dimension polylog(k) such that f is constant on each subspace. In other words\, up to polynomial factors\, deterministic communication complexity and parity decision tree complexity are equivalent. \nThis relies on a novel technique of entropy decrement combined with Sanders’ Bogolyubov-Ruzsa lemma. \nJoint work with Hamed Hatami and Shachar Lovett\n\n\n12:00-1:30pm\nLunch\n\n\n\n1:30-2:20pm\nGuy Kindler\n\nFrom the Grassmann graph to Two-to-Two games \nAbstract: In this work we show a relation between the structure of the so called Grassmann graph over Z_2 and the Two-to-Two conjecture in computational complexity. Specifically\, we present a structural conjecture concerning the Grassmann graph (together with an observation by Barak et. al.\, one can view this as a conjecture about the structure of non-expanding sets in that graph) which turns out to imply the Two-to-Two conjecture. \nThe latter conjecture its the lesser-known and weaker sibling of the Unique-Games conjecture [Khot02]\, which states that unique games (a.k.a. one-to-one games) are hard to approximate. Indeed\, if the Grassmann-Graph conjecture its true\, it would also rule out some attempts to refute the Unique-Games conjecture\, as these attempts provide potentially efficient algorithms to solve unique games\, that would actually also solve two-to-two games if they work at all. \nThese new connections between the structural properties of the Grassmann graph and complexity theoretic conjectures highlight the Grassmann graph as an interesting and worthy object of study. We may indicate some initial results towards analyzing its structure. \nThis is joint work with Irit Dinur\, Subhash Khot\, Dror Minzer\, and Muli Safra. \n\n\n\n\n\n\n\nEvents\,Past Events
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-additive-combinatorics-oct-2-6-2017/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170907T170000
DTEND;TZID=America/New_York:20170907T180000
DTSTAMP:20250305T183135Z
CREATED:20230717T172748Z
LAST-MODIFIED:20250305T183135Z
UID:10000035-1504803600-1504807200@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Noga Alon Public Talk
DESCRIPTION:Noga Alon (Tel Aviv University) will be giving a public talk on September 7\, 2017\,as part of the program on combinatorics and complexity hosted by the CMSA during AY17-18.  The talk will be at 5:00pm in Askwith Hall\, 13 Appian Way\, Cambridge\, MA. \nTitle: Graph Coloring: Local and Global \nAbstract: Graph Coloring is arguably the most popular subject in Discrete Mathematics\, and its combinatorial\, algorithmic and computational aspects have been studied intensively. The most basic notion in the area\, the chromatic number of a graph\, is an inherently global property. This is demonstrated by the hardness of computation or approximation of this invariant as well as by the existence of graphs with arbitrarily high chromatic number and no short cycles. The investigation of these graphs had a profound impact on Graph Theory and Combinatorics. It combines combinatorial\, probabilistic\, algebraic and topological techniques with number theoretic tools. I will describe the rich history of the subject focusing on some recent results. \n 
URL:https://live-hu-cmsa-222.pantheonsite.io/event/noga-alon-public-talk-9-7-17/
CATEGORIES:Event,Public Lecture
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Noga-Poster-2-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170818T154700
DTEND;TZID=America/New_York:20170819T154700
DTSTAMP:20250328T144515Z
CREATED:20230717T172600Z
LAST-MODIFIED:20250328T144515Z
UID:10000034-1503071220-1503157620@live-hu-cmsa-222.pantheonsite.io
SUMMARY:2017 Big Data Conference
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a conference on Big Data from August 18 – 19\, 2017\, in Hall D of the Science Center at Harvard University.\nThe Big Data Conference features many speakers from the Harvard community as well as scholars from across the globe\, with talks focusing on computer science\, statistics\, math and physics\, and economics. This is the third conference on Big Data the Center will host as part of our annual events\, and is co-organized by Richard Freeman\, Scott Kominers\, Jun Liu\, Horng-Tzer Yau and Shing-Tung Yau. \nConfirmed Speakers: \n\nMohammad Akbarpour\, Stanford University\nAlbert-László Barabási\, Northeastern University\nNoureddine El Karoui\, University of California\, Berkeley\nRavi Jagadeesan\, Harvard University\nLucas Janson\, Harvard University\nTracy Ke\, University of Chicago\nTze Leung Lai\, Stanford University\nAnnie Liang\, University of Pennsylvania\nMarena Lin\, Harvard University\nNikhil Naik\, Harvard University\nAlex Peysakhovich\, Facebook\nNatesh Pillai\, Harvard University\nJann Spiess\, Harvard University\nBradly Stadie\, Open AI\, University of California\, Berkeley\nZak Stone\, Google\nHau-Tieng Wu\, University of Toronto\nSifan Zhou\, Xiamen University\n\n  \nFollowing the conference\, there will be a two-day workshop from August 20-21. The workshop is organized by Scott Kominers\, and will feature: \n\nJörn Boehnke\, Harvard University\nNikhil Naik\, Harvard University\nBradly Stadie\, Open AI\, University of California\, Berkeley\n\n  \nConference Schedule \nA PDF version of the schedule below can also be downloaded here. \nAugust 18\, Friday (Full day)\n\n\n\nTime\nSpeaker\nTopic\n\n\n8:30 am – 9:00 am\n\nBreakfast\n\n\n9:00 am – 9:40 am\nMohammad Akbarpour \nVideo\nTitle: Information aggregation in overlapping generations and the emergence of experts \nAbstract: We study a model of social learning with “overlapping generations”\, where agents meet others and share data about an underlying state over time. We examine under what conditions the society will produce individuals with precise knowledge about the state of the world. There are two information sharing regimes in our model: Under the full information sharing technology\, individuals exchange the information about their point estimates of an underlying state\, as well as their sources (or the precision of their signals) and update their beliefs by taking a weighted average. Under the limited information sharing technology\, agents only observe the information about the point estimates of those they meet\, and update their beliefs by taking a weighted average\, where weights can depend on the sequence of meetings\, as well as the labels. Our main result shows that\, unlike most social learning settings\, using such linear learning rules do not guide the society (or even a fraction of its members) to learn the truth\, and having access to\, and exploiting knowledge of the precision of a source signal are essential for efficient social learning (joint with Amin Saberi & Ali Shameli).\n\n\n9:40 am – 10:20 am\nLucas Janson \nVideo\nTitle: Model-Free Knockoffs For High-Dimensional Controlled Variable Selection \nAbstract: Many contemporary large-scale applications involve building interpretable models linking a large set of potential covariates to a response in a nonlinear fashion\, such as when the response is binary. Although this modeling problem has been extensively studied\, it remains unclear how to effectively control the fraction of false discoveries even in high-dimensional logistic regression\, not to mention general high-dimensional nonlinear models. To address such a practical problem\, we propose a new framework of model-free knockoffs\, which reads from a different perspective the knockoff procedure (Barber and Candès\, 2015) originally designed for controlling the false discovery rate in linear models. The key innovation of our method is to construct knockoff variables probabilistically instead of geometrically. This enables model-free knockoffs to deal with arbitrary (and unknown) conditional models and any dimensions\, including when the dimensionality p exceeds the sample size n\, while the original knockoffs procedure is constrained to homoscedastic linear models with n greater than or equal to p. Our approach requires the design matrix be random (independent and identically distributed rows) with a covariate distribution that is known\, although we show our procedure to be robust to unknown/estimated distributions. As we require no knowledge/assumptions about the conditional distribution of the response\, we effectively shift the burden of knowledge from the response to the covariates\, in contrast to the canonical model-based approach which assumes a parametric model for the response but very little about the covariates. To our knowledge\, no other procedure solves the controlled variable selection problem in such generality\, but in the restricted settings where competitors exist\, we demonstrate the superior power of knockoffs through simulations. Finally\, we apply our procedure to data from a case-control study of Crohn’s disease in the United Kingdom\, making twice as many discoveries as the original analysis of the same data. \nSlides\n\n\n10:20 am – 10:50 am\n\nBreak\n\n\n10:50 pm – 11:30 pm\nNoureddine El Karoui \nVideo\nTitle: Random matrices and high-dimensional statistics: beyond covariance matrices \nAbstract: Random matrices have played a central role in understanding very important statistical methods linked to covariance matrices (such as Principal Components Analysis\, Canonical Correlation Analysis etc…) for several decades. In this talk\, I’ll show that one can adopt a random-matrix-inspired point of view to understand the performance of other widely used tools in statistics\, such as M-estimators\, and very common methods such as the bootstrap. I will focus on the high-dimensional case\, which captures well the situation of “moderately” difficult statistical problems\, arguably one of the most relevant in practice. In this setting\, I will show that random matrix ideas help upend conventional theoretical thinking (for instance about maximum likelihood methods) and highlight very serious practical problems with resampling methods.\n\n\n11:30 am – 12:10 pm\nNikhil Naik \nVideo\nTitle: Understanding Urban Change with Computer Vision and Street-level Imagery \nAbstract: Which neighborhoods experience physical improvements? In this work\, we introduce a computer vision method to measure changes in the physical appearances of neighborhoods from time-series street-level imagery. We connect changes in the physical appearance of five US cities with economic and demographic data and find three factors that predict neighborhood improvement. First\, neighborhoods that are densely populated by college-educated adults are more likely to experience physical improvements. Second\, neighborhoods with better initial appearances experience\, on average\, larger positive improvements. Third\, neighborhood improvement correlates positively with physical proximity to the central business district and to other physically attractive neighborhoods. Together\, our results illustrate the value of using computer vision methods and street-level imagery to understand the physical dynamics of cities. \n(Joint work with Edward L. Glaeser\, Cesar A. Hidalgo\, Scott Duke Kominers\, and Ramesh Raskar.)\n\n\n12:10 pm – 12:25 pm\nVideo #1 \nVideo #2\nData Science Lightning Talks\n\n\n12:25 pm – 1:30 pm\n\nLunch\n\n\n1:30 pm – 2:10 pm\nTracy Ke \nVideo\nTitle: A new SVD approach to optimal topic estimation \nAbstract: In the probabilistic topic models\, the quantity of interest—a low-rank matrix consisting of topic vectors—is hidden in the text corpus matrix\, masked by noise\, and Singular Value Decomposition (SVD) is a potentially useful tool for learning such a low-rank matrix. However\, the connection between this low-rank matrix and the singular vectors of the text corpus matrix are usually complicated and hard to spell out\, so how to use SVD for learning topic models faces challenges. \nWe overcome the challenge by revealing a surprising insight: there is a low-dimensional simplex structure which can be viewed as a bridge between the low-rank matrix of interest and the SVD of the text corpus matrix\, and which allows us to conveniently reconstruct the former using the latter. Such an insight motivates a new SVD-based approach to learning topic models. \nFor asymptotic analysis\, we show that under a popular topic model (Hofmann\, 1999)\, the convergence rate of the l1-error of our method matches that of the minimax lower bound\, up to a multi-logarithmic term. In showing these results\, we have derived new element-wise bounds on the singular vectors and several large deviation bounds for weakly dependent multinomial data. Our results on the convergence rate and asymptotical minimaxity are new. We have applied our method to two data sets\, Associated Process (AP) and Statistics Literature Abstract (SLA)\, with encouraging results. In particular\, there is a clear simplex structure associated with the SVD of the data matrices\, which largely validates our discovery.\n\n\n2:10 pm – 2:50 pm\nAlbert-László Barabási \nVideo\nTitle: Taming Complexity: From Network Science to Controlling Networks \nAbstract: The ultimate proof of our understanding of biological or technological systems is reflected in our ability to control them. While control theory offers mathematical tools to steer engineered and natural systems towards a desired state\, we lack a framework to control complex self-organized systems. Here we explore the controllability of an arbitrary complex network\, identifying the set of driver nodes whose time-dependent control can guide the system’s entire dynamics. We apply these tools to several real networks\, unveiling how the network topology determines its controllability. Virtually all technological and biological networks must be able to control their internal processes. Given that\, issues related to control deeply shape the topology and the vulnerability of real systems. Consequently unveiling the control principles of real networks\, the goal of our research\, forces us to address series of fundamental questions pertaining to our understanding of complex systems. \n \n\n\n2:50 pm – 3:20 pm\n\nBreak\n\n\n3:20 pm – 4:00 pm\nMarena Lin \nVideo\nTitle: Optimizing climate variables for human impact studies \nAbstract: Estimates of the relationship between climate variability and socio-economic outcomes are often limited by the spatial resolution of the data. As studies aim to generalize the connection between climate and socio-economic outcomes across countries\, the best available socio-economic data is at the national level (e.g. food production quantities\, the incidence of warfare\, averages of crime incidence\, gender birth ratios). While these statistics may be trusted from government censuses\, the appropriate metric for the corresponding climate or weather for a given year in a country is less obvious. For example\, how do we estimate the temperatures in a country relevant to national food production and therefore food security? We demonstrate that high-resolution spatiotemporal satellite data for vegetation can be used to estimate the weather variables that may be most relevant to food security and related socio-economic outcomes. In particular\, satellite proxies for vegetation over the African continent reflect the seasonal movement of the Intertropical Convergence Zone\, a band of intense convection and rainfall. We also show that agricultural sensitivity to climate variability differs significantly between countries. This work is an example of the ways in which in-situ and satellite-based observations are invaluable to both estimates of future climate variability and to continued monitoring of the earth-human system. We discuss the current state of these records and potential challenges to their continuity.\n\n\n4:00 pm – 4:40 pm\nAlex Peysakhovich\n Title: Building a cooperator \nAbstract: A major goal of modern AI is to construct agents that can perform complex tasks. Much of this work deals with single agent decision problems. However\, agents are rarely alone in the world. In this talk I will discuss how to combine ideas from deep reinforcement learning and game theory to construct artificial agents that can communicate\, collaborate and cooperate in productive positive sum interactions.\n\n\n4:40 pm – 5:20 pm\nTze Leung Lai \nVideo\nTitle: Gradient boosting: Its role in big data analytics\, underlying mathematical theory\, and recent refinements \nAbstract: We begin with a review of the history of gradient boosting\, dating back to the LMS algorithm of Widrow and Hoff in 1960 and culminating in Freund and Schapire’s AdaBoost and Friedman’s gradient boosting and stochastic gradient boosting algorithms in the period 1999-2002 that heralded the big data era. The role played by gradient boosting in big data analytics\, particularly with respect to deep learning\, is then discussed. We also present some recent work on the mathematical theory of gradient boosting\, which has led to some refinements that greatly improves the convergence properties and prediction performance of the methodology.\n\n\n\nAugust 19\, Saturday (Full day)\n\n\n\nTime\nSpeaker\nTopic\n\n\n8:30 am – 9:00 am\n\nBreakfast\n\n\n9:00 am – 9:40 am\nNatesh Pillai \nVideo\nTitle: Accelerating MCMC algorithms for Computationally Intensive Models via Local Approximations \nAbstract: We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood\, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel\, borrowing ideas from deterministic approximation theory\, optimization\, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain\, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity\, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems\, with both synthetic and real data.\n\n\n9:40 am – 10:20 am\nRavi Jagadeesan \nVideo\nTitle: Designs for estimating the treatment effect in networks with interference \nAbstract: In this paper we introduce new\, easily implementable designs for drawing causal inference from randomized experiments on networks with interference. Inspired by the idea of matching in observational studies\, we introduce the notion of considering a treatment assignment as a quasi-coloring” on a graph. Our idea of a perfect quasi-coloring strives to match every treated unit on a given network with a distinct control unit that has identical number of treated and control neighbors. For a wide range of interference functions encountered in applications\, we show both by theory and simulations that the classical Neymanian estimator for the direct effect has desirable properties for our designs. This further extends to settings where homophily is present in addition to interference.\n\n\n10:20 am – 10:50 am\n\nBreak\n\n\n10:50 am – 11:30 am\nAnnie Liang \nVideo\nTitle: The Theory is Predictive\, but is it Complete? An Application to Human Generation of Randomness \nAbstract: When we test a theory using data\, it is common to focus on correctness: do the predictions of the theory match what we see in the data? But we also care about completeness: how much of the predictable variation in the data is captured by the theory? This question is difficult to answer\, because in general we do not know how much “predictable variation” there is in the problem. In this paper\, we consider approaches motivated by machine learning algorithms as a means of constructing a benchmark for the best attainable level of prediction.  We illustrate our methods on the task of predicting human-generated random sequences. Relative to a theoretical machine learning algorithm benchmark\, we find that existing behavioral models explain roughly 15 percent of the predictable variation in this problem. This fraction is robust across several variations on the problem. We also consider a version of this approach for analyzing field data from domains in which human perception and generation of randomness has been used as a conceptual framework; these include sequential decision-making and repeated zero-sum games. In these domains\, our framework for testing the completeness of theories provides a way of assessing their effectiveness over different contexts; we find that despite some differences\, the existing theories are fairly stable across our field domains in their performance relative to the benchmark. Overall\, our results indicate that (i) there is a significant amount of structure in this problem that existing models have yet to capture and (ii) there are rich domains in which machine learning may provide a viable approach to testing completeness (joint with Jon Kleinberg and Sendhil Mullainathan).\n\n\n11:30 am – 12:10 pm\nZak Stone \nVideo\nTitle: TensorFlow: Machine Learning for Everyone \nAbstract: We’ve witnessed extraordinary breakthroughs in machine learning over the past several years. What kinds of things are possible now that weren’t possible before? How are open-source platforms like TensorFlow and hardware platforms like GPUs and Cloud TPUs accelerating machine learning progress? If these tools are new to you\, how should you get started? In this session\, you’ll hear about all of this and more from Zak Stone\, the Product Manager for TensorFlow on the Google Brain team.\n\n\n12:10 pm – 1:30 pm\n\nLunch\n\n\n1:30 pm – 2:10 pm\nJann Spiess \nVideo\nTitle: (Machine) Learning to Control in Experiments \nAbstract: Machine learning focuses on high-quality prediction rather than on (unbiased) parameter estimation\, limiting its direct use in typical program evaluation applications. Still\, many estimation tasks have implicit prediction components. In this talk\, I discuss accounting for controls in treatment effect estimation as a prediction problem. In a canonical linear regression framework with high-dimensional controls\, I argue that OLS is dominated by a natural shrinkage estimator even for unbiased estimation when treatment is random; suggest a generalization that relaxes some parametric assumptions; and contrast my results with that for another implicit prediction problem\, namely the first stage of an instrumental variables regression.\n\n\n2:10 pm – 2:50 pm\nBradly Stadie\nTitle: Learning to Learn Quickly: One-Shot Imitation and Meta Learning \nAbstract: Many reinforcement learning algorithms are bottlenecked by data collection costs and the brittleness of their solutions when faced with novel scenarios.\nWe will discuss two techniques for overcoming these shortcomings. In one-shot imitation\, we train a module that encodes a single demonstration of a desired behavior into a vector containing the essence of the demo. This vector can subsequently be utilized to recover the demonstrated behavior. In meta-learning\, we optimize a policy under the objective of learning to learn new tasks quickly. We show meta-learning methods can be accelerated with the use of auxiliary objectives. Results are presented on grid worlds\, robotics tasks\, and video game playing tasks.\n\n\n2:50 pm – 3:20 pm\n\nBreak\n\n\n3:20 pm – 4:00 pm\nHau-Tieng Wu \nVideo\nTitle: When Medical Challenges Meet Modern Data Science \nAbstract: Adaptive acquisition of correct features from massive datasets is at the core of modern data analysis. One particular interest in medicine is the extraction of hidden dynamics from a single observed time series composed of multiple oscillatory signals\, which could be viewed as a single-channel blind source separation problem. The mathematical and statistical problems are made challenging by the structure of the signal which consists of non-sinusoidal oscillations with time varying amplitude/frequency\, and by the heteroscedastic nature of the noise. In this talk\, I will discuss recent progress in solving this kind of problem by combining the cepstrum-based nonlinear time-frequency analysis and manifold learning technique. A particular solution will be given along with its theoretical properties. I will also discuss the application of this method to two medical problems – (1) the extraction of a fetal ECG signal from a single lead maternal abdominal ECG signal; (2) the simultaneous extraction of the instantaneous heart/respiratory rate from a PPG signal during exercise; (3) (optional depending on time) an application to atrial fibrillation signals. If time permits\, the clinical trial results will be discussed.\n\n\n4:00 pm – 4:40 pm\nSifan Zhou \nVideo\nTitle: Citing People Like Me: Homophily\, Knowledge Spillovers\, and Continuing a Career in Science \nAbstract: Forward citation is widely used to measure the scientific merits of articles. This research studies millions of journal article citation records in life sciences from MEDLINE and finds that authors of the same gender\, the same ethnicity\, sharing common collaborators\, working in the same institution\, or being geographically close are more likely (and quickly) to cite each other than predicted by their proportion among authors working on the same research topics. This phenomenon reveals how social and geographic distances influence the quantity and speed of knowledge spillovers. Given the importance of forward citations in academic evaluation system\, citation homophily potentially put authors from minority group at a disadvantage. I then show how it influences scientists’ chances to survive in the academia and continue publishing. Based on joint work with Richard Freeman.\n\n\n\n  \nTo view photos and video interviews from the conference\, please visit the CMSA blog. \n\n \n\n  \n\n\n\nBig Data\,CMSA\,Harvard\,Math\nEvents\,Past Events
URL:https://live-hu-cmsa-222.pantheonsite.io/event/2017-big-data-conference-aug-18-19/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Big Data Conference,Conference,Event
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Big-Data-2017_2.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170605T090000
DTEND;TZID=America/New_York:20170606T170000
DTSTAMP:20250305T182141Z
CREATED:20230717T175551Z
LAST-MODIFIED:20250305T182141Z
UID:10000032-1496653200-1496768400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:A Celebration of Symplectic Geometry: 15 Years of JSG
DESCRIPTION:In celebration of the Journal of Symplectic Geometry’s 15th anniversary\, the Center of Mathematical Sciences and Applications will be hosting A Celebration of Symplectic Geometry: 15 Years of JSG on June 5-6\, 2017. \nConfirmed speakers: \n\nRoger Casals\, MIT\nChen He\, Northeastern University\nYael Karshon\, University of Toronto\nAilsa Keating\, Institute of Advanced Study\nEckhard Meinrenken\, University of Toronto\nAna Rita Pires\, Fordham University\nSobhan Seyfaddini\, Institute of Advanced Study\nAlejandro Uribe\, University of Michigan\nJonathan Weitsman\, Northeastern University\n\nThe conference is co-organized by Denis Auroux and Victor Guillemin. Additional information on the conference will be announced closer to the event. \nSchedule:\nJune 5\, Monday (Full day)\n\n\n\nTime\nSpeaker\nTopic\n\n\n8:30am – 9:0am\n\nBreakfast\n\n\n9:00am – 10:00am\nJonathan Weitsman\nTitle: On the geometric quantization of (some) Poisson manifolds\n\n\n10:30am – 11:30am\nEckhard Meinrenken\nTitle: On Hamiltonian loop group spaces \nAbstract: Let G be a compact Lie group. We explain a construction of an LG-equivariant spinor module over any Hamiltonian loop group space with proper moment map. It may be regarded as its `canonical spin-c structure’. We show how to reduce to finite dimensions\, resulting in actual spin-s structure on transversals\, as well as twisted spin-c structures for the associated quasi-hamiltonian space. This is based on joint work with Yiannis Loizides and Yanli Song.\n\n\n\n11:30am – 1:30pm\n\nBreak\n\n\n1:30pm – 2:30pm\nAna Rita Pires\nTitle: Infinite staircases in symplectic embedding problems \nAbstract: McDuff and Schlenk studied an embedding capacity function\, which describes when a 4-dimensional ellipsoid can symplectically embed into a 4-ball. The graph of this function includes an infinite staircase related to the odd index Fibonacci numbers. Infinite staircases have been shown to exist also in the graphs of the embedding capacity functions when the target manifold is a polydisk or the ellipsoid E(2\,3). I will describe how we use ECH capacities\, lattice point counts and Ehrhart theory to show that infinite staircases exist for these and a few other target manifolds\, as well as to conjecture that these are the only such target manifolds. This is a joint work with Cristofaro-Gardiner\, Holm and Mandini. \nVideo\n\n\n3:00pm – 4:00pm\nSobhan Seyfaddini\nTitle: Rigidity of conjugacy classes in groups of area-preserving homeomorphisms \nAbstract: Motivated by understanding the algebraic structure of groups of area-preserving homeomorphims F. Beguin\, S. Crvoisier\, and F. Le Roux were lead to the following question: Can the conjugacy class of a Hamiltonian homeomorphism be dense? We will show that one can rule out existence of dense conjugacy classes by simply counting fixed points. This is joint work with Le Roux and Viterbo.\n\n\n4:30pm – 5:30pm\nRoger Casals\nTitle: Differential Algebra of Cubic Graphs\nAbstract: In this talk we will associate a combinatorial dg-algebra to a cubic planar graph. This algebra is defined by counting binary sequences\, which we introduce\, and we shall provide explicit computations and examples. From there we study the Legendrian surfaces behind these constructions\, including Legendrian surgeries\, the count of Morse flow trees involved in contact homology\, and the relation to microlocal sheaves. Time permitting\, I will explain a connection to spectral networks.Video\n\n\n\nJune 6\, Tuesday (Full day) \n\n\n\nTime\nSpeaker\nTopic\n\n\n8:30am – 9:00am\n\nBreakfast\n\n\n9:00am – 10:00am\nAlejandro Uribe\nTitle: Semi-classical wave functions associated with isotropic submanifolds of phase space \nAbstract: After reviewing fundamental ideas on the quantum-classical correspondence\, I will describe how to associate spaces of semi-classical wave functions to isotropic submanifolds of phase space satisfying a Bohr-Sommerfeld condition. Such functions have symbols that are symplectic spinors\, and they satisfy a symbol calculus under the action of quantum observables. This is the semi-classical version of the Hermite distributions of Boutet the Monvel and Guillemin\, and it is joint work with Victor Guillemin and Zuoqin Wang. I will inlcude applications and open questions. \nVideo\n\n\n10:30am – 11:30am\nAlisa Keating\nTitle: Symplectomorphisms of exotic discs \nAbstract: It is a theorem of Gromov that the group of compactly supported symplectomorphisms of R^4\, equipped with the standard symplectic form\, is contractible. While nothing is known in higher dimensions for the standard symplectic form\, we show that for some exotic symplectic forms on R^{4n}\, for all but finitely n\, there exist compactly supported symplectomorphisms that are smoothly non-trivial. The principal ingredients are constructions of Milnor and Munkres\, a symplectic and contact version of the Gromoll filtration\, and Borman\, Eliashberg and Murphy’s work on existence of over-twisted contact structures. Joint work with Roger Casals and Ivan Smith. \nVideo\n\n\n11:30am – 1:30pm\n\nBreak\n\n\n1:30pm – 2:30pm\nChen He\nTitle: Morse theory on b-symplectic manifolds \nAbstract: b-symplectic (or log-symplectic) manifolds are Poisson manifolds equipped with symplectic forms of logarithmic singularity. Following Guillemin\, Miranda\, Pires and Scott’s introduction of Hamiltonian group actions on b-symplectic manifolds\, we will survey those classical results of Hamiltonian geometry to the b-symplectic case. \nVideo\n\n\n3:00pm – 4:00pm\nYael Karshon\nTitle: Geometric quantization with metaplectic-c structures \nAbstract: I will present a variant of the Kostant-Souriau geometric quantization procedure that uses metaplectic-c structures to incorporate the “half form correction” into the prequantization stage. This goes back to the late 1970s but it is not widely known and it has the potential to generalize and improve upon recent works on geometric quantization. \nVideo\n\n\n\n 
URL:https://live-hu-cmsa-222.pantheonsite.io/event/a-celebration-of-symplectic-geometry-15-years-of-jsg-june-5-6-2017/
LOCATION:20 Garden Street\, Cambridge\, MA 02138\, MA\, MA\, 02138\, United States
CATEGORIES:Conference,Event
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Shlomo_orange.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170501T090000
DTEND;TZID=America/New_York:20170502T170000
DTSTAMP:20240209T152357Z
CREATED:20230717T175324Z
LAST-MODIFIED:20240209T152357Z
UID:10000031-1493629200-1493744400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Working Conference on Covariance Analysis in Biology\, May 1-4\, 2017
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a working Conference on Covariance Analysis in Biology\, May 1-4\, 2017.  The conference will be hosted in Room G10 of the CMSA Building located at 20 Garden Street\, Cambridge\, MA 02138. \nThis event is open and free.  If you would like to attend\, please register here to help us keep a headcount. A list of lodging options convenient to the Center can also be found on our recommended lodgings page. \nSpeakers: \nOrr Ashenberg\, Fred Hutchinson Cancer Research Center \nJohn Barton\, Massachusetts Institute of Technology \nSimona Cocco\, Laboratoire de Physique Statistique de l’ENS \nSean Eddy\, Harvard University \nEfthimios Kaxiras\, Harvard University \n\n\n\nMichael Laub\, Massachusetts Institute of Technology \nDebora S. Marks\, Harvard University \n\n\n\nGovind Menon\, Brown University \nRémi Monasson\, Laboratoire de Physique Théorique de l’ENS \nAndrew Murray\, Harvard University \nIlya Nemenman\, Emory College \n\n\n\nChris Sander\, Dana-Farber Cancer Institute\, Harvard Medical School \n\n\n\nDave Thirumalai\, University of Texas at Austin \nMartin Weigt\, IBPS\, Université Pierre et Marie Curie \nMatthieu Wyart\, EPFL \nMore speakers will be confirmed soon. \n  \n\n\n\nSchedule:\n(Please click here for a downloadable version of the schedule.)\nPlease note that the schedule for both days is currently tentative and is subject to change.\nMay 1\, Monday \n\n\n\n\n\nTime\nSpeaker\nTopic\n\n\n9:00-10:00am\nSean Eddy\nTBA\n\n\n10:00-11:00am\nMike Laub\nTBA\n\n\n11:00am-12:00pm\nIlya Nemenman\nTBA\n\n\n\n\nMay 2\, Tuesday\n\n\n\n\n\nTime\nSpeaker\nTopic\n\n\n9:00-10:00am\nOrr Ashenberg\nTBA\n\n\n10:00-11:00am\nDebora Marks\nTBA\n\n\n11:00am-12:00pm\nMartin Weigt\nTBA\n\n\n4:30pm-5:30pm\nSimona Cocco\nCMSA Colloquia\n\n\n\n  \n\nMay 3\, Wednesday\n\n\n\n\n\nTime\nSpeaker\nTopic\n\n\n9:00-10:00am\nAndrew Murray\nTBA\n\n\n10:00-11:00am\nMatthieu Wyart\nTBA\n\n\n11:00am-12:00pm\nRémi Monasson\nTBA\n\n\n\n  \n\nMay 4\, Thursday\n\n\n\n\nTime\nSpeaker\nTopic\n\n\n9:00-10:00am\nDavid Thirumalai\nTBA\n\n\n10:00-11:00am\nChris Sander\nTBA\n\n\n11:00am-12:00pm\nJohn Barton\nTBA\n\n\n\n  \n\n\nOrganizers: \n\n\n\nMichael Brenner\, Lucy Colwell\, Elena Rivas\, Eugene Shakhnovich \n\n\n\n* This event is sponsored by CMSA Harvard University. \n\n\n\n\nPast Events
URL:https://live-hu-cmsa-222.pantheonsite.io/event/working-conference-on-covariance-analysis-in-biology-may-1-4-2017/
LOCATION:20 Garden Street\, Cambridge\, MA 02138\, MA\, MA\, 02138\, United States
CATEGORIES:Conference,Event
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170428T090000
DTEND;TZID=America/New_York:20170502T170000
DTSTAMP:20250305T215930Z
CREATED:20230717T175015Z
LAST-MODIFIED:20250305T215930Z
UID:10000030-1493370000-1493744400@live-hu-cmsa-222.pantheonsite.io
SUMMARY:JDG 2017 Conference
DESCRIPTION:In celebration of the Journal of Differential Geometry’s 50th anniversary\, the Harvard Math Department will be hosting the Tenth Conference on Geometry and Topology (JDG 2017) from April 28 – May 2\, 2017. \nConfirmed Speakers \n\nMina Aganagic\, UC Berkeley\nDenis Auroux\, UC Berkeley\nCaucher Birkar\, University of Cambridge\nHuai-Dong Cao\, Lehigh University\nTristan Collins\, Harvard University\nCamillo De Lellis\, ETH Zurich\nJean-Pierre Demailly\, Grenoble Alpes University\nSimon Donaldson\, Stony Brook University\nDan Freed\, University of Texas at Austin\nKenji Fukaya\, Stony Brook University\nDavid Gabai\, Princeton University\nLarry Guth\, Massachusetts Institute of Technology\nRichard Hamilton\, Columbia University\nYujiro Kawamata\, University of Tokyo\nFrances Kirwan\, Oxford University\nBlaine Lawson\, Stony Brook University\nJun Li\, Stanford University\nSi Li\, Tsinghua University\nBong Lian\, Brandeis University\nChiu-Chu Melissa Liu\, Columbia University\nCiprian Manolescu\, University of California\, Los Angeles\nFernando Marques\, Princeton University\nWilliam Meeks\, University of Massachusetts Amherst\nWilliam Minicozzi\, Massachusetts Institute of Technology\nJohn Pardon\, Princeton University\nDuong Phong\, Columbia University\nAlena Pirutka\, Courant Institute of New York University\nRichard Schoen\, University of California\, Irvine\nArtan Sheshmani\, QGM Aarhus University/Harvard University\nCliff Taubes\, Harvard University\nCumrun Vafa\, Harvard University\nMu-Tao Wang\, Columbia University\nShing-Tung Yau\, Harvard University\nSteve Zelditch\, Northwestern University\n\n* This event is co-sponsored by Lehigh University and partially supported by the National Science Foundation.
URL:https://live-hu-cmsa-222.pantheonsite.io/event/jdg-2017-conference-april-28-may-2-2017/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Conference,Event
ATTACH;FMTTYPE=image/jpeg:https://live-hu-cmsa-222.pantheonsite.io/media/JDG-2017-scaled.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170423T090000
DTEND;TZID=America/New_York:20170424T170000
DTSTAMP:20250304T181313Z
CREATED:20230717T174601Z
LAST-MODIFIED:20250304T181313Z
UID:10000028-1492938000-1493053200@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Quantum Information
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a workshop on Quantum Information on April 23-24\, 2018. In the days leading up to the conference\, the American Mathematical Society will also be hosting a sectional meeting on quantum information on April 21-22. You can find more information here. \nThe following speakers are confirmed: \n\nFernando G.S.L Brandão (CalTech)\nJacob Biamonte (Skoltech)\nIsaac Chuang (MIT)\nIris Cong (Harvard)\nAram Harrow (MIT)\nKe Li (HIT)\nMikhail D. Lukin (Harvard)\nShunlong Luo (AMSS)\nRenato Renner (ETH Zürich)\nPeter Shor (MIT)
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-quantum-information/
LOCATION:20 Garden Street\, Cambridge\, MA 02138\, MA\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170327T153400
DTEND;TZID=America/New_York:20170330T153400
DTSTAMP:20240307T105730Z
CREATED:20240209T021031Z
LAST-MODIFIED:20240307T105730Z
UID:10001796-1490628840-1490888040@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Working Conference on Materials and Data Analysis\, March 27-30\, 2017
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a 5-day working Conference on Materials and Data Analysis and related areas\, March 27-30\, 2017.  The conference will be hosted in Room G10 of the CMSA Building located at 20 Garden Street\, Cambridge\, MA 02138. \nPhotos of the event can be found on CMSA’s Blog. \n Participants:\n\nRyan P. Adams\, Harvard University\nJörg Behler\, University of Göttingen\nKieron Burke\, University of California\, Irvine\nLucy Colwell\, University of Cambridge\nGábor Csányi\, University of Cambridge\nEkin Doğuş Çubuk\, Stanford University\nLeslie Greengard\, Courant Institute of Mathematical Sciences\, New York University\nPetros Koumoutsakos\, Radcliffe Institute for Advanced Study\, Harvard University\nGovind Menon\, Brown University\nEvan Reed\, Stanford University\nPatrick Riley\, Google\nMatthias Rupp\, Fitz Haber Institute of the Max Planck Society\nSadasivan Shankar\, Harvard University\nDennis Sheberla\, Harvard University\n\n\n\nOrganizers: \n\n\n\nMichael Brenner\, Efthimios Kaxiras \n\n\n\n* This event is sponsored by CMSA Harvard University. \n\nSchedule:\n\nMonday\, March 27 \n\n\n\nTime\nSpeaker\nTitle\n\n\n8:30am – 9:00am\nBreakfast\n\n\n9:00am – 10:00am\nKieron Burke\, University of California\, Irvine\nBackground in DFT and electronic structure calculations\n\n\n10:00am – 11:00am\nKieron Burke\, University of California\, Irvine\n\nThe density functionals machines can learn \n\n\n\n11:00am – 12:00pm\nSadasivan Shankar\, Harvard University\nA few key principles for applying Machine Learning to Materials (or Complex Systems) — Scientific and Engineering Perspectives\n\n\n\nTuesday\, March 28 \n\n\n\nTime\nSpeaker\nTitle\n\n\n8:30am – 9:00am\nBreakfast\n\n\n9:00am – 10:00am\nRyan Adams\, Harvard\nTBA\n\n\n10:00am – 11:00am\nGábor Csányi\, University of Cambridge\n\nInteratomic potentials using machine learning: accuracy\, transferability and chemical diversity \n\n\n\n11:00am – 1:00pm\nLunch Break\n\n\n1:00pm – 2:00pm\nEvan Reed\, Stanford University\nTBA\n\n\n\n Wednesday\, March 29  \n\n\n\nTime\nSpeaker\nTitle\n\n\n8:30am – 9:00am\nBreakfast\n\n\n9:00am – 10:00am\nPatrick Riley\, Google\nThe Message Passing Neural Network framework and its application to molecular property prediction\n\n\n10:00am – 11:00am\nJörg Behler\, University of Göttingen\nTBA\n\n\n11:00am – 12:00pm\nEkin Doğuş Çubuk\, Stanford Univers\nTBA\n\n\n4:00pm\nLeslie Greengard\, Courant Institute\nInverse problems in acoustic scattering and cryo-electron microscopy \nCMSA Colloquium\n\n\n\nThursday\, March 30 \n\n\n\nTime\nSpeaker\nTitle\n\n\n8:30am – 9:00am\nBreakfast\n\n\n9:00am – 10:00am\nMatthias Rupp\, Fitz Haber Institute of the Max Planck Society\nTBA\n\n\n10:00am – 11:00am\nPetros Koumoutsakos\, Radcliffe Institute for Advanced Study\, Harvard\nTBA\n\n\n11:00am – 1:00pm\nLunch Break\n\n\n1:00pm – 2:00pm\nDennis Sheberla\, Harvard University\nRapid discovery of functional molecules by a high-throughput virtual screening\n\n\n\n\n\n\n\nEvents\, Past Events
URL:https://live-hu-cmsa-222.pantheonsite.io/event/working-conference-on-materials-and-data-analysis-march-27-30-2017/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Conference,Event
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170308T121100
DTEND;TZID=America/New_York:20170419T121100
DTSTAMP:20250328T194543Z
CREATED:20230717T174006Z
LAST-MODIFIED:20250328T194543Z
UID:10000024-1488975060-1492603860@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Special Lecture Series on Donaldson-Thomas and Gromov-Witten Theories
DESCRIPTION:From March 8 to April 19\, the Center of Mathematical Sciences and Applications will be hosting a special lecture series on Donaldson-Thomas and Gromov-Witten Theories. Artan Sheshmani (QGM Aarhus and CMSA Harvard) will give eight talks on the topic on Wednesdays and Fridays from 9:00-10:30 am\, which will be recorded and promptly available on CMSA’s Youtube Channel.
URL:https://live-hu-cmsa-222.pantheonsite.io/event/special-lecture-series-on-donaldson-thomas-and-gromov-witten-theories/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Special Lectures
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170109T090000
DTEND;TZID=America/New_York:20170113T170000
DTSTAMP:20250305T194842Z
CREATED:20250305T194842Z
LAST-MODIFIED:20250305T194842Z
UID:10003717-1483952400-1484326800@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Working Conference on Applications of Random Matrix Theory to Data Analysis\, January 9-13\, 2017
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a working Conference on Applications of Random Matrix Theory to Data Analysis\, January 9-13\, 2017.  The conference will be hosted in Room G10 of the CMSA Building located at 20 Garden Street\, Cambridge\, MA 02138. \nParticipants:\nGerard Ben Arous\, Courant Institute of Mathematical Sciences \nAlex Bloemendal\, Broad Institute \nArup Chakraburty\, MIT \n\n\n\nZhou Fan\, Stanford University \nAlpha Lee\, Harvard University \nMatthew R. McKay\, Hong Kong University of Science and Technology (HKUST) \nDavid R. Nelson\, Harvard University \nNick Patterson\, Broad Institute \nMarc Potters\, Capital Fund management \n\n\n\nYasser Roudi\, IAS \nTom Trogdon\, UC Irvine \nOrganizers: \n\n\n\nMichael Brenner\, Lucy Colwell\, Govind Menon\, Horng-Tzer Yau \nPlease click Program for a downloadable schedule with talk abstracts.\n\nSchedule: \n\n\n\nJanuary 9 – Day 1\n\n\n9:30am – 10:00am\nBreakfast & Opening remarks\n\n\n10:00am – 11:00am\nMarc Potters\, “Eigenvector overlaps and the estimation of large noisy matrices”\n\n\n11:00am – 12:00pm\nYasser Roudi\n\n\n12:00pm – 2:00pm\nLunch\n\n\n2:00pm\nAfternoon Discussion\n\n\nJanuary 10 – Day 2\n\n\n8:30am – 9:00am\nBreakfast\n\n\n9:00am – 10:00am\nArup Chakraburty\, “The mathematical analyses and biophysical reasons underlying why the prevalence of HIV strains and their relative fitness are simply correlated\, and pose the challenge of building a general theory that encompasses other viruses where this is not true.”\n\n\n10:00am – 11:00am\nTom Trogdon\, “On the average behavior of numerical algorithms”\n\n\n11:00am – 12:00pm\nDavid R. Nelson\, “Non-Hermitian Localization in Neural Networks”\n\n\n12:00pm – 2:00pm\nLunch\n\n\n2:00pm\nAfternoon Discussion\n\n\nJanuary 11 – Day 3\n\n\n8:30am – 9:00am\nBreakfast\n\n\n9:00am – 10:00am\nNick Patterson\n\n\n10:00am – 11:00am\nLucy Colwell\n\n\n11:00am – 12:00pm\nAlpha Lee\n\n\n12:00pm – 2:00pm\nLunch\n\n\n2:00pm-4:00pm\nAfternoon Discussion\n\n\n4:00pm\nGerard Ben Arous (Public Talk)\, “Complexity of random functions of many variables: from geometry to statistical physics and deep learning algorithms“\n\n\nJanuary 12 – Day 4\n\n\n8:30am – 9:00am\nBreakfast\n\n\n9:00am – 10:00am\nGovind Menon\n\n\n10:00am – 11:00am\nAlex Bloemendal\n\n\n11:00am – 12:00pm\nZhou Fan\, “Free probability\, random matrices\, and statistics”\n\n\n12:00pm – 2:00pm\nLunch\n\n\n2:00pm\nAfternoon Discussion\n\n\nJanuary 13 – Day 5\n\n\n8:30am – 9:00am\nBreakfast\n\n\n9:00am – 12:00pm\nFree for Working\n\n\n12:00pm – 2:00pm\nLunch\n\n\n2:00pm\nFree for Working\n\n\n\n\n* This event is sponsored by CMSA Harvard University.
URL:https://live-hu-cmsa-222.pantheonsite.io/event/working-conference-on-applications-of-random-matrix-theory-to-data-analysis-january-9-13-2017/
LOCATION:CMSA 20 Garden Street Cambridge\, Massachusetts 02138 United States
CATEGORIES:Conference,Event
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170109T090000
DTEND;TZID=America/New_York:20170113T170000
DTSTAMP:20240209T152014Z
CREATED:20230717T173216Z
LAST-MODIFIED:20240209T152014Z
UID:10000020-1483952400-1484326800@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Discrete and Topological Models for Effective Field Theories\, January 9-13\, 2017
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a Workshop on “Discrete and Topological Models for Effective Field Theories\,” January 9-13\, 2017.  The workshop will be hosted in G02 of the CMSA Building located at 20 Garden Street\, Cambridge\, MA 02138. \nTitles\, abstracts and schedule will be provided nearer to the event. \nParticipants:\nDan Freed\, UT Austin \nAnton Kapustin\, California Institute of Technology \nAlexei Y. Kitaev\, California Institute of Technology \nGreg Moore\, Rutgers University \n\n\n\nConstantin Teleman\, University of Oxford \n\n\n\nOrganizers: \n\n\n\nMike Hopkins\, Shing-Tung Yau \n* This event is sponsored by CMSA Harvard University.
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-discrete-and-topological-models-for-effective-field-theories-january-9-13-2017/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20161203T090000
DTEND;TZID=America/New_York:20161204T170000
DTSTAMP:20250305T201523Z
CREATED:20230717T172404Z
LAST-MODIFIED:20250305T201523Z
UID:10000018-1480755600-1480870800@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Mini-school on Nonlinear Equations\, December 3-4\, 2016
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a Mini-school on Nonlinear Equations on December 3-4\, 2016. The conference will have speakers and will be hosted at Harvard CMSA Building: Room G10 20 Garden Street\, Cambridge\, MA 02138. \nSpeakers:\n\nCliff Taubes (Harvard University)\nValentino Tosatti (Northwestern University)\nPengfei Guan (McGill University)\nJared Speck (MIT)\n\nSchedule:\n\n\n\nDecember 3rd – Day 1\n\n\n9:00am – 10:30am\nCliff Taubes\, “Compactness theorems in gauge theories”\n\n\n10:45am – 12:15pm\nValentino Tosatti\, “Complex Monge-Ampère Equations”\n\n\n\n\n\n12:15pm – 1:45pm\nLUNCH\n\n\n\n\n\n\n1:45pm – 3:15pm\nPengfei Guan\, “Monge-Ampère type equations and related geometric problems”\n\n\n3:30pm – 5:00pm\nJared Speck\, “Finite-time degeneration of hyperbolicity without blowup for solutions to quasilinear wave equations”\n\n\n\n\n\n\n\n\nDecember 4th – Day 2\n\n\n9:00am – 10:30am\nCliff Taubes\, “Compactness theorems in gauge theories”\n\n\n10:45am – 12:15pm\nValentino Tosatti\, “Complex Monge-Ampère Equations”\n\n\n\n\n\n12:15pm – 1:45pm\nLUNCH\n\n\n\n\n\n\n1:45pm – 3:15pm\nPengfei Guan\, “Monge-Ampère type equations and related geometric problems”\n\n\n3:30pm – 5:00pm\nJared Speck\, “Finite-time degeneration of hyperbolicity without blowup for solutions to quasilinear wave equations”\n\n\n\n\n  \n* This event is sponsored by National Science Foundation (NSF) and CMSA Harvard University.
URL:https://live-hu-cmsa-222.pantheonsite.io/event/mini-school-on-nonlinear-equations-december-3-4-2016/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Conference,Event,Workshop
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/minischool.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160822T090000
DTEND;TZID=America/New_York:20160823T163000
DTSTAMP:20250328T144123Z
CREATED:20230717T171959Z
LAST-MODIFIED:20250328T144123Z
UID:10000017-1471856400-1471969800@live-hu-cmsa-222.pantheonsite.io
SUMMARY:2016 Big Data Conference & Workshop
DESCRIPTION:! LOCATION CHANGE: The conference will be in Science Center Hall C on Tuesday\, Aug.23\, 2016.\nThe Center of Mathematical Sciences and Applications will be hosting a workshop on Big Data from August 12 – 21\, 2016 followed by a two-day conference on Big Data from August 22 – 23\, 2016. \nBig Data Conference features many speakers from the Harvard Community as well as many scholars from across the globe\, with talks focusing on computer science\, statistics\, math and physics\, and economics. This is the second conference on Big Data the Center will host as part of our annual events. The 2015 conference was a huge success. \nThe conference will be hosted at Harvard Science Center Hall A (Monday\, Aug.22) & Hall C (Tuesday\, Aug.23): 1 Oxford Street\, Cambridge\, MA 02138. \nThe 2016 Big Data conference is sponsored by the Center of Mathematical Sciences and Applications at Harvard University and the Alfred P. Sloan Foundation. \nConference Speakers:\n\nJörn Boehnke\, Harvard CMSA\nJoan Bruna\, UC Berkeley [Video]\nTamara Broderick\, MIT [Video]\nJustin Chen\, MIT [Video]\nYiling Chen\, Harvard University [Video]\nAmir Farbin\, UT Arlington [Video]\nDoug Finkbeiner\, Harvard University [Video]\nAndrew Gelman\, Columbia University [Video]\nNina Holden\, MIT [Video]\nElchanan Mossel\, MIT\nAlex Peysakhovich\, Facebook\nAlexander Rakhlin\, University of Pennsylvania [Video]\nNeal Wadhwa\, MIT [Video]\nJun Yin\, University of Wisconsin\nHarry Zhou\, Yale University [Video]\n\nPlease click Conference Program for a downloadable schedule with talk abstracts.\nConference Schedule:\n\n\n\nAugust 22 – Day 1\n\n\n8:30am\nBreakfast\n\n\n8:55am\nOpening remarks\n\n\n9:00am – 9:50am\nYiling Chen\, “Machine Learning with Strategic Data Sources” [Video]\n\n\n9:50am – 10:40am\nAndrew Gelman\, “Taking Bayesian Inference Seriously” [Video]\n\n\n10:40am – 11:10am\nBreak\n\n\n11:10am – 12:00pm\nHarrison Zhou\, “A General Framework for Bayes Structured Linear Models” [Video]\n\n\n12:00pm – 1:30pm\nLunch\n\n\n1:30pm – 2:20pm\nDouglas Finkbeiner\, “Mapping the Milky Way in 3D with star colors” [Video]\n\n\n2:20pm – 3:10pm\nNina Holden\, “Sparse exchangeable graphs and their limits” [Video]\n\n\n3:10pm – 3:40pm\nBreak\n\n\n3:40pm – 4:30pm\nAlex Peysakhovich\, “How social science methods inform personalization on Facebook News Feed” [Video]\n\n\n4:30pm – 5:20pm\nAmir Farbin\, “Deep Learning in High Energy Physics” [Video]\n\n\n\n\n\nAugust 23 – Day 2\n\n\n8:45am\nBreakfast\n\n\n9:00am – 9:50am\nJoan Bruna Estrach\, “Addressing Computational and Statistical Gaps with Deep Networks” [Video]\n\n\n9:50am – 10:40am\nJustin Chen & Neal Wadhwa\, “Smaller Than the Eye Can See: Big Engineering from Tiny Motions in Video” [Video]\n\n\n10:40am – 11:10am\nBreak\n\n\n11:10am – 12:00pm\nAlexander Rakhlin\, “How to Predict When Estimation is Hard: Algorithms for Learning on Graphs” [Video]\n\n\n12:00pm – 1:30pm\nLunch\n\n\n1:30pm – 2:20pm\nTamara Broderick\, “Fast Quantification of Uncertainty and Robustness with Variational Bayes” [Video]\n\n\n2:20pm – 3:10pm\nElchanan Mossel\, “Phylogenetic Reconstruction – a Rigorous Model of Deep Learning”\n\n\n3:10pm – 3:40pm\nBreak\n\n\n3:40pm – 4:30pm\nJörn Boehnke\, “Amazon’s Price and Sales-rank Data: What can one billion prices on 150 thousand products tell us about the economy?”\n\n\n\nWorkshop Participants:\nRichard Freeman’s Group: \n\nSen Chai\, ESSEC\nBrock Mendel\, Harvard University\nRaviv Muriciano-Goroff\, Stanford University\nSifan Zhou\, CMSA\n\nScott Kominer’s Group: \n\nBradly Stadie\, UC Berkeley\nNeal Wadhwa\, MIT [Video]\nJustin Chen\n\nChristopher Rogan’s Group: \n\nAmir Farbin\, UT Arlington [Video]\nPaul Jackson\, University of Adelaide\n\nFor more information about the workshops\, please reach out directly to the individual group leaders. \n* This event is sponsored by CMSA Harvard University and the Alfred P. Sloan Foundation. \n 
URL:https://live-hu-cmsa-222.pantheonsite.io/event/2016-big-data-conference-workshop/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Big Data Conference,Conference,Event,Workshop
ATTACH;FMTTYPE=image/png:https://live-hu-cmsa-222.pantheonsite.io/media/Big-Data_2016_2-1-2.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160627T090000
DTEND;TZID=America/New_York:20160630T123000
DTSTAMP:20240209T151628Z
CREATED:20230717T181127Z
LAST-MODIFIED:20240209T151628Z
UID:10001123-1467018000-1467289800@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Optimization in Image Processing
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a workshop on Optimization in Image Processing on June 27 – 30\, 2016. This 4-day workshop aims to bring together researchers to exchange and stimulate ideas in imaging sciences\, with a special focus on new approaches based on optimization methods. This is a cutting-edge topic with crucial impact in various areas of imaging science including inverse problems\, image processing and computer vision. 16 speakers will participate in this event\, which we think will be a very stimulating and exciting workshop. The workshop will be hosted in Room G10 of the CMSA Building located at 20 Garden Street\, Cambridge\, MA 02138. \nTitles\, abstracts and schedule will be provided nearer to the event. \nSpeakers:\n\nAntonin Chambolle\, CMAP\, Ecole Polytechnique\nRaymond Chan\, The Chinese University of Hong Kong\nKe Chen\, University of Liverpool\nPatrick Louis Combettes\, Université Pierre et Marie Curie\nMario Figueiredo\, Instituto Superior Técnico\nAlfred Hero\, University of Michigan\nRonald Lok Ming Lui\, The Chinese University of Hong Kong\nMila Nikolova\, Ecole Normale Superieure Cachan\nShoham Sabach\, Israel Institute of Technology\nMartin Benning\, University of Cambridge\nJin Keun Seo\, Yonsei University\nFiorella Sgallari\, University of Bologna\nGabriele Steidl\, Kaiserslautern University of Technology\nJoachim Weickert\, Saarland University\nIsao Yamada\, Tokyo Institute of Technology\nWotao Yin\, UCLA\n\nPlease click Workshop Program for a downloadable schedule with talk abstracts.\nPlease note that lunch will not be provided during the conference\, but a map of Harvard Square with a list of local restaurants can be found by clicking Map & Resturants.\nPlease click here for registration – Registration Deadline: June 7\, 2016; Registration is capped at 70 participants.\n\nSchedule:\n\n\n\nJune 27 – Day 1\n\n\n9:00am\nBreakfast\n\n\n9:20am\nOpening remarks\n\n\n9:30am – 10:20am\nJoachim Weickert\, “FSI Schemes: Fast Semi-Iterative Methods for Diffusive or Variational Image Analysis Problems”\n\n\n10:20am – 10:50am\nBreak\n\n\n10:50am – 11:40pm\nPatrick Louis Combettes\, “Block-Iterative Asynchronous Variational Image Recovery”\n\n\n11:40am – 12:30pm\nIsao Yamada\, “Spicing up Convex Optimization for Certain Inverse Problems”\n\n\n12:30pm – 2:00pm\nLunch\n\n\n2:30pm – 3:20pm\nFiorella Sgallari\, “Majorization-Minimization for Nonconvex Optimization”\n\n\n3:20pm – 3:50pm\nBreak\n\n\n3:50pm – 4:40pm\nShoham Sabach\, “A Framework for Globally Convergent Methods in Nonsmooth and Nonconvex Problems”\n\n\nJune 28 – Day 2\n\n\n9:00am\nBreakfast\n\n\n9:30am – 10:20am\nAntonin Chambolle\, “Acceleration of alternating minimisations”\n\n\n10:20am – 10:50am\nBreak\n\n\n10:50am – 11:40am\nMario Figueiredo\, “ADMM in Image Restoration and Related Problems: Some History and Recent Advances”\n\n\n11:40am – 12:30pm\nKe Chen\, “Image Restoration and Registration Based on Total Fractional-Order Variation Regularization”\n\n\n12:30pm – 2:30pm\nLunch\n\n\n2:30pm – 4:40pm\nDiscussions\n\n\nJune 29 – Day 3\n\n\n9:00am\nBreakfast\n\n\n9:30am – 10:20am\nAlfred Hero\, “Continuum relaxations for discrete optimization”\n\n\n10:20am – 10:50am\nBreak\n\n\n10:50am – 11:40am\nWotao Yin\, “Coordinate Update Algorithms for Computational Imaging and Machine Learning”\n\n\n11:40am – 12:30pm\nMila Nikolova\, “Limits on noise removal using log-likelihood and regularization”\n\n\n12:30pm – 2:30pm\nLunch\n\n\n2:30pm – 3:20pm\nMartin Benning\, “Nonlinear spectral decompositions and the inverse scale space method”\n\n\n3:20pm – 3:50pm\nBreak\n\n\n3:50pm – 4:40pm\nRonald Ming Lui\, “TEMPO: Feature-endowed Teichmuller extremal mappings of point cloud for shape classification”\n\n\nJune 30 – Day 4\n\n\n9:00am\nBreakfast\n\n\n9:30am – 10:20am\nJin Keun Seo\, “Mathematical methods for biomedical impedance imaging”\n\n\n10:20am – 10:50am\nBreak\n\n\n10:50am – 11:40am\nGabriele Steidl\, “Iterative Multiplicative Filters for Data Labeling”\n\n\n11:40am – 12:30pm\nRaymond Chan\, “Point-spread function reconstruction in ground-based astronomy”\n\n\n\n* This event is sponsored by CMSA Harvard University.\n \nOrganizers: Raymond Chan and Shing-Tung Yau
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-optimization-in-image-processing-3/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160523T083000
DTEND;TZID=America/New_York:20160524T160000
DTSTAMP:20250328T144011Z
CREATED:20240209T022127Z
LAST-MODIFIED:20250328T144011Z
UID:10001803-1463992200-1464105600@live-hu-cmsa-222.pantheonsite.io
SUMMARY:Workshop on Aspects of General Relativity
DESCRIPTION:The Center of Mathematical Sciences and Applications will be hosting a workshop on General Relativity from May 23 – 24\, 2016. The workshop will be hosted in Room G10 of the CMSA Building located at 20 Garden Street\, Cambridge\, MA 02138. The workshop will start on Monday\, May 23 at 9am and end on Tuesday\, May 24 at 4pm. \nSpeakers:\n\nPo-Ning Chen\, Columbia University\nPiotr T. Chruściel\, University of Vienna\nJustin Corvino\, Lafayette College\nGreg Galloway\, University of Miami\nJames Guillochon\, Harvard University\nLan-Hsuan Huang\, University of Connecticut\nDan Kapec\, Harvard University\nDan Lee\, CUNY\nAlex Lupsasca\, Harvard University\nPengzi Miao\, University of Miami\nPrahar Mitra\, Harvard University\nLorenzo Sironi\, Harvard University\nJared Speck\, MIT\nMu-Tao Wang\, Columbia University\n\nRegistration is capped at 70 participants.\nSchedule:\n\n\n\nMay 23 – Day 1\n\n\n8:30am\nBreakfast\n\n\n8:55am\nOpening remarks\n\n\n9:00am – 9:45am\nGreg Galloway\, “Some remarks on photon spheres and their uniqueness“\n\n\n9:45am – 10:30am\nPrahar Mitra\, “BMS supertranslations and Weinberg’s soft graviton theorem“\n\n\n10:30am – 11:00am\nBreak\n\n\n11:00am – 11:45am\nDan Kapec\, “Area\, Entanglement Entropy and Supertranslations at Null Infinity“\n\n\n11:45am – 12:30pm\nPiotr T. Chruściel\, “The cosmological constant and the energy of gravitational radiation”\n\n\n12:30pm – 2:00pm\nLunch\n\n\n2:00pm – 2:45pm\nJames Guillochon\, “Tidal disruptions of stars by supermassive black holes: dynamics\, light\, and relics”\n\n\n2:45pm – 3:30pm\nMu-Tao Wang\, “Quasi local conserved quantities in general relativity“\n\n\n3:30pm – 4:00pm\nBreak\n\n\n4:00pm – 4:45pm\nPo-Ning Chen\, “Quasi local energy in presence of gravitational radiations”\n\n\n4:45pm – 5:30pm\nPengzi Miao\, “Total mean curvature\, scalar curvature\, and a variational analog of Brown York mass“\n\n\n\n\n\nMay 24 – Day 2\n\n\n8:45am\nBreakfast\n\n\n9:00am – 9:45am\nJustin Corvino\, “Scalar curvature deformation and the Bartnik mass“\n\n\n9:45am – 10:30am\nLan-Hsuan Huang\, “Constraint Manifolds with the Dominant Energy Condition“\n\n\n10:30am – 11:00am\nBreak\n\n\n11:00am – 11:45am\nDan Lee\, “Lower semicontinuity of Huisken’s isoperimetric mass“\n\n\n11:45am – 12:30pm\nJared Speck\, “Shock Formation in Solutions to the Compressible Euler Equations“\n\n\n12:30pm – 2:00pm\nLunch\n\n\n2:00pm – 2:45pm\nLorenzo Sironi\, “Electron Heating and Acceleration in the Vicinity of Supermassive Black Holes“\n\n\n2:45pm – 3:30pm\nAlex Lupsasca\, “Near Horizon Extreme Kerr Magnetospheres“\n\n\n\n* Click titles for talk videos. All videos are also available on “Harvard CMSA” channel on Youtube\, grouped into playlist “Workshop on Aspects on General Relativity“.\n* This event is sponsored by National Science Foundation (NSF) and CMSA Harvard University.\n \nOrganizers: Piotr T. Chruściel and Shing-Tung Yau
URL:https://live-hu-cmsa-222.pantheonsite.io/event/workshop-on-aspects-of-general-relativity/
CATEGORIES:Event,Workshop
END:VEVENT
END:VCALENDAR