Mark Sellke - RankMe

68 papers A* 20A 1B 2Journal 44Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Early science acceleration experiments with GPT-5. CoRR Sébastien Bubeck, Christian Coester, Ronen Eldan, Timothy Gowers, Yin Tat Lee, Alexandru Lupsasca, Mehtaab Sawhney, Robert Scherrer, Mark Sellke, Brian K. Spears, Derya Unutmaz, Kevin Weil, Steven Yin, Nikita Zhivotovskiy
2025	J	`jnl`	Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts. CoRR Benjamin Schiffer, Mark Sellke
2025	J	`jnl`	On Learning-Curve Monotonicity for Maximum Likelihood Estimators. CoRR Mark Sellke, Steven Yin
2025	J	`jnl`	Strong Low Degree Hardness for Stable Local Optima in Spin Glasses. CoRR Brice Huang, Mark Sellke
2025	J	`jnl`	Strong Low Degree Hardness for the Number Partitioning Problem. CoRR Rushil Mallarapu, Mark Sellke
2025	A*	`conf`	Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses. FOCS Mark Sellke
2025	J	`jnl`	Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses. CoRR Mark Sellke
2024	J	`jnl`	Improved Lower Bound for Frankl's Union-Closed Sets Conjecture. Electron. J. Comb. Ryan Alweiss, Brice Huang, Mark Sellke
2024	A*	`conf`	Metric Transforms and Low Rank Representations of Kernels for Fast Attention. NeurIPS Timothy Chu, Josh Alman, Gary L. Miller, Shyam Narayanan, Mark Sellke, Zhao Song
2024	A*	`conf`	No Free Prune: Information-Theoretic Barriers to Pruning at Initialization. ICML Tanishq Kumar, Kevin Luo, Mark Sellke
2024	J	`jnl`	No Free Prune: Information-Theoretic Barriers to Pruning at Initialization. CoRR Tanishq Kumar, Kevin Luo, Mark Sellke
2024	J	`jnl`	On size-independent sample complexity of ReLU networks. Inf. Process. Lett. Mark Sellke
2023	J	`jnl`	A Universal Law of Robustness via Isoperimetry. J. ACM Sébastien Bubeck, Mark Sellke
2023	J	`jnl`	Algorithmic Threshold for Multi-Species Spherical Spin Glasses. CoRR Brice Huang, Mark Sellke
2023	J	`jnl`	Asymptotically Optimal Pure Exploration for Infinite-Armed Bandits. CoRR Evelyn Xiao-Yue Gong, Mark Sellke
2023	A*	`conf`	Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed Bandits. NeurIPS Evelyn Xiao-Yue Gong, Mark Sellke
2023	J	`jnl`	First-Order Bayesian Regret Analysis of Thompson Sampling. IEEE Trans. Inf. Theory Sébastien Bubeck, Mark Sellke
2023	A*	`conf`	Incentivizing Exploration with Linear Contexts and Combinatorial Actions. ICML Mark Sellke
2023	J	`jnl`	Incentivizing Exploration with Linear Contexts and Combinatorial Actions. CoRR Mark Sellke
2023	J	`jnl`	Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree. Random Struct. Algorithms Ahmed El Alaoui, Andrea Montanari, Mark Sellke
2023	J	`jnl`	On Size-Independent Sample Complexity of ReLU Networks. CoRR Mark Sellke
2023	J	`jnl`	The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity. Oper. Res. Mark Sellke, Aleksandrs Slivkins
2023	A*	`conf`	Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. FOCS Ofer Grossman, Meghal Gupta, Mark Sellke
2023	J	`jnl`	Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. CoRR Ofer Grossman, Meghal Gupta, Mark Sellke
2023	A*	`conf`	When Does Adaptivity Help for Quantum State Learning? FOCS Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke
2022	J	`jnl`	Exact Minimum Number of Bits to Stabilize a Linear System. IEEE Trans. Autom. Control. Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
2022	A*	`conf`	Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environments. NeurIPS Yining Chen, Elan Rosenfeld, Mark Sellke, Tengyu Ma, Andrej Risteski
2022	A*	`conf`	Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization. FOCS Ahmed El Alaoui, Andrea Montanari, Mark Sellke
2022	J	`jnl`	Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization. CoRR Ahmed El Alaoui, Andrea Montanari, Mark Sellke
2022	A*	`conf`	The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication. COLT Allen Liu, Mark Sellke
2022	J	`jnl`	The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication. CoRR Allen Liu, Mark Sellke
2022	J	`jnl`	Tight Bounds for State Tomography with Incoherent Measurements. CoRR Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke
2022	A*	`conf`	Tight Lipschitz Hardness for optimizing Mean Field Spin Glasses. FOCS Brice Huang, Mark Sellke
2021	A*	`conf`	A Universal Law of Robustness via Isoperimetry. NeurIPS Sébastien Bubeck, Mark Sellke
2021	J	`jnl`	A Universal Law of Robustness via Isoperimetry. CoRR Sébastien Bubeck, Mark Sellke
2021	A*	`conf`	Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions. COLT Sébastien Bubeck, Thomas Budzinski, Mark Sellke
2021	J	`jnl`	Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environments. CoRR Yining Chen, Elan Rosenfeld, Mark Sellke, Tengyu Ma, Andrej Risteski
2021	J	`jnl`	Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree. CoRR Ahmed El Alaoui, Andrea Montanari, Mark Sellke
2021	A	`conf`	Metrical Service Systems with Transformations. ITCS Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke
2021	A*	`conf`	Online Multiserver Convex Chasing and Optimization. SODA Sébastien Bubeck, Yuval Rabani, Mark Sellke
2021	J	`jnl`	Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits. IEEE Trans. Inf. Theory Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
2021	A*	`conf`	The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity. EC Mark Sellke, Aleksandrs Slivkins
2021	J	`jnl`	Tight Lipschitz Hardness for Optimizing Mean Field Spin Glasses. CoRR Brice Huang, Mark Sellke
2021	A*	`conf`	Vertex Sparsification for Edge Connectivity. SODA Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
2020	J	`jnl`	Algorithmic pure states for the negative spherical perceptron. CoRR Ahmed El Alaoui, Mark Sellke
2020	A*	`conf`	Chasing Convex Bodies Optimally. SODA Mark Sellke
2020	A*	`conf`	Chasing Nested Convex Bodies Nearly Optimally. SODA Sébastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li, Mark Sellke
2020	J	`jnl`	Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions. CoRR Sébastien Bubeck, Thomas Budzinski, Mark Sellke
2020	B	`conf`	First-Order Bayesian Regret Analysis of Thompson Sampling. ALT Sébastien Bubeck, Mark Sellke
2020	J	`jnl`	Functions that Preserve Manhattan Distances. CoRR Timothy Chu, Gary L. Miller, Shyam Narayanan, Mark Sellke
2020	J	`jnl`	Metrical Service Systems with Transformations. CoRR Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke
2020	A*	`conf`	Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. COLT Sébastien Bubeck, Yuanzhi Li, Yuval Peres, Mark Sellke
2020	J	`jnl`	Online Multiserver Convex Chasing and Optimization. CoRR Sébastien Bubeck, Yuval Rabani, Mark Sellke
2020	J	`jnl`	Sample Complexity of Incentivized Exploration. CoRR Mark Sellke, Aleksandrs Slivkins
2020	J	`jnl`	Vertex Sparsification for Edge Connectivity. CoRR Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
2019	J	`jnl`	Chasing Convex Bodies Optimally. CoRR Mark Sellke
2019	J	`jnl`	Competitively Chasing Convex Bodies. SIAM J. Comput. Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
2019	A*	`conf`	Competitively chasing convex bodies. STOC Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
2019	J	`jnl`	First-Order Regret Analysis of Thompson Sampling. CoRR Sébastien Bubeck, Mark Sellke
2019	J	`jnl`	Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. CoRR Sébastien Bubeck, Yuanzhi Li, Yuval Peres, Mark Sellke
2019	J	`jnl`	Vertex Sparsifiers for c-Edge Connectivity. CoRR Yang P. Liu, Richard Peng, Mark Sellke
2018	J	`jnl`	Chasing Nested Convex Bodies Nearly Optimally. CoRR Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
2018	J	`jnl`	Competitively Chasing Convex Bodies. CoRR Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke
2018	—	`conf`	Exact minimum number of bits to stabilize a linear system. CDC Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
2018	J	`jnl`	Exact minimum number of bits to stabilize a linear system. CoRR Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
2018	B	`conf`	Stabilizing a System with an Unbounded Random Gain Using Only Finitely Many Bits. ISIT Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
2018	J	`jnl`	Stabilizing a system with an unbounded random gain using only a finite number of bits. CoRR Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke
2017	J	`jnl`	Approximating Continuous Functions by ReLU Nets of Minimal Width. CoRR Boris Hanin, Mark Sellke