A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm
arXiv:1902.03736
Abstract
In this note, we derive concentration inequalities for random vectors with subGaussian norm (a generalization of both subGaussian random vectors and norm bounded random vectors), which are tight up to logarithmic factors.
Cited by in corpus (9)
- Minibatch optimal transport distances; analysis and applications
- A High Probability Analysis of Adaptive SGD with Momentum
- A Simple Reward-free Approach to Constrained Reinforcement Learning
- Optimizing Black-box Metrics with Adaptive Surrogates
- Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games
- Adapting to Function Difficulty and Growth Conditions in Private Optimization
- Improved Regret Bound and Experience Replay in Regularized Policy Iteration
- Improved Regret Bounds for Online Submodular Maximization
- Locally Private k-Means in One Round