Title resolution pending

We examine 𝑓∗(x)=v 𝑇 xfor1000samples of v∼Normal( 0,𝐼), compute the sample proportion of settings𝑓∗ in which the iterative solution is optimal (specifically, if the loss of the iterative solution is within a tolerance of10−8 of the opt · 2025

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

representative citing papers

Designing Algorithmic Delegates: The Role of Indistinguishability in Human-AI Handoff

cs.GT · 2025-06-03 · conditional · novelty 7.0

Optimal AI delegation reduces to choosing which human categories the machine should retain, and this subset-selection problem is NP-hard in general yet polynomial in separable settings.

citing papers explorer

Showing 1 of 1 citing paper.

Designing Algorithmic Delegates: The Role of Indistinguishability in Human-AI Handoff cs.GT · 2025-06-03 · conditional · none · ref 6
Optimal AI delegation reduces to choosing which human categories the machine should retain, and this subset-selection problem is NP-hard in general yet polynomial in separable settings.

Title resolution pending

fields

years

verdicts

representative citing papers

citing papers explorer