iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.dagstuhl.de/pid/207/8338.xml
Mark Sellke Stanford University, Department of Mathematics, USA https://orcid.org/0000-0001-9166-8185
Ryan Alweiss Brice Huang Mark Sellke Improved Lower Bound for Frankl's Union-Closed Sets Conjecture. 2024 31 Electron. J. Comb. 3 https://doi.org/10.37236/12232 db/journals/combinatorics/combinatorics31.html#AlweissHS24 streams/journals/combinatorics
Mark Sellke On size-independent sample complexity of ReLU networks. 106482 2024 186 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2024.106482 db/journals/ipl/ipl186.html#Sellke24 streams/journals/ipl
Tanishq Kumar Kevin Luo Mark Sellke No Free Prune: Information-Theoretic Barriers to Pruning at Initialization. 2024 ICML https://openreview.net/forum?id=Uzb45nolTb conf/icml/2024 db/conf/icml/icml2024.html#KumarLS24
Tanishq Kumar Kevin Luo Mark Sellke No Free Prune: Information-Theoretic Barriers to Pruning at Initialization. 2024 abs/2402.01089 CoRR https://doi.org/10.48550/arXiv.2402.01089 db/journals/corr/corr2402.html#abs-2402-01089
Mark Sellke Aleksandrs Slivkins The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity. 1706-1732 2023 71 Oper. Res. 5 https://doi.org/10.1287/opre.2022.2401 db/journals/ior/ior71.html#SellkeS23
Sébastien Bubeck Mark Sellke A Universal Law of Robustness via Isoperimetry. 10:1-10:18 2023 April 70 J. ACM 2 https://doi.org/10.1145/3578580 db/journals/jacm/jacm70.html#BubeckS23
Ahmed El Alaoui Andrea Montanari Mark Sellke Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree. 689-715 2023 October 63 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.21149 db/journals/rsa/rsa63.html#AlaouiMS23
Sébastien Bubeck Mark Sellke First-Order Bayesian Regret Analysis of Thompson Sampling. 1795-1823 2023 March 69 IEEE Trans. Inf. Theory 3 https://doi.org/10.1109/TIT.2022.3213630 db/journals/tit/tit69.html#BubeckS23
Sitan Chen Brice Huang Jerry Li 0001 Allen Liu Mark Sellke When Does Adaptivity Help for Quantum State Learning? 391-404 2023 FOCS https://doi.org/10.1109/FOCS57990.2023.00029 conf/focs/2023 db/conf/focs/focs2023.html#ChenH0LS23 Ofer Grossman Meghal Gupta Mark Sellke Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. 1496-1504 2023 FOCS https://doi.org/10.1109/FOCS57990.2023.00091 conf/focs/2023 db/conf/focs/focs2023.html#GrossmanGS23 Mark Sellke Incentivizing Exploration with Linear Contexts and Combinatorial Actions. 30570-30583 2023 ICML https://proceedings.mlr.press/v202/sellke23a.html conf/icml/2023 db/conf/icml/icml2023.html#Sellke23 Evelyn Xiao-Yue Gong Mark Sellke Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed Bandits. 2023 NeurIPS http://papers.nips.cc/paper_files/paper/2023/hash/3b3a83a5d86e1d424daefed43d998079-Abstract-Conference.html conf/nips/2023 db/conf/nips/neurips2023.html#GongS23
Brice Huang Mark Sellke Algorithmic Threshold for Multi-Species Spherical Spin Glasses. 2023 abs/2303.12172 CoRR https://doi.org/10.48550/arXiv.2303.12172 db/journals/corr/corr2303.html#abs-2303-12172
Ofer Grossman Meghal Gupta Mark Sellke Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. 2023 abs/2304.01438 CoRR https://doi.org/10.48550/arXiv.2304.01438 db/journals/corr/corr2304.html#abs-2304-01438
Mark Sellke Incentivizing Exploration with Linear Contexts and Combinatorial Actions. 2023 abs/2306.01990 CoRR https://doi.org/10.48550/arXiv.2306.01990 db/journals/corr/corr2306.html#abs-2306-01990
Mark Sellke On Size-Independent Sample Complexity of ReLU Networks. 2023 abs/2306.01992 CoRR https://doi.org/10.48550/arXiv.2306.01992 db/journals/corr/corr2306.html#abs-2306-01992
Evelyn Xiao-Yue Gong Mark Sellke Asymptotically Optimal Pure Exploration for Infinite-Armed Bandits. 2023 abs/2306.01995 CoRR https://doi.org/10.48550/arXiv.2306.01995 db/journals/corr/corr2306.html#abs-2306-01995
Victoria Kostina Yuval Peres Gireeja Ranade Mark Sellke Exact Minimum Number of Bits to Stabilize a Linear System. 5548-5554 2022 67 IEEE Trans. Autom. Control. 10 https://doi.org/10.1109/TAC.2021.3126679 db/journals/tac/tac67.html#KostinaPRS22
Allen Liu Mark Sellke The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication. 3094 2022 COLT https://proceedings.mlr.press/v178/liu22e.html conf/colt/2022 db/conf/colt/colt2022.html#LiuS22 Brice Huang Mark Sellke Tight Lipschitz Hardness for optimizing Mean Field Spin Glasses. 312-322 2022 conf/focs/2022 FOCS https://doi.org/10.1109/FOCS54457.2022.00037 db/conf/focs/focs2022.html#HuangS22 Ahmed El Alaoui Andrea Montanari Mark Sellke Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization. 323-334 2022 conf/focs/2022 FOCS https://doi.org/10.1109/FOCS54457.2022.00038 db/conf/focs/focs2022.html#AlaouiMS22 Yining Chen Elan Rosenfeld Mark Sellke Tengyu Ma 0001 Andrej Risteski Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environments. 2022 conf/nips/2022 NeurIPS http://papers.nips.cc/paper_files/paper/2022/hash/0b5eb45a22ff33956c043dd271f244ea-Abstract-Conference.html db/conf/nips/neurips2022.html#ChenRS0R22
Allen Liu Mark Sellke The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication. 2022 abs/2202.09653 CoRR https://arxiv.org/abs/2202.09653 db/journals/corr/corr2202.html#abs-2202-09653
Ahmed El Alaoui Andrea Montanari Mark Sellke Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization. 2022 abs/2203.05093 CoRR https://doi.org/10.48550/arXiv.2203.05093 db/journals/corr/corr2203.html#abs-2203-05093
Sitan Chen Brice Huang Jerry Li 0001 Allen Liu Mark Sellke Tight Bounds for State Tomography with Incoherent Measurements. 2022 abs/2206.05265 CoRR https://doi.org/10.48550/arXiv.2206.05265 db/journals/corr/corr2206.html#abs-2206-05265
Victoria Kostina Yuval Peres Gireeja Ranade Mark Sellke Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits. 2554-2561 2021 67 IEEE Trans. Inf. Theory 4 https://doi.org/10.1109/TIT.2021.3053140 db/journals/tit/tit67.html#KostinaPRS21
Sébastien Bubeck Thomas Budzinski Mark Sellke Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions. 821-822 2021 COLT http://proceedings.mlr.press/v134/bubeck21b.html conf/colt/2021 db/conf/colt/colt2021.html#BubeckBS21 Sébastien Bubeck Niv Buchbinder Christian Coester Mark Sellke Metrical Service Systems with Transformations. 21:1-21:20 2021 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2021.21 conf/innovations/2021 db/conf/innovations/innovations2021.html#BubeckBCS21 Sébastien Bubeck Mark Sellke A Universal Law of Robustness via Isoperimetry. 28811-28822 2021 NeurIPS https://proceedings.neurips.cc/paper/2021/hash/f197002b9a0853eca5e046d9ca4663d5-Abstract.html conf/nips/2021 db/conf/nips/neurips2021.html#BubeckS21 Mark Sellke Aleksandrs Slivkins The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity. 795-796 2021 EC https://doi.org/10.1145/3465456.3467549 conf/sigecom/2021 db/conf/sigecom/sigecom2021.html#SellkeS21 Parinya Chalermsook Syamantak Das Yunbum Kook Bundit Laekhanukit Yang P. Liu Richard Peng Mark Sellke Daniel Vaz 0001 Vertex Sparsification for Edge Connectivity. 1206-1225 2021 SODA https://doi.org/10.1137/1.9781611976465.74 conf/soda/2021 db/conf/soda/soda2021.html#ChalermsookDKLL21 Sébastien Bubeck Yuval Rabani Mark Sellke Online Multiserver Convex Chasing and Optimization. 2093-2104 2021 SODA https://doi.org/10.1137/1.9781611976465.125 conf/soda/2021 db/conf/soda/soda2021.html#BubeckRS21
Sébastien Bubeck Mark Sellke A Universal Law of Robustness via Isoperimetry. 2021 abs/2105.12806 CoRR https://arxiv.org/abs/2105.12806 db/journals/corr/corr2105.html#abs-2105-12806
Yining Chen Elan Rosenfeld Mark Sellke Tengyu Ma 0001 Andrej Risteski Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environments. 2021 abs/2106.09913 CoRR https://arxiv.org/abs/2106.09913 db/journals/corr/corr2106.html#abs-2106-09913
Brice Huang Mark Sellke Tight Lipschitz Hardness for Optimizing Mean Field Spin Glasses. 2021 abs/2110.07847 CoRR https://arxiv.org/abs/2110.07847 db/journals/corr/corr2110.html#abs-2110-07847
Ahmed El Alaoui Andrea Montanari Mark Sellke Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree. 2021 abs/2111.06813 CoRR https://arxiv.org/abs/2111.06813 db/journals/corr/corr2111.html#abs-2111-06813
Sébastien Bubeck Mark Sellke First-Order Bayesian Regret Analysis of Thompson Sampling. 196-233 2020 ALT http://proceedings.mlr.press/v117/bubeck20a.html conf/alt/2020 db/conf/alt/alt2020.html#BubeckS20 Sébastien Bubeck Yuanzhi Li Yuval Peres Mark Sellke Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. 961-987 2020 COLT http://proceedings.mlr.press/v125/bubeck20c.html conf/colt/2020 db/conf/colt/colt2020.html#BubeckLPS20 Sébastien Bubeck Bo'az Klartag Yin Tat Lee Yuanzhi Li Mark Sellke Chasing Nested Convex Bodies Nearly Optimally. 1496-1508 2020 SODA https://doi.org/10.1137/1.9781611975994.91 conf/soda/2020 db/conf/soda/soda2020.html#BubeckKLLS20 Mark Sellke Chasing Convex Bodies Optimally. 1509-1518 2020 SODA https://doi.org/10.1137/1.9781611975994.92 conf/soda/2020 db/conf/soda/soda2020.html#Sellke20
Mark Sellke Aleksandrs Slivkins Sample Complexity of Incentivized Exploration. 2020 abs/2002.00558 CoRR https://arxiv.org/abs/2002.00558 db/journals/corr/corr2002.html#abs-2002-00558
Sébastien Bubeck Yuval Rabani Mark Sellke Online Multiserver Convex Chasing and Optimization. 2020 abs/2004.07346 CoRR https://arxiv.org/abs/2004.07346 db/journals/corr/corr2004.html#abs-2004-07346
Parinya Chalermsook Syamantak Das Bundit Laekhanukit Yunbum Kook Yang P. Liu Richard Peng Mark Sellke Daniel Vaz 0001 Vertex Sparsification for Edge Connectivity. 2020 abs/2007.07862 CoRR https://arxiv.org/abs/2007.07862 db/journals/corr/corr2007.html#abs-2007-07862
Sébastien Bubeck Niv Buchbinder Christian Coester Mark Sellke Metrical Service Systems with Transformations. 2020 abs/2009.08266 CoRR https://arxiv.org/abs/2009.08266 db/journals/corr/corr2009.html#abs-2009-08266
Ahmed El Alaoui Mark Sellke Algorithmic pure states for the negative spherical perceptron. 2020 abs/2010.15811 CoRR https://arxiv.org/abs/2010.15811 db/journals/corr/corr2010.html#abs-2010-15811
Sébastien Bubeck Thomas Budzinski Mark Sellke Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions. 2020 abs/2011.03896 CoRR https://arxiv.org/abs/2011.03896 db/journals/corr/corr2011.html#abs-2011-03896
Timothy Chu Gary L. Miller Shyam Narayanan Mark Sellke Functions that Preserve Manhattan Distances. 2020 abs/2011.11503 CoRR https://arxiv.org/abs/2011.11503 db/journals/corr/corr2011.html#abs-2011-11503
Sébastien Bubeck Yin Tat Lee Yuanzhi Li Mark Sellke Competitively chasing convex bodies. 861-868 2019 STOC https://doi.org/10.1145/3313276.3316314 conf/stoc/2019 db/conf/stoc/stoc2019.html#BubeckLLS19
Sébastien Bubeck Mark Sellke First-Order Regret Analysis of Thompson Sampling. 2019 abs/1902.00681 CoRR http://arxiv.org/abs/1902.00681 db/journals/corr/corr1902.html#abs-1902-00681
Sébastien Bubeck Yuanzhi Li Yuval Peres Mark Sellke Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. 2019 abs/1904.12233 CoRR http://arxiv.org/abs/1904.12233 db/journals/corr/corr1904.html#abs-1904-12233
Mark Sellke Chasing Convex Bodies Optimally. 2019 abs/1905.11968 CoRR http://arxiv.org/abs/1905.11968 db/journals/corr/corr1905.html#abs-1905-11968
Yang P. Liu Richard Peng Mark Sellke Vertex Sparsifiers for c-Edge Connectivity. 2019 abs/1910.10359 CoRR http://arxiv.org/abs/1910.10359 db/journals/corr/corr1910.html#abs-1910-10359
Victoria Kostina Yuval Peres Gireeja Ranade Mark Sellke Exact minimum number of bits to stabilize a linear system. 453-458 2018 CDC https://doi.org/10.1109/CDC.2018.8619156 conf/cdc/2018 db/conf/cdc/cdc2018.html#KostinaPRS18 Victoria Kostina Yuval Peres Gireeja Ranade Mark Sellke Stabilizing a System with an Unbounded Random Gain Using Only Finitely Many Bits. 2256-2260 2018 ISIT https://doi.org/10.1109/ISIT.2018.8437548 conf/isit/2018 db/conf/isit/isit2018.html#KostinaPRS18
Victoria Kostina Yuval Peres Gireeja Ranade Mark Sellke Stabilizing a system with an unbounded random gain using only a finite number of bits. 2018 abs/1805.05535 CoRR http://arxiv.org/abs/1805.05535 db/journals/corr/corr1805.html#abs-1805-05535
Victoria Kostina Yuval Peres Gireeja Ranade Mark Sellke Exact minimum number of bits to stabilize a linear system. 2018 abs/1807.07686 CoRR http://arxiv.org/abs/1807.07686 db/journals/corr/corr1807.html#abs-1807-07686
Sébastien Bubeck Yin Tat Lee Yuanzhi Li Mark Sellke Competitively Chasing Convex Bodies. 2018 abs/1811.00887 CoRR http://arxiv.org/abs/1811.00887 db/journals/corr/corr1811.html#abs-1811-00887
Sébastien Bubeck Yin Tat Lee Yuanzhi Li Mark Sellke Chasing Nested Convex Bodies Nearly Optimally. 2018 abs/1811.00999 CoRR http://arxiv.org/abs/1811.00999 db/journals/corr/corr1811.html#abs-1811-00999
Boris Hanin Mark Sellke Approximating Continuous Functions by ReLU Nets of Minimal Width. 2017 abs/1710.11278 CoRR http://arxiv.org/abs/1710.11278 db/journals/corr/corr1710.html#abs-1710-11278
Ahmed El Alaoui Ryan Alweiss Sébastien Bubeck Niv Buchbinder Thomas Budzinski Parinya Chalermsook Sitan Chen Yining Chen Timothy Chu Christian Coester Syamantak Das Evelyn Xiao-Yue Gong Ofer Grossman Meghal Gupta Boris Hanin Brice Huang Bo'az Klartag Yunbum Kook Victoria Kostina Tanishq Kumar Bundit Laekhanukit Yin Tat Lee Jerry Li 0001 Yuanzhi Li Allen Liu Yang P. Liu Kevin Luo Tengyu Ma 0001 Gary L. Miller Andrea Montanari Shyam Narayanan Richard Peng Yuval Peres Yuval Rabani Gireeja Ranade Andrej Risteski Elan Rosenfeld Aleksandrs Slivkins Daniel Vaz 0001