Mark Sellke

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 57

Top Topics

Sample Complexity

Top Venues

Publications

Tanishq Kumar, Kevin Luo, Mark Sellke
No Free Prune: Information-Theoretic Barriers to Pruning at Initialization. CoRR (2024)
Mark Sellke
On Size-Independent Sample Complexity of ReLU Networks. CoRR (2023)
Ofer Grossman, Meghal Gupta, Mark Sellke
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. CoRR (2023)
Mark Sellke
Incentivizing Exploration with Linear Contexts and Combinatorial Actions. ICML (2023)
Ofer Grossman, Meghal Gupta, Mark Sellke
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. FOCS (2023)
Brice Huang, Mark Sellke
Algorithmic Threshold for Multi-Species Spherical Spin Glasses. CoRR (2023)
Mark Sellke
Incentivizing Exploration with Linear Contexts and Combinatorial Actions. CoRR (2023)
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
Competitively Chasing Convex Bodies. SIAM J. Comput. 52 (1) (2023)
Mark Sellke, Aleksandrs Slivkins
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity. Oper. Res. 71 (5) (2023)
Ahmed El Alaoui, Andrea Montanari, Mark Sellke
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree. Random Struct. Algorithms 63 (3) (2023)
Sébastien Bubeck, Mark Sellke
A Universal Law of Robustness via Isoperimetry. J. ACM 70 (2) (2023)
Xiao-Yue Gong, Mark Sellke
Asymptotically Optimal Pure Exploration for Infinite-Armed Bandits. CoRR (2023)
Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke
When Does Adaptivity Help for Quantum State Learning? FOCS (2023)
Sébastien Bubeck, Mark Sellke
First-Order Bayesian Regret Analysis of Thompson Sampling. IEEE Trans. Inf. Theory 69 (3) (2023)
Evelyn Xiao-Yue Gong, Mark Sellke
Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed Bandits. NeurIPS (2023)
Ahmed El Alaoui, Andrea Montanari, Mark Sellke
Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization. FOCS (2022)
Allen Liu, Mark Sellke
The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication. COLT (2022)
Ahmed El Alaoui, Andrea Montanari, Mark Sellke
Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization. CoRR (2022)
Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke
Tight Bounds for State Tomography with Incoherent Measurements. CoRR (2022)
Yining Chen, Elan Rosenfeld, Mark Sellke, Tengyu Ma, Andrej Risteski
Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environments. NeurIPS (2022)
Brice Huang, Mark Sellke
Tight Lipschitz Hardness for optimizing Mean Field Spin Glasses. FOCS (2022)
Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
Exact Minimum Number of Bits to Stabilize a Linear System. IEEE Trans. Autom. Control. 67 (10) (2022)
Allen Liu, Mark Sellke
The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication. CoRR (2022)
Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits. IEEE Trans. Inf. Theory 67 (4) (2021)
Yining Chen, Elan Rosenfeld, Mark Sellke, Tengyu Ma, Andrej Risteski
Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environments. CoRR (2021)
Sébastien Bubeck, Yuval Rabani, Mark Sellke
Online Multiserver Convex Chasing and Optimization. SODA (2021)
Ahmed El Alaoui, Andrea Montanari, Mark Sellke
Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree. CoRR (2021)
Mark Sellke, Aleksandrs Slivkins
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity. EC (2021)
Brice Huang, Mark Sellke
Tight Lipschitz Hardness for Optimizing Mean Field Spin Glasses. CoRR (2021)
Sébastien Bubeck, Thomas Budzinski, Mark Sellke
Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions. COLT (2021)
Sébastien Bubeck, Mark Sellke
A Universal Law of Robustness via Isoperimetry. NeurIPS (2021)
Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke
Metrical Service Systems with Transformations. ITCS (2021)
Sébastien Bubeck, Mark Sellke
A Universal Law of Robustness via Isoperimetry. CoRR (2021)
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. SODA (2021)
Sébastien Bubeck, Mark Sellke
First-Order Bayesian Regret Analysis of Thompson Sampling. ALT (2020)
Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke
Metrical Service Systems with Transformations. CoRR (2020)
Ahmed El Alaoui, Mark Sellke
Algorithmic pure states for the negative spherical perceptron. CoRR (2020)
Timothy Chu, Gary L. Miller, Shyam Narayanan, Mark Sellke
Functions that Preserve Manhattan Distances. CoRR (2020)
Sébastien Bubeck, Yuval Rabani, Mark Sellke
Online Multiserver Convex Chasing and Optimization. CoRR (2020)
Sébastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li, Mark Sellke
Chasing Nested Convex Bodies Nearly Optimally. SODA (2020)
Mark Sellke
Chasing Convex Bodies Optimally. SODA (2020)
Sébastien Bubeck, Yuanzhi Li, Yuval Peres, Mark Sellke
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. COLT (2020)
Mark Sellke, Aleksandrs Slivkins
Sample Complexity of Incentivized Exploration. CoRR (2020)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. CoRR (2020)
Sébastien Bubeck, Thomas Budzinski, Mark Sellke
Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions. CoRR (2020)
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
Competitively chasing convex bodies. STOC (2019)
Yang P. Liu, Richard Peng, Mark Sellke
Vertex Sparsifiers for c-Edge Connectivity. CoRR (2019)
Sébastien Bubeck, Mark Sellke
First-Order Regret Analysis of Thompson Sampling. CoRR (2019)
Mark Sellke
Chasing Convex Bodies Optimally. CoRR (2019)
Sébastien Bubeck, Yuanzhi Li, Yuval Peres, Mark Sellke
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. CoRR (2019)
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
Chasing Nested Convex Bodies Nearly Optimally. CoRR (2018)
Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
Exact minimum number of bits to stabilize a linear system. CoRR (2018)
Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
Stabilizing a system with an unbounded random gain using only a finite number of bits. CoRR (2018)
Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
Exact minimum number of bits to stabilize a linear system. CDC (2018)
Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
Stabilizing a System with an Unbounded Random Gain Using Only Finitely Many Bits. ISIT (2018)
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
Competitively Chasing Convex Bodies. CoRR (2018)
Boris Hanin, Mark Sellke
Approximating Continuous Functions by ReLU Nets of Minimal Width. CoRR (2017)