Presentation is loading. Please wait.

Presentation is loading. Please wait.

Voting Rules As Error-Correcting Codes Ariel D. Procaccia, Nisarg Shah, Yair Zick Carnegie Mellon University Error- Correcting Code.

Published byJames Ellis Modified over 9 years ago

Similar presentations

Presentation on theme: "Voting Rules As Error-Correcting Codes Ariel D. Procaccia, Nisarg Shah, Yair Zick Carnegie Mellon University Error- Correcting Code."— Presentation transcript:

1 Voting Rules As Error-Correcting Codes Ariel D. Procaccia, Nisarg Shah, Yair Zick Carnegie Mellon University Error- Correcting Code

2 Voting Rules As Error-Correcting Codes Social Choice Theory Alternatives Inputs Output = 7 = 2 = 1, = 3 = 5 = 2

3 Voting Rules As Error-Correcting Codes Subjective vs Objective  Aggregate subjective preferences  Find social consensus  Aggregate noisy estimates of underlying ground truth  Estimate the ground truth

4 Voting Rules As Error-Correcting Codes Previous Work Maximum Likelihood Estimation (MLE)  Assume votes are drawn from a specific distribution  Given votes, choose the most likely ground truth Input Distribution Output MLE Rule Votes

5 Voting Rules As Error-Correcting Codes Previous Work Output Possible Input Distributions Votes

6 Voting Rules As Error-Correcting Codes This Work

7 Voting Rules As Error-Correcting Codes Error-Correcting…what?

8 Voting Rules As Error-Correcting Codes Research Question

9 Voting Rules As Error-Correcting Codes Notations

10 Voting Rules As Error-Correcting Codes Model

11 Voting Rules As Error-Correcting Codes Lining Up the Results! Kendall tau Footrule Maximum displacement Cayley’s distance

12 Voting Rules As Error-Correcting Codes Experiments Two real-world datasets  Dots and Puzzle (MPC, AAAI’13) DotsPuzzle

13 Voting Rules As Error-Correcting Codes Experiments Two real-world datasets  Dots and Puzzle (MPC, AAAI’13) DotsPuzzle

14 Voting Rules As Error-Correcting Codes Discussion

Download ppt "Voting Rules As Error-Correcting Codes Ariel D. Procaccia, Nisarg Shah, Yair Zick Carnegie Mellon University Error- Correcting Code."

Similar presentations

What Could We Do better? Alternative Statistical Methods Jim Crooks and Xingye Qiao.

What Could We Do better? Alternative Statistical Methods Jim Crooks and Xingye Qiao.
Regression Eric Feigelson Lecture and R tutorial Arcetri Observatory April 2014.

Regression Eric Feigelson Lecture and R tutorial Arcetri Observatory April 2014.
: INTRODUCTION TO Machine Learning Parametric Methods.

: INTRODUCTION TO Machine Learning Parametric Methods.
1 AI and Economics: The Dynamic Duo Ariel Procaccia Center for Research on Computation and Society Harvard SEAS AI AND ECONOMICS DYNAMIC DUO THE.

1 AI and Economics: The Dynamic Duo Ariel Procaccia Center for Research on Computation and Society Harvard SEAS AI AND ECONOMICS DYNAMIC DUO THE.
On the Robustness of Preference Aggregation in Noisy Environments Ariel D. Procaccia, Jeffrey S. Rosenschein and Gal A. Kaminka.

On the Robustness of Preference Aggregation in Noisy Environments Ariel D. Procaccia, Jeffrey S. Rosenschein and Gal A. Kaminka.
Common Voting Rules as Maximum Likelihood Estimators Vincent Conitzer (Joint work with Tuomas Sandholm) Early version of this work appeared in UAI-05.

Common Voting Rules as Maximum Likelihood Estimators Vincent Conitzer (Joint work with Tuomas Sandholm) Early version of this work appeared in UAI-05.
Computing Kemeny and Slater Rankings Vincent Conitzer (Joint work with Andrew Davenport and Jayant Kalagnanam at IBM Research.)

