An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits

Research article (Conference on Learning Theory, 2016) · cited 33× · AI/ML

academia openalex:W2963921604

Press Enter · cited answer in seconds

An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits

Summary

An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits is a scholarly article^[1].

Key Facts

An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits's instance of is recorded as scholarly article^[2].

⭐ Popularity Graph

0/100 long tail

Quick Facts

Instance of scholarly article

🔗 Connections

Authored by 1

Chao-Kai Chiang

← Author of 1

Chao-Kai Chiang

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

[2] ↑ An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits is an instance of scholarly article (scholarly article) [P31, primary]. Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA

4ort.xyz Knowledge Graph. (2026). An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-algorithm-with-nearly-optimal-pseudo-regret-for-both-stochastic-and-adversarial-bandits

MLA

“An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-algorithm-with-nearly-optimal-pseudo-regret-for-both-stochastic-and-adversarial-bandits.

BibTeX

@misc{4ortxyz_an-algorithm-with-nearly-optimal-pseudo-regret-for-both-stochastic-and-adversarial-bandits_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits}}, year = {2026}, url = {https://4ort.xyz/entity/an-algorithm-with-nearly-optimal-pseudo-regret-for-both-stochastic-and-adversarial-bandits}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits — https://4ort.xyz/entity/an-algorithm-with-nearly-optimal-pseudo-regret-for-both-stochastic-and-adversarial-bandits (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/an-algorithm-with-nearly-optimal-pseudo-regret-for-both-stochastic-and-adversarial-bandits · Last refreshed: May 24, 2026