No article text was recorded for this version.
median-of-means estimation
Version 2 of 2221 papers285 conceptsfrozen 2026-10-04
Papers in this version
- Blog: No-Regret Reinforcement Learning with Heavy-Tailed Rewards
- Blog: What You See May Not Be What You Get: UCB Bandit Algorithms Robust to ε-Contamination
- Blog: A Simple and Optimal Sublinear Algorithm for Mean Estimation
- Blog: Robust Kernel Density Estimation with Median-of-Means principle
- Blog: Bandits with heavy tail
- Blog: Dirichlet Process-Based Robust Clustering Using the Median-of-Means Estimator
- Blog: Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs
- Blog: Outlier Robust Mean Estimation with Subgaussian Rates via Stability
- Blog: Budgeted-Bandits with Controlled Restarts with Applications in Learning and Computing
- Blog: Lecture Notes: Selected topics on robust statistical learning theory
- Blog: Bandit algorithms: Letting go of logarithmic regret for statistical robustness
- Blog: Bandit algorithms: Letting go of logarithmic regret for statistical robustness
- Blog: CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption
- Blog: Robust classification via MOM minimization
- Blog: Uniform Mean Estimation for Heavy-Tailed Distributions via Median-of-Means
- Blog: Safe Online Convex Optimization with Heavy-Tailed Observation Noises
- Blog: Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards
- Blog: A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis
- Blog: Learn the Ropes, Then Trust the Wins: Self-imitation with Progressive Exploration for Agentic Reinforcement Learning
- Blog: Best Arm Identification for Contaminated Bandits
- Blog: Signature Estimation and Signal Recovery Using Median of Means
- Blog: Budgeted Recommendation with Delayed Feedback
- Blog: Stochastic Graphical Bandits with Heavy-Tailed Rewards
- Blog: Adversarially Robust Clustering With Optimality Guarantees
- Blog: Improving PAC Exploration Using the Median Of Means
- Blog: Outlier Robust Mean Estimation with Subgaussian Rates via Stability
- Blog: Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
- Blog: SimDiff: Simpler Yet Better Diffusion Model for Time Series Point Forecasting
- Blog: Generalization Bounds in the Presence of Outliers: a Median-of-Means Study
- Blog: Efficient Inference via Universal LSH Kernel
- Blog: On mean estimation for heteroscedastic random variables
- Blog: Tight Variational Bounds via Random Projections and I-Projections
- Blog: Robust Offline Policy Evaluation and Optimization with Heavy-Tailed Rewards
- Blog: On Medians of (Randomized) Pairwise Means
- Blog: When OT meets MoM: Robust estimation of Wasserstein Distance
- Blog: Extended UCB Policy for Multi-Armed Bandit with Light-Tailed Reward Distributions
- Blog: Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs
- Blog: Multi-agent Multi-armed Bandit with Fully Heavy-tailed Dynamics
- Blog: Efficient Algorithms for Extreme Bandits
- Blog: Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination
- Blog: Minimax Policy for Heavy-Tailed Bandits
- Blog: Demystifying the Optimal Performance of Multi-Class Classification
- Blog: Beyond Sin-Squared Error: Linear-Time Entrywise Uncertainty Quantification for Streaming PCA
- Blog: Quantile Off-Policy Evaluation via Deep Conditional Generative Learning
- Blog: Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards
- Blog: CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption
- Blog: Improved Concentration Bounds for Count-Sketch
- Blog: Local Differential Privacy for Bayesian Optimization
- Blog: Learning with risk-averse feedback under potentially heavy tails
- Blog: Contextual Bandits with Stochastic Experts
- Blog: Robust k-means Clustering for Distributions with Two Moments
- Blog: Minimax Policy for Heavy-tailed Bandits
- Blog: Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs
- Blog: Epsilon-Best-Arm Identification in Pay-Per-Reward Multi-Armed Bandits
- Blog: Extended UCB Policies for Multi-armed Bandit Problems
- Blog: Matching via Dimensionality Reduction for Estimation of Treatment Effects in Digital Marketing Campaigns
- Blog: Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
- Blog: Budget-Constrained Bandits over General Cost and Reward Distributions
- Blog: Near-optimal algorithms for private estimation and sequential testing of collision probability
- Blog: Thompson Sampling on Symmetric Alpha-Stable Bandits
Showing 60 of 221 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_median_of_means_estimation_969e198a,
title = {median-of-means estimation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/median-of-means-estimation/rdr_969e198a5cf2484ab029beb18bbecb03},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_median_of_means_estimation_969e198a_v2,
title = {median-of-means estimation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/median-of-means-estimation/rdr_969e198a5cf2484ab029beb18bbecb03/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}