Discussion: So Who Won. Announcements Looks like you’re turning in reviews… good! – Some of you are spending too much time on them!! Key points, what.

Slides:



Advertisements
Similar presentations
Finding a Research Topic Padma Raghavan CSE Penn State With credits to: Mary Jane Irwin, CSE Penn State and Kathy Yelick, EECS UC Berkeley.
Advertisements

CS Section 600 CS Section 002 Dr. Angela Guercio Spring 2010.
Incentivize Crowd Labeling under Budget Constraint
Evaluating Heuristics for the Fixed-Predecessor Subproblem of Pm | prec, p j = 1 | C max.
Chapter 17: The binomial model of probability Part 2
Analysis of Algorithms
Lecture 2. A Day of Principles The principle of virtual work d’Alembert’s principle Hamilton’s principle 1 (with an example that applies ‘em all at the.
ElasticTree: Saving Energy in Data Center Networks Brandon Heller, Srini Seetharaman, Priya Mahadevan, Yiannis Yiakoumis, Puneed Sharma, Sujata Banerjee,
David Luebke 1 5/4/2015 CS 332: Algorithms Dynamic Programming Greedy Algorithms.
FilterBoost: Regression and Classification on Large Datasets Joseph K. Bradley 1 and Robert E. Schapire 2 1 Carnegie Mellon University 2 Princeton University.
Best-First Search: Agendas
CSE 331 SOFTWARE DESIGN & IMPLEMENTATION TESTING II Autumn 2011.
Reviewing the work of others Referee reports. Components of a referee report Summary of the paper Overall evaluation Comments about content Comments about.
Getting an Experimental Idea Psych 231: Research Methods in Psychology.
Game Playing CSC361 AI CSC361: Game Playing.
Clock Synchronization Ken Birman. Why do clock synchronization?  Time-based computations on multiple machines Applications that measure elapsed time.
CSE 421 Algorithms Richard Anderson Lecture 6 Greedy Algorithms.
Preference Analysis Joachim Giesen and Eva Schuberth May 24, 2006.
CS121 Heuristic Search Planning CSPs Adversarial Search Probabilistic Reasoning Probabilistic Belief Learning.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
Traveling Salesman Problem Continued. Heuristic 1 Ideas? –Go from depot to nearest delivery –Then to delivery closest to that –And so on until we are.
CS 6190 Finding a Research Topic. The Thesis Equation Topic + Advisor = Dissertation.
Homework – Day 1 Read all of Chapter 1. As you read, answer the following questions. 1. Define economics. 2. Explain the “economic way of thinking,” including.
Advanced Research Methodology
Learning at Low False Positive Rate Scott Wen-tau Yih Joshua Goodman Learning for Messaging and Adversarial Problems Microsoft Research Geoff Hulten Microsoft.
EVALUATION David Kauchak CS 451 – Fall Admin Assignment 3 - change constructor to take zero parameters - instead, in the train method, call getFeatureIndices()
COLLABORATION MODULE #3 Planning Good Meetings An online module developed by Pivot Learning Partners for the West Contra Costa Unified School District.
Extension to ANOVA From t to F. Review Comparisons of samples involving t-tests are restricted to the two-sample domain Comparisons of samples involving.
Called as the Interval Scheduling Problem. A simpler version of a class of scheduling problems. – Can add weights. – Can add multiple resources – Can ask.
Homework – Day 1 Read p in Chapter 1. As you read, answer the following questions. 1. Define economics. 2. Identify and explain the three elements.
Group Recommendations with Rank Aggregation and Collaborative Filtering Linas Baltrunas, Tadas Makcinskas, Francesco Ricci Free University of Bozen-Bolzano.
The Scientific Method. The Scientific Method The Scientific Method is a problem solving-strategy. *It is just a series of steps that can be used to solve.
Why Do Funded Research?. We want/need to understand our world.
Nina H. Fefferman, Ph.D. Rutgers Univ. Balancing Workforce Productivity Against Disease Risks for Environmental and Infectious.
Software Engineering Experimentation Rules for Reviewing Papers Jeff Offutt See my editorials 17(3) and 17(4) in STVR
Treatment Learning: Implementation and Application Ying Hu Electrical & Computer Engineering University of British Columbia.
Statistics (cont.) Psych 231: Research Methods in Psychology.
Scalable Computing on Open Distributed Systems Jon Weissman University of Minnesota National E-Science Center CLADE 2008.
Models in I.E. Lectures Introduction to Optimization Models: Shortest Paths.
Finding a Dissertation/Thesis Topic Henri Casanova ICS Graduate Chair
Review: Tree search Initialize the frontier using the starting state While the frontier is not empty – Choose a frontier node to expand according to search.
Query Sensitive Embeddings Vassilis Athitsos, Marios Hadjieleftheriou, George Kollios, Stan Sclaroff.
How To Do NPV’s ©2007 Dr. B. C. Paul Note – The principles covered in these slides were developed by people other than the author, but are generally recognized.
Sorting: Implementation Fundamental Data Structures and Algorithms Klaus Sutner February 24, 2004.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
Lufthansa Looking for Feedback Performance Measurement in Revenue Management Stefan Pölt Lufthansa German Airlines AGIFORS Reservations & Yield Management.
De novo discovery of mutated driver pathways in cancer Discussion leader: Matthew Bernstein Scribe: Kun-Chieh Wang Computational Network Biology BMI 826/Computer.
CSCI1600: Embedded and Real Time Software Lecture 23: Real Time Scheduling I Steven Reiss, Fall 2015.
INFO 4990: Information Technology Research Methods Guide to the Research Literature Lecture by A. Fekete (based in part on materials by J. Davis and others)
Statistics Presentation Ch En 475 Unit Operations.
CSEP 521 Applied Algorithms Richard Anderson Winter 2013 Lecture 3.
CS 127 Exceptions and Decision Structures. Exception Handling This concept was created to allow a programmer to write code that catches and deals with.
Consensus Relevance with Topic and Worker Conditional Models Paul N. Bennett, Microsoft Research Joint with Ece Kamar, Microsoft Research Gabriella Kazai,
Chapter 11 Introduction to Computational Complexity Copyright © 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1.
Validity and utility of theoretical tools - does the systematic review process from clinical medicine have a use in conservation? Ioan Fazey & David Lindenmayer.
Human-powered Sorts and Joins. At a high level Yet another paper on crowd-algorithms – Probably the second to be published (so keep that in mind when.
INFOMGP Student names and numbers Papers’ references Title.
All Your Queries are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption Yupeng Zhang, Jonathan Katz, Charalampos Papamanthou University.
How to Really Review Papers CS 8803 AIC. Prvulovic: CORD 2 Paper Reviewing Algorithm Read the paper Think about it Take a look at related work Leave it.
By : Jack Kelenjian. Is a career in computers right for me? To determine if a career in computers is right for someone you need to identify what makes.
5. SERVING STEPS  Think of some ways and places you could serve God in the church or the youth group at Max age.  What ways do you personally want to.
Trading Timeliness and Accuracy in Geo-Distributed Streaming Analytics
Chapter 6: From Brainstorm to Topic
How to Really Review Papers
What to do when you don’t know anything know nothing
CAP 5636 – Advanced Artificial Intelligence
Topic 1: Problem Solving
Software Engineering Experimentation
CS249: Neural Language Model
Presentation transcript:

Discussion: So Who Won

Announcements Looks like you’re turning in reviews… good! – Some of you are spending too much time on them!! Key points, what was good, what was bad, anything you found interesting. Not necessarily a summary of the paper Not necessarily long “Think like a reviewer” – you have to – A) get the gist – B) say something intelligent/critical about the paper that other reviewers may not have pointed out. force you to think

