Fetching the paper…
Reading the bibliography…
Multi-task learning leverages structural similarities between multiple tasks to learn despite very few samples.
Reduced-rank regression for the multivariate linear model
Alan Julian Izenman · 1975
Earlier work this paper cites.
Multitask learning
Rich Caruana · 1997
Earlier work this paper cites.
A framework for learning predictive structures from multiple tasks and unlabeled data
Rie Kubota Ando, Tong Zhang, and Peter Bartlett · 2005
Earlier work this paper cites.
Bounds for linear multi-task learning
Andreas Maurer · 2006
Earlier work this paper cites.
Uncovering shared structures in multiclass classification
Yonatan Amit, Michael Fink, Nathan Srebro, and Shimon Ullman · 2007
Earlier work this paper cites.
Convex multi-task feature learning
Andreas Argyriou, Theodoros Evgeniou, and Massimiliano Pontil · 2008
Earlier work this paper cites.
Union support recovery in high-dimensional multivariate regression
Guillaume Obozinski, Martin J Wainwright, and Michael I Jordan · 2008
Earlier work this paper cites.
An accelerated gradient method for trace norm minimization
Shuiwang Ji and Jieping Ye · 2009
Earlier work this paper cites.
Taking advantage of sparsity in multi-task learning
Karim Lounici, Massimiliano Pontil, Alexandre Tsybakov, and Sara van de Geer · 2009
Earlier work this paper cites.
On the conditions used to prove oracle results for the lasso
Sara van de Geer and Peter Bühlmann · 2009
Earlier work this paper cites.
Linear algorithms for online multitask classification
Giovanni Cavallanti, Nicolo Cesa-Bianchi, and Claudio Gentile · 2010
Earlier work this paper cites.
A simple algorithm for nuclear norm regularized problems
Martin Jaggi and Marek Sulovskỳ · 2010
Cited alongside, same era.
An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
Kim-Chuan Toh and Sangwoon Yun · 2010
Cited alongside, same era.
Optimal selection of reduced rank estimators of high-dimensional matrices
Florentina Bunea, Yiyuan She, and Marten H Wegkamp · 2011
Cited alongside, same era.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Emmanuel J Candes and Yaniv Plan · 2011
Cited alongside, same era.
Multi-task low-rank affinity pursuit for image segmentation
Bin Cheng, Guangcan Liu, Jingdong Wang, Zhongyang Huang, and Shuicheng Yan · 2011
Cited alongside, same era.
Estimation of high-dimensional low-rank matrices
Matching networks for one shot learning
Oriol Vinyals, Charles Blundell, Timothy Lillicrap, Daan Wierstra, et al · 2016
Later among the works it cites.
Model-agnostic meta-learning for fast adaptation of deep networks
Chelsea Finn, Pieter Abbeel, and Sergey Levine · 2017
Later among the works it cites.
How to escape saddle points efficiently
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan · 2017
Later among the works it cites.
Learning to model the tail
Yu-Xiong Wang, Deva Ramanan, and Martial Hebert · 2017
Later among the works it cites.
High-Dimensional Probability: An Introduction With Applications In Data Science , volume 47
Roman Vershynin · 2018
Later among the works it cites.
Learning-to-learn stochastic gradient descent with biased regularization
Giulia Denevi, Carlo Ciliberto, Riccardo Grazzi, and Massimiliano Pontil · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Angelika Rohde and Alexandre Tsybakov · 2011
Cited alongside, same era.
Large-scale image classification with trace-norm regularization
Zaid Harchaoui, Matthijs Douze, Mattis Paulin, Miroslav Dudik, and Jérôme Malick · 2012
Cited alongside, same era.
Random design analysis of ridge regression
Daniel Hsu, Sham M Kakade, and Tong Zhang · 2012
Cited alongside, same era.
A unified framework for high-dimensional analysis of m m -estimators with decomposable regularizers
Sahand N Negahban, Pradeep Ravikumar, Martin J Wainwright, and Bin Yu · 2012
Cited alongside, same era.
Excess risk bounds for multitask learning with trace norm regularization
Massimiliano Pontil and Andreas Maurer · 2013
Cited alongside, same era.
The benefit of multitask representation learning
Andreas Maurer, Massimiliano Pontil, and Bernardino Romera-Paredes · 2016
Cited alongside, same era.
Sample efficient linear meta-learning by alternating minimization
Kiran Koshy Thekumparampil, Prateek Jain, Praneeth Netrapalli, and Sewoong Oh
Cited in the paper.
Sharp concentration results for heavy-tailed distributions
Milad Bakhshizadeh, Arian Maleki, and Victor H de la Pena · 2020
Later among the works it cites.
Multitask online mirror descent
Nicolò Cesa-Bianchi, Pierre Laforgue, Andrea Paudice, and Massimiliano Pontil · 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.
Local rademacher complexity-based learning guarantees for multi-task learning
Niloofar Yousefi, Yunwen Lei, Marius Kloft, Mansooreh Mollaghasemi, and Georgios C Anagnostopoulos · 2021
Later among the works it cites.