arXiv:2610. 00545v1 Announce Type: new Abstract: We study adversarial online maximization of nonnegative, non-monotone DR-submodular functions over compact convex down-closed sets.
By Vaneet Aggarwal
arXiv:2610.00545v2 Announce Type: replace
Abstract: We study online and offline maximization of nonnegative, non-monotone DR-submodular functions over compact convex down-closed sets $K\subseteq[0,1]...
By Vaneet Aggarwal, Yiyang Lu
arXiv:2608.12134v2 Announce Type: replace-cross
Abstract: We study nonnegative submodular maximization on $n$ elements subject to a general matroid of rank $k$, when the offline algorithm is given an...
By Vaneet Aggarwal
arXiv:2609.24569v1 Announce Type: cross
Abstract: Over the past decade, a growing body of research has shown that $\gamma$-weak submodularity broadly arises in numerous subset selection tasks, includ...
By Shi Fu, Youming Qiao, Dacheng Tao, Zongqi Wan, Qixin Zhang
arXiv:2609. 20701v1 Announce Type: cross Abstract: We study efficient algorithms for realizing the first-order oracle complexity of optimization of $G$-Lipschitz convex functions with respect to the $\ell_{q}$-norm over an $\ell_{p}$-ball of radius $R$, where $1\leq p,q\leq \infty$.
By David Mart\'inez-Rubio, Crist\'obal Guzm\'an
arXiv:2608. 12134v1 Announce Type: cross Abstract: We study nonnegative submodular maximization subject to a general matroid when the offline algorithm is given an arbitrary controlled value oracle.
By Vaneet Aggarwal