Announcements Class schedule is up – Typically assigned Rank 1 or Rank 2 paper to you; in rare cases Rank 3 – Send presentations to Tarique 48 hrs in advance for feedback – You don’t need to do your class review when you’re the one presenting

Today’s paper Early days of crowdsourced algorithms – One of the first few papers in this space Motivation was derived from the design of database primitives for crowdsourcing – MAX, FILTER, SORT, … Makes it easier for database reviewers to accept the paper!

Today’s Paper An algorithmic paper Some hardness and #P-hardness proofs – Totally fine if you don’t get them – not the point – Completely understand that you may be coming in with different backgrounds (UG, HCI, Industrial Eng., Systems) Some heuristics to solve the problem – Hopefully most of you got these! Plenty of experimental takeaways

What to look out for in a crowd algorithms paper Error Model Question Model Objectives Problem Formulation Algorithms Experiments Realism Utility

Question Model: Crowdsourced Questions The paper uniformly uses pairwise comparisons between items as a “unit question” Are there other questions? Pros/Cons?

Question Model: Crowdsourced Questions The paper uniformly uses pairwise comparisons between items as a “unit question” Are there other questions? Pros/Cons? – Rating: fewer questions, more errors due to comparison O(n) vs O(n^2) – Compare multiple items and rank? Again tradeoff somewhere in terms of too many items to keep track of.

Error Model: Assumptions Were there any issues in the error model adopted by the paper?

Error Model: Assumptions Were there any issues in the error model adopted by the paper? A: Paper assumes that workers have a single error rate – need not be true B: Workers are assumed to be independent C: There is assumed to be a single true ranking

Objectives Three-way tradeoff between – Cost – Latency – Accuracy What do they optimize for? What do they mean by those quantities? What about other quantities?

Problem formulation Next Questions: Is the next questions problem formulation reasonable? Say, instead of a handful of additional questions, I’d like to schedule 1000 questions. Is it still reasonable?

Problem formulation Next Questions: Is the next questions problem formulation reasonable? Say, instead of a handful of additional questions, I’d like to schedule 1000 questions. Is it still reasonable? – Not really – may want to do a “decision tree” type approach.

Algorithms Most of the algorithms were adapted from literature in economics/social choice Q: were there other variants you’d have liked to have seen for the judgment problem?

Algorithms Most of the algorithms were adapted from literature in economics/social choice Q: were there other variants you’d have liked to have seen for the judgment problem? – What about: “two” hop instead of “one” hop = local? Combining information across these algorithms?

Algorithms Most of the algorithms were adapted from literature in economics/social choice Q: were there other variants you’d have liked to have seen for the next votes problem?

Algorithms Most of the algorithms were adapted from literature in economics/social choice Q: were there other variants you’d have liked to have seen for the next votes problem? – Pair, Max, Greedy, Round-Robin – What about something that quantifies the potential impact of each vote of changing the sort order? – What about repeatedly asking the top pair?

Experimental Results Did you find any issues with the experiments?

Experimental Results Did you find any issues with the experiments? Most of them were simulated Real experiments often reveal interesting insights – Always worth performing to check the realism of models – Or at least whether they lead to tangible benefits

What else? What else could the authors have done better?