Distributional Analysis

July 26, 2020 Β· Declared Dead Β· πŸ› Beyond the Worst-Case Analysis of Algorithms

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tim Roughgarden arXiv ID 2007.13240 Category cs.DS: Data Structures & Algorithms Citations 9 Venue Beyond the Worst-Case Analysis of Algorithms Last Checked 4 months ago
Abstract
In distributional or average-case analysis, the goal is to design an algorithm with good-on-average performance with respect to a specific probability distribution. Distributional analysis can be useful for the study of general-purpose algorithms on "non-pathological" inputs, and for the design of specialized algorithms in applications in which there is detailed understanding of the relevant input distribution. For some problems, however, pure distributional analysis encourages "overfitting" an algorithmic solution to a particular distributional assumption and a more robust analysis framework is called for. This chapter presents numerous examples of the pros and cons of distributional analysis, highlighting some of its greatest hits while also setting the stage for the hybrids of worst- and average-case analysis studied in later chapters.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted