Lower Bounds for Prior Independent Algorithms

07/10/2021
by   Jason Hartline, et al.
0

The prior independent framework for algorithm design considers how well an algorithm that does not know the distribution of its inputs approximates the expected performance of the optimal algorithm for this distribution. This paper gives a method that is agnostic to problem setting for proving lower bounds on the prior independent approximation factor of any algorithm. The method constructs a correlated distribution over inputs that can be generated both as a distribution over i.i.d. good-for-algorithms distributions and as a distribution over i.i.d. bad-for-algorithms distributions. Prior independent algorithms are upper-bounded by the optimal algorithm for the latter distribution even when the true distribution is the former. Thus, the ratio of the expected performances of the Bayesian optimal algorithms for these two decompositions is a lower bound on the prior independent approximation ratio. The techniques of the paper connect prior independent algorithm design, Yao's Minimax Principle, and information design. We apply this framework to give new lower bounds on several canonical prior independent mechanism design problems.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/28/2020

Benchmark Design and Prior-independent Optimization

This paper compares two leading approaches for robust optimization in th...
02/26/2021

Revelation Gap for Pricing from Samples

This paper considers prior-independent mechanism design, in which a sing...
05/06/2018

On Facility Location with General Lower Bounds

In this paper, we give the first constant approximation algorithm for th...
11/06/2015

Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice

We prove non-asymptotic lower bounds on the expectation of the maximum o...
05/29/2021

Towards a Rigorous Statistical Analysis of Empirical Password Datasets

In this paper we consider the following problem: given N independent sam...
11/08/2020

The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds

We propose differentially private algorithms for parameter estimation in...
11/18/2019

Finding Skewed Subcubes Under a Distribution

Say that we are given samples from a distribution ψ over an n-dimensiona...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.