The theory behind overfitting, cross validation, regularization, bagging, and boosting: tutorial

B Ghojogh, M Crowley - arXiv preprint arXiv:1905.12787, 2019 - arxiv.org
In this tutorial paper, we first define mean squared error, variance, covariance, and bias of
both random variables and classification/predictor models. Then, we formulate the true and …

A tutorial on canonical correlation methods

V Uurtio, JM Monteiro, J Kandola… - ACM Computing …, 2017 - dl.acm.org
Canonical correlation analysis is a family of multivariate statistical methods for the analysis
of paired sets of variables. Since its proposition, canonical correlation analysis has, for …

Optimizing the latent space of generative networks

P Bojanowski, A Joulin, D Lopez-Paz… - arXiv preprint arXiv …, 2017 - arxiv.org
Generative Adversarial Networks (GANs) have achieved remarkable results in the task of
generating realistic natural images. In most successful applications, GAN models share two …

[PDF][PDF] Linear dimensionality reduction: Survey, insights, and generalizations

JP Cunningham, Z Ghahramani - The Journal of Machine Learning …, 2015 - jmlr.org
Linear dimensionality reduction methods are a cornerstone of analyzing high dimensional
data, due to their simple geometric interpretations and typically attractive computational …

Optimization with sparsity-inducing penalties

F Bach, R Jenatton, J Mairal… - … and Trends® in …, 2012 - nowpublishers.com
Sparse estimation methods are aimed at using or obtaining parsimonious representations of
data or models. They were first dedicated to linear variable selection but numerous …

Convergence rates of inexact proximal-gradient methods for convex optimization

M Schmidt, N Roux, F Bach - Advances in neural …, 2011 - proceedings.neurips.cc
We consider the problem of optimizing the sum of a smooth convex function and a non-
smooth convex function using proximal-gradient methods, where an error is present in the …

Studying very low resolution recognition using deep networks

Z Wang, S Chang, Y Yang, D Liu… - Proceedings of the …, 2016 - openaccess.thecvf.com
Visual recognition research often assumes a sufficient resolution of the region of interest
(ROI). That is usually violated in practice, inspiring us to explore the Very Low Resolution …

Spatial group sparsity regularized nonnegative matrix factorization for hyperspectral unmixing

X Wang, Y Zhong, L Zhang, Y Xu - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
In recent years, blind source separation (BSS) has received much attention in the
hyperspectral unmixing field due to the fact that it allows the simultaneous estimation of both …

[PDF][PDF] Practice and theory of blendshape facial models.

JP Lewis, K Anjyo, T Rhee, M Zhang… - … (State of the Art …, 2014 - scribblethink.org
Abstract “Blendshapes”, a simple linear model of facial expression, is the prevalent
approach to realistic facial animation. It has driven animated characters in Hollywood films …

Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization

SJ Reddi, S Sra, B Poczos… - Advances in neural …, 2016 - proceedings.neurips.cc
We analyze stochastic algorithms for optimizing nonconvex, nonsmooth finite-sum problems,
where the nonsmooth part is convex. Surprisingly, unlike the smooth case, our knowledge of …