DOCSLIB.ORG

Foundations of Data Science∗

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Foundations of Data Science∗ Foundations of Data Science∗ Avrim Blum, John Hopcroft and Ravindran Kannan Thursday 9th June, 2016 ∗Copyright 2015. All rights reserved 1 Contents 1 Introduction 8 2 High-Dimensional Space 11 2.1 Introduction . 11 2.2 The Law of Large Numbers . 11 2.3 The Geometry of High Dimensions . 14 2.4 Properties of the Unit Ball . 15 2.4.1 Volume of the Unit Ball . 15 2.4.2 Most of the Volume is Near the Equator . 17 2.5 Generating Points Uniformly at Random from a Ball . 20 2.6 Gaussians in High Dimension . 21 2.7 Random Projection and Johnson-Lindenstrauss Lemma . 23 2.8 Separating Gaussians . 25 2.9 Fitting a Single Spherical Gaussian to Data . 27 2.10 Bibliographic Notes . 29 2.11 Exercises . 30 3 Best-Fit Subspaces and Singular Value Decomposition (SVD) 38 3.1 Introduction and Overview . 38 3.2 Preliminaries . 39 3.3 Singular Vectors . 41 3.4 Singular Value Decomposition (SVD) . 44 3.5 Best Rank-k Approximations . 45 3.6 Left Singular Vectors . 47 3.7 Power Method for Computing the Singular Value Decomposition . 49 3.7.1 A Faster Method . 50 3.8 Singular Vectors and Eigenvectors . 52 3.9 Applications of Singular Value Decomposition . 52 3.9.1 Centering Data . 52 3.9.2 Principal Component Analysis . 53 3.9.3 Clustering a Mixture of Spherical Gaussians . 54 3.9.4 Ranking Documents and Web Pages . 59 3.9.5 An Application of SVD to a Discrete Optimization Problem . 60 3.10 Bibliographic Notes . 63 3.11 Exercises . 64 4 Random Graphs 71 4.1 The G(n; p)Model ............................... 71 4.1.1 Degree Distribution . 72 4.1.2 Existence of Triangles in G(n; d=n).................. 77 4.2 Phase Transitions . 79 4.3 The Giant Component . 87 2 4.4 Branching Processes . 96 4.5 Cycles and Full Connectivity . 102 4.5.1 Emergence of Cycles . 102 4.5.2 Full Connectivity . 104 4.5.3 Threshold for O(ln n) Diameter . 105 4.6 Phase Transitions for Increasing Properties . 107 4.7 Phase Transitions for CNF-sat . 109 4.8 Nonuniform and Growth Models of Random Graphs . 114 4.8.1 Nonuniform Models . 114 4.8.2 Giant Component in Random Graphs with Given Degree Distribution114 4.9 Growth Models . 116 4.9.1 Growth Model Without Preferential Attachment . 116 4.9.2 Growth Model With Preferential Attachment . 122 4.10 Small World Graphs . 124 4.11 Bibliographic Notes . 129 4.12 Exercises . 130 5 Random Walks and Markov Chains 139 5.1 Stationary Distribution . 143 5.2 Markov Chain Monte Carlo . 145 5.2.1 Metropolis-Hasting Algorithm . 146 5.2.2 Gibbs Sampling . 147 5.3 Areas and Volumes . 150 5.4 Convergence of Random Walks on Undirected Graphs . 151 5.4.1 Using Normalized Conductance to Prove Convergence . 157 5.5 Electrical Networks and Random Walks . 160 5.6 Random Walks on Undirected Graphs with Unit Edge Weights . 164 5.7 Random Walks in Euclidean Space . 171 5.8 The Web as a Markov Chain . 175 5.9 Bibliographic Notes . 179 5.10 Exercises . 180 6 Machine Learning 190 6.1 Introduction . 190 6.2 Overfitting and Uniform Convergence . 192 6.3 Illustrative Examples and Occam's Razor . 194 6.3.1 Learning disjunctions . 194 6.3.2 Occam's razor . 195 6.3.3 Application: learning decision trees . 196 6.4 Regularization: penalizing complexity . 197 6.5 Online learning and the Perceptron algorithm . 198 6.5.1 An example: learning disjunctions . 198 6.5.2 The Halving algorithm . 199 3 6.5.3 The Perceptron algorithm . 199 6.5.4 Extensions: inseparable data and hinge-loss . 201 6.6 Kernel functions . 202 6.7 Online to Batch Conversion . 204 6.8 Support-Vector Machines . 205 6.9 VC-Dimension . 206 6.9.1 Definitions and Key Theorems . 207 6.9.2 Examples: VC-Dimension and Growth Function . 209 6.9.3 Proof of Main Theorems . 211 6.9.4 VC-dimension of combinations of concepts . 214 6.9.5 Other measures of complexity . 214 6.10 Strong and Weak Learning - Boosting . 215 6.11 Stochastic Gradient Descent . 218 6.12 Combining (Sleeping) Expert Advice . 220 6.13 Deep learning . 222 6.14 Further Current directions . 228 6.14.1 Semi-supervised learning . 228 6.14.2 Active learning . 231 6.14.3 Multi-task learning . 231 6.15 Bibliographic Notes . 232 6.16 Exercises . 233 7 Algorithms for Massive Data Problems: Streaming, Sketching, and Sampling 237 7.1 Introduction . 237 7.2 Frequency Moments of Data Streams . 238 7.2.1 Number of Distinct Elements in a Data Stream . 239 7.2.2 Counting the Number of Occurrences of a Given Element. 242 7.2.3 Counting Frequent Elements . 243 7.2.4 The Second Moment . 244 7.3 Matrix Algorithms using Sampling . 247 7.3.1 Matrix Multiplication Using Sampling . 249 7.3.2 Implementing Length Squared Sampling in two passes . 252 7.3.3 Sketch of a Large Matrix . 253 7.4 Sketches of Documents . 256 7.5 Bibliography . 258 7.6 Exercises . 259 8 Clustering 264 8.1 Introduction . 264 8.1.1 Two general assumptions on the form of clusters . 265 8.2 k-means Clustering . 267 8.2.1 A maximum-likelihood motivation for k-means . 267 4 8.2.2 Structural properties of the k-means objective . 268 8.2.3 Lloyd's k-means clustering algorithm . 268 8.2.4 Ward's algorithm . 270 8.2.5 k-means clustering on the line . 271 8.3 k-Center Clustering . 271 8.4 Finding Low-Error Clusterings . 272 8.5 Approximation Stability . 272 8.6 Spectral Clustering . 275 8.6.1 Stochastic Block Model . 276 8.6.2 Gaussian Mixture Model . ..
Load more

