DeepAI AI Chat
Log In Sign Up

Approximate F_2-Sketching of Valuation Functions

by   Grigory Yaroslavtsev, et al.
Indiana University

We study the problem of constructing a linear sketch of minimum dimension that allows approximation of a given real-valued function f F_2^n → R with small expected squared error. We develop a general theory of linear sketching for such functions through which we analyze their dimension for most commonly studied types of valuation functions: additive, budget-additive, coverage, α-Lipschitz submodular and matroid rank functions. This gives a characterization of how many bits of information have to be stored about the input x so that one can compute f under additive updates to its coordinates. Our results are tight in most cases and we also give extensions to the distributional version of the problem where the input x ∈F_2^n is generated uniformly at random. Using known connections with dynamic streaming algorithms, both upper and lower bounds on dimension obtained in our work extend to the space complexity of algorithms evaluating f(x) under long sequences of additive updates to the input x presented as a stream. Similar results hold for simultaneous communication in a distributed setting.


page 1

page 2

page 3

page 4


Estimating the Nash Social Welfare for coverage and other submodular valuations

We study the Nash Social Welfare problem: Given n agents with valuation ...

Learning Valuation Functions

In this paper we study the approximate learnability of valuations common...

On Additive Approximate Submodularity

A real-valued set function is (additively) approximately submodular if i...

The Complexity of Partial Function Extension for Coverage Functions

Coverage functions are an important subclass of submodular functions, fi...

Optimality of Linear Sketching under Modular Updates

We study the relation between streaming algorithms and linear sketching ...

FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives

We design a fixed-parameter deterministic algorithm for computing a maxi...

On the Approximation Power of Two-Layer Networks of Random ReLUs

This paper considers the following question: how well can depth-two ReLU...