Fetching the paper…
Reading the bibliography…
There is growing body of learning problems for which it is natural to organize the parameters into matrix, so as to appropriately regularize the parameters under some matrix norm (in order to impose some more sophisticated prior knowledge).
Convex Analysis
R.T. Rockafellar · 1970
Earlier work this paper cites.
Martingales with values in uniformly convex spaces
G. Pisier · 1975
Earlier work this paper cites.
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
N. Littlestone · 1988
Earlier work this paper cites.
Sharp uniform convexity and smoothness inequalities for trace norms
Keith Ball, Eric A. Carlen, and Elliott H. Lieb · 1994
Earlier work this paper cites.
Optimum bounds for the distributions of martingales in banach spaces
I. Pinelis · 1994
Earlier work this paper cites.
The convex analysis of unitarily invariant matrix functions
A. S. Lewis · 1995
Earlier work this paper cites.
Matrix Analysis
R. Bhatia · 1997
Earlier work this paper cites.
Exponentiated gradient versus gradient descent for linear predictors
J. Kivinen and M. Warmuth · 1997
Earlier work this paper cites.
On the learnability and design of output codes for multiclass problems
K. Crammer and Y. Singer · 2000
Earlier work this paper cites.
General convergence results for linear discriminant updates
A. J. Grove, N. Littlestone, and D. Schuurmans · 2001
Earlier work this paper cites.
Relative loss bounds for multidimensional regression problems
J. Kivinen and M. Warmuth · 2001
Earlier work this paper cites.
Rademacher and Gaussian complexities: Risk bounds and structural results
P. L. Bartlett and S. Mendelson · 2002
Earlier work this paper cites.
The robustness of the p-norm algorithms
C. Gentile · 2003
Earlier work this paper cites.
Generalization error bounds for Bayesian mixture algorithms
R. Meir and T. Zhang · 2003
Cited alongside, same era.
Learning the kernel matrix with semidefinite programming
G.R.G. Lanckriet, N. Cristianini, P.L. Bartlett, L. El Ghaoui, and M.I. Jordan · 2004
Cited alongside, same era.
Feature selection, l 1 l_{1} vs. l 2 l_{2} regularization, and rotational invariance
A.Y. Ng · 2004
Cited alongside, same era.
Convex Analysis and Nonlinear Optimization
J. Borwein and A. Lewis · 2006
Cited alongside, same era.
Prediction, learning, and games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
Bounds for linear multi-task learning
Andreas Maurer · 2006
Cited alongside, same era.
Joint covariate selection for grouped classification
G. Obozinski, B. Taskar, and M Jordan · 2007
Later among the works it cites.
Online Learning: Theory, Algorithms, and Applications
S. Shalev-Shwartz · 2007
Later among the works it cites.
A primal-dual perspective of online learning algorithms
S. Shalev-Shwartz and Y. Singer · 2007
Later among the works it cites.
Matrix regularization techniques for online multitask learning
Alekh Agarwal, Alexander Rakhlin, and Peter Bartlett · 2008
Later among the works it cites.
Consistency of the group lasso and multiple kernel learning
Francis Bach · 2008
Later among the works it cites.
Linear algorithms for online multitask classification
G. Cavallanti, N. Cesa-Bianchi, and C. Gentile · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Shalev-Shwartz and Y. Singer · 2006
Cited alongside, same era.
Learning bounds for support vector machines with learned kernels
N. Srebro and S. Ben-David · 2006
Cited alongside, same era.
Online variance minimization
M. Warmuth and D. Kuzmin · 2006
Cited alongside, same era.
Model selection and estimation in regression with grouped variables
M. Yuan and Y. Lin · 2006
Cited alongside, same era.
Convex analysis in general vector spaces
C. Zalinescu · 2006
Cited alongside, same era.
Uncovering shared structures in multiclass classification
Yonatan Amit, Michael Fink, Nathan Srebro, and Shimon Ullman · 2007
Cited alongside, same era.
Large deviations of vector-valued martingales in 2-smooth normed spaces
A. Juditsky and A. Nemirovski · 2008
Later among the works it cites.
On the complexity of linear prediction: Risk bounds, margin bounds, and regularization
S.M. Kakade, K. Sridharan, and A. Tewari · 2008
Later among the works it cites.
On the equivalence of weak learnability and linear separability: New relaxations and efficient boosting algorithms
S. Shalev-Shwartz and Y. Singer · 2008
Later among the works it cites.
Taking advantage of sparsity in multi-task learning
Karim Lounici, Massimiliano Pontil, Alexandre B Tsybakov, and Sara van de Geer · 2009
Closest in time.
Heterogeneous multitask learning with joint sparsity constraints
X. Yang, S. Kim, and E. P. Xing · 2009
Closest in time.
Generalization bounds for learning the kernel
Y. Ying and C. Campbell · 2009
Closest in time.