UCB-AA is a screening-enhanced UCB algorithm for bandits with arriving arms that delivers arrival-dependent regret bounds and sublinear dynamic regret under gap regularity conditions.
Zelen , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Standard observables fail to support delegation-scoped attribution in agentic AI systems, requiring a new gateway and common information model to bind context at execution time.
citing papers explorer
-
Multi-Armed Bandits with Arriving Arms: Sequential Screening, Dynamic Regret, and Sublinear Guarantees
UCB-AA is a screening-enhanced UCB algorithm for bandits with arriving arms that delivers arrival-dependent regret bounds and sublinear dynamic regret under gap regularity conditions.
-
Observability for Delegated Execution in Agentic AI Systems
Standard observables fail to support delegation-scoped attribution in agentic AI systems, requiring a new gateway and common information model to bind context at execution time.