Lorenzo Rosasco

Lorenzo Rosasco

Auto-generated profile, based on publicly available information

Lorenzo Rosasco

Malga -DIBRIS University of Genova IT

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 April 2007 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
YYYuan Yao
Yuan Yao
LRLorenzo Rosasco
Lorenzo Rosasco
ACAndrea Caponnetto
Andrea Caponnetto

19 June 2012 in Foundations and Trends in Machine Learning
Verified
Journal Article
Closed access
PDF file
MÁMauricio A. Álvarez
Mauricio A. Álvarez
LRLorenzo Rosasco
Lorenzo Rosasco
NLNeil Lawrence
Neil Lawrence
Kernel methods are among the most popular techniques in machine learning. From a regularization perspective they play a central role in regularization theory as they provide a natural choice for the hypotheses space and the regularization functional through the notion of reproducing kernel Hilbert spaces. From a probabilistic perspective they are the key in the context of Gaussian processes, where the kernel function is known as the covariance function. Traditionally, kernel methods have been used in supervised learning problems with scalar outputs and indeed there has been a considerable amount of work devoted to designing and learning kernels. More recently there has been an increasing interest in methods that deal with multiple outputs, motivated partially by frameworks like multitask learning. In this monograph, we review different methods to design or learn valid kernel functions for multiple outputs, paying particular attention to the connection between probabilistic and functional methods.

14 March 2017 in International Journal of Automation and Computing
Verified
Journal Article
Open access
PDF file
TPTomaso Poggio
Tomaso Poggio
HMHrushikesh Mhaskar
Hrushikesh Mhaskar
LRLorenzo Rosasco
Lorenzo Rosasco
BMBrando Miranda
Brando Miranda
QLQianli Liao
Qianli Liao
The paper reviews and extends an emerging body of theoretical results on deep learning including the conditions under which it can be exponentially better than shallow learning. A class of deep convolutional networks represent an important special case of these conditions, though weight sharing is not the main reason for their exponential advantage. Implications of a few key theorems are discussed, together with new results, open problems and conjectures.

1 February 2007 in Journal of Complexity
Verified
Journal Article
Closed access
FBFrank Bauer
Frank Bauer
SPSergei Pereverzev
Sergei Pereverzev
LRLorenzo Rosasco
Lorenzo Rosasco

1 May 2004 in Neural Computation
Verified
Journal Article
Closed access
LRLorenzo Rosasco
Lorenzo Rosasco
EVErnesto De Vito
Ernesto De Vito
ACAndrea Caponnetto
Andrea Caponnetto
MPMichele Piana
Michele Piana
AVAlessandro Verri
Alessandro Verri
In this letter, we investigate the impact of choosing different loss functions from the viewpoint of statistical learning theory. We introduce a convexity assumption, which is met by all loss functions commonly used in the literature, and study how the bound on the estimation error changes with the loss. We also derive a general result on the minimizer of the expected risk for a convex loss function in the case of classification. The main outcome of our analysis is that for classification, the hinge loss appears to be the loss of choice. Other things being equal, the hinge loss leads to a convergence rate practically indistinguishable from the logistic loss rate and much better than the square loss rate. Furthermore, if the hypothesis space is sufficiently rich, the bounds obtained for the hinge loss are not loosened by the thresholding stage.

1 April 2009 in Journal of Complexity
Verified
Journal Article
Closed access
CMChristine De Mol
Christine De Mol
EVErnesto De Vito
Ernesto De Vito
LRLorenzo Rosasco
Lorenzo Rosasco