arXiv (All)
open access
Online Non-Monotone DR-Submodular Maximization Matching the Offline $0.401$ Factor
We study online maximization of nonnegative, non-monotone DR-submodular functions over compact convex down-closed subsets of the $d$-dimensional unit cube. The best known constructive offline approximation factor is $0.401$ under the corresponding meta-solvability assumptions, whereas comparable adv
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
- Geometry-Dependent Bounds for Online Non-Monotone DR-Submodular Maximization#1155480
- Submodular Welfare under Routing Coupling: A Hierarchical Decomposition with Perturbation Guarantees#984665
- Matching Higher-Order Oracle Complexity for Smooth Monotone Variational Inequalities#1071248
- A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization#179082
- Complexities of Weak Proximal Oracle Methods for Composite Convex Optimization#1050601
Record · ID 822542
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