Fetching the paper…
Reading the bibliography…
Bernstein's condition is a key assumption that guarantees fast rates in machine learning.
Asymptotic evaluation of certain markov process expectations for large time. iii
M. D. Donsker and S. S. Varadhan · 1976
Earlier work this paper cites.
Multitask learning
R. Caruana · 1997
Earlier work this paper cites.
A PAC analysis of a Bayes estimator
J. Shawe-Taylor and R. Williamson · 1997
Earlier work this paper cites.
Some PAC-Bayesian theorems
D. A. McAllester · 1998
Earlier work this paper cites.
Learning to learn: Introduction and overview
Sebastian Thrun and Lorien Pratt · 1998
Earlier work this paper cites.
Smooth discrimination analysis
E. Mammen and A. B. Tsybakov · 1999
Earlier work this paper cites.
A model of inductive bias learning
Jonathan Baxter · 2000
Earlier work this paper cites.
Learning to learn using gradient descent
Sepp Hochreiter, A Steven Younger, and Peter R Conwell · 2001
Earlier work this paper cites.
Exploiting task relatedness for multiple task learning
Shai Ben-David and Reba Schuller · 2003
Earlier work this paper cites.
Statistical Learning Theory and Stochastic Optimization
O. Catoni · 2004
Earlier work this paper cites.
Optimal aggregation of classifiers in statistical learning
A. B. Tsybakov · 2004
Earlier work this paper cites.
Algorithmic stability and meta-learning
A. Maurer and T. Jaakkola · 2005
Earlier work this paper cites.
Convexity, classification, and risk bounds
P. L. Bartlett, M. I. Jordan, and J. D. McAuliffe · 2006
Earlier work this paper cites.
Empirical minimization
Peter L Bartlett and Shahar Mendelson · 2006
Earlier work this paper cites.
Information-theoretic upper and lower bounds for statistical estimation
Tong Zhang · 2006
Earlier work this paper cites.
PAC-Bayesian supervised classification: the thermodynamics of statistical learning
O. Catoni · 2007
Earlier work this paper cites.
Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
A. Dalalyan and A. B. Tsybakov · 2008
Earlier work this paper cites.
Transfer learning for image classification with sparse prototype representations
Ariadna Quattoni, Michael Collins, and Trevor Darrell · 2008
Earlier work this paper cites.
Transfer bounds for linear feature learning
A. Maurer · 2009
Earlier work this paper cites.
A survey on transfer learning
Sinno Jialin Pan and Qiang Yang · 2010
Earlier work this paper cites.
What you saw is not what you get: Domain adaptation using asymmetric kernel transforms
Brian Kulis, Kate Saenko, and Trevor Darrell · 2011
Earlier work this paper cites.
Concentration Inequalities
S. Boucheron, G. Lugosi, and P. Massart · 2013
Earlier work this paper cites.
A comprehensive survey on transfer learning
Fuzhen Zhuang, Zhiyuan Qi, Keyu Duan, Dongbo Xi, Yongchun Zhu, Hengshu Zhu, Hui Xiong, and Qing He · 2013
Earlier work this paper cites.
A PAC-Bayesian bound for lifelong learning
A. Pentina and C. Lampert · 2014
Earlier work this paper cites.
Siamese neural networks for one-shot image recognition
Gregory Koch, Richard Zemel, Ruslan Salakhutdinov, et al · 2015
Earlier work this paper cites.
On the properties of variational approximations of Gibbs posteriors
P. Alquier, J. Ridgway, and N. Chopin · 2016
Earlier work this paper cites.
A general framework for updating belief distributions
P. G. Bissiri, C. C. Holmes, and S. G. Walker · 2016
Earlier work this paper cites.
The benefit of multitask representation learning
A. Maurer, M. Pontil, and B. Romera-Paredes · 2016
Earlier work this paper cites.
Meta-learning with memory-augmented neural networks
Adam Santoro, Sergey Bartunov, Matthew Botvinick, Daan Wierstra, and Timothy Lillicrap · 2016
Earlier work this paper cites.
Matching networks for one shot learning
Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Daan Wierstra, et al · 2016
Earlier work this paper cites.
Learning to reinforcement learn
Jane X Wang, Zeb Kurth-Nelson, Dhruva Tirumala, Hubert Soyer, Joel Z Leibo, Remi Munos, Charles Blundell, Dharshan Kumaran, and Matt Botvinick · 2016
Cited alongside, same era.
Regret Bounds for Lifelong Learning
Pierre Alquier, The Tien Mai, and Massimiliano Pontil · 2017
Cited alongside, same era.
Model-agnostic meta-learning for fast adaptation of deep networks
Chelsea Finn, Pieter Abbeel, and Sergey Levine · 2017
Cited alongside, same era.
Fundamentals of nonparametric Bayesian inference , volume 44
S. Ghosal and A. Van der Vaart · 2017
Cited alongside, same era.
Meta networks
Tsendsuren Munkhdalai and Hong Yu · 2017
Cited alongside, same era.
Optimization as a model for few-shot learning
Sachin Ravi and Hugo Larochelle · 2017
Cited alongside, same era.
Fast-rate pac-bayes generalization bounds via shifted rademacher processes
Jun Yang, Shengyang Sun, and Daniel M Roy · 2019
Later among the works it cites.
A closer look at the training strategy for modern meta-learning
Jiaxin Chen, Xiao-Ming Wu, Yanke Li, Qimai Li, Li-Ming Zhan, and Fu-lai Chung · 2020
Later among the works it cites.
The advantage of conditional meta-learning for biased regularization and fine tuning
Giulia Denevi, Massimiliano Pontil, and Carlo Ciliberto · 2020
Later among the works it cites.
Few-shot learning via learning the representation, provably
Simon S Du, Wei Hu, Sham M Kakade, Jason D Lee, and Qi Lei · 2020
Later among the works it cites.
Fast rates for general unbounded loss functions: from erm to generalized bayes
Peter D Grünwald and Nishant A Mehta · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Prototypical networks for few-shot learning
Jake Snell, Kevin Swersky, and Richard Zemel · 2017
Cited alongside, same era.
Information-theoretic analysis of generalization capability of learning algorithms
A. Xu and M. Raginsky · 2017
Cited alongside, same era.
Meta-learning by adjusting priors based on extended PAC-Bayes theory
R. Amit and R. Meir · 2018
Cited alongside, same era.
Dynamic few-shot visual learning without forgetting
Spyros Gidaris and Nikos Komodakis · 2018
Cited alongside, same era.
Recasting gradient-based meta-learning as hierarchical bayes
Erin Grant, Chelsea Finn, Sergey Levine, Trevor Darrell, and Thomas Griffiths · 2018
Cited alongside, same era.
Meta-learning for low-resource neural machine translation
Jiatao Gu, Yong Wang, Yun Chen, Kyunghyun Cho, and Victor OK Li · 2018
Cited alongside, same era.
Uncertainty in model-agnostic meta-learning using variational inference
Cuong Nguyen, Thanh-Toan Do, and Gustavo Carneiro · 2020
Later among the works it cites.
Meta-world: A benchmark and evaluation for multi-task and meta reinforcement learning
Tianhe Yu, Deirdre Quillen, Zhanpeng He, Ryan Julian, Karol Hausman, Chelsea Finn, and Sergey Levine · 2020
Later among the works it cites.
On data efficiency of meta-learning
Maruan Al-Shedivat, Liam Li, Eric Xing, and Ameet Talwalkar · 2021
Later among the works it cites.
User-friendly introduction to PAC-Bayes bounds
Pierre Alquier · 2021
Later among the works it cites.
How important is the train-validation split in meta-learning?
Yu Bai, Minshuo Chen, Pan Zhou, Tuo Zhao, Jason Lee, Sham Kakade, Huan Wang, and Caiming Xiong · 2021
Later among the works it cites.
Generalization bounds for meta-learning: An information-theoretic analysis
Qi Chen, Changjian Shui, and Mario Marchand · 2021
Later among the works it cites.
Bridging the gap between practice and pac-bayes theory in few-shot meta-learning
N. Ding, X. Chen, T. Levinboim, S. Goodman, and R. Soricut · 2021
Later among the works it cites.
Generalization of model-agnostic meta-learning algorithms: Recurring and unseen tasks
Alireza Fallah, Aryan Mokhtari, and Asuman Ozdaglar · 2021
Later among the works it cites.
Generalization bounds for meta-learning via pac-bayes and uniform stability
A. Farid and A. Majumdar · 2021
Later among the works it cites.
Towards a unified information-theoretic framework for generalization
Mahdi Haghifam, Gintare Karolina Dziugaite, Shay Moran, and Dan Roy · 2021
Later among the works it cites.
Information-theoretic generalization bounds for meta-learning and applications
Sharu Theresa Jose and Osvaldo Simeone · 2021
Later among the works it cites.
Transfer meta-learning: Information-theoretic bounds and information meta-risk minimization
Sharu Theresa Jose, Osvaldo Simeone, and Giuseppe Durisi · 2021
Later among the works it cites.
Pac-bayes bounds for meta-learning with data-dependent prior
Tianyu Liu, Jie Lu, Zheng Yan, and Guangquan Zhang · 2021
Later among the works it cites.
Meta-strategy for learning tuning parameters with guarantees
D. Meunier and P. Alquier · 2021
Later among the works it cites.
Conditional mutual information-based generalization bound for meta learning
Arezou Rezazadeh, Sharu Theresa Jose, Giuseppe Durisi, and Osvaldo Simeone · 2021
Later among the works it cites.
Pacoh: Bayes-optimal meta-learning with pac-guarantees
J. Rothfuss, V. Fortuin, M. Josifoski, and A. Krause · 2021
Later among the works it cites.
Provable meta-learning of linear representations
Nilesh Tripuraneni, Chi Jin, and Michael Jordan · 2021
Later among the works it cites.
A survey on multi-task learning
Yu Zhang and Qiang Yang · 2021
Later among the works it cites.
Is bayesian model-agnostic meta learning better than model-agnostic meta learning, provably?
Lisha Chen and Tianyi Chen · 2022
Later among the works it cites.
Fine-grained analysis of stability and generalization for modern meta learning algorithms
J. Guan, Y. Liu, and Z. Lu · 2022
Later among the works it cites.
Evaluated cmi bounds for meta learning: Tightness and expressiveness
Fredrik Hellström and Giuseppe Durisi · 2022
Later among the works it cites.
A unified view on pac-bayes bounds for meta-learning
A. Rezazadeh · 2022
Later among the works it cites.
Pac-bayesian meta-learning: From theory to practice
J. Rothfuss, M. Josifoski, V. Fortuin, and A. Krause · 2022
Later among the works it cites.
Learning with limited samples: Meta-learning and applications to communication systems
Lisha Chen, Sharu Theresa Jose, Ivana Nikoloska, Sangwoo Park, Tianyi Chen, and Osvaldo Simeone · 2023
Closest in time.