arXiv (All)
open access
Geometry-Dependent Bounds for Online Non-Monotone DR-Submodular Maximization
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 prove a comparator-uniform first-order inequality
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach#974311
- Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization#1144705
- Online Non-Monotone DR-Submodular Maximization Matching the Offline $0.401$ Factor#822542
- Submodular Maximization under Supermodular Constraint: Greedy Guarantees#614921
- Submodular Maximization under Supermodular Constraint: Greedy Guarantees#613954
Record · ID 1155480
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive