Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tsz-Chung Lai

dblp:91/4762 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Speech recognition and synthesis · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis › automatic speech recognition › speaker adaptation
maximum-likelihood linear regression
0.112009
Maximum Penalized Likelihood Kernel Regression for Fast Adaptation · IEEE Trans. Speech Audio Process. 2009
Natural language and speech › Speech recognition and synthesis › automatic speech recognition
speaker adaptation
0.112009
Maximum Penalized Likelihood Kernel Regression for Fast Adaptation · IEEE Trans. Speech Audio Process. 2009

Methods — techniques the papers use, named apart from their topics

maximum a posteriori linear regression · 0.1kernel regression · 0.1convex optimization · 0.1
YearPublicationVenuePosition
2009 Maximum Penalized Likelihood Kernel Regression for Fast Adaptation
abstract
This paper proposes a nonlinear generalization of the popularmaximum-likelihoodlinearregression(MLLR) adaptation algorithm using kernel methods. The proposed method, calledmaximumpenalizedlikelihoodkernelregressionadaptation (MPLKR), applies kernel regression with appropriate regularization to determine the affine model transform in a kernel-induced high-dimensional feature space. Although this is not the first attempt of applying kernel methods to conventional linear adaptation algorithms, unlike most of other kernelized adaptation methods such as kernel eigenvoice or kernel eigen-MLLR, MPLKR has the advantage that it is a convex optimization and its solution is always guaranteed to be globally optimal. In fact, the adapted Gaussian means can be obtained analytically by simply solving a system of linear equations. From the Bayesian perspective, MPLKR can also be considered as the kernel version ofmaximumaposteriorilinearregression(MAPLR) adaptation. Supervised and unsupervised speaker adaptation using MPLKR were evaluated on the Resource Management and Wall Street Journal 5K tasks, respectively, achieving a word error rate reduction of 23.6% and 15.5% respectively over the speaker-independently model.
Brian Kan-Wing Mak, Tsz-Chung Lai, Ivor W. Tsang, James T. Kwok
IEEE Trans. Speech Audio Process.2
2006 Improving Reference Speaker Weighting Adaptation by the Use of Maximum-Likelihood Reference Speakers
abstract
We would like to revisit a simple fast adaptation technique called reference speaker weighting (RSW). RSW is similar to eigenvoice (EV) adaptation, and simply requires the model of a new speaker to lie on the span of a set of reference speaker vectors. In the original RSW, the reference speakers are computed through a hierarchical speaker clustering (HSC) algorithm using information such as the gender and speaking rate. We show in this paper that RSW adaptation may be improved if those training speakers that have the highest likelihoods of the adaptation data are selected as the reference speakers; we call them the maximum-likelihood (ML) reference spers.ak- When RSW adaptation was evaluated on WSJ0 using 5s of adaptation speech, the word error rate reduction can be boosted from 2.54% to 9.15% by using 10 ML reference speakers instead of reference speakers determined from HSC. Moreover, when compared with EV, MAP, MLLR, and eKEV on fast adaptation, we are surprised that the algorithmically simplest RSW technique actually gives the best performance.
Brian Kan-Wing Mak, Tsz-Chung Lai, Roger Hsiao
ICASSP (1)2