Conceptio
›
Archive
›
arXiv (All)
arXiv (All)
open access
Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
Farzin, Amir Ali et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗
Direct PDF ↓
numerical-analysis
optimization-and-control
optimization and control, machine learning, numerical analysis
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Related documents
Are Human-Aligned Models Models of Humans? A Turing-Test Gap in Preference Alignment
#1052296
ELIPPS: Exact Learning for Inverse Problems from Partial Self-supervision
#1052297
Density-Ratio Rescoring for Imbalanced Classification Using Raking Duals and Classifier Scores
#1052300
Record
· ID 974311
Retrieved via
Conceptio
— every document is proof-bundled with source, license, and retrieval metadata.