arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.12574math.OCcs.CR
收藏

连续次模函数的一个最优化问题

An optimization problem for continuous submodular functions

Laszlo Csirmaz

摘要:

实连续次模函数作为离散函数概念在连续域上的推广,近年来得到了广泛的关注。熵函数的类似概念需要额外的性质:定义在$\mathbb R^n$的非负正交上的实函数是类熵(EL)的,如果它是次模的,在零处取零,非减,并且具有递减返回属性。受多方秘密共享的Shannon复杂性问题的启发,考虑了以下一般最优化问题的一个特例:求满足一定约束条件的EL函数的最小代价.在我们的特殊情况下,EL函数的成本是$n$偏导数在零处的最大值。另一种可能性是函数值域的上确界。约束条件由光滑有界曲面$S$截断向下的闭子集指定。如果在$S$的内部点处,函数的左和右偏导数至少相差1,则EL函数是可行的。最小代价的一般下界是根据曲面$S$的法线给出的。当$S$是线性的时,该界限是紧的。在二维情况下,对于凸或凹$S$,相同的界限是紧的。它表明,最佳EL函数不一定是唯一的。本文最后提出了几个开放的问题。

英文摘要:

Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real function defined on the non-negative orthant of $\mathbb R^n$ is entropy-like (EL) if it is submodular, takes zero at zero, non-decreasing, and has the Diminishing Returns property. Motivated by problems concerning the Shannon complexity of multipartite secret sharing, a special case of the following general optimization problem is considered: find the minimal cost of those EL functions which satisfy certain constraints. In our special case the cost of an EL function is the maximal value of the $n$ partial derivatives at zero. Another possibility could be the supremum of the function range. The constraints are specified by a smooth bounded surface $S$ cutting off a downward closed subset. An EL function is feasible if at the internal points of $S$ the left and right partial derivatives of the function differ by at least one. A general lower bound for the minimal cost is given in terms of the normals of the surface $S$. The bound is tight when $S$ is linear. In the two-dimensional case the same bound is tight for convex or concave $S$. It is shown that the optimal EL function is not necessarily unique. The paper concludes with several open problems.

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

↑