Beyond Worst-Case Analysis

by   Tim Roughgarden, et al.
Stanford University

In the worst-case analysis of algorithms, the overall performance of an algorithm is summarized by its worst performance on any input. This approach has countless success stories, but there are also important computational problems --- like linear programming, clustering, online caching, and neural network training --- where the worst-case analysis framework does not provide any helpful advice on how to solve the problem. This article covers a number of modeling methods for going beyond worst-case analysis and articulating which inputs are the most relevant.


page 1

page 2

page 3

page 4


Beyond the Worst-Case Analysis of Algorithms (Introduction)

One of the primary goals of the mathematical analysis of algorithms is t...

Algorithms with Predictions

We introduce algorithms that use predictions from machine learning appli...

Constant RMR Recoverable Mutex under System-wide Crashes

We design two Recoverable Mutual Exclusion (RME) locks for the system-wi...

Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model

The problem of evacuating two robots from the disk in the face-to-face m...

Beyond Worst-case Analysis of Multicore Caching Strategies

Every processor with multiple cores sharing a cache needs to implement a...

Worst-Case Dynamic Power Distribution Network Noise Prediction Using Convolutional Neural Network

Worst-case dynamic PDN noise analysis is an essential step in PDN sign-o...

PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python

PEPit is a Python package aiming at simplifying the access to worst-case...

Please sign up or login with your details

Forgot password? Click here to reset