sub-gaussian noise

Safe Online Convex Optimization with Heavy-Tailed Observation Noises AAAI 2025 Finite Time Logarithmic Regret Bounds for Self-Tuning Regulation ICML 2024 Linear bandits with polylogarithmic minimax regret COLT 2024 Experimental Designs for Heteroskedastic Variance NeurIPS 2023 Generalization Bounds for Inductive Matrix Completion in Low-Noise Settings AAAI 2023 High Probability Convergence of Stochastic Gradient Methods ICML 2023 Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits ICML 2023 Beyond Sub-Gaussian Noises: Sharp Concentration Analysis for Stochastic Gradient Descent JMLR 2022 Experimental Design for Linear Functionals in Reproducing Kernel Hilbert Spaces NeurIPS 2022 Optimal partition recovery in general graphs AISTATS 2022 Revenue maximization via machine learning with noisy data NeurIPS 2021 Robustness Analysis of Non-Convex Stochastic Gradient Descent using Biased Expectations NeurIPS 2020 No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016 Guaranteed Sparse Recovery under Linear Transformation ICML 2013