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...
The paper establishes a general minimax regret lower bound of Ω(√{Tγ_T/ log T}) for kernel bandits with non‑constant continuous kernels on compact domains, matching existing upper bounds up to logarithmic factors. It shows that this log factor is unavoidable in general but can be removed under specific conditions. Consequently, the optimal scaling is exactly Θ(√{Tγ_T}) for several common kernels, including Matérn‑ν (ν∈(0,2)), γ‑exponential (γ∈(0,2)), and certain piecewise‑polynomial kernels.
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.
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...
arXiv:2610. 04049v2 Announce Type: replace-cross Abstract: We study the maximization of a nonnegative $k$-submodular function, not assumed monotone, in which each of $n$ elements receives one of $k\ge2$ labels or stays unselected and the selected elements must satisfy a constraint.
arXiv:2608. 26515v1 Announce Type: cross Abstract: We study online prediction for a specific finite-alphabet, exogenously driven source with infinite input memory.
arXiv:2609.06327v2 Announce Type: replace-cross Abstract: A query-oblivious coreset for a softmax-attention head is a subset of the key-value pairs whose attention output is within $\varepsilon$ of t...
arXiv:2608.30254v1 Announce Type: new Abstract: We resolve the threshold part of Question 4 of the COLT 2025 open problem "Data Selection for Regression Tasks" of Hanneke, Moran, Shlimovich and Yehud...
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]...
We prove the gap-entropy conjecture for fixed-confidence best-arm identification with independent unit-variance Gaussian arms, means in $[0,1]$, and a unique optimal arm. For each suboptimal arm $i$,...
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.
arXiv:2609. 20687v1 Announce Type: cross Abstract: We study first-order black-box convex optimization over an $\ell_p$-ball for objectives Lipschitz in the $\ell_q$-norm, solving in the affirmative the nonsmooth version of the COLT open question (Guz15b) on whether the geometry of a smaller feasible set ($p < q$) can improve convergence rates in convex optimization, and matching prior lower bounds up to logarithmic factors.