Showing 1–12 of 12 results
/ Date/ Name
Dec 20, 2025The Challenger: When Do New Data Sources Justify Switching Machine Learning Models?Apr 27, 2026On the Average-Case Performance of Greedy for Maximum CoverageJul 2, 2021Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy AlgorithmFeb 14, 2022Robust Estimation of Discrete Distributions under Local Differential PrivacyJun 8, 2021Decentralized Learning in Online Queuing SystemsJul 31, 2021Pure Exploration and Regret Minimization in Matching BanditsJun 13, 2023Online Matching in Geometric Random GraphsFeb 12, 2025Balancing optimism and pessimism in offline-to-online learningMay 31, 2022On Preemption and Learning in Stochastic SchedulingOct 1, 2024Almost Free: Self-concordance in Natural Exponential Families and an Application to BanditsApr 2, 2026Flexibility allocation in random bipartite matching markets: exact matching rates and dominance regimesJan 19, 2026A uniformity principle for spatial matching