Mark Sellke
10 papers · 2020–2024 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
🌉 Interdisciplinary Bridge · Silver 🌍 Conference Polyglot · Bronze 🗺️ Taxonomy Completionist (24) 🐣 Hot Topic Early Bird 🗃️ Keyword Collector (51)
🔥
Unstoppable · Bronze
💎
Century Club · Bronze
Venues
Top co-authors
Research topics
Keywords
multi-armed bandit
(6)
regret bound
(4)
collision avoidance
(2)
thompson sampling
(2)
sample complexity
(1)
pac learning
(1)
domain generalization
(1)
low-rank approximation
(1)
attention mechanism
(1)
distribution matching
(1)
mutual information
(1)
stochastic process
(1)
low-rank matrix
(1)
neural network optimization
(1)
stochastic mirror descent
(1)
pareto optimality
(1)
bayesian regret
(1)
feature matching
(1)
robustness
(1)
combinatorial optimization
(1)
Papers
Metric Transforms and Low Rank Representations of Kernels for Fast Attention
NeurIPS 2024
No Free Prune: Information-Theoretic Barriers to Pruning at Initialization
ICML 2024
Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed Bandits
NeurIPS 2023
Incentivizing Exploration with Linear Contexts and Combinatorial Actions
ICML 2023
Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environments
NeurIPS 2022
The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication
COLT 2022
A Universal Law of Robustness via Isoperimetry
NeurIPS 2021
Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions
COLT 2021
First-Order Bayesian Regret Analysis of Thompson Sampling
ALT 2020
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without
COLT 2020