BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220818T100000
DTEND;TZID=America/New_York:20220818T103000
DTSTAMP:20260417T151446
CREATED:20240215T094804Z
LAST-MODIFIED:20240229T085424Z
UID:10002728-1660816800-1660818600@cmsa.fas.harvard.edu
SUMMARY:Scalable Dynamic Graph Algorithms
DESCRIPTION:CMSA Interdisciplinary Science Seminar \nSpeaker: Quanquan Liu\, Northwestern University \nTitle: Scalable Dynamic Graph Algorithms \nAbstract: The field of dynamic graph algorithms seeks to understand and compute statistics on real-world networks that undergo changes with time. Some of these networks could have up to millions of edge insertions and deletions per second. In light of these highly dynamic networks\, we propose various scalable and accurate graph algorithms for a variety of problems. In this talk\, I will discuss new algorithms for various graph problems in the batch-dynamic model in shared-memory architectures where updates to the graph arrive in multiple batches of one or more updates. I’ll also briefly discuss my work in other dynamic models such as distributed dynamic models where the communication topology of the network also changes with time (ITCS 2022). In these models\, I will present efficient algorithms for graph problems including k-core decomposition\, low out-degree orientation\, matching\, triangle counting\, and coloring. \nSpecifically\, in the batch-dynamic model where we are given a batch of B updates\, I’ll discuss an efficient O(B log^2 n) amortized work and O(log^2 n log log n) depth algorithm that gives a (2+\epsilon)-approximation on the k-core decomposition after each batch of updates (SPAA 2022). We also obtain new batch-dynamic algorithms for matching\, triangle counting\, and coloring using techniques and data structures developed in our k-core decomposition algorithm. In addition to our theoretical results\, we implemented and experimentally evaluated our k-core decomposition algorithm on a 30-core machine with two-way hyper-threading on 11 graphs of varying densities and sizes. Our experiments show improvements over state-of-the-art algorithms even on machines with only 4 cores (your standard laptop). I’ll conclude with a discussion of some open questions and potential future work that these lines of research inspire. \nBio: Quanquan C. Liu is a postdoctoral scholar at Northwestern University under the mentorship of Prof. Samir Khuller. She completed her PhD in Computer Science at MIT where she was advised by Prof. Erik Demaine and Prof. Julian Shun. Before that\, she obtained her dual bachelor’s degree in computer science and math also at MIT. She has worked on a number of problems in algorithms and the intersection between theory and practice. Her most recent work focuses on scalable dynamic and static graph algorithms as well as differentially private graph algorithms for problems including k-core decomposition\, densest subgraphs\, subgraph counting\, matching\, maximal independent set and coloring. She has earned the Best Paper Award at SPAA 2022\, a NSF Graduate Research Fellowship\, and participated in the 2021 EECS Rising Stars workshop. Outside of research\, she is extensively involved in programming outreach as a coach for the USA Computing Olympiad (USACO) and as a trainer for the North America Programming Camp (NAPC).
URL:https://cmsa.fas.harvard.edu/event/iss_81822/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Interdisciplinary Science Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220811T090000
DTEND;TZID=America/New_York:20220811T100000
DTSTAMP:20260417T151446
CREATED:20240215T095012Z
LAST-MODIFIED:20240229T085717Z
UID:10002730-1660208400-1660212000@cmsa.fas.harvard.edu
SUMMARY:Exploring and Exploiting the Universality Phenomena in High-Dimensional Estimation and Learning
DESCRIPTION:Interdisciplinary Science Seminar \nSpeaker: Yue M. Lu\, Harvard University \nTitle: Exploring and Exploiting the Universality Phenomena in High-Dimensional Estimation and Learning \nAbstract: Universality is a fascinating high-dimensional phenomenon. It points to the existence of universal laws that govern the macroscopic behavior of wide classes of large and complex systems\, despite their differences in microscopic details. The notion of universality originated in statistical mechanics\, especially in the study of phase transitions. Similar phenomena have been observed in probability theory\, dynamical systems\, random matrix theory\, and number theory.\nIn this talk\, I will present some recent progresses in rigorously understanding and exploiting the universality phenomena in the context of statistical estimation and learning on high-dimensional data. Examples include spectral methods for high-dimensional projection pursuit\, statistical learning based on kernel and random feature models\, and approximate message passing algorithms on highly structured\, strongly correlated\, and even (nearly) deterministic data matrices. Together\, they demonstrate the robustness and wide applicability of the universality phenomena. \nBio: Yue M. Lu attended the University of Illinois at Urbana-Champaign\, where he received the M.Sc. degree in mathematics and the Ph.D. degree in electrical engineering\, both in 2007.  He is currently Gordon McKay Professor of Electrical Engineering and of Applied Mathematics at Harvard University. He is also fortunate to have held visiting appointments at Duke University in 2016 and at the École Normale Supérieure (ENS) in 2019. His research interests include the mathematical foundations of statistical signal processing and machine learning in high dimensions.
URL:https://cmsa.fas.harvard.edu/event/iss_81122/
LOCATION:Hybrid
CATEGORIES:Interdisciplinary Science Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220810T090000
DTEND;TZID=America/New_York:20220810T100000
DTSTAMP:20260417T151446
CREATED:20240215T095253Z
LAST-MODIFIED:20240229T090234Z
UID:10002731-1660122000-1660125600@cmsa.fas.harvard.edu
SUMMARY:Recent Advances on Maximum Flows and Minimum-Cost Flows
DESCRIPTION:Interdisciplinary Science Seminar\n\n\n\n\n\n\nSpeaker: Yang P. Liu\n\n\nTitle: Recent Advances on Maximum Flows and Minimum-Cost Flows\n\nAbstract: We survey recent advances on computing flows in graphs\, culminating in an almost linear time algorithm for solving minimum-cost flow and several other problems to high accuracy on directed graphs. Along the way\, we will discuss intuitions from linear programming\, graph theory\, and data structures that influence these works\, and the resulting natural open problems. \nBio: Yang P. Liu is a final-year graduate student at Stanford University. He is broadly interested in the efficient design of algorithms\, particularly flows\, convex optimization\, and online algorithms. For his work\, he has been awarded STOC and ITCS best student papers.
URL:https://cmsa.fas.harvard.edu/event/iss_81022/
LOCATION:Virtual
CATEGORIES:Interdisciplinary Science Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220728T090000
DTEND;TZID=America/New_York:20220728T100000
DTSTAMP:20260417T151446
CREATED:20240215T094315Z
LAST-MODIFIED:20240229T084527Z
UID:10002726-1658998800-1659002400@cmsa.fas.harvard.edu
SUMMARY:Statistical Mechanical theory for spatio-temporal evolution of Intra-tumor heterogeneity in cancers: Analysis of Multiregion sequencing data
DESCRIPTION:CMSA Interdisciplinary Science Seminar \nSpeaker: Sumit Sinha\, Harvard University \nTitle: Statistical Mechanical theory for spatio-temporal evolution of Intra-tumor heterogeneity in cancers: Analysis of Multiregion sequencing data (https://arxiv.org/abs/2202.10595) \nAbstract: Variations in characteristics from one region (sub-population) to another are commonly observed in complex systems\, such as glasses and a collection of cells. Such variations are manifestations of heterogeneity\, whose spatial and temporal behavior is hard to describe theoretically. In the context of cancer\, intra-tumor heterogeneity (ITH)\, characterized by cells with genetic and phenotypic variability that co-exist within a single tumor\, is often the cause of ineffective therapy and recurrence of cancer. Next-generation sequencing\, obtained by sampling multiple regions of a single tumor (multi-region sequencing\, M-Seq)\, has vividly demonstrated the pervasive nature of ITH\, raising the need for a theory that accounts for evolution of tumor heterogeneity. Here\, we develop a statistical mechanical theory to quantify ITH\, using the Hamming distance\, between genetic mutations in distinct regions within a single tumor. An analytic expression for ITH\, expressed in terms of cell division probability (α) and mutation probability (p)\, is validated using cellular-automaton type simulations. Application of the theory successfully captures ITH extracted from M-seq data in patients with exogenous cancers (melanoma and lung). The theory\, based on punctuated evolution at the early stages of the tumor followed by neutral evolution\, is accurate provided the spatial variation in the tumor mutation burden is not large. We show that there are substantial variations in ITH in distinct regions of a single solid tumor\, which supports the notion that distinct subclones could co-exist. The simulations show that there are substantial variations in the sub-populations\, with the ITH increasing as the distance between the regions increases. The analytical and simulation framework developed here could be used in the quantitative analyses of the experimental (M-Seq) data. More broadly\, our theory is likely to be useful in analyzing dynamic heterogeneity in complex systems such as supercooled liquids. \nBio: I am a postdoctoral fellow in Harvard SEAS (Applied Mathematics) and Dana Farber Cancer Institute (Data Science) beginning Feb 2022. I finished my PhD in Physics (Theoretical Biophysics) from UT Austin (Jan 2022) on “Theoretical and computational studies of growing tissue”.  I pursued my undergraduate degree in Physics from the Indian Institute of Technology\, Kanpur in India (2015). Boradly\, I am interested in developing theoretical models\, inspired from many-body statistical physics\, for biological processes at different length and time scales. \n 
URL:https://cmsa.fas.harvard.edu/event/iss_72822/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Interdisciplinary Science Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220721T090000
DTEND;TZID=America/New_York:20220721T100000
DTSTAMP:20260417T151446
CREATED:20240214T111802Z
LAST-MODIFIED:20240301T092042Z
UID:10002694-1658394000-1658397600@cmsa.fas.harvard.edu
SUMMARY:Infants’ sensory-motor cortices undergo microstructural tissue growth coupled with myelination
DESCRIPTION:Abstract: The establishment of neural circuitry during early infancy is critical for developing visual\, auditory\, and motor functions. However\, how cortical tissue develops postnatally is largely unknown. By combining T1 relaxation time from quantitative MRI and mean diffusivity (MD) from diffusion MRI\, we tracked cortical tissue development in infants across three timepoints (newborn\, 3 months\, and 6 months). Lower T1 and MD indicate higher microstructural tissue density and more developed cortex. Our data reveal three main findings: First\, primary sensory-motor areas (V1: visual\, A1: auditory\, S1: somatosensory\, M1: motor) have lower T1 and MD at birth than higher-level cortical areas. However\, all primary areas show significant reductions in T1 and MD in the first six months of life\, illustrating profound tissue growth after birth. Second\, significant reductions in T1 and MD from newborns to 6-month-olds occur in all visual areas of the ventral and dorsal visual streams. Strikingly\, this development was heterogenous across the visual hierarchies: Earlier areas are more developed with denser tissue at birth than higher-order areas\, but higher-order areas had faster rates of development. Finally\, analysis of transcriptomic gene data that compares gene expression in postnatal vs. prenatal tissue samples showed strong postnatal expression of genes associated with myelination\, synaptic signaling\, and dendritic processes. Our results indicate that these cellular processes may contribute to profound postnatal tissue growth in sensory cortices observed in our in-vivo measurements. We propose a novel principle of postnatal maturation of sensory systems: development of cortical tissue proceeds in a hierarchical manner\, enabling the lower-level areas to develop first to provide scaffolding for higher-order areas\, which begin to develop more rapidly following birth to perform complex computations for vision and audition. \nThis work is published here: https://www.nature.com/articles/s42003-021-02706-w
URL:https://cmsa.fas.harvard.edu/event/7-21-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220714T090000
DTEND;TZID=America/New_York:20220714T100000
DTSTAMP:20260417T151446
CREATED:20240214T091545Z
LAST-MODIFIED:20240301T101549Z
UID:10002614-1657789200-1657792800@cmsa.fas.harvard.edu
SUMMARY:Topological and geometrical aspects of spinors in insulating crystals
DESCRIPTION:Abstract:  Introducing internal degrees of freedom in the description of crystalline insulators has led to a myriad of theoretical and experimental advances. Of particular interest are the effects of periodic perturbations\, either in time or space\, as they considerably enrich the variety of electronic responses. Here\, we present a semiclassical approach to transport and accumulation of general spinor degrees of freedom in adiabatically driven\, weakly inhomogeneous crystals of dimensions one\, two and three under external electromagnetic fields. Our approach shows that spatio-temporal modulations of the system induce a spinor current and density that is related to geometrical and topological objects — the spinor-Chern fluxes and numbers — defined over the higher-dimensional phase-space of the system\, i.e.\, its combined momentum-position-time coordinates. \nThe results are available here: https://arxiv.org/abs/2203.14902 \nBio: Ioannis Petrides is a postdoctoral fellow at the School of Engineering and Applied Sciences at Harvard University. He received his Ph.D. from the Institute for Theoretical Physics at ETH Zurich. His research focuses on the topological and geometrical aspects of condensed matter systems.
URL:https://cmsa.fas.harvard.edu/event/7-14-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-07.14.22-1583x2048-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220707T090000
DTEND;TZID=America/New_York:20220707T100000
DTSTAMP:20260417T151446
CREATED:20240215T094540Z
LAST-MODIFIED:20240229T085211Z
UID:10002727-1657184400-1657188000@cmsa.fas.harvard.edu
SUMMARY:The phenotype of the last universal common ancestor and the evolution of complexity
DESCRIPTION:Interdisciplinary Science Seminar\n\n\n\n\n\nSpeaker: Fouad El Baidouri\, Broad Institute \nTitle: The phenotype of the last universal common ancestor and the evolution of complexity \nAbstract: A fundamental concept in evolutionary theory is the last universal common ancestor (LUCA) from which all living organisms originated. While some authors have suggested a relatively complex LUCA it is still widely assumed that LUCA must have been a very simple cell and that life has subsequently increased in complexity through time. However\, while current thought does tend towards a general increase in complexity through time in Eukaryotes\, there is increasing evidence that bacteria and archaea have undergone considerable genome reduction during their evolution. This raises the surprising possibility that LUCA\, as the ancestor of bacteria and archaea may have been a considerably complex cell. While hypotheses regarding the phenotype of LUCA do exist\, all are founded on gene presence/absence. Yet\, despite recent attempts to link genes and phenotypic traits in prokaryotes\, it is still inherently difficult to predict phenotype based on the presence or absence of genes alone. In response to this\, we used Bayesian phylogenetic comparative methods to predict ancestral traits. Testing for robustness to horizontal gene transfer (HGT) we inferred the phenotypic traits of LUCA using two robust published phylogenetic trees and a dataset of 3\,128 bacterial and archaeal species. \nOur results depict LUCA as a far more complex cell than has previously been proposed\, challenging the evolutionary model of increased complexity through time in prokaryotes. Given current estimates for the emergence of LUCA we suggest that early life very rapidly evolved cellular complexity.
URL:https://cmsa.fas.harvard.edu/event/iss_7722/
CATEGORIES:Interdisciplinary Science Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220630T162300
DTEND;TZID=America/New_York:20220630T172300
DTSTAMP:20260417T151446
CREATED:20240214T091304Z
LAST-MODIFIED:20240301T101730Z
UID:10002613-1656606180-1656609780@cmsa.fas.harvard.edu
SUMMARY:Entanglement and its key role in quantum information
DESCRIPTION:Abstract: Entanglement is a type of correlation found in composite quantum systems\, connected with various non-classical phenomena. Currently\, entanglement plays a key role in quantum information applications such as quantum computing\, quantum communication\, and quantum sensing. In this talk the concept of entanglement will be introduced along with various methods that have been proposed to detect and quantify it. The fundamental role of entanglement in both quantum theory and quantum technology will also be discussed. \nBio: Spyros Tserkis is a postdoctoral researcher at Harvard University\, working on quantum information theory. Before joining Harvard in Fall 2021\, he was a postdoctoral researcher at MIT and the Australian National University. He received his PhD from the University of Queensland.
URL:https://cmsa.fas.harvard.edu/event/6-30-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-06.30.22-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220623T090000
DTEND;TZID=America/New_York:20220623T100000
DTSTAMP:20260417T151446
CREATED:20240214T091046Z
LAST-MODIFIED:20240301T101920Z
UID:10002611-1655974800-1655978400@cmsa.fas.harvard.edu
SUMMARY:Some new algorithms in statistical genomics
DESCRIPTION:Abstract: The statistical analysis of genomic data has incubated many innovations for computational method development. This talk will discuss some simple algorithms that may be useful in analyzing such data. Examples include algorithms for efficient resampling-based hypothesis testing\, minimizing the sum of truncated convex functions\, and fitting equality-constrained lasso problems. These algorithms have the potential to be used in other applications beyond statistical genomics. \nBio: Hui Jiang is an Associate Professor in the Department of Biostatistics at the University of Michigan. He received his Ph.D. in Computational and Mathematical Engineering from Stanford University. Before joining the University of Michigan\, he was a postdoc in the Department of Statistics and Stanford Genome Technology Center at Stanford University. He is interested in developing statistical and computational methods for analyzing large-scale biological data generated using modern high-throughput technologies.
URL:https://cmsa.fas.harvard.edu/event/6-23-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-06.23.2022-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220616T090000
DTEND;TZID=America/New_York:20220616T100000
DTSTAMP:20260417T151446
CREATED:20240215T094047Z
LAST-MODIFIED:20240229T084329Z
UID:10002724-1655370000-1655373600@cmsa.fas.harvard.edu
SUMMARY:Surface hopping algorithms for non-adiabatic quantum systems
DESCRIPTION:Interdisciplinary Science Seminar\n\n\n\n\nSpeaker: Jianfeng Lu\, Duke UniversityTitle: Surface hopping algorithms for non-adiabatic quantum systems \nAbstract: Surface hopping algorithm is widely used in chemistry for mixed quantum-classical dynamics. In this talk\, we will discuss some of our recent works in mathematical understanding and algorithm development for surface hopping methods. These methods are based on stochastic approximations of semiclassical path-integral representation to the solution of multi-level Schrodinger equations; such methodology also extends to other high-dimensional transport systems.
URL:https://cmsa.fas.harvard.edu/event/iss_61622/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Interdisciplinary Science Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220602T161300
DTEND;TZID=America/New_York:20220602T171300
DTSTAMP:20260417T151446
CREATED:20240214T090758Z
LAST-MODIFIED:20240301T102323Z
UID:10002608-1654186380-1654189980@cmsa.fas.harvard.edu
SUMMARY:Fast Point Transformer
DESCRIPTION:Abstract: The recent success of neural networks enables a better interpretation of 3D point clouds\, but processing a large-scale 3D scene remains a challenging problem. Most current approaches divide a large-scale scene into small regions and combine the local predictions together. However\, this scheme inevitably involves additional stages for pre- and post-processing and may also degrade the final output due to predictions in a local perspective. This talk introduces Fast Point Transformer that consists of a new lightweight self-attention layer. Our approach encodes continuous 3D coordinates\, and the voxel hashing-based architecture boosts computational efficiency. The proposed method is demonstrated with 3D semantic segmentation and 3D detection. The accuracy of our approach is competitive to the best voxel-based method\, and our network achieves 129 times faster inference time than the state-of-the-art\, Point Transformer\, with a reasonable accuracy trade-off in 3D semantic segmentation on S3DIS dataset. \nBio: Jaesik Park is an Assistant Professor at POSTECH. He received his Bachelor’s degree from Hanyang University in 2009\, and he received his Master’s degree and Ph.D. degree from KAIST in 2011 and 2015\, respectively. Before joining POSTECH\, He worked at Intel as a research scientist\, where he co-created the Open3D library. His research interests include image synthesis\, scene understanding\, and 3D reconstruction. He serves as a program committee at prestigious computer vision conferences\, such as Area Chair for ICCV\, CVPR\, and ECCV.
URL:https://cmsa.fas.harvard.edu/event/6-2-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-06.02.2022-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220526T090000
DTEND;TZID=America/New_York:20220526T100000
DTSTAMP:20260417T151446
CREATED:20240214T085539Z
LAST-MODIFIED:20240301T102538Z
UID:10002601-1653555600-1653559200@cmsa.fas.harvard.edu
SUMMARY:Extinction and coexistence for reaction-diffusion systems on metric graphs
DESCRIPTION:Abstract: In spatial population genetics\, it is important to understand the probability of extinction in multi-species interactions such as growing bacterial colonies\, cancer tumor evolution and human migration. This is because extinction probabilities are instrumental in determining the probability of coexistence and the genealogies of populations. A key challenge is the complication due to spatial effect and different sources of stochasticity. In this talk\, I will discuss about methods to compute the probability of extinction and other long-time behaviors for stochastic reaction-diffusion equations on metric graphs that flexibly parametrizes the underlying space. Based on recent joint work with Adrian Gonzalez-Casanova and Yifan (Johnny) Yang.
URL:https://cmsa.fas.harvard.edu/event/5-26-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-05.26.2022-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220519T090000
DTEND;TZID=America/New_York:20220519T100000
DTSTAMP:20260417T151446
CREATED:20240214T084730Z
LAST-MODIFIED:20240301T102658Z
UID:10002598-1652950800-1652954400@cmsa.fas.harvard.edu
SUMMARY:The geometry of conditional independence models with hidden variables
DESCRIPTION:Abstract: Conditional independence (CI) is an important tool instatistical modeling\, as\, for example\, it gives a statistical interpretation to graphical models. In general\, given a list of dependencies among random variables\, it is difficult to say which constraints are implied by them. Moreover\, it is important to know what constraints on the random variables are caused by hidden variables. On the other hand\, such constraints are corresponding to some determinantal conditions on the tensor of joint probabilities of the observed random variables. Hence\, the inference question in statistics relates to understanding the algebraic and geometric properties of determinantal varieties such as their irreducible decompositions or determining their defining equations. I will explain some recent progress that arises by uncovering the link to point configurations in matroid theory and incidence geometry. This connection\, in particular\, leads to effective computational approaches for (1) giving a decomposition for each CI variety; (2) identifying each component in the decomposition as a matroid variety; (3) determining whether the variety has a real point or equivalently there is a statistical model satisfying a given collection of dependencies. The talk is based on joint works with Oliver Clarke\, Kevin Grace\, and Harshit Motwani. \nThe papers are available on arxiv: https://arxiv.org/pdf/2011.02450\nand https://arxiv.org/pdf/2103.16550.pdf
URL:https://cmsa.fas.harvard.edu/event/5-19-2022-cmsa-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-05.19.22-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220512T153800
DTEND;TZID=America/New_York:20220512T173800
DTSTAMP:20260417T151446
CREATED:20240214T084325Z
LAST-MODIFIED:20240301T102818Z
UID:10002594-1652369880-1652377080@cmsa.fas.harvard.edu
SUMMARY:Geometric Models for Sets of Probability Measures
DESCRIPTION:Abstract: Many statistical and computational tasks boil down to comparing probability measures expressed as density functions\, clouds of data points\, or generative models.  In this setting\, we often are unable to match individual data points but rather need to deduce relationships between entire weighted and unweighted point sets. In this talk\, I will summarize our team’s recent efforts to apply geometric techniques to problems in this space\, using tools from optimal transport and spectral geometry. Motivated by applications in dataset comparison\, time series analysis\, and robust learning\, our work reveals how to apply geometric reasoning to data expressed as probability measures without sacrificing computational efficiency.
URL:https://cmsa.fas.harvard.edu/event/5-12-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-05.12.22-1583x2048-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220505T153600
DTEND;TZID=America/New_York:20220505T173600
DTSTAMP:20260417T151446
CREATED:20240214T084023Z
LAST-MODIFIED:20240301T102954Z
UID:10002592-1651764960-1651772160@cmsa.fas.harvard.edu
SUMMARY:Qianfang: a type-safe and data-driven healthcare system starting from Traditional Chinese Medicine
DESCRIPTION:Abstract: Although everyone talks about AI + healthcare\, many people were unaware of the fact that there are two possible outcomes of the collaboration\, due to the inherent dissimilarity between the two giant subjects. The first possibility is healthcare-leads\, and AI is for building new tools to make steps in healthcare easier\, better\, more effective or more accurate. The other possibility is AI-leads\, and therefore the protocols of healthcare can be redesigned or redefined to make sure that the whole infrastructure and pipelines are ideal for running AI algorithms. \nOur system Qianfang belongs to the second category. We have designed a new kind of clinic for the doctors and patients\, so that it will be able to collect high quality data for AI algorithms. Interestingly\, the clinic is based on Traditional Chinese Medicine (TCM) instead of modern medicine\, because we believe that TCM is more suitable for AI algorithms as the starting point. \nIn this talk\, I will elaborate on how we convert TCM knowledge into a modern type-safe large-scale system\, the mini-language that we have designed for the doctors and patients\, the interpretability of AI decisions\, and our feedback loop for collecting data. \nOur project is still on-going\, not finished yet.Bio: Yang Yuan is now an assistant professor at IIIS\, Tsinghua. He finished his undergraduate study at Peking University in 2012. Afterwards\, he received his PhD at Cornell University in 2018\, advised by Professor Robert Kleinberg. During his PhD\, he was a visiting student at MIT/Microsoft New England (2014-2015) and Princeton University (2016 Fall). Before joining Tsinghua\, he spent one year at MIT Institute for Foundations of Data Science (MIFODS) as a postdoc researcher. He now works on AI+Healthcare\, AI Interpretability and AI system.
URL:https://cmsa.fas.harvard.edu/event/5-5-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-05.05.2022-1583x2048-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220428T153300
DTEND;TZID=America/New_York:20220428T173300
DTSTAMP:20260417T151446
CREATED:20240214T112923Z
LAST-MODIFIED:20240301T103000Z
UID:10002698-1651159980-1651167180@cmsa.fas.harvard.edu
SUMMARY:Intersection number and systole on hyperbolic surfaces
DESCRIPTION:Abstract: Let X be a compact hyperbolic surface. We can see that there is a constant C(X) such that the intersection number of the closed geodesics is  \leq C(X) times the product of their lengths. Consider the optimum constant C(X). In this talk\, we describe its asymptotic behavior in terms of systole\,  length of the shortest closed geodesic on X.
URL:https://cmsa.fas.harvard.edu/event/4-28-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-04.28.22-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220421T090000
DTEND;TZID=America/New_York:20220421T100000
DTSTAMP:20260417T151446
CREATED:20240214T113250Z
LAST-MODIFIED:20240301T103156Z
UID:10002700-1650531600-1650535200@cmsa.fas.harvard.edu
SUMMARY:Secure Multi-Party Computation: from Theory to Practice
DESCRIPTION:Abstract:\nEncryption is the backbone of cybersecurity. While encryption can secure data both in transit and at rest\, in the new era of ubiquitous computing\, modern cryptography also aims to protect data during computation. Secure multi-party computation (MPC) is a powerful technology to tackle this problem\, which enables distrustful parties to jointly perform computation over their private data without revealing their data to each other. Although it is theoretically feasible and provably secure\, the adoption of MPC in real industry is still very much limited as of today\, the biggest obstacle of which boils down to its efficiency. \nMy research goal is to bridge the gap between the theoretical feasibility and practical efficiency of MPC. Towards this goal\, my research spans both theoretical and applied cryptography. In theory\, I develop new techniques for achieving general MPC with the optimal complexity\, bringing theory closer to practice. In practice\, I design tailored MPC to achieve the best concrete efficiency for specific real-world applications. In this talk\, I will discuss the challenges in both directions and how to overcome these challenges using cryptographic approaches. I will also show strong connections between theory and practice. \nBiography:\nPeihan Miao is an assistant professor of computer science at the University of Illinois Chicago (UIC). Before coming to UIC\, she received her Ph.D. from the University of California\, Berkeley in 2019 and had brief stints at Google\, Facebook\, Microsoft Research\, and Visa Research. Her research interests lie broadly in cryptography\, theory\, and security\, with a focus on secure multi-party computation — especially in incorporating her industry experiences into academic research.
URL:https://cmsa.fas.harvard.edu/event/4-21-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-04.21.22-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220414T090000
DTEND;TZID=America/New_York:20220414T100000
DTSTAMP:20260417T151446
CREATED:20240214T113429Z
LAST-MODIFIED:20240301T103314Z
UID:10002701-1649926800-1649930400@cmsa.fas.harvard.edu
SUMMARY:SIMPLEs: a single-cell RNA sequencing imputation strategy preserving gene modules and cell clusters variation
DESCRIPTION:Abstract: A main challenge in analyzing single-cell RNA sequencing (scRNA-seq) data is to reduce technical variations yet retain cell heterogeneity. Due to low mRNAs content per cell and molecule losses during the experiment (called ‘dropout’)\, the gene expression matrix has a substantial amount of zero read counts. Existing imputation methods treat either each cell or each gene as independently and identically distributed\, which oversimplifies the gene correlation and cell type structure. We propose a statistical model-based approach\, called SIMPLEs (SIngle-cell RNA-seq iMPutation and celL clustErings)\, which iteratively identifies correlated gene modules and cell clusters and imputes dropouts customized for individual gene module and cell type. Simultaneously\, it quantifies the uncertainty of imputation and cell clustering via multiple imputations. In simulations\, SIMPLEs performed significantly better than prevailing scRNA-seq imputation methods according to various metrics. By applying SIMPLEs to several real datasets\, we discovered gene modules that can further classify subtypes of cells. Our imputations successfully recovered the expression trends of marker genes in stem cell differentiation and can discover putative pathways regulating biological processes.
URL:https://cmsa.fas.harvard.edu/event/4-14-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-04.14.22-1583x2048-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220407T152200
DTEND;TZID=America/New_York:20220407T172200
DTSTAMP:20260417T151446
CREATED:20240214T113556Z
LAST-MODIFIED:20240301T103440Z
UID:10002702-1649344920-1649352120@cmsa.fas.harvard.edu
SUMMARY:The space of vector bundles on spheres: algebra\, geometry\, topology
DESCRIPTION:Abstract: Bott periodicity relates vector bundles on a topological space X to vector bundles on X “times a sphere”.   I’m not a topologist\, so I will try to explain an algebraic or geometric incarnation\, in terms of vector bundles on the Riemann sphere.   I will attempt to make the talk introductory\, and (for the most part) accessible to those in all fields\, at the expense of speaking informally and not getting far.   This relates to recent work of Hannah Larson\, as well as joint work with (separately) Larson and Jim Bryan.
URL:https://cmsa.fas.harvard.edu/event/4-7-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-04.07.2022-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220331T152000
DTEND;TZID=America/New_York:20220331T172000
DTSTAMP:20260417T151446
CREATED:20240214T113726Z
LAST-MODIFIED:20240301T103621Z
UID:10002704-1648740000-1648747200@cmsa.fas.harvard.edu
SUMMARY:Compactification of an embedded vector space and its combinatorics
DESCRIPTION:Abstract: Matroids are combinatorial abstractions of vector spaces embedded in a coordinate space.  Many fundamental questions have been open for these classical objects.  We highlight some recent progress that arise from the interaction between matroid theory and algebraic geometry.  Key objects involve compactifications of embedded vector spaces\, and an exceptional Hirzebruch-Riemann-Roch isomorphism between the K-ring of vector bundles and the cohomology ring of stellahedral varieties.
URL:https://cmsa.fas.harvard.edu/event/3-31-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-03.231.2022-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220324T151700
DTEND;TZID=America/New_York:20220324T171700
DTSTAMP:20260417T151446
CREATED:20240215T091039Z
LAST-MODIFIED:20240301T104333Z
UID:10002708-1648135020-1648142220@cmsa.fas.harvard.edu
SUMMARY:An operadic structure on supermoduli spaces
DESCRIPTION:Abstract: The operadic structure on the moduli spaces of algebraic curves  encodes in a combinatorial way how nodal curves in the boundary can be obtained by glueing smooth curves along marked points. In this talk\, I will present a generalization of the operadic structure to moduli spaces of SUSY curves (or super Riemann surfaces). This requires colored graphs and generalized operads in the sense of Borisov-Manin. Based joint work with Yu. I. Manin and Y. Wu. https://arxiv.org/abs/2202.10321
URL:https://cmsa.fas.harvard.edu/event/3-24-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-03.24.2022-1583x2048-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220317T151500
DTEND;TZID=America/New_York:20220317T161500
DTSTAMP:20260417T151446
CREATED:20240215T091301Z
LAST-MODIFIED:20240301T104445Z
UID:10002709-1647530100-1647533700@cmsa.fas.harvard.edu
SUMMARY:On optimization and generalization in deep learning
DESCRIPTION:Abstract: Deep neural networks have achieved significant empirical success in many fields\, including the fields of computer vision and natural language processing. Along with its empirical success\, deep learning has been theoretically shown to be attractive in terms of its expressive power. However\, the theory of expressive power does not ensure that we can efficiently find an optimal solution in terms of optimization and generalization\, during the optimization process. In this talk\, I will discuss some mathematical properties of optimization and generalization for deep neural networks.
URL:https://cmsa.fas.harvard.edu/event/3-17-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-03.17.2022-1583x2048-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220310T151300
DTEND;TZID=America/New_York:20220310T161300
DTSTAMP:20260417T151446
CREATED:20240215T091511Z
LAST-MODIFIED:20240301T104543Z
UID:10002710-1646925180-1646928780@cmsa.fas.harvard.edu
SUMMARY:Virtual Teams in Gig Economy — An End-to-End Data Science Approach
DESCRIPTION:Abstract: The gig economy provides workers with the benefits of autonomy and flexibility\, but it does so at the expense of work identity and co-worker bonds. Among the many reasons why gig workers leave their platforms\, an unexplored aspect is the organization identity. In a series of studies\, we develop a team formation and inter-team contest at a ride-sharing platform. We employ an end-to-end data science approach\, combining methodologies from randomized field experiments\, recommender systems\, and counterfactual machine learning. Together\, our results show that platform designers can leverage team identity and team contests to increase revenue and worker engagement in a gig economy. \nBio: Wei Ai is an Assistant Professor in the College of Information Studies (iSchool) and the Institute for Advanced Computer Studies (UMIACS) at the University of Maryland. His research interest lies in data science for social good\, where the advances of machine learning and data analysis algorithms translate into measurable impacts on society. He combines machine learning\, causal inference\, and field experiments in his research\, and has rich experience in collaborating with industrial partners. He earned his Ph.D. from the School of Information at the University of Michigan. His research has been published in top journals and conferences\, including PNAS\, ACM TOIS\, WWW\, and ICWSM.
URL:https://cmsa.fas.harvard.edu/event/3-10-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-03.10.2022-1583x2048-1-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220303T151100
DTEND;TZID=America/New_York:20220303T161100
DTSTAMP:20260417T151446
CREATED:20240215T091737Z
LAST-MODIFIED:20240301T104734Z
UID:10002711-1646320260-1646323860@cmsa.fas.harvard.edu
SUMMARY:Towards Understanding Training Dynamics for Mildly Overparametrized Models
DESCRIPTION:Abstract: While over-parameterization is widely believed to be crucial for the success of optimization for the neural networks\, most existing theories on over-parameterization do not fully explain the reason — they either work in the Neural Tangent Kernel regime where neurons don’t move much\, or require an enormous number of neurons. In this talk I will describe our recent works towards understanding training dynamics that go beyond kernel regimes with only polynomially many neurons (mildly overparametrized). In particular\, we first give a local convergence result for mildly overparametrized two-layer networks. We then analyze the global training dynamics for a related overparametrized tensor model. For both works\, we rely on a key intuition that neurons in overparametrized models work in groups and it’s important to understand the behavior of an average neuron in the group. Based on two works: https://arxiv.org/abs/2102.02410 and https://arxiv.org/abs/2106.06573. \nBio: Professor Rong Ge is Associate Professor of Computer Science at Duke University. He received his Ph.D. from the Computer Science Department of Princeton University\, supervised by Sanjeev Arora. He was a post-doc at Microsoft Research\, New England. In 2019\, he received both a Faculty Early Career Development Award from the National Science Foundation and the prestigious Sloan Research Fellowship. His research interest focus on theoretical computer science and machine learning. Modern machine learning algorithms such as deep learning try to automatically learn useful hidden representations of the data. He is interested in formalizing hidden structures in the data and designing efficient algorithms to find them. His research aims to answer these questions by studying problems that arise in analyzing text\, images\, and other forms of data\, using techniques such as non-convex optimization and tensor decompositions.
URL:https://cmsa.fas.harvard.edu/event/3-3-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-03.03.2022-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220224T150800
DTEND;TZID=America/New_York:20220224T160800
DTSTAMP:20260417T151446
CREATED:20240215T091941Z
LAST-MODIFIED:20240301T104857Z
UID:10002713-1645715280-1645718880@cmsa.fas.harvard.edu
SUMMARY:Singular Set in Obstacle Problems
DESCRIPTION:Abstract: In this talk we describe a new method to study the singular set in the obstacle problem. This method does not depend on monotonicity formulae and works for fully nonlinear elliptic operators. The result we get matches the best-known result for the case of Laplacian.
URL:https://cmsa.fas.harvard.edu/event/2-24-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-2.24.2022-1583x2048-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220217T150500
DTEND;TZID=America/New_York:20220217T160500
DTSTAMP:20260417T151446
CREATED:20240215T092142Z
LAST-MODIFIED:20240301T105602Z
UID:10002714-1645110300-1645113900@cmsa.fas.harvard.edu
SUMMARY:Sparse Markov Models for High-dimensional Inference
DESCRIPTION:Abstract: Finite order Markov models are theoretically well-studied models for dependent data.  Despite their generality\, application in empirical work when the order is larger than one is quite rare.  Practitioners avoid using higher order Markov models because (1) the number of parameters grow exponentially with the order\, (2) the interpretation is often difficult. Mixture of transition distribution models (MTD)  were introduced to overcome both limitations. MTD represent higher order Markov models as a convex mixture of single step Markov chains\, reducing the number of parameters and increasing the interpretability. Nevertheless\, in practice\, estimation of MTD models with large orders are still limited because of curse of dimensionality and high algorithm complexity. Here\, we prove that if only few lags are relevant we can consistently and efficiently recover the lags and estimate the transition probabilities of high order MTD models. Furthermore\, we show that using the selected lags we can construct non-asymptotic confidence intervals for the transition probabilities of the model. The key innovation is a recursive procedure for the selection of the relevant lags of the model.  Our results are  based on (1) a new structural result of the MTD and (2) an improved martingale concentration inequality. Our theoretical results are illustrated through simulations.
URL:https://cmsa.fas.harvard.edu/event/2-17-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-2.17.2022-1-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220210T150000
DTEND;TZID=America/New_York:20220210T160000
DTSTAMP:20260417T151446
CREATED:20240215T092349Z
LAST-MODIFIED:20240301T105720Z
UID:10002716-1644505200-1644508800@cmsa.fas.harvard.edu
SUMMARY:2/10/2022 – Interdisciplinary Science Seminar
DESCRIPTION:Title: Metric Algebraic Geometry \nAbstract: A real algebraic variety is the set of points in real Euclidean space that satisfy a system of polynomial equations. Metric algebraic geometry is the study of properties of real algebraic varieties that depend on a distance metric. In this talk\, we introduce metric algebraic geometry through a discussion of Voronoi cells\, bottlenecks\, and the reach of an algebraic variety. We also show applications to the computational study of the geometry of data with nonlinear models.
URL:https://cmsa.fas.harvard.edu/event/2-10-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-2.10.2022-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220203T145700
DTEND;TZID=America/New_York:20220203T165700
DTSTAMP:20260417T151446
CREATED:20240215T092602Z
LAST-MODIFIED:20240301T105825Z
UID:10002717-1643900220-1643907420@cmsa.fas.harvard.edu
SUMMARY:2/3/2022 – Interdisciplinary Science Seminar
DESCRIPTION:Title:Quasiperiodic prints from triply periodic blocks \nAbstract: Slice a triply periodic wooden sculpture along an irrational plane. If you ink the cut surface and press it against a page\, the pattern you print will be quasiperiodic. Patterns like these help physicists see how metals conduct electricity in strong magnetic fields. I’ll show you some block prints that imitate the printing process described above\, and I’ll point out the visual features that reveal conductivity properties. \nInteractive slides:https://www.ihes.fr/~fenyes/seeing/slices/
URL:https://cmsa.fas.harvard.edu/event/2-3-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-2.03.2022-1583x2048-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220127T145400
DTEND;TZID=America/New_York:20220127T165400
DTSTAMP:20260417T151446
CREATED:20240215T092855Z
LAST-MODIFIED:20240215T092855Z
UID:10002718-1643295240-1643302440@cmsa.fas.harvard.edu
SUMMARY:1/27/2022 – Interdisciplinary Science Seminar
DESCRIPTION:Title: Polynomials vanishing at lattice points in convex sets \nAbstract: Let P be a convex subset of R^2. For large d\, what is the smallest degree r_d of a polynomial vanishing at all lattice points in the dilate d*P? We show that r_d / d converges to some positive number\, which we compute for many (but maybe not all) triangles P.
URL:https://cmsa.fas.harvard.edu/event/1-27-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-1.27.2022-1583x2048-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220120T145200
DTEND;TZID=America/New_York:20220120T165200
DTSTAMP:20260417T151446
CREATED:20240215T093039Z
LAST-MODIFIED:20240215T093039Z
UID:10002719-1642690320-1642697520@cmsa.fas.harvard.edu
SUMMARY:1/20/2022 – Interdisciplinary Science Seminar
DESCRIPTION:Title: Markov chains\, optimal control\, and reinforcement learning \nAbstract: Markov decision processes are a model for several artificial intelligence problems\, such as games (chess\, Go…) or robotics. At each timestep\, an agent has to choose an action\, then receives a reward\, and then the agent’s environment changes (deterministically or stochastically) in response to the agent’s action. The agent’s goal is to adjust its actions to maximize its total reward. In principle\, the optimal behavior can be obtained by dynamic programming or optimal control techniques\, although practice is another story. \nHere we consider a more complex problem: learn all optimal behaviors for all possible reward functions in a given environment. Ideally\, such a “controllable agent” could be given a description of a task (reward function\, such as “you get +10 for reaching here but -1 for going through there”) and immediately perform the optimal behavior for that task. This requires a good understanding of the mapping from a reward function to the associated optimal behavior. \nWe prove that there exists a particular “map” of a Markov decision process\, on which near-optimal behaviors for all reward functions can be read directly by an algebraic formula. Moreover\, this “map” is learnable by standard deep learning techniques from random interactions with the environment. We will present our recent theoretical and empirical results in this direction.
URL:https://cmsa.fas.harvard.edu/event/1-20-2022-interdisciplinary-science-seminar/
CATEGORIES:Interdisciplinary Science Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Interdisciplinary-Science-Seminar-01.20.22-1577x2048-1.png
END:VEVENT
END:VCALENDAR