Tengyu Ma Facebook AI Research. Based on joint work with Yuanzhi Li (Princeton) and Hongyang Zhang (Stanford)
|
|
- Justin Lawson
- 5 years ago
- Views:
Transcription
1 Tengyu Ma Facebook AI Research Based on joint work with Yuanzhi Li (Princeton) and Hongyang Zhang (Stanford)
2 Ø Over-parameterization: # parameters # examples Ø a set of parameters that can Ø fit to training data and generalize to test data Ø or fit to real inputs with random labels, and fail to generalize Ø or fit to training data but fail to generalize This talk: analysis for simpler models that share the properties above (matrix sensing, and neural nets with quadratic activations)
3 Ø Uniform convergence doesn t hold Ø training loss test loss for all parameters Ø a model that can fit to training data but fail to generalize test loss training loss Ø Algorithm matters: multiple local/global minima exist, the algorithm chooses the one that generalizes Ø different algorithms converge to local min of training loss, but generalize differently [Keskar et al 16, Wilson et al 17, Dinh et al 17] Ø Post-mortem explanations: margin theory, PAC-Bayes, and compressionbased bounds [Bartlett et al. 17, Neyshabur et al. 17, Arora et al. 18, Dziugaite and Roy 18]
4 Algorithms matter Stochastic gradient descent, with proper initialization and learning rate, prefers an optimal solution with low complexity, when it exists Ø # parameters is almost irrelevant Intrinsic complexity of the data matters Ø This talk: rigorous argument for matrix sensing and quadratic neural networks
5 Ø! data " #,, " & R ), *! Ø Claim: minimize,(.) with gradient descent starting with. = 0 is equivalent to solve Ø Gradient descent is limited to search in a subspace Ø Related: GD on logistic loss converges to max margin solution [Soudry et al. 17, Ji&Telgarsky 17] span(" #,, " & )
6 Ø! data points " #,, " & R ) ) from standard normal dist. Ø Unknown PSD matrix + R ) ) of rank,. Ø We observe / 0 = " 0, + Ø Variable 4 R ) ) min U f(u) = nx (y i ha i,uu > i) 2 i=1 Ø Focus: gradient descent 4 56# = :(4 5 ) Ø Well-studied problem with efficient solutions [Recht et al. 10, Candes et al 07, Tu et al 2015, Zheng and Lafferty 15 ]
7 min U f(u) = 3 4 : = 7 4, * nx (y i ha i,uu > i) 2 i=1 Ø Regime of parameters:! #$ % # % Ø Ideal solution: ' satisfying '' ( = * has zero training error Ø other solution ' with zero training error but '' ( * Gradient descent with small initialization empirically converges to the ideal solution! [Gunasekar et al. 2017] Ø Compared to low-rank factorization (taking ' R / 1 ): the algorithm finds the correct rank automatically
8 test error (population risk) = Ef = km UU > k 2 F Ø! = 5, % = 5&! Ø Early stopping and stochasticity is not necessary Systematic empirical studies in [Gunasekar et al. 2017]
9 Theorem: [Li-M.-Zhang 17] With!"($% & ) observations, and initialization ( ) = + - and learning rate., at iteration / satisfying 0 log 5 / Technicalities:, the generalization error is bounded by ( 9 ( 9 : < = & $+ Ø We assume < is well-conditioned Ø Theorem also holds when the measurements > 0,, > A satisfy B- restricted isometry property with B 1/ % ØThe runtime bound is non-trivial even with infinite samples
10 Gradient descent prefers low complexity solutions S r = {approximately rank-r solutions} := {U : r+1(u) apple } Non-generalizable global minima of training loss! $ generalizable global minima of training loss! "! # 0
11 More concrete analysis plan: Ø GD on population risk %& stays in! # Ø GD on & behaves similarly to that on %& in! # ref(u) rf(u) Ø Generalization is trivial in! # Ef(U) f(u), 8U 2 S r! $ Non-generalizable global minima of training loss generalizable global minima of training loss! "! # GD on %& 0
12 Ø Input dim = 100 ØGenerate labels with a network of hidden layer size! = 1 Ø Train with hidden layer size = 100
13 Ø WLOG, assume! = # # %, # = 1 Ø Decompose the iterate ( ) into: ( ) = # * ) % +, ) signal noise 7 :*; < Goals: show inductively Ø, ) -. 0 Ø * ) 1 Ø These imply ( ) # # %, )23, ) * ) * ) * ) 267
14 Lemma 1:! "#$! " + 2() Ø Preparation: = U t (U t U t M)U t =(I (U t U t M))U t Small when * " is approx. low rank Ø Proof: E t =(I u? u?> )U t E t+1 = E t (I U t U t ) + small term b.c. (I u? u?> )M =0 GD on population risk reduces the error ke t+1 kappleke t k + small term
15 Ø! : entry-wise quadratic $ = & '!() ' *) Ø Almost equivalent to matrix sensing with rank-1 measurement: $ = ) ' *, = ** ', )) ' measurement matrix to recover Ø Only difference: unlike random measurement, ** ' doesn t satisfy restricted isometry property Ø Solution: throwing away a very small fraction of the data (adaptively) that devastate restricted isometry property
16 Ø Generalization error depends on initialization Initialization =! #
17 Initialization =! Ø Caveat: SGD or GD with large initialization can work with quadratic neural networks. (But the current theory requires small initialization.)
18 Ø Algo. analyzed: GD on Ø Algo. for comparison: projected GD on min U f(u) = nx (y i ha i,uu > i) 2 i=1 min g(z) = X n (y i ha i,zi) 2 Z 0 i=1
19 Ø Algorithms have an implicit regularization effect Open questions: Ø other matrix factorization based models Ø logistic loss [Gunasekar et al 18] Ø neural nets with other activation functions and loss (more in Nati s talk) Ø better understanding of algorithms for deep learning Ø which seems to be very helpful for fully understanding generalization Thank you!
Tengyu Ma Facebook AI Research. Based on joint work with Rong Ge (Duke) and Jason D. Lee (USC)
Tengyu Ma Facebook AI Research Based on joint work with Rong Ge (Duke) and Jason D. Lee (USC) Users Optimization Researchers function f Solution gradient descent local search Convex relaxation + Rounding
More informationOverview. Ø Neural Networks are considered black-box models Ø They are complex and do not provide much insight into variable relationships
Neural Networks Overview Ø s are considered black-box models Ø They are complex and do not provide much insight into variable relationships Ø They have the potential to model very complicated patterns
More informationA comparative analysis of subreddit recommenders for Reddit
A comparative analysis of subreddit recommenders for Reddit Jay Baxter Massachusetts Institute of Technology jbaxter@mit.edu Abstract Reddit has become a very popular social news website, but even though
More informationInstructors: Tengyu Ma and Chris Re
Instructors: Tengyu Ma and Chris Re cs229.stanford.edu Ø Probability (CS109 or STAT 116) Ø distribution, random variable, expectation, conditional probability, variance, density Ø Linear algebra (Math
More informationCSC304 Lecture 16. Voting 3: Axiomatic, Statistical, and Utilitarian Approaches to Voting. CSC304 - Nisarg Shah 1
CSC304 Lecture 16 Voting 3: Axiomatic, Statistical, and Utilitarian Approaches to Voting CSC304 - Nisarg Shah 1 Announcements Assignment 2 was due today at 3pm If you have grace credits left (check MarkUs),
More informationProbabilistic earthquake early warning in complex earth models using prior sampling
Probabilistic earthquake early warning in complex earth models using prior sampling Andrew Valentine, Paul Käufl & Jeannot Trampert EGU 2016 21 st April www.geo.uu.nl/~andrew a.p.valentine@uu.nl A case
More informationLocal differential privacy
Local differential privacy Adam Smith Penn State Bar-Ilan Winter School February 14, 2017 Outline Model Ø Implementations Question: what computations can we carry out in this model? Example: randomized
More informationImproved Boosting Algorithms Using Confidence-rated Predictions
Improved Boosting Algorithms Using Confidence-rated Predictions ÊÇÊÌ º ËÀÈÁÊ schapire@research.att.com AT&T Labs, Shannon Laboratory, 18 Park Avenue, Room A279, Florham Park, NJ 7932-971 ÇÊÅ ËÁÆÊ singer@research.att.com
More informationPolitical Economics II Spring Lectures 4-5 Part II Partisan Politics and Political Agency. Torsten Persson, IIES
Lectures 4-5_190213.pdf Political Economics II Spring 2019 Lectures 4-5 Part II Partisan Politics and Political Agency Torsten Persson, IIES 1 Introduction: Partisan Politics Aims continue exploring policy
More informationTitle: Local Search Required reading: AIMA, Chapter 4 LWH: Chapters 6, 10, 13 and 14.
B.Y. Choueiry 1 Instructor s notes #8 Title: Local Search Required reading: AIMA, Chapter 4 LWH: Chapters 6, 10, 13 and 14. Introduction to Artificial Intelligence CSCE 476-876, Fall 2017 URL: www.cse.unl.edu/
More informationUC-BERKELEY. Center on Institutions and Governance Working Paper No. 22. Interval Properties of Ideal Point Estimators
UC-BERKELEY Center on Institutions and Governance Working Paper No. 22 Interval Properties of Ideal Point Estimators Royce Carroll and Keith T. Poole Institute of Governmental Studies University of California,
More informationCS 4407 Algorithms Greedy Algorithms and Minimum Spanning Trees
CS 4407 Algorithms Greedy Algorithms and Minimum Spanning Trees Prof. Gregory Provan Department of Computer Science University College Cork 1 Sample MST 6 5 4 9 14 10 2 3 8 15 Greedy Algorithms When are
More informationThe HeLIx + inversion code Genetic algorithms. A. Lagg - Abisko Winter School 1
The HeLIx + inversion code Genetic algorithms A. Lagg - Abisko Winter School 1 Inversion of the RTE Once solution of RTE is known: Ø comparison between Stokes spectra of synthetic and observed spectrum
More informationA Calculus for End-to-end Statistical Service Guarantees
A Calculus for End-to-end Statistical Service Guarantees Technical Report: University of Virginia, CS-2001-19 (2nd revised version) Almut Burchard Ý Jörg Liebeherr Stephen Patek Ý Department of Mathematics
More informationAnnouncements. HW3 Due tonight HW4 posted No class Thursday (Thanksgiving) 2017 Kevin Jamieson
Announcements HW3 Due tonight HW4 posted No class Thursday (Thanksgiving) 2017 Kevin Jamieson 1 Mixtures of Gaussians Machine Learning CSE546 Kevin Jamieson University of Washington November 20, 2016 Kevin
More informationClassifier Evaluation and Selection. Review and Overview of Methods
Classifier Evaluation and Selection Review and Overview of Methods Things to consider Ø Interpretation vs. Prediction Ø Model Parsimony vs. Model Error Ø Type of prediction task: Ø Decisions Interested
More informationOnline Appendix: Trafficking Networks and the Mexican Drug War
Online Appendix: Trafficking Networks and the Mexican Drug War Melissa Dell February 6, 2015 Contents A-1 Estimation appendix A 3 A-1.1 The shortest paths problem........................ A 3 A-1.2 Solving
More informationCongressional Gridlock: The Effects of the Master Lever
Congressional Gridlock: The Effects of the Master Lever Olga Gorelkina Max Planck Institute, Bonn Ioanna Grypari Max Planck Institute, Bonn Preliminary & Incomplete February 11, 2015 Abstract This paper
More informationVoting and Complexity
Voting and Complexity legrand@cse.wustl.edu Voting and Complexity: Introduction Outline Introduction Hardness of finding the winner(s) Polynomial systems NP-hard systems The minimax procedure [Brams et
More informationSocial Choice & Mechanism Design
Decision Making in Robots and Autonomous Agents Social Choice & Mechanism Design Subramanian Ramamoorthy School of Informatics 2 April, 2013 Introduction Social Choice Our setting: a set of outcomes agents
More informationSpatial Chaining Methods for International Comparisons of Prices and Real Expenditures D.S. Prasada Rao The University of Queensland
Spatial Chaining Methods for International Comparisons of Prices and Real Expenditures D.S. Prasada Rao The University of Queensland Jointly with Robert Hill, Sriram Shankar and Reza Hajargasht 1 PPPs
More informationIntroduction to Path Analysis: Multivariate Regression
Introduction to Path Analysis: Multivariate Regression EPSY 905: Multivariate Analysis Spring 2016 Lecture #7 March 9, 2016 EPSY 905: Multivariate Regression via Path Analysis Today s Lecture Multivariate
More informationCluster Analysis. (see also: Segmentation)
Cluster Analysis (see also: Segmentation) Cluster Analysis Ø Unsupervised: no target variable for training Ø Partition the data into groups (clusters) so that: Ø Observations within a cluster are similar
More informationP(x) testing training. x Hi
ÙÑÙÐ Ø Ú ÈÖÓ Ø ± Ê Ú Û Ó Ä ØÙÖ ½ Ç Ñ³ Ê ÞÓÖ Ì ÑÔÐ Ø ÑÓ Ð Ø Ø Ø Ø Ø Ð Ó Ø ÑÓ Ø ÔÐ Ù Ð º Ë ÑÔÐ Ò P(x) testing training Ø ÒÓÓÔ Ò x ÓÑÔÐ Ü ØÝ Ó h ÓÑÔÐ Ü ØÝ Ó H ¼ ¾¼ ½¼ ¼ ¹½¼ ÒÓÓÔ Ò ÒÓ ÒÓÓÔ Ò ÙÒÐ ÐÝ Ú ÒØ Ò
More informationCS 229: r/classifier - Subreddit Text Classification
CS 229: r/classifier - Subreddit Text Classification Andrew Giel agiel@stanford.edu Jonathan NeCamp jnecamp@stanford.edu Hussain Kader hkader@stanford.edu Abstract This paper presents techniques for text
More informationDo two parties represent the US? Clustering analysis of US public ideology survey
Do two parties represent the US? Clustering analysis of US public ideology survey Louisa Lee 1 and Siyu Zhang 2, 3 Advised by: Vicky Chuqiao Yang 1 1 Department of Engineering Sciences and Applied Mathematics,
More informationClassical papers: Osborbe and Slivinski (1996) and Besley and Coate (1997)
The identity of politicians is endogenized Typical approach: any citizen may enter electoral competition at a cost. There is no pre-commitment on the platforms, and winner implements his or her ideal policy.
More informationAppendix to Non-Parametric Unfolding of Binary Choice Data Keith T. Poole Graduate School of Industrial Administration Carnegie-Mellon University
Appendix to Non-Parametric Unfolding of Binary Choice Data Keith T. Poole Graduate School of Industrial Administration Carnegie-Mellon University 7 July 1999 This appendix is a supplement to Non-Parametric
More informationEstimating the Margin of Victory for Instant-Runoff Voting
Estimating the Margin of Victory for Instant-Runoff Voting David Cary Abstract A general definition is proposed for the margin of victory of an election contest. That definition is applied to Instant Runoff
More informationTrading Goods or Human Capital
Trading Goods or Human Capital The Winners and Losers from Economic Integration Micha l Burzyński, Université catholique de Louvain, IRES Poznań University of Economics, KEM michal.burzynski@uclouvain.be
More information(67686) Mathematical Foundations of AI June 18, Lecture 6
(67686) Mathematical Foundations of AI June 18, 2008 Lecturer: Ariel D. Procaccia Lecture 6 Scribe: Ezra Resnick & Ariel Imber 1 Introduction: Social choice theory Thus far in the course, we have dealt
More informationAdapting the Social Network to Affect Elections
Adapting the Social Network to Affect Elections Sigal Sina Dept of Computer Science Bar Ilan University, Israel sinasi@macs.biu.ac.il Noam Hazon Dept of Computer Science and Mathematics Ariel University,
More informationBargaining and Cooperation in Strategic Form Games
Bargaining and Cooperation in Strategic Form Games Sergiu Hart July 2008 Revised: January 2009 SERGIU HART c 2007 p. 1 Bargaining and Cooperation in Strategic Form Games Sergiu Hart Center of Rationality,
More informationPolice patrol districting method and simulation evaluation using agent-based model & GIS
Zhang and Brown Security Informatics 2013, 2:7 RESEARCH Open Access Police patrol districting method and simulation evaluation using agent-based model & GIS Yue Zhang * and Donald E Brown Abstract Police
More informationExploring QR Factorization on GPU for Quantum Monte Carlo Simulation
Exploring QR Factorization on GPU for Quantum Monte Carlo Simulation Tyler McDaniel Ming Wong Mentors: Ed D Azevedo, Ying Wai Li, Kwai Wong Quantum Monte Carlo Simulation Slater Determinant for N-electrons
More informationA New Proposal on Special Majority Voting 1 Christian List
C. List A New Proposal on Special Majority Voting Christian List Abstract. Special majority voting is usually defined in terms of the proportion of the electorate required for a positive decision. This
More informationTHE EFFECT OF OFFER-OF-SETTLEMENT RULES ON THE TERMS OF SETTLEMENT
Last revision: 12/97 THE EFFECT OF OFFER-OF-SETTLEMENT RULES ON THE TERMS OF SETTLEMENT Lucian Arye Bebchuk * and Howard F. Chang ** * Professor of Law, Economics, and Finance, Harvard Law School. ** Professor
More informationCombating Friend Spam Using Social Rejections
Combating Friend Spam Using Social Rejections Qiang Cao Duke University Michael Sirivianos Xiaowei Yang Kamesh Munagala Cyprus Univ. of Technology Duke University Duke University Friend Spam in online
More informationRobust Electric Power Infrastructures. Response and Recovery during Catastrophic Failures.
Robust Electric Power Infrastructures. Response and Recovery during Catastrophic Failures. Arturo Suman Bretas Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University
More informationA Framework for the Quantitative Evaluation of Voting Rules
A Framework for the Quantitative Evaluation of Voting Rules Michael Munie Computer Science Department Stanford University, CA munie@stanford.edu Yoav Shoham Computer Science Department Stanford University,
More informationIncumbency Advantages in the Canadian Parliament
Incumbency Advantages in the Canadian Parliament Chad Kendall Department of Economics University of British Columbia Marie Rekkas* Department of Economics Simon Fraser University mrekkas@sfu.ca 778-782-6793
More informationProving correctness of Stable Matching algorithm Analyzing algorithms Asymptotic running times
Objectives Proving correctness of Stable Matching algorithm Analyzing algorithms Asymptotic running times Wiki notes: Read after class; I am giving loose guidelines the point is to review and synthesize
More informationRandom Forests. Gradient Boosting. and. Bagging and Boosting
Random Forests and Gradient Boosting Bagging and Boosting The Bootstrap Sample and Bagging Simple ideas to improve any model via ensemble Bootstrap Samples Ø Random samples of your data with replacement
More informationConvergence of Iterative Voting
Convergence of Iterative Voting Omer Lev omerl@cs.huji.ac.il School of Computer Science and Engineering The Hebrew University of Jerusalem Jerusalem 91904, Israel Jeffrey S. Rosenschein jeff@cs.huji.ac.il
More information1 Electoral Competition under Certainty
1 Electoral Competition under Certainty We begin with models of electoral competition. This chapter explores electoral competition when voting behavior is deterministic; the following chapter considers
More informationProbabilistic Latent Semantic Analysis Hofmann (1999)
Probabilistic Latent Semantic Analysis Hofmann (1999) Presenter: Mercè Vintró Ricart February 8, 2016 Outline Background Topic models: What are they? Why do we use them? Latent Semantic Analysis (LSA)
More informationIntroduction to Text Modeling
Introduction to Text Modeling Carl Edward Rasmussen November 11th, 2016 Carl Edward Rasmussen Introduction to Text Modeling November 11th, 2016 1 / 7 Key concepts modeling document collections probabilistic
More informationEstimating the Margin of Victory for an IRV Election Part 1 by David Cary November 6, 2010
Summary Estimating the Margin of Victory for an IRV Election Part 1 by David Cary November 6, 2010 New procedures are being developed for post-election audits involving manual recounts of random samples
More informationBIPOLAR MULTICANDIDATE ELECTIONS WITH CORRUPTION by Roger B. Myerson August 2005 revised August 2006
BIPOLAR MULTICANDIDATE ELECTIONS WITH CORRUPTION by Roger B. Myerson August 2005 revised August 2006 Abstract. The goals of democratic competition are not only to give implement a majority's preference
More informationName Phylogeny. A Generative Model of String Variation. Nicholas Andrews, Jason Eisner and Mark Dredze
Name Phylogeny A Generative Model of String Variation Nicholas Andrews, Jason Eisner and Mark Dredze Department of Computer Science, Johns Hopkins University EMNLP 2012 Thursday, July 12 Outline Introduction
More informationUse and abuse of voter migration models in an election year. Dr. Peter Moser Statistical Office of the Canton of Zurich
Use and abuse of voter migration models in an election year Statistical Office of the Canton of Zurich Overview What is a voter migration model? How are they estimated? Their use in forecasting election
More informationAdaptive QoS Control for Real-Time Systems
Adaptive QoS Control for Real-Time Systems Chenyang Lu CSE 520S Challenges Ø Classical real-time scheduling theory relies on accurate knowledge about workload and platform. New challenges under uncertainties
More informationSlicing and Bundling
Slicing and Bundling ODILON CÂMARA University of Southern California JON. EGUIA Michigan State University January 20, 2017 Abstract We develop a theory of agenda-setting in a legislature. A proposer supports
More informationCS269I: Incentives in Computer Science Lecture #4: Voting, Machine Learning, and Participatory Democracy
CS269I: Incentives in Computer Science Lecture #4: Voting, Machine Learning, and Participatory Democracy Tim Roughgarden October 5, 2016 1 Preamble Last lecture was all about strategyproof voting rules
More informationSupporting Information Political Quid Pro Quo Agreements: An Experimental Study
Supporting Information Political Quid Pro Quo Agreements: An Experimental Study Jens Großer Florida State University and IAS, Princeton Ernesto Reuben Columbia University and IZA Agnieszka Tymula New York
More informationMinimizing Justified Envy in School Choice: The Design of NewApril Orleans 13, 2018 One App1 Atila / 40
Minimizing Justified Envy in School Choice: The Design of New Orleans One App Atila Abdulkadiroğlu (Duke), Yeon-Koo Che (Columbia), Parag Pathak(MIT), Alvin Roth (Stanford), and Olivier Tercieux (PSE)
More informationComplexity of Strategic Behavior in Multi-Winner Elections
Journal of Artificial Intelligence Research 33 (2008) 149 178 Submitted 03/08; published 09/08 Complexity of Strategic Behavior in Multi-Winner Elections Reshef Meir Ariel D. Procaccia Jeffrey S. Rosenschein
More informationUniversality of election statistics and a way to use it to detect election fraud.
Universality of election statistics and a way to use it to detect election fraud. Peter Klimek http://www.complex-systems.meduniwien.ac.at P. Klimek (COSY @ CeMSIIS) Election statistics 26. 2. 2013 1 /
More informationSession 2: The economics of location choice: theory
Session 2: The economics of location choice: theory Jacob L. Vigdor Duke University and NBER 6 September 2010 Outline The classics Roy model of selection into occupations. Sjaastad s rational choice analysis
More information14.770: Introduction to Political Economy Lectures 8 and 9: Political Agency
14.770: Introduction to Political Economy Lectures 8 and 9: Political Agency Daron Acemoglu MIT October 2 and 4, 2018. Daron Acemoglu (MIT) Political Economy Lectures 8 and 9 October 2 and 4, 2018. 1 /
More informationPolydisciplinary Faculty of Larache Abdelmalek Essaadi University, MOROCCO 3 Department of Mathematics and Informatics
International Journal of Pure and Applied Mathematics Volume 115 No. 4 2017, 801-812 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v115i4.13
More informationDeep Learning and Visualization of Election Data
Deep Learning and Visualization of Election Data Garcia, Jorge A. New Mexico State University Tao, Ng Ching City University of Hong Kong Betancourt, Frank University of Tennessee, Knoxville Wong, Kwai
More informationCS 886: Multiagent Systems. Fall 2016 Kate Larson
CS 886: Multiagent Systems Fall 2016 Kate Larson Multiagent Systems We will study the mathematical and computational foundations of multiagent systems, with a focus on the analysis of systems where agents
More informationHoboken Public Schools. Algebra II Honors Curriculum
Hoboken Public Schools Algebra II Honors Curriculum Algebra Two Honors HOBOKEN PUBLIC SCHOOLS Course Description Algebra II Honors continues to build students understanding of the concepts that provide
More informationIllegal Migration and Policy Enforcement
Illegal Migration and Policy Enforcement Sephorah Mangin 1 and Yves Zenou 2 September 15, 2016 Abstract: Workers from a source country consider whether or not to illegally migrate to a host country. This
More informationFall Detection for Older Adults with Wearables. Chenyang Lu
Fall Detection for Older Adults with Wearables Chenyang Lu Internet of Medical Things Ø Wearables: wristbands, smart watches q Continuous monitoring q Sensing: activity, heart rate, sleep, (pulse-ox, glucose
More informationNetworked Games: Coloring, Consensus and Voting. Prof. Michael Kearns Networked Life NETS 112 Fall 2013
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life NETS 112 Fall 2013 Experimental Agenda Human-subject experiments at the intersection of CS, economics, sociology, network
More informationMATH 1340 Mathematics & Politics
MATH 1340 Mathematics & Politics Lecture 1 June 22, 2015 Slides prepared by Iian Smythe for MATH 1340, Summer 2015, at Cornell University 1 Course Information Instructor: Iian Smythe ismythe@math.cornell.edu
More informationCan Mathematics Help End the Scourge of Political Gerrymandering?
Can Mathematics Help End the Scourge of Political Gerrymandering? Austin Fry frya2@xavier.edu David Gerberry Xavier University May 4, 2017 Austin Fry (Xavier University) Gerrymandering May 4, 2017 1 /
More informationExperimental Computational Philosophy: shedding new lights on (old) philosophical debates
Experimental Computational Philosophy: shedding new lights on (old) philosophical debates Vincent Wiegel and Jan van den Berg 1 Abstract. Philosophy can benefit from experiments performed in a laboratory
More informationInfinite-Horizon Policy-Gradient Estimation
Journal of Artificial Intelligence Research 15 (2001) 319-350 Submitted 9/00; published 11/01 Infinite-Horizon Policy-Gradient Estimation Jonathan Baxter WhizBang! Labs. 4616 Henry Street Pittsburgh, PA
More informationProcesses. Criteria for Comparing Scheduling Algorithms
1 Processes Scheduling Processes Scheduling Processes Don Porter Portions courtesy Emmett Witchel Each process has state, that includes its text and data, procedure call stack, etc. This state resides
More informationLearning and Visualizing Political Issues from Voting Records Erik Goldman, Evan Cox, Mikhail Kerzhner. Abstract
Learning and Visualizing Political Issues from Voting Records Erik Goldman, Evan Cox, Mikhail Kerzhner Abstract For our project, we analyze data from US Congress voting records, a dataset that consists
More informationWind power integration and consumer behavior: a complementarity approach
1 Wind power integration and consumer behavior: a complementarity approach 8 th Annual Trans-Atlantic INFRADAY Conference on Energy November 7 th, 2014 Ali Daraeepour, Duke University Dr. Jalal Kazempour,
More informationLearning Systems. Research at the Intersection of Machine Learning & Data Systems. Joseph E. Gonzalez
Learning Systems Research at the Intersection of Machine Learning & Data Systems Joseph E. Gonzalez Asst. Professor, UC Berkeley jegonzal@cs.berkeley.edu How can machine learning techniques be used to
More informationDecomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP Sibylle Fröschle and Sławomir Lasota Institute of Informatics, Warsaw University 02 097 Warszawa, Banacha 2, Poland sib,sl
More informationVoting with Bidirectional Elimination
Voting with Bidirectional Elimination Matthew S. Cook Economics Department Stanford University March, 2011 Advisor: Jonathan Levin Abstract Two important criteria for judging the quality of a voting algorithm
More informationEnriqueta Aragones Harvard University and Universitat Pompeu Fabra Andrew Postlewaite University of Pennsylvania. March 9, 2000
Campaign Rhetoric: a model of reputation Enriqueta Aragones Harvard University and Universitat Pompeu Fabra Andrew Postlewaite University of Pennsylvania March 9, 2000 Abstract We develop a model of infinitely
More informationThe parametric g- formula in SAS JESSICA G. YOUNG CIMPOD 2017 CASE STUDY 1
The parametric g- formula in SAS JESSICA G. YOUNG CIMPOD 2017 CASE STUDY 1 Structure of the workshop Part I: Motivation Ø Why we might use the parametric g- formula and how it works in general Part II:
More informationTopics on the Border of Economics and Computation December 18, Lecture 8
Topics on the Border of Economics and Computation December 18, 2005 Lecturer: Noam Nisan Lecture 8 Scribe: Ofer Dekel 1 Correlated Equilibrium In the previous lecture, we introduced the concept of correlated
More informationWhat makes people feel free: Subjective freedom in comparative perspective Progress Report
What makes people feel free: Subjective freedom in comparative perspective Progress Report Presented by Natalia Firsova, PhD Student in Sociology at HSE at the Summer School of the Laboratory for Comparative
More informationPathbreakers? Women's Electoral Success and Future Political Participation
Pathbreakers? Women's Electoral Success and Future Political Participation Sonia Bhalotra, University of Essex Irma Clots-Figueras, Universidad Carlos III de Madrid Lakshmi Iyer, University of Notre Dame
More informationCOULD SIMULATION OPTIMIZATION HAVE PREVENTED 2012 CENTRAL FLORIDA ELECTION LINES?
Proceedings of the 2013 Winter Simulation Conference R. Pasupathy, S.-H. Kim, A. Tolk, R. Hill, and M. E. Kuhl, eds. COULD SIMULATION OPTIMIZATION HAVE PREVENTED 2012 CENTRAL FLORIDA ELECTION LINES? Jingsheng
More informationDimension Reduction. Why and How
Dimension Reduction Why and How The Curse of Dimensionality As the dimensionality (i.e. number of variables) of a space grows, data points become so spread out that the ideas of distance and density become
More informationGame theoretical techniques have recently
[ Walid Saad, Zhu Han, Mérouane Debbah, Are Hjørungnes, and Tamer Başar ] Coalitional Game Theory for Communication Networks [A tutorial] Game theoretical techniques have recently become prevalent in many
More informationOn removing the Condorcet influence from pairwise elections data
Economics Working Papers (2002 2016) Economics 7-2-2010 On removing the Condorcet influence from pairwise elections data Abhit Chandra Iowa State University, achandra@iastate.edu Sunanda Roy Iowa State
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY
LIBRARY OF THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY Digitized by the Internet Archive in 2011 with funding from Boston Library Consortium IVIember Libraries http://www.archive.org/details/votingforpublicaoomask
More informationSupport Vector Machines
Support Vector Machines Linearly Separable Data SVM: Simple Linear Separator hyperplane Which Simple Linear Separator? Classifier Margin Objective #1: Maximize Margin MARGIN MARGIN How s this look? MARGIN
More informationMidterm Review. EECS 2011 Prof. J. Elder - 1 -
Midterm Review - 1 - Topics on the Midterm Ø Data Structures & Object-Oriented Design Ø Run-Time Analysis Ø Linear Data Structures Ø The Java Collections Framework Ø Recursion Ø Trees Ø Priority Queues
More informationNotes on Strategic and Sincere Voting
Notes on Strategic and Sincere Voting Francesco Trebbi March 8, 2019 Idea Kawai and Watanabe (AER 2013): Inferring Strategic Voting. They structurally estimate a model of strategic voting and quantify
More informationIntroduction. The Politician and the Judge: Accountability in Government
Introduction Representative democracy vs. direct democracy Accountable vs. unaccountable officials Develop a simple model to explore when different types of government are optimal Introduction Representative
More informationCoalition Formation and Selectorate Theory: An Experiment - Appendix
Coalition Formation and Selectorate Theory: An Experiment - Appendix Andrew W. Bausch October 28, 2015 Appendix Experimental Setup To test the effect of domestic political structure on selection into conflict
More informationPlanning versus Free Choice in Scientific Research
Planning versus Free Choice in Scientific Research Martin J. Beckmann a a Brown University and T U München Abstract The potential benefits of centrally planning the topics of scientific research and who
More informationPPIC Statewide Survey Methodology
PPIC Statewide Survey Methodology Updated February 7, 2018 The PPIC Statewide Survey was inaugurated in 1998 to provide a way for Californians to express their views on important public policy issues.
More informationBuying Supermajorities
Presenter: Jordan Ou Tim Groseclose 1 James M. Snyder, Jr. 2 1 Ohio State University 2 Massachusetts Institute of Technology March 6, 2014 Introduction Introduction Motivation and Implication Critical
More informationA model for election night forecasting applied to the 2004 South African elections
Volume 22 (1), pp. 89 103 http://www.orssa.org.za ORiON ISSN 0529-191-X c 2006 A model for election night forecasting applied to the 2004 South African elections JM Greben C Elphinstone J Holloway Received:
More informationUniversity of Toronto Department of Economics. Influential Opinion Leaders
University of Toronto Department of Economics Working Paper 403 Influential Opinion Leaders By Jakub Steiner and Colin Stewart April 16, 2010 Influential Opinion Leaders Jakub Steiner Northwestern University
More informationSupplementary/Online Appendix for:
Supplementary/Online Appendix for: Relative Policy Support and Coincidental Representation Perspectives on Politics Peter K. Enns peterenns@cornell.edu Contents Appendix 1 Correlated Measurement Error
More informationMinimum Spanning Tree Union-Find Data Structure. Feb 28, 2018 CSCI211 - Sprenkle. Comcast wants to lay cable in a neighborhood. Neighborhood Layout
Objec&ves Minimum Spanning Tree Union-Find Data Structure Feb, 0 CSCI - Sprenkle Started teasing out some algorithms. Laying Cable Focus on commonality: what should our final solution look like? Comcast
More informationRural-urban Migration and Urbanization in Gansu Province, China: Evidence from Time-series Analysis
Rural-urban Migration and Urbanization in Gansu Province, China: Evidence from Time-series Analysis Haiying Ma (Corresponding author) Lecturer, School of Economics, Northwest University for Nationalities
More information