Yuanzhi Li
with Bubeck · 2017
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 2 researchers here, as inferred from the citation graph.
Whom Yuanzhi Li trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Yuanzhi Li overall
Papers from Yuanzhi Li's perspective
Ordered by how strongly the researchers Yuanzhi Li trusts endorse each paper. Same corpus, a different order for every researcher.
- Minimax Policies for Adversarial and Stochastic Bandits
- Better Algorithms for Benign Bandits
- Convex Optimization: Algorithms and Complexity
- Towards Minimax Policies for Online Linear Optimization with Bandit Feedback
- Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization (Annual Conference Computational Learning Theory)
- Efficient algorithms for online decision problems
- Some aspects of the sequential design of experiments
- Combinatorial Bandits
- A decision-theoretic generalization of on-line learning and an application to boosting
- Tracking the Best Expert
Their papers
- Sparsity, variance and curvature in multi-armed bandits (2017) — 68 citations