Recommended publications
  • Avrim Blum, John Hopcroft, Ravindran Kannan
    Foundations of Data Science This book provides an introduction to the mathematical and algorithmic founda- tions of data science, including machine learning, high-dimensional geometry, and analysis of large networks. Topics include the counterintuitive nature of data in high dimensions, important linear algebraic techniques such as singular value decompo- sition, the theory of random walks and Markov chains, the fundamentals of and important algorithms for machine learning, algorithms, and analysis for clustering, probabilistic models for large networks, representation learning including topic modeling and nonnegative matrix factorization, wavelets, and compressed sensing. Important probabilistic techniques are developed including the law of large num- bers, tail inequalities, analysis of random projections, generalization guarantees in machine learning, and moment methods for analysis of phase transitions in large random graphs. Additionally, important structural and complexity measures are discussed such as matrix norms and VC-dimension. This book is suitable for both undergraduate and graduate courses in the design and analysis of algorithms for data. Avrim Blum is Chief Academic Officer at the Toyota Technological Institute at Chicago and formerly Professor at Carnegie Mellon University. He has over 25,000 citations for his work in algorithms and machine learning. He has received the AI Journal Classic Paper Award, ICML/COLT 10-Year Best Paper Award, Sloan Fellowship, NSF NYI award, and Herb Simon Teaching Award, and is a fellow of the Association for Computing Machinery. John Hopcroft is the IBM Professor of Engineering and Applied Mathematics at Cornell University. He is a member National Academy of Sciences and National Academy of Engineering, and a foreign member of the Chinese Academy of Sciences.
    [Show full text]
  • Caltech/Mit Voting Technology Project
    CALTECH/MIT VOTING TECHNOLOGY PROJECT A multi-disciplinary, collaborative project of the California Institute of Technology – Pasadena, California 91125 and the Massachusetts Institute of Technology – Cambridge, Massachusetts 02139 ADVANCES IN CRYPTOGRAPHIC VOTING SYSTEMS BEN ADIDA MIT Key words: voting systems, cryptographic, election administration, secret- ballot elections VTP WORKING PAPER #51 September 2006 Advances in Cryptographic Voting Systems by Ben Adida Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY August 2006 c Massachusetts Institute of Technology 2006. All rights reserved. Author . .................................................................. Department of Electrical Engineering and Computer Science August 31st, 2006 Certified by . ............................................................. Ronald L. Rivest Viterbi Professor of Electrical Engineering and Computer Science Thesis Supervisor Accepted by . ............................................................ Arthur C. Smith Chairman, Department Committee on Graduate Students 2 Advances in Cryptographic Voting Systems by Ben Adida Submitted to the Department of Electrical Engineering and Computer Science on August 31st, 2006, in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science Abstract Democracy depends on the proper administration of popular
    [Show full text]
  • Manuel Blum's CV
    Manuel Blum [email protected] MANUEL BLUM Bruce Nelson Professor of Computer Science Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 Telephone: Office: (412) 268-3742, Fax: (412) 268-5576 Home: (412) 687-8730, Mobile: (412) 596-4063 Email: [email protected] Personal Born: 26 April1938 in Caracas, Venezuela. Citizenship: Venezuela and USA. Naturalized Citizen of USA, January 2000. Wife: Lenore Blum, Distinguished Career Professor of Computer Science, CMU Son: Avrim Blum, Professor of Computer Science, CMU. Interests: Computational Complexity; Automata Theory; Algorithms; Inductive Inference: Cryptography; Program Result-Checking; Human Interactive Proofs. Employment History Research Assistant and Research Associate for Dr. Warren S. McCulloch, Research Laboratory of Electronics, MIT, 1960-1965. Assistant Professor, Department of Mathematics, MIT, 1966-68. Visiting Assistant Professor, Associate Professor, Professor, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, 1968-2001. Associate Chair for Computer Science, U.C. Berkeley, 1977-1980. Arthur J. Chick Professor of Computer Science, U.C. Berkeley, 1995-2001. Group in Logic and Methodology of Science, U.C. Berkeley, 1974-present. Visiting Professor of Computer Science. City University of Hong Kong, 1997-1999. Bruce Nelson Professor of Computer Science, Carnegie Mellon University, 2001-present. Education B.S., Electrical Engineering, MIT, 1959; M.S., Electrical Engineering, MIT. 1961. Ph.D., Mathematics, MIT, 1964, Professor Marvin Minsky, supervisor. Manuel Blum [email protected] Honors MIT Class VIB (Honor Sequence in EE), 1958-61 Sloan Foundation Fellowship, 1972-73. U.C. Berkeley Distinguished Teaching Award, 1977. Fellow of the IEEE "for fundamental contributions to the abstract theory of computational complexity,” 1982.
    [Show full text]
  • Algorithms for Generalized Topic Modeling
    Algorithms for Generalized Topic Modeling Avrim Blum Nika Haghtalab Toyota Technological Institute at Chicago Computer Science Department [email protected] Carnegie Mellon University [email protected] Abstract lations, like shooting a free throw or kicking a field goal. Better would be a model in which sentences are drawn i.i.d. Recently there has been significant activity in developing al- from a distribution over sentences. Even better would be gorithms with provable guarantees for topic modeling. In this paragraphs drawn i.i.d. from a distribution over paragraphs work we consider a broad generalization of the traditional topic modeling framework, where we no longer assume that (this would account for the word correlations that exist within words are drawn i.i.d. and instead view a topic as a complex a coherent paragraph). Or, even better, how about a model in distribution over sequences of paragraphs. Since one could which paragraphs are drawn non-independently, so that the not hope to even represent such a distribution in general (even second paragraph in a document can depend on what the first if paragraphs are given using some natural feature representa- paragraph was saying, though presumably with some amount tion), we aim instead to directly learn a predictor that given a of additional entropy as well? This is the type of model we new document, accurately predicts its topic mixture, without study here. learning the distributions explicitly. We present several natural Note that an immediate problem with considering such conditions under which one can do this from unlabeled data a model is that now the task of learning an explicit distri- only, and give efficient algorithms to do so, also discussing issues such as noise tolerance and sample complexity.
    [Show full text]
  • Computational Learning Theory
    UC Berkeley, CS 294-220 Spring 2021 Computational Learning Theory Staff Prof. Shafi Goldwasser [email protected] Jonathan Shafer [email protected] About this Course This course is an introduction to learning theory. We will present a few definitions of learning, and then proceed to investigate what can (and cannot) be learned according to each definition, and what amount of computational resources (especially data and compute time) are necessary in the cases where learning is possible. Attention will be devoted to understanding definitions and proofs. The course will generally not cover applications and state-of-the-art technologies. See a list of topics on the following page. Recommended Textbooks 1. Shalev-Shwartz and Ben-David. Understanding Machine Learning: From Theory to Algorithms. [SB14] 2. Mohri, Rostamizadeh and Talwalkar. Foundations of Machine Learning. [MRT18] 3. Vapnik. The Nature of Statistical Learning Theory. [Vap00] Homework: Six problem sets will be assigned throughout the semester. Grading Students may choose between the following options: 1. Six problem sets: 100% 2. Four problem sets: 65%; Final research project: 35%. Prerequisites: CS 170. 1 Last update: November 9, 2020 UC Berkeley, CS 294-220 Spring 2021 Outline The following is preliminary and very much subject to change. Unit Topic References [MRT18, Ch. 16] Language identification in the limit 1 [KV94, Ch. 8] Learning with queries [Gol67, BB75, Ang80, Ang87] PAC learning: { Definitions: PAC, agnostic PAC [SB14, Ch. 3-5] 2 { Learning via uniform convergence [MRT18, Ch. 2] { No free lunch PAC learning: { VC dimension [SB14, Ch. 6] 3 { Sauer's lemma [MRT18, Ch. 3] { Fundamental theorem of PAC learning { Part I PAC learning: { Rademacher complexity [SB14, Ch.
    [Show full text]
  • (CONSCS) Systems
    3/2/2004 NSF ITR-(ASE+ECS+NHS)-(dmc+soc+int) Mathematical Foundations for Understanding and Designing Conceptualizing Strategizing Control (CONSCS) Systems Manuel Blum (PI), Avrim Blum (Co-PI), Lenore Blum (Co-PI), Steven Rudich (Co-PI), Research Assistants: Ryan Williams, Luis von Ahn From Collins English Dictionary, 1995: conscious adj. 4.a. denoting or relating to a part of the human mind that is aware of a person’s self, environment, and mental activity and that to a certain extent determines his choices of action. b. (as n.) the conscious is only a small part of the mind. Compare unconscious. 1. Introduction: Proposal Objectives and Expected Significance. There is a critical need for, and a great deal of interest in, the design of self-aware programs, robots, and systems. Robots that are aware of their own state and the state of their surroundings are better able to deal with unexpected adversity, changes in goals, new information, and to make long-term plans. Indeed, a number of areas of AI deal with different models and approaches to self-awareness, as for example the explicitly modeled belief-state of a robot in a Partially Observable Markov Decision Process (POMDP) framework [KaelLitCas, JaaSinJor, Monahan, SutBar]. Our goal in this proposal is to initiate an automata-theoretic study of self-awareness, and what we would mean by a truly self-aware autonomous system, in terms of both its behavior and its internal design. More ambitiously, we would like to develop a set of definitions for an automata-theoretic version of consciousness, what we call a CONceptualizing Strategizing Control System (CONSCS), that would enable us to prove theorems about CONSCSness, and would help to support the eventual development of a truly self-aware robot.
    [Show full text]
  • Santosh S. Vempala
    Santosh S. Vempala Professor of Computer Science Office Phone: (404) 385-0811 Georgia Institute of Technology Home Phone: (404) 855-5621 Klaus 2222, 266 Ferst Drive Email: [email protected] Atlanta, GA 30332 http://www.cc.gatech.edu/~vempala Research The theory of algorithms; algorithmic tools for sampling, learning, optimiza- Interests tion and data analysis; high-dimensional geometry; randomized linear algebra; Computing-for-Good (C4G). Education Carnegie Mellon University, (1993-1997) School of CS, Ph.D. in Algorithms, Combinatorics and Optimization. Thesis: \Geometric Tools for Algorithms." Advisor: Prof. Avrim Blum Indian Institute of Technology, New Delhi, (1988-1992) B. Tech. in Computer Science. Awards Best Paper ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021. Best Paper ITU Kaleideschope, 2019. Gem of PODS (test of time award), 2019. Edenfield Faculty Fellowship, 2019. CIOS Course Effectiveness Teaching Award, 2016. Frederick Storey chair, 2016-. ACM fellow, 2015. Open Source Software World Challenge, Gold prize, 2015. GT Class of 1934 Outstanding Interdisciplinary Activities Award, 2012. Georgia Trend 40-under-40, 2010. Raytheon fellow, 2008. Distinguished Professor of Computer Science, 2007- Guggenheim Fellow, 2005 Alfred P. Sloan Research Fellow, 2002 NSF Career Award, 1999 Miller Fellow, U.C. Berkeley, 1998 IEEE Machtey Prize, 1997 Best Undergraduate Thesis Award, IIT Delhi, 1992 Appointments Aug 06 { Georgia Tech, Professor, Computer Science (primary), ISYE, Mathematics. Aug 06{Apr 11 Founding Director, Algorithms and Randomness Center (ARC), Georgia Tech. Jul 03{Jul 07 MIT, Associate Professor of Applied Mathematics Jul 98{Jun 03 MIT, Assistant Professor of Applied Mathematics Sep 97{Jun 98 MIT, Applied Mathematics Instructor. 2001, 03, 06, 14 Microsoft Research, Visiting Researcher.
    [Show full text]
  • A Discriminative Framework for Clustering Via Similarity Functions
    A Discriminative Framework for Clustering via Similarity Functions Maria-Florina Balcan∗ Avrim Blum∗ Santosh Vempala† Dept. of Computer Science Dept. of Computer Science College of Computing Carnegie Mellon University Carnegie Mellon University Georgia Inst. of Technology Pittsburgh, PA Pittsburgh, PA Atlanta, GA [email protected] [email protected] [email protected] ABSTRACT new efficient algorithms that are able to take advantage of them. Problems of clustering data from pairwise similarity information Our algorithms for hierarchical clustering combine recent learning- are ubiquitous in Computer Science. Theoretical treatments typi- theoretic approaches with linkage-style methods. We also show cally view the similarity information as ground-truth and then de- how our algorithms can be extended to the inductive case, i.e., by sign algorithms to (approximately) optimize various graph-based using just a constant-sized sample, as in property testing. The anal- objective functions. However, in most applications, this similarity ysis here uses regularity-type results of [20] and [3]. information is merely based on some heuristic; the ground truth is Categories and Subject Descriptors: F.2.0 [Analysis of Algo- really the unknown correct clustering of the data points and the real rithms and Problem Complexity]: General goal is to achieve low error on the data. In this work, we develop a theoretical approach to clustering from this perspective. In partic- General Terms: Algorithms, Theory ular, motivated by recent work in learning theory that asks “what Keywords: Clustering, Similarity Functions, Learning. natural properties of a similarity (or kernel) function are sufficient to be able to learn well?” we ask “what natural properties of a 1.
    [Show full text]
  • Bespeak Dissertation Fast
    bespeak Dissertation fast The following is an academic genealogy of computer scientists and is constructed by following the pedigree of thesis advisors. == Europe == === Denmark === Peter Naur (Olivier Danvy) === Finland === Arto Salomaa === France === Many French computer scientists worked at the National Institute for Research in Computer Science and Control (INRIA). Marcel-Paul Schützenberger Maurice Nivat Philippe Flajolet Gérard Huet Francois Fages Thierry Coquand Hugo Herbelin Xavier Leroy Christine Paulin-Mohring Didier Rémy François Pottier Bruno Courcelle Louis Nolin Bernard Robinet Emmanuel Saint-James Olivier Danvy (Secondary advisor: Emmanuel Saint-James) Jean-François Perrot Jacques Sakarovitch Jean-Eric Pin Pascal Weil Gérard Berry Gilles Kahn Patrick Cousot Alain Colmerauer === Germany === Karl Steinbuch Franz Baader Carl Adam Petri Martin Odersky === Italy === Corrado Böhm Ugo Montanari Paolo Ciancarini Roberto Gorrieri Nadia Busi Davide Sangiorgi === Netherlands === ==== Van Wijngaarden / Dijkstra ==== Adriaan van Wijngaarden was director of the computer science department at the Centrum Wiskunde & Informatica. It was influential in the development of ALGOL 68. Cornelis Benjamin Biezeno (1933: honoris causa. Universiteit van Amsterdam) Adriaan van Wijngaarden (1945: Enige toepassingen van Fourierintegralen op elastische problemen. Technische Universiteit Delft) Willem van der Poel (1956: The Logical Principles of Some Simple Computers. Universiteit van Amsterdam) Gerard Holzmann (1979: Coordination Problems in Multiprocessing
    [Show full text]
  • A Theoretical Computer Science Perspective on Consciousness1
    A Theoretical Computer Science Perspective on Consciousness1 Manuel Blum and Lenore Blum2 ABSTRACT The quest to understand consciousness, once the purview of philosophers and theologians, is now actively pursued by scientists of many stripes. This paper studies consciousness from the perspective of theoretical computer science. It formalizes the Global Workspace Theory (GWT) originated by cognitive neuroscientist Bernard Baars and further developed by him, Stanislas Dehaene, and others. Our major contribution lies in the precise formal definition of a Conscious Turing Machine (CTM), also called a Conscious AI. We define the CTM in the spirit of Alan Turing’s simple yet powerful definition of a computer, the Turing Machine (TM). We are not looking for a complex model of the brain nor of cognition but for a simple model of (the admittedly complex concept of) consciousness. After formally defining CTM, we give a formal definition of consciousness in CTM. We later suggest why the CTM has the feeling of consciousness. The reasonableness of the definitions and explanations can be judged by how well they agree with commonly accepted intuitive concepts of human consciousness, the range of related concepts that the model explains easily and naturally, and the extent of its agreement with scientific evidence. INTRODUCTION Thanks to major advances in cognitive neuroscience, science is on the brink of understanding how the brain achieves consciousness. In 1988, cognitive neuroscientist Bernard Baars proposed a Global Workspace Theory (GWT) of the brain, sketched its architecture, and outlined its implications for understanding consciousness. See (Baars B. J., 1988) and (Baars B. J., 2019). That, together with the invention of fMRI in 1990, and the seminal investigations by Francis Crick and Christof Koch (Crick & Koch, 1990) into the neural correlates of consciousness, helped shake off the taboo on the scientific study of consciousness.
    [Show full text]
  • CV- Maria-Florina Balcan 1
    MARIA-FLORINA BALCAN Carnegie Mellon University Pittsburgh, PA 15213-3891 [email protected] www.cs.cmu.edu/~ninamf RESEARCH INTERESTS Learning Theory, Machine Learning, Theory of Computing, Artificial Intelligence, Algorithmic Economics and Algorithmic Game Theory, Optimization. APPOINTMENTS • July 2020 - present Professor, Cadence Design Systems Chair in Computer Science, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. • June 2014 – 2020 Associate Professor, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. (tenured in 2016) • 2009 - 2014 Assistant Professor, College of Computing, Georgia Tech, Atlanta, GA. • 2008 - 2009 Postdoctoral Researcher, Microsoft Research NE, Cambridge, MA. • 2000 - 2002 Instructor, Computer Science Department, University of Bucharest, Romania. EDUCATION • Ph.D. 2002 – 2008. Carnegie Mellon University, Pittsburgh, PA. Computer Science Department. • M.S. 2000 – 2002. University of Bucharest, Romania, Faculty of Mathematics, Computer Science Department, M.S. Degree in Computer Science, GPA 10.00 / 10.00. • B.S. 1996 – 2000. University of Bucharest, Romania. Faculty of Mathematics, Computer Science Dept., GPA 10.00/10.00. “Summa Cum Laude” Diploma. HONORS AND AWARDS Major Leadership Positions • General Chair for the 38th International Conference on Machine Learning (ICML) 2021. • Program Committee Co-Chair for the 34th Conference on Neural Information Processing Systems (NeurIPS) 2020. • Invited Co-organizer for the “Machine Learning and Computational Modelling” Session of the Japanese- American- German Kavli Frontiers of Science Symposium, National Academy of Sciences, 2017. • Co-organizer for “Foundations of Machine Learning”, semester long program at the Simons Institute for Theory of Computing, 2017. • Program Committee Co-Chair for the 33rd International Conference on Machine Learning (ICML) 2016. • Program Committee Co-Chair for the 27th Annual Conference on Learning Theory (COLT) 2014.
    [Show full text]