arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.09554cs.LGstat.ML

Black-box Methods for Restoring Monotonicity

UW-Madison(威斯康星大学麦迪逊分校);Microsoft Research(微软研究院)

Evangelia Gergatsouli, Brendan Lucier, Christos Tzamos

英文摘要:

In many practical applications, heuristic or approximation algorithms are used to efficiently solve the task at hand. However their solutions frequently do not satisfy natural monotonicity properties of optimal solutions. In this work we develop algorithms that are able to restore monotonicity in the parameters of interest. Specifically, given oracle access to a (possibly non-monotone) multi-dimensional real-valued function $f$, we provide an algorithm that restores monotonicity while degrading the expected value of the function by at most $\varepsilon$. The number of queries required is at most logarithmic in $1/\varepsilon$ and exponential in the number of parameters. We also give a lower bound showing that this exponential dependence is necessary. Finally, we obtain improved query complexity bounds for restoring the weaker property of $k$-marginal monotonicity. Under this property, every $k$-dimensional projection of the function $f$ is required to be monotone. The query complexity we obtain only scales exponentially with $k$.

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

↑