arxiv
PublishedOctober 3, 2026 at 4:00 AM
—neutral
Geometry-Dependent Bounds for Online Non-Monotone DR-Submodular Maximization
Publisher summary· verbatim
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. A learner commits each action before observing its objective and competes with the best fixed action in hindsight. We pr
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSequential Capacity of Quantum Processes with Finite Memory16harxivQ-MINO: A Minimal-Norm Method for Quantization-Aware Training16harxivThe Price of Correlated Tests: How Strict Should a Model Release Gate Be?16harxivOpen Vocabulary Word Recognition From Transcribed Bangla Texts16hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