The Query Complexity of Certification

01/19/2022
by   Guy Blanc, et al.
0

We study the problem of certification: given queries to a function f : {0,1}^n →{0,1} with certificate complexity ≤ k and an input x^⋆, output a size-k certificate for f's value on x^⋆. This abstractly models a central problem in explainable machine learning, where we think of f as a blackbox model that we seek to explain the predictions of. For monotone functions, a classic local search algorithm of Angluin accomplishes this task with n queries, which we show is optimal for local search algorithms. Our main result is a new algorithm for certifying monotone functions with O(k^8 log n) queries, which comes close to matching the information-theoretic lower bound of Ω(k log n). The design and analysis of our algorithm are based on a new connection to threshold phenomena in monotone functions. We further prove exponential-in-k lower bounds when f is non-monotone, and when f is monotone but the algorithm is only given random examples of f. These lower bounds show that assumptions on the structure of f and query access to it are both necessary for the polynomial dependence on k that we achieve.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/04/2022

An Optimal Algorithm for Certifying Monotone Functions

Given query access to a monotone function f{0,1}^n→{0,1} with certificat...
research
07/14/2022

A Query-Optimal Algorithm for Finding Counterfactuals

We design an algorithm for finding counterfactuals with strong theoretic...
research
07/29/2020

Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents

We consider the ε-Consensus-Halving problem, in which a set of heterogen...
research
03/21/2020

Black-box Methods for Restoring Monotonicity

In many practical applications, heuristic or approximation algorithms ar...
research
04/14/2019

Approximating the noise sensitivity of a monotone Boolean function

The noise sensitivity of a Boolean function f: {0,1}^n →{0,1} is one of ...
research
02/14/2012

Noisy Search with Comparative Feedback

We present theoretical results in terms of lower and upper bounds on the...
research
03/25/2011

Distribution-Independent Evolvability of Linear Threshold Functions

Valiant's (2007) model of evolvability models the evolutionary process o...

Please sign up or login with your details

Forgot password? Click here to reset