Bounds on the minimax rate for estimating a prior over a VC class from independent learning tasks
From MaRDI portal
Publication:1704568
DOI10.1016/j.tcs.2017.11.025zbMath1388.68257arXiv1505.05231OpenAlexW2773417679MaRDI QIDQ1704568
Steve Hanneke, Liu Yang, Jaime G. Carbonell
Publication date: 12 March 2018
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.05231
Nonparametric estimation (62G05) Point estimation (62F10) Minimax procedures in statistical decision theory (62C20) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rates of convergence of minimum distance estimators and Kolmogorov's entropy
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- A Bayesian/information theoretic model of learning to learn via multiple task sampling
- Bounds on the minimax rate for estimating a prior over a VC class from independent learning tasks
- Theory of statistics
- A theory of transfer learning with applications to active learning
- Learnability and the Vapnik-Chervonenkis dimension
- Sampling lower bounds via information theory
- Algorithmic Learning Theory
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Sequential Tests of Statistical Hypotheses
- Combinatorial methods in density estimation
This page was built for publication: Bounds on the minimax rate for estimating a prior over a VC class from independent learning tasks
