Machine learning paradigms for speech recognition: An overview
L Deng, X Li - IEEE Transactions on Audio, Speech, and …, 2013 - ieeexplore.ieee.org
Automatic Speech Recognition (ASR) has historically been a driving force behind many
machine learning (ML) techniques, including the ubiquitously used hidden Markov model …
machine learning (ML) techniques, including the ubiquitously used hidden Markov model …
Review of transfer learning in modeling additive manufacturing processes
Modeling plays an important role in the additive manufacturing (AM) process and quality
control. In practice, however, only limited data are available for each product due to the …
control. In practice, however, only limited data are available for each product due to the …
A survey on multi-task learning
Multi-Task Learning (MTL) is a learning paradigm in machine learning and its aim is to
leverage useful information contained in multiple related tasks to help improve the …
leverage useful information contained in multiple related tasks to help improve the …
Invariant models for causal transfer learning
Methods of transfer learning try to combine knowledge from several related tasks (or
domains) to improve performance on a test task. Inspired by causal methodology, we relax …
domains) to improve performance on a test task. Inspired by causal methodology, we relax …
A survey on transfer learning
A major assumption in many machine learning and data mining algorithms is that the
training and future data must be in the same feature space and have the same distribution …
training and future data must be in the same feature space and have the same distribution …
Deep multi-task representation learning: A tensor factorisation approach
Most contemporary multi-task learning methods assume linear models. This setting is
considered shallow in the era of deep learning. In this paper, we present a new deep multi …
considered shallow in the era of deep learning. In this paper, we present a new deep multi …
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
V Koltchinskii, K Lounici, AB Tsybakov - 2011 - projecteuclid.org
This paper deals with the trace regression model where n entries or linear combinations of
entries of an unknown m 1× m 2 matrix A 0 corrupted by noise are observed. We propose a …
entries of an unknown m 1× m 2 matrix A 0 corrupted by noise are observed. We propose a …
[PDF][PDF] Analysis of multi-stage convex relaxation for sparse regularization.
T Zhang - Journal of Machine Learning Research, 2010 - jmlr.org
Analysis of Multi-stage Convex Relaxation for Sparse Regularization Page 1 Journal of
Machine Learning Research 11 (2010) 1081-1107 Submitted 5/09; Revised 1/10; …
Machine Learning Research 11 (2010) 1081-1107 Submitted 5/09; Revised 1/10; …
[PDF][PDF] Iterative reweighted algorithms for matrix rank minimization
The problem of minimizing the rank of a matrix subject to affine constraints has applications
in several areas including machine learning, and is known to be NP-hard. A tractable …
in several areas including machine learning, and is known to be NP-hard. A tractable …