Top Banner
+ Probabilistic Accuracy Bounds @aysylu22 October 28, 2015 Papers We Love Too
36

Probabilistic Accuracy Bounds @ Papers We Love SF

Jan 19, 2017

Download

Software

Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Probabilistic Accuracy Bounds @ Papers We Love SF

+

Probabilistic Accuracy Bounds

@aysylu22 October 28, 2015

Papers We Love Too

Page 2: Probabilistic Accuracy Bounds @ Papers We Love SF

+Aysylu Greenberg

@aysylu22 http://aysy.lu

Page 3: Probabilistic Accuracy Bounds @ Papers We Love SF

+Papers We Love NYC

Page 4: Probabilistic Accuracy Bounds @ Papers We Love SF

+Today

Page 5: Probabilistic Accuracy Bounds @ Papers We Love SF

+

https://www.youtube.com/watch?v=1o9RGnujlkI

Page 6: Probabilistic Accuracy Bounds @ Papers We Love SF

+Inaccuracy is OK in Some Domains

n Monte Carlo

n Video/audio encoder/decoder

n Reed-Solomon codes

n Robust statistical techniques

n Near-realistic visualization of collision detection

Page 7: Probabilistic Accuracy Bounds @ Papers We Love SF

+Benefit of Inaccurate Computations

n Latency reduction

n Working around small failures

n Reducing utilization of compute resource power

n Resilient to software errors

Page 8: Probabilistic Accuracy Bounds @ Papers We Love SF

+

Andy Warhol

Page 9: Probabilistic Accuracy Bounds @ Papers We Love SF

+

Page 10: Probabilistic Accuracy Bounds @ Papers We Love SF

+MapReduce:

Warholfaux Gallery Showing

Reduce

Map

Input

Map

Input

Map

Input

Page 11: Probabilistic Accuracy Bounds @ Papers We Love SF

+

Christopher Wool

Page 12: Probabilistic Accuracy Bounds @ Papers We Love SF

+

Page 13: Probabilistic Accuracy Bounds @ Papers We Love SF

+

Page 14: Probabilistic Accuracy Bounds @ Papers We Love SF

+

FAILED CRITICALITY TEST

Page 15: Probabilistic Accuracy Bounds @ Papers We Love SF

+Criticality Test

n Will corrupt data consumed by the next task block n Null pointer type corruption

n Wrong or incomplete data distorts results downstream “too much”

n “Too much” = if 10% of tasks failed and n No output OR n Computed distortion > 0.1

Page 16: Probabilistic Accuracy Bounds @ Papers We Love SF

+Distortion

•  For each input: •  measure the difference between

correct output and observed output, •  scale it by correct output value for

meaningful comparison across different inputs.

•  Sum over all inputs •  Divide by total number of samples.

Page 17: Probabilistic Accuracy Bounds @ Papers We Love SF

+Obtaining a Model

n Linear least-squares regression

Page 18: Probabilistic Accuracy Bounds @ Papers We Love SF

+Distortion Model

•  Given n failable tasks, model is sum of terms where each term consists of: •  least-squares coefficient for

regression, •  95% confidence intervals for the

coefficients •  non-zero 0th term coefficient indicates

different modes for small vs large task failure rates

Page 19: Probabilistic Accuracy Bounds @ Papers We Love SF

+Good Statistical Properties

in Layman’s Terms

n Linear least-squares regression

n R2 = how much of the variation in the data the model accounts for

n confidence interval = range of values from training set that is likely to explain the distribution

n F value = how well model explains the data

Page 20: Probabilistic Accuracy Bounds @ Papers We Love SF

+Simulations

n Water

Page 21: Probabilistic Accuracy Bounds @ Papers We Love SF

+Simulations

n Water

n Search

Page 22: Probabilistic Accuracy Bounds @ Papers We Love SF

+Simulations

n Water

n Search

n SOR

Page 23: Probabilistic Accuracy Bounds @ Papers We Love SF

+Simulations

n Water

n Search

n SOR

n String

Page 24: Probabilistic Accuracy Bounds @ Papers We Love SF

+String

Shoot rays Put results into storage

Create data structures

Deallocate data

structures

Compute new model

Page 25: Probabilistic Accuracy Bounds @ Papers We Love SF

+String

Shoot rays Put results into storage

Create data structures

Deallocate data

structures

Compute new model

Page 26: Probabilistic Accuracy Bounds @ Papers We Love SF

+Distortion Model

Page 27: Probabilistic Accuracy Bounds @ Papers We Love SF

+Time Model

Page 28: Probabilistic Accuracy Bounds @ Papers We Love SF

+Distortion & Time Model

n  Distortion:

n  Time:

n Ratio: 0.053/-0.50

= -0.106

n  Distortion:

n  Time:

n Ratio: 0.54 / -0.004

= -135

1st failable task x1 4th failable task x4

Page 29: Probabilistic Accuracy Bounds @ Papers We Love SF

+Amdahl’s Law

Theoretical Maximum Speedup Parallelization Speedup

Page 30: Probabilistic Accuracy Bounds @ Papers We Love SF

+Jade

n Portable, implicitly parallel language designed for exploiting task-level concurrency n Start with a program written in a serial, imperative

language n  Jade constructs to declare how parts of the program

access data

n  Jade implementation uses data access information to automatically extract the concurrency and map the application onto the machine

n Extension to C

http://people.csail.mit.edu/rinard/paper/toplas98.pdf

Page 31: Probabilistic Accuracy Bounds @ Papers We Love SF

+Computing with

Bounded Inaccuracies

n Purposeful failure of tasks to reduce execution time

Page 32: Probabilistic Accuracy Bounds @ Papers We Love SF

+

Page 33: Probabilistic Accuracy Bounds @ Papers We Love SF

+Computing with

Bounded Inaccuracies

n Purposeful failure of tasks to reduce execution time

n Simplified implementation resilient to software errors that avoids expensive handling of edge cases

n More focus on failure detection and repair mechanisms

Page 34: Probabilistic Accuracy Bounds @ Papers We Love SF

+References

n Practical Probabilistic Programming

Page 35: Probabilistic Accuracy Bounds @ Papers We Love SF

+References

n Practical Probabilistic Programming

n  Jade design: http://people.csail.mit.edu/rinard/paper/toplas98.pdf

n Distributed Information Processing in Biological and Computational Systems: http://m.cacm.acm.org/magazines/2015/1/181614-distributed-information-processing-in-biological-and-computational-systems/fulltext

n Loop perforation: http://people.csail.mit.edu/rinard/paper/fse11.pdf

n Confidence intervals: http://blog.minitab.com/blog/adventures-in-statistics/when-should-i-use-confidence-intervals-prediction-intervals-and-tolerance-intervals

Page 36: Probabilistic Accuracy Bounds @ Papers We Love SF

+

Probabilistic Accuracy Bounds

@aysylu22 October 28, 2015

Papers We Love Too