Search papers, labs, and topics across Lattice.
Affiliation:
7
0
7
4
Achieving a $0.401$ online approximation factor for non-monotone DR-submodular maximization could redefine expectations for online optimization in adversarial settings.
A previously observed performance gain in interactive agents disappears under rigorous confirmation testing, challenging the reliability of existing evaluation benchmarks.
The minimax cumulative-regret scale reveals that even minor adjustments in input memory can lead to vastly different prediction outcomes.
The Spiteful Greedy Swap Poisson Process retains its approximation guarantees even in adversarial environments, paving the way for robust online learning in submodular settings.
Achieving universal dynamic regret in online convex optimization without any prior knowledge of problem parameters could redefine the landscape of adaptive algorithms under heavy-tailed noise.
Achieving a total-sample rate improvement from $T^{-1/4+o(1)}$ to $T^{-1/2+o(1)}$ could redefine efficiency benchmarks in stochastic approximation methods.
Achieving near-optimal regret in continuous dueling bandits is now possible with just logarithmic space complexity, opening the door to efficient exploration in complex comparative decision-making problems.
