CMS Upcoming SeminarsCMS Upcoming Seminar Feed
http://www.cms.caltech.edu/seminars.rss
enCMI Faculty Lunch (invitation only): John Doyle: Universal laws and architectures in complex networked systems with applications to sensorimotor controlltaddeo@caltech.edu (Linda Taddeo)CMI Faculty Lunch (invitation only): John Doyle<strong>Speaker(s):</strong> John Doyle (Caltech)<br><strong>Location:</strong> Annenberg 121<br><p>Attendance by invitation only.</p>Thu, 14 Nov 2019 16:00:00 -0800http://www.cms.caltech.edu/events/87184Finance Seminar: Conflicting Priorities: A Theory of Covenants and Collateralsabrina@hss.caltech.edu (Sabrina Hameister)Finance Seminar<strong>Speaker(s):</strong> Giorgia Piacentino (Columbia University)<br><strong>Location:</strong> Baxter B125<br><p>Abstract: Debt secured by collateral is repaid ahead of unsecured debt, even if taken in violation of covenants. We develop a model in which this priority leads to conflicts among debt contracts, but can be optimal nonetheless. Whereas creditors’ option to accelerate following covenant violations can deter dilution by new secured debt, preventing overinvestment, their option to waive covenants allows some dilution, preventing underinvestment. The optimal debt structure trades off over- and under-investment, blocking “bad” but not “good” dilution. It is multi-layered, including secured and unsecured debt with and without covenants. Our results are consistent with several debt structure regularities.</p><p>Written with Jason Roderick Donaldson and Denis Gromb.</p><p><i>Finance Seminars at Caltech are funded through the generous support of The Ronald and Maxine Linde Institute of Economic and Management Sciences (lindeinstitute.caltech.edu).</i></p>Thu, 14 Nov 2019 16:00:00 -0800http://www.cms.caltech.edu/events/86161Social and Information Sciences Laboratory (SISL) Seminar: Transparency and Demand Management in Platforms for Networked Marketsmmartin@caltech.edu (Mary Martin)Social and Information Sciences Laboratory (SISL) Seminar<strong>Speaker(s):</strong> Adam Wierman (Caltech)<br><strong>Location:</strong> Baxter 125<br><p>Abstract: Platforms have emerged as a powerful economic force, driving both traditional markets, like the electricity market, and emerging markets, like the sharing economy. The power of platforms comes from their ability to tame the complexities of networked marketplaces -- marketplaces where there is not a single centralized market, but instead a network of interconnected markets loosely defined by a graph of feasible exchanges. Despite the power and prominence of platforms, the workings of platforms are often guarded secrets. In this talk, I will overview recent work from our group that focuses on understanding the consequences of control, transparency, and demand management in modern platforms. I will use electricity markets and ridesharing services as motivating examples throughout. </p>Fri, 15 Nov 2019 12:00:00 -0800http://www.cms.caltech.edu/events/86869IQIM Postdoctoral and Graduate Student Seminar: Quantum Supremacy: Understanding and Calibrating the Sycamore Processormarciab@caltech.edu (Marcia Brown)IQIM Postdoctoral and Graduate Student Seminar<strong>Speaker(s):</strong> Kevin Satzinger (Google AI Quantum)<br><strong>Location:</strong> Annenberg 105<br><p><b>Abstract:</b> The recent experimental demonstration of quantum supremacy heralds the era of noisy intermediate-scale quantum (NISQ) technologies. In this experiment, we use a processor with 53 programmable superconducting qubits, Sycamore, creating quantum states in a space of dimension 253. Sycamore is built with a new 2D architecture where each qubit is coupled to up to four neighbors in a square array, with tunable coupling to each neighbor. This allows us to perform operations simultaneously across the device while maintaining high fidelity. A key challenge in operating a NISQ processor is automated calibration to optimize operations such as quantum gates and readout. In this presentation, we share an overview of the hardware involved, such as electronics, cryogenics, and superconducting circuits, and explain how we calibrate and benchmark the Sycamore processor.</p>Fri, 15 Nov 2019 12:00:00 -0800http://www.cms.caltech.edu/events/87164A Fireside Chat with Dr. Timnit Gebru and Dr. Karina Edmonds (PhD '97): TBDclairer@caltech.edu (Claire Ralph)A Fireside Chat with Dr. Timnit Gebru and Dr. Karina Edmonds (PhD '97)<strong>Speaker(s):</strong> <br><strong>Location:</strong> Annenberg 105<br><p>Due to popular demand Dr. Timnit Gebru, Research Scientist at Google, has agreed to participate in an informal fireside chat prior to giving the CMS-EE Partners Tech Talk. She will be joined by alum Dr. Karina Edmonds (PhD '97), University Lead for Cloud AI at Google. The conversation will be moderated by Claire Ralph, Lecturer in Computing and Mathematical Sciences and aimed at a broad Caltech audience. We expect to touch on current research efforts in ethical AI, broader questions at the intersection of technology and society, and Dr. Gebru's advocacy work through Black in AI. This is an H x S event.</p><p></p><p>Dr. Timnit Gebru is currently a research scientist at Google in the ethical AI team. Prior to that she did a postdoc at Microsoft Research, New York City in the FATE (Fairness Transparency Accountability and Ethics in AI) group, where she studied algorithmic bias and the ethical implications underlying any data mining project (see this New York Times article for an example of my work). She received her PhD from the Stanford Artificial Intelligence Laboratory, studying computer vision under Fei-Fei Li. Her thesis work pertained to data mining large scale publicly available images to gain sociological insight, and working on computer vision problems that arise as a result. The Economist, The New York Times and others have covered part of this work. Some of the computer vision areas she is interested in include fine-grained image recognition, scalable annotation of images, and domain adaptation. Prior to joining Fei-Fei's lab she worked at Apple designing circuits and signal processing algorithms for various Apple products including the first iPad.</p>Mon, 18 Nov 2019 10:30:00 -0800http://www.cms.caltech.edu/events/87165CMS-EE Partners Tech Talk: Ethical AIclairer@caltech.edu (Claire Ralph)CMS-EE Partners Tech Talk<strong>Speaker(s):</strong> Timnit Gebru (Google)<br><strong>Location:</strong> Annenberg 105<br><p></p>Mon, 18 Nov 2019 12:00:00 -0800http://www.cms.caltech.edu/events/86992IST Lunch Bunch: TBA (Diane Goodfellow)IST Lunch Bunch<strong>Speaker(s):</strong> Pietro Perona (CALTECH)<br><strong>Location:</strong> Annenberg 105<br><p>TBA</p>Tue, 19 Nov 2019 12:00:00 -0800http://www.cms.caltech.edu/events/87189IQI Weekly Seminar: Calculating Nature Naturallybjleung@caltech.edu (Bonnie Leung)IQI Weekly Seminar<strong>Speaker(s):</strong> Natalie Klco (University of Washington)<br><strong>Location:</strong> Annenberg 107<br><p><b>Abstract</b>: In current classical calculations of quantum many-body systems, the exponentially-growing framework of modern quantum mechanics dictates that a large portion of the universe is required to calculate properties of an infinitesimal version of itself. This fundamental resource requirement suggests that simulating the complexity of quantum systems with purely classical devices is simply not natural. Field theories have been extolled as an efficient muse of quantum simulation and even the basis of universal quantum computers themselves. It is with this perspective that I will discuss how understanding the structure and dynamics of entanglement can be a window into the scattering of fundamental particles as well as a guide in designing efficient quantum simulations of field theories.</p><p></p><p></p><p></p><p></p><p></p><p></p><p></p>Tue, 19 Nov 2019 15:00:00 -0800http://www.cms.caltech.edu/events/86935CMI Seminar: Eliza O'Reilly: Modeling Repulsion with Determinantal Point Processesltaddeo@caltech.edu (Linda Taddeo)CMI Seminar: Eliza O'Reilly<strong>Speaker(s):</strong> Eliza O'Reilly (Caltech)<br><strong>Location:</strong> Annenberg 314<br><p> </p><p>Determinantal point processes (DPPs) are a useful probabilistic model of point configurations exhibiting repulsion between points. They appear in random matrix theory and have found many applications including in machine learning for selecting diverse subsets. We will discuss the appealing properties of DPPs as well as a procedure for their simulation. I will then present a coupling result characterizing the repulsive effect of a point in a DPP, based on joint work with Jesper Møller.<br></p>Tue, 19 Nov 2019 16:00:00 -0800http://www.cms.caltech.edu/events/87077Special CMX Seminar: How Many Labels Do You Need For Semi-Supervised Learning?jbrink@caltech.edu (Jolene Brink)Special CMX Seminar<strong>Speaker(s):</strong> Matthew Thorpe (Carnegie Mellon University)<br><strong>Location:</strong> Annenberg 213<br><p> Given a data set of which a small subset are labelled, the goal of semi-supervised learning is to find the unknown labels. A popular method is to minimise a discrete p-Dirichlet energy defined on a graph constructed from the data. As the size of the data set increases one hopes that solutions of the discrete problem converge to a continuum variational problem with the continuum p-Dirichlet energy. It follows from Sobolev regularity that one cannot impose constraints if p is less than the dimension of the data hence, in this regime, one must also increase the number of labels in order to avoid labels "dissappearing" in the limit. In this talk I will address the question of what is the minimal number of labels. To compare labelling functions on different domains we use a metric based on optimal transport which then allows for the application of methods from the calculus of variation, in particular Gamma-convergence, and methods from PDE's, such as constructing barrier functions in order to apply the maximum principle. We can further show rates of convergence. This is joint work with Jeff Calder (Minnesota) and Dejan Slepcev (CMU). </p>Tue, 19 Nov 2019 16:30:00 -0800http://www.cms.caltech.edu/events/86677TCS+ Talk: The Karger-Stein Algorithm is Optimal for $k$-cutbjleung@caltech.edu (Bonnie Leung)TCS+ Talk<strong>Speaker(s):</strong> Jason Li (Carnegie Mellon University)<br><strong>Location:</strong> Annenberg 322<br><p><b>Abstract:</b> In the $k$-cut problem, we are given an edge-weighted graph and want to find the least-weight set of edges whose deletion breaks the graph into $k$ connected components. Algorithms due to Karger-Stein and Thorup showed how to find such a minimum $k$-cut in time approximately $O(n^{2k-2})$. The best lower bounds come from conjectures about the solvability of the $k$-clique problem and a reduction from $k$-clique to $k$-cut, and show that solving $k$-cut is likely to require time $\Omega(n^k)$. Our recent results have given special-purpose algorithms that solve the problem in time $n^{1.98k + O(1)}$, and ones that have better performance for special classes of graphs (e.g., for small integer weights).In this work, we resolve the problem for general graphs, by showing that for any fixed $k \geq 2$, the Karger-Stein algorithm outputs any fixed minimum $k$-cut with probability at least $\widehat{O}(n^{-k})$, where $\widehat{O}(\cdot)$ hides a $2^{O(\ln \ln n)^2}$ factor. This also gives an extremal bound of $\widehat{O}(n^k)$ on the number of minimum $k$-cuts in an $n$-vertex graph and an algorithm to compute a minimum $k$-cut in similar runtime. Both are tight up to $\widehat{O}(1)$ factors.The first main ingredient in our result is a fine-grained analysis of how the graph shrinks---and how the average degree evolves---under the Karger-Stein process. The second ingredient is an extremal result bounding the number of cuts of size at most $(2-\delta) OPT/k$, using the Sunflower lemma.</p>Wed, 20 Nov 2019 10:00:00 -0800http://www.cms.caltech.edu/events/86731Social and Information Sciences Laboratory (SISL) Seminar: Equitable Voting Rulesmmartin@caltech.edu (Mary Martin)Social and Information Sciences Laboratory (SISL) Seminar<strong>Speaker(s):</strong> Omer Tamuz (Caltech)<br><strong>Location:</strong> Baxter 125<br><p>Abstract: May’s Theorem (1952), a celebrated result in social choice, provides the foundation for majority rule. May’s crucial assumption of symmetry, often thought of as a procedural equity requirement, is violated by many choice procedures that grant voters identical roles. We show that a modification of May’s symmetry assumption allows for a far richer set of rules that still treat voters equally, but have minimal winning coalitions comprising a vanishing fraction of the population. We conclude that procedural fairness can coexist with the empowerment of a small minority of individuals. Methodologically, we introduce techniques from group theory and illustrate their usefulness for the analysis of social choice questions. <br>Written with Laurent Bartholdi, Wade Hann-Caruthers, Maya Josyula and Leeat Yariv.</p>Fri, 22 Nov 2019 12:00:00 -0800http://www.cms.caltech.edu/events/86941IQI Weekly Seminar: TBAbjleung@caltech.edu (Bonnie Leung)IQI Weekly Seminar<strong>Speaker(s):</strong> Monica Jinwoo Kang (Caltech)<br><strong>Location:</strong> Annenberg 107<br><p><b>Abstract</b>: TBA</p><p></p><p></p><p></p><p></p><p></p><p></p><p></p>Tue, 26 Nov 2019 15:00:00 -0800http://www.cms.caltech.edu/events/87043CMS-EE Partners Tech Talk: TBDclairer@caltech.edu (Claire Ralph)CMS-EE Partners Tech Talk<strong>Speaker(s):</strong> (Facebook)<br><strong>Location:</strong> Annenberg 105<br><p></p>Mon, 02 Dec 2019 12:00:00 -0800http://www.cms.caltech.edu/events/86994TCS+ Talk: TBAbjleung@caltech.edu (Bonnie Leung)TCS+ Talk<strong>Speaker(s):</strong> Nihar Shah (Carnegie Mellon University)<br><strong>Location:</strong> Annenberg 322<br><p><b>Abstract:</b> TBA</p>Wed, 04 Dec 2019 10:00:00 -0800http://www.cms.caltech.edu/events/87089Special CMX Seminar: TBAjbrink@caltech.edu (Jolene Brink)Special CMX Seminar<strong>Speaker(s):</strong> José Antonio Carrillo (Imperial College London)<br><strong>Location:</strong> Annenberg 213<br><p></p>Thu, 05 Dec 2019 16:30:00 -0800http://www.cms.caltech.edu/events/86828Special ACM/CMS Seminar: The Universe in a Computer: How mathematical and numerical methods are essentialdbohler@caltech.edu (Diana Bohler)Special ACM/CMS Seminar<strong>Speaker(s):</strong> Dr. Christian Klingenberg (Würzburg University, Germany)<br><strong>Location:</strong> Annenberg 213<br><p>We will talk about our contribution to a large project with the goal of a self-consistent numerical simulation of the evolution of the universe beginning soon after the Big Bang and ending with the formation of realistic stellar systems like the Milky Way. This is a multi-scale problem of vast proportions. It requires the development of new numerical methods that excel in accuracy, parallel scalability to the processes relevant in galaxy formation. These numerical methods themselves require the development of mathematical theory in order to guarantee the above mentioned requirements. In this talk we shall focus on our contribution to this effort. This is joint work among others with Volker Springel.</p>Mon, 09 Dec 2019 16:00:00 -0800http://www.cms.caltech.edu/events/87155Finance Seminar: Topic to be announcedsabrina@hss.caltech.edu (Sabrina Hameister)Finance Seminar<strong>Speaker(s):</strong> Jessica A. Wachter (University of Pennsylvania)<br><strong>Location:</strong> Baxter B125<br><p>Please check later for additional details</p><p><i>Finance Seminars at Caltech are funded through the generous support of The Ronald and Maxine Linde Institute of Economic and Management Sciences (lindeinstitute.caltech.edu).</i></p>Thu, 12 Dec 2019 16:00:00 -0800http://www.cms.caltech.edu/events/86369Special CMX Seminar: TBAjbrink@caltech.edu (Jolene Brink)Special CMX Seminar<strong>Speaker(s):</strong> Zhenzhen Li (The Hong Kong University of Science and Technology)<br><strong>Location:</strong> Annenberg 213<br><p></p>Thu, 12 Dec 2019 16:30:00 -0800http://www.cms.caltech.edu/events/86829CMS-EE Partners Tech Talk: TBDclairer@caltech.edu (Claire Ralph)CMS-EE Partners Tech Talk<strong>Speaker(s):</strong> <br><strong>Location:</strong> Annenberg 105<br><p></p>Mon, 06 Jan 2020 12:00:00 -0800http://www.cms.caltech.edu/events/86999