Yi-Te Hong
Artificial Intelligence · 2017
A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 5 citations into it
- Management Science and Operations Research — 5 citations into it
Whom Yi-Te Hong trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Yi-Te Hong overall
Papers from Yi-Te Hong's perspective
Ordered by how strongly the researchers Yi-Te Hong trusts endorse each paper. Same corpus, a different order for every researcher.
- The Nonstochastic Multiarmed Bandit Problem
- On Upper-Confidence Bound Policies for Switching Bandit Problems (International Conference on Algorithmic Learning Theory)
- Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
- Empirical Bernstein Bounds and Sample-Variance Penalization
- Non-Stationary Stochastic Optimization
- Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards (Neural Information Processing Systems)
- Some aspects of the sequential design of experiments
- Asymptotically efficient adaptive allocation rules
- Multi-armed Bandit Allocation Indices
- Asymptotically Efficient Adaptive Allocation Rules
Their papers
- Tracking the Best Expert in Non-stationary Stochastic Environments (2017) — 65 citations