Computing Kemeny and Slater Rankings Vincent Conitzer (Joint work with Andrew Davenport and Jayant Kalagnanam at IBM Research.)
Oct 14, 2014 Lirong Xia Recommender systems acknowledgment: Li Zhang, UCSC.

Oct 14, 2014 Lirong Xia Recommender systems acknowledgment: Li Zhang, UCSC.
FilterBoost: Regression and Classification on Large Datasets Joseph K. Bradley 1 and Robert E. Schapire 2 1 Carnegie Mellon University 2 Princeton University.

FilterBoost: Regression and Classification on Large Datasets Joseph K. Bradley 1 and Robert E. Schapire 2 1 Carnegie Mellon University 2 Princeton University.
A Sampled Texture Prior for Image Super-Resolution Lyndsey C. Pickup, Stephen J. Roberts and Andrew Zisserman, Robotics Research Group, University of Oxford.

A Sampled Texture Prior for Image Super-Resolution Lyndsey C. Pickup, Stephen J. Roberts and Andrew Zisserman, Robotics Research Group, University of Oxford.
Multivariate linear models for regression and classification Outline: 1) multivariate linear regression 2) linear classification (perceptron) 3) logistic.

Multivariate linear models for regression and classification Outline: 1) multivariate linear regression 2) linear classification (perceptron) 3) logistic.
Kalman’s Beautiful Filter (an introduction) George Kantor presented to Sensor Based Planning Lab Carnegie Mellon University December 8, 2000.

Kalman’s Beautiful Filter (an introduction) George Kantor presented to Sensor Based Planning Lab Carnegie Mellon University December 8, 2000.
Speaker: Ariel Procaccia Joint work with: Michael Zuckerman, Jeff Rosenschein Hebrew University of Jerusalem.

Speaker: Ariel Procaccia Joint work with: Michael Zuckerman, Jeff Rosenschein Hebrew University of Jerusalem.
Bayesian Image Super-resolution, Continued Lyndsey C. Pickup, David P. Capel, Stephen J. Roberts and Andrew Zisserman, Robotics Research Group, University.

Bayesian Image Super-resolution, Continued Lyndsey C. Pickup, David P. Capel, Stephen J. Roberts and Andrew Zisserman, Robotics Research Group, University.
Chapter 3 Coding Theory.

Chapter 3 Coding Theory.
Maximum Likelihood We have studied the OLS estimator. It only applies under certain assumptions In particular,  ~ N(0, 2 ) But what if the sampling distribution.

Maximum Likelihood We have studied the OLS estimator. It only applies under certain assumptions In particular,  ~ N(0, 2 ) But what if the sampling distribution.
Common Voting Rules as Maximum Likelihood Estimators Vincent Conitzer and Tuomas Sandholm Carnegie Mellon University, Computer Science Department.

Common Voting Rules as Maximum Likelihood Estimators Vincent Conitzer and Tuomas Sandholm Carnegie Mellon University, Computer Science Department.
Chapter 11 Integration Information Instructor: Prof. G. Bebis Represented by Reza Fall 2005.

Chapter 11 Integration Information Instructor: Prof. G. Bebis Represented by Reza Fall 2005.
Preference Functions That Score Rankings and Maximum Likelihood Estimation Vincent Conitzer Matthew Rognlie Lirong Xia Duke University Thanks (at least)

Preference Functions That Score Rankings and Maximum Likelihood Estimation Vincent Conitzer Matthew Rognlie Lirong Xia Duke University Thanks (at least)
Error Correcting Codes To detect and correct errors Adding redundancy to the original message Crucial when it’s impossible to resend the message (interplanetary.

Error Correcting Codes To detect and correct errors Adding redundancy to the original message Crucial when it’s impossible to resend the message (interplanetary.

Similar presentations

Ads by Google