arXiv (All)
open access
Nonsmooth Nonconvex Optimization from Noisy Comparisons: Unbiased Gap Estimation and the Price of Preference Feedback
We study the minimization of $L$-Lipschitz, possibly nonsmooth and nonconvex $f:R^d\to R$ from noisy pairwise comparisons: comparing $x$ and $y$ returns a bit equal to $1$ with probability $σ((f(y)-f(x))/τ)$, for a known link $σ$ and temperature $τ$, and the goal is a $(δ,ε)$-Goldstein stationary po
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
- The Complexity of Finding Stationary Points in Nonsmooth Nonconvex Optimization#1011501
- Learning While Scheduling Jobs under Context-Dependent Service Rates: An Anytime Rate-Optimal Algorithm#1202425
- Bandits in Prod: Hyperparameter Optimization at Inference Time#924666
- Bandits in Prod: Hyperparameter Optimization at Inference Time#920432
- Improved Sublinear Algorithms for Maximal Independent Set and Metric Steiner Forest#1202472
Record · ID 1298045
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