analiza aiqbench
This paper presents novel statistical methods for estimating multiple mean vectors in high-dimensional spaces by optimizing convex combinations of empirical means. The approach leverages dimensional asymptotics to achieve minimax-optimal performance, specifically targeting applications like kernel mean embeddings where reducing quadratic risk is critical.
Estimation of multiple mean vectors in high dimension
arXiv:2403.15038v3 Announce Type: replace-cross Abstract: We endeavour to estimate numerous multi-dimensional means of various probability distributions on a common space based on independent samples. Our approach involves forming estimators through convex combinations of empirical means derived from these samples. We introduce two strategies to find appropriate data-dependent convex combination weights: a first one employing a testing procedure to identify neighbouring means with low variance, which results in a closed-form plug-in formula for the weights, and a second one determining weights via minimization of an upper confidence bound on the quadratic risk. Through theoretical analysis, we evaluate the improvement in quadratic risk offered by our methods compared to the empirical means. Our analysis focuses on a dimensional asymptotics perspective, showing that our methods asymptotically approach an oracle (minimax) improvement as the effective dimension of the data increases. We demonstrate the efficacy of our methods in estimating multiple kernel mean embeddings through experiments on both simulated and real-world datasets.
Abstract:We endeavour to estimate numerous multi-dimensional means of various probability distributions on a common space based on independent samples. Our approach involves forming estimators through convex combinations of empirical means derived from these samples. We introduce two strategies to find appropriate data-dependent convex combination weights: a first one employing a testing procedure to identify neighbouring means with low variance, which results in a closed-form plug-in formula for the weights, and a second one determining weights via minimization of an upper confidence bound on the quadratic risk. Through theoretical analysis, we evaluate the improvement in quadratic risk offered by our methods compared to the empirical means. Our analysis focuses on a dimensional asymptotics perspective, showing that our methods asymptotically approach an oracle (minimax) improvement as the effective dimension of the data increases. We demonstrate the efficacy of our methods in estimating multiple kernel mean embeddings through experiments on both simulated and real-world datasets.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2403.15038 [stat.ML]
(or arXiv:2403.15038v3 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2403.15038 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 247 cuvinte
Subiecte conexe

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026

Quadrillion Param Costs: KV Cache, Context Length, Frontier Margins
LessWrong · 27 iul. 2026
Links #5: 2026/07
LessWrong · 31 iul. 2026

Attention Decode on AMD MI450 GPUs: A Gluon Kernel Optimization Guide
AMD · 27 iul. 2026