arXiv 1702.040672017-02cs.DM

Submodular Goal Value of Boolean Functions

Eric Bach, Jeremie Dusart, Lisa Hellerstein, Devorah Kletenik

英文摘要：

Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the "goal value" of the function. The goal value of $f$ is defined in terms of a monotone, submodular utility function associated with $f$. As shown by Deshpande et al., proving that a Boolean function $f$ has small goal value can lead to a good approximation algorithm for the Stochastic Boolean Function Evaluation problem for $f$. Also, if $f$ has small goal value, it indicates a close relationship between two other measures of the complexity of $f$, its average-case decision tree complexity and its average-case certificate complexity. In this paper, we explore the goal value measure in detail. We present bounds on the goal values of arbitrary and specific Boolean functions, and present results on properties of the measure. We compare the goal value measure to other, previously studied, measures of the complexity of Boolean functions. Finally, we discuss a number of open questions provoked by our work.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

学习伪布尔k-DNF和次模函数

Learning pseudo-Boolean k-DNF and Submodular Functions

Pennsylvania State University（宾夕法尼亚州立大学）

We prove that any submodular function f: {0,1}^n -> {0,1,...,k} can be represented as a pseudo-Boolean 2k-DNF formula. Pseudo-Boolean DNFs are a natural generalization of DNF representation for functions with integer range. Each term in such a formula has an associated integral constant. We show that an analog of Hastad's switching lemma holds for pseudo-Boolean k-DNFs if all constants associated with the terms of the formula are bounded. This allows us to generalize Mansour's PAC- learning algorithm for k-DNFs to pseudo-Boolean k-DNFs, and hence gives a PAC- learning algorithm with membership…

2012-08-10cs.DMcs.DScs.LG

Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions

University of Utah（犹他大学）；Alan Turing Institute（艾伦图灵研究所）；University of Edinburgh（爱丁堡大学）；ETH Zurich（苏黎世联邦理工学院）；University of Oxford（牛津大学）

Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \log^2 n . E +n^4 {\log}^{O(1)} n)$ where $E$ is the time required to evaluate the function and $n$ is the number of variables \cite{Lee2015}. On the other hand, many computer vision and machine learning problems are defined over special subclasses of submodular functions that can be written as the sum of many submodular cost functions defined over cliques containing few variables. In suc…

2017-01-23cs.CVcs.DMcs.DS

二元次模函数的表示能力

The Expressive Power of Binary Submodular Functions

Oxford University（牛津大学）；Royal Holloway, University of London（伦敦大学皇家霍洛威学院）

它以前一直是一个开放的问题，是否所有的布尔子模函数可以分解成一个总和的二元子模函数在一个可能更大的一组变量。这个问题已经在计算机科学的几个不同的背景下被考虑过，包括计算机视觉，人工智能和伪布尔优化。使用值约束的表达能力和函数的某些代数性质之间的联系，我们否定地回答了这个问题。我们的结果有几个推论。首先，我们精确地确定了4元的哪些子模函数可以用二元子模函数表示。接下来，我们确定了一个新的类的子模函数的任意arities，可以表示为二进制子模函数，因此有效地最小化使用所谓的可表达性减少的最小割问题。更重要的是，我们的研究结果意味着这种减少的限制，并建立第一次，它不能被用来在一般情况下，以尽量减少任意次模函数。最后，我们驳斥了Promislow和Young关于布尔次模函数锥的极端射线结构的一个猜想。

2008-11-12cs.AIcs.CVcs.DM

避免分配格次模最小化中的指数爆炸

Avoiding Exponential Blow-Up in Distributive Lattice Submodular Minimization

Ishant Shanu

针对分配格上次模函数最小化中因布尔格变换导致的空间指数膨胀问题，提出仅在分配格内工作的通用框架，显著提升运行效率。

2026-06-16cs.CVcs.DM

子模块性是可测试的吗？

Is submodularity testable?

本文首先研究了布尔超立方体上的子模性质。次模函数在组合优化中有着广泛的应用。对于大量的算法，假设子模函数的预言存在。但是如何检验这个预言是否真的代表了一个子模函数呢？考虑函数f：{0，1}^n \rightarrow R。到子模的距离是需要修改以使f子模化的$f$的值的最小分数。如果这个距离大于0，那么我们说f是ε-远不是次模的。其目的是有一个有效的过程，给定的输入f是ε-远不是次模，证明f不是次模。我们分析了这个问题的一个非常自然的测试程序，并证明它在次指数时间内运行。这给出了子模块性的第一个非平凡测试器。另一方面，我们证明了一个有趣的下限（不幸的是，距离上限很远），表明这个测试器在epsilon方面不可能非常有效。这涉及到一些非平凡的函数例子，这些函数远离子模，但没有表现出太多的局部违规。我们还提供了一些结构，表明在设计一个测试子模块的困难。我们构造了一个定义在指数级多个点上的部分函数，这些点不能扩展为子模函数，但这些值的任何严格子集都可以扩展为子模函数。

2010-08-04cs.DMcs.DS

An Efficient Characterization of Submodular Spanning Tree Games

Cooperative games are an important class of problems in game theory, where the goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that assigns a value share to each player. A crucial aspect of such games is submodularity (or convexity). Indeed, convex instances of cooperative games exhibit several nice properties, e.g. regarding the existence and computation of allocations realizing some of the most important solution concepts proposed in the literature. For this reason, a relevant que…

2019-06-06cs.DMcs.GT

更多相关论文收起更多论文

从精确学习到计算布尔函数，然后再返回

From Exact Learning to Computing Boolean Functions and Back Again

Rutgers University（罗格斯大学）

本文的目标是与评估的布尔函数（证书的复杂性，决策树复杂性）和学习维度用于表征精确学习（教学维度，扩展教学维度）的复杂性措施。高层次的动机是发现一个未知概念的精确学习和测试一个未知概念是否是一个概念类的一部分之间的非平凡关系。具体地说，我们的目标是提供一个问题类型的复杂性度量的下限和上限。

2012-05-19cs.DMcs.LG

子模多路划分的近似算法

Approximation Algorithms for Submodular Multiway Partition

本文研究子模多路划分问题（SubMP）的算法。SubMP的一个实例由一个有限基集$V$、一个称为终端的$k$元素的子集$S = \{s_1,s_2,...,s_k\}$和一个作为值oracle提供的$V$上的非负子模集函数$f:2^V\rightarrow \mathbb{R}_+$组成。目标是将$V$划分为$k$集合$A_1,...,A_k$，使得对于$1 \le i \le k$、$s_i \in A_i$和$\sum_{i=1}^k f(A_i)$最小化。SubMP推广了一些著名的问题，如图和超图中的多路割问题，以及图中的节点加权多路割问题。Zhao，Nagamochi和Ibaraki \cite{ZhaoNI05}考虑了任意次模函数（而不仅仅是对称函数）的SubMP。以前的算法是基于贪婪的分裂和分而治之的策略。在最近的工作\cite{ChekuriE11}，我们提出了一个凸规划松弛SubMP的基础上的子模函数的Lovász-扩展，并显示其适用于某些特殊情况。在本文中，我们得到了以下结果任意次模函数通过这种松弛。(i)SubMP的2-近似。这改进了来自\cite{ZhaoNI05}的$(k-1)$ -近似和（ii）当$f$是对称的时用于SubMP的$(1.5-1/k)$ -近似。这改进了来自\cite{Queyranne99,ZhaoNI05}的$2(1-1/k)$近似。

2011-05-10cs.DMcs.DS

单调子模成本分配问题的近似算法

An Approximation Algorithm for Monotone Submodular Cost Allocation

Tokyo University of Agriculture and Technology（东京农工大学）

本文提出了一种针对单调子模成本分配问题的近似算法，证明了其整数规划间隙为k/2，并给出了几乎匹配的下界。

2026-09-17cs.DMcs.DS

Randomized Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem

This paper studies randomized approximation algorithm for a variant of the set cover problem called minimum submodular cost partial multi-cover (SCPMC), in which each element $e$ has a covering requirement $r_e$ and a profit $p_e$, and the cost function on sub-collection of sets is submodular, the goal is to find a minimum cost sub-collection of sets which fully covers at least $q$-percentage of total profit, where an element $e$ is fully covered by sub-collection $S'$ if and only if it belongs to at least $r_e$ sets of $\mathcal S'$. Previous work shows that such a combination enormously incr…

2017-02-01cs.DMcs.DS

Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism

A function $f\colon \{-1,1\}^n \to \{-1,1\}$ is a $k$-junta if it depends on at most $k$ of its variables. We consider the problem of tolerant testing of $k$-juntas, where the testing algorithm must accept any function that is $ε$-close to some $k$-junta and reject any function that is $ε'$-far from every $k'$-junta for some $ε'= O(ε)$ and $k' = O(k)$. Our first result is an algorithm that solves this problem with query complexity polynomial in $k$ and $1/ε$. This result is obtained via a new polynomial-time approximation algorithm for submodular function minimization (SFM) under large cardina…

2016-11-03cs.CCcs.DMcs.DS

面向RDNF的随机布尔函数分析

RDNF Oriented Analytics to Random Boolean Functions

本文围绕随机布尔函数的简化析取范式（RDNF）展开分析，研究布尔最小化问题的平均复杂度，构建模式识别逻辑分离分类算法基础，可应用于多个计算机科学领域。

2024-02-01cs.DM

偏序集到布尔格的弱嵌入

Weak embeddings of posets to the Boolean lattice

本文证明偏序集弱嵌入到小布尔格及其连续层级等变体问题均为NP完全，并等价推导出图嵌入超立方体两中间层级亦为NP完全。

2018-01-23cs.DMmath.CO

计算子模 utility 和 cost 交易的近似帕累托前沿

Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs

Boston University（波士顿大学）

本文提出了一种计算子模 utility 和 cost 交易近似帕累托前沿的框架，通过高效算法探索多种权衡方案，提升子模优化的实用性。

2026-09-10cs.DMcs.DScs.SI

Sequential Submodular Maximization and Applications to Ranking an Assortment of Products

We study a submodular maximization problem motivated by applications in online retail. A platform displays a list of products to a user in response to a search query. The user inspects the first $k$ items in the list for a $k$ chosen at random from a given distribution, and decides whether to purchase an item from that set based on a choice model. The goal of the platform is to maximize the engagement of the shopper defined as the probability of purchase. This problem gives rise to a less-studied variation of submodular maximization in which we are asked to choose an $\textit{ordering}$ of a s…

2022-10-20cs.DMcs.DScs.GT

On the power of choice for Boolean functions

In this paper we consider a variant of the well-known Achlioptas process for graphs adapted to monotone Boolean functions. Fix a number of choices $r\in \mathbb N$ and a sequence of increasing functions $(f_n)_{n\ge 1}$ such that, for every $n\ge 1$, $f_n:\{0,1\}^n\mapsto \{0,1\}$. Given $n$ bits which are all initially equal to 0, at each step $r$ 0-bits are sampled uniformly at random and are proposed to an agent. Then, the agent selects one of the proposed bits and turns it from 0 to 1 with the goal to reach the preimage of 1 as quickly as possible. We nearly characterize the conditions und…

2021-09-27cs.DMmath.CO

边缘-云环境中基于成本驱动的任务卸载与子模优化的算法学与计算复杂性

Algorithmics and Complexity of Cost-Driven Task Offloading with Submodular Optimization in Edge-Cloud Environments

本文研究边缘-云环境中成本驱动的任务卸载问题，提出通信假设并证明该问题可建模为子模最小化从而多项式可解，同时揭示其难度取决于通信假设是否成立。

2024-11-24cs.CCcs.DCcs.DM