Sahil Singla
with Bradač · 2019
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Sahil Singla trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Sahil Singla's perspective
Ordered by how strongly the researchers Sahil Singla trusts endorse each paper. Same corpus, a different order for every researcher.
- A multiple-choice secretary algorithm with applications to online auctions
- Adam: A Method for Stochastic Optimization (International Conference on Learning Representations)
- The Sample Complexity of Exploration in the Multi-Armed Bandit Problem (Journal of machine learning research)
- Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
- Information Theory: 1948-1998 - Guest Editorial
- The NP-Completeness Column: An Ongoing Guide
- Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
- The Budgeted Maximum Coverage Problem
- Using Confidence Bounds for Exploitation-Exploration Trade-offs
- Finite-time Analysis of the Multiarmed Bandit Problem
Their papers
- Robust Algorithms for the Secretary Problem (2019) — 26 citations