Searcharxiv⌕ Search

arXiv subjects

Yi-Hao Kao

Publications and source records attributed to Yi-Hao Kao.

4 recordsLinked to original sources

Richardson tableaux and Motzkin paths

Richardson tableaux were introduced by Karp and Precup in their study of irreducible components of Springer fibers that are Richardson varieties. Guo gave an explicit bijection between Richardson tableaux and Motzkin paths through noncrossing involutions and the Robinson--Schensted (RS) algorithm. In this paper, we study Richardson tableaux of a fixed shape from the viewpoint of Motzkin paths. We introduce a shape algorithm, independent of the RS algorithm, that directly determines the shape of the corresponding Richardson tableau from a Motzkin path. Based on this algorithm, we construct a local bijection which keeps track of the major statistic and reproves combinatorially Karp and Precup's $q$-enumeration formula for Richardson tableaux of a given shape. We also prove in two ways a conjecture of Guo on the comajor generating function for Richardson tableaux with a prescribed number of odd columns.

math.CO↗

Learning a Factor Model via Regularized PCA

We consider the problem of learning a linear factor model. We propose a regularized form of principal component analysis (PCA) and demonstrate through experiments with synthetic and real data the superiority of resulting estimates to those produced by pre-existing factor analysis approaches. We also establish theoretical results that explain how our algorithm corrects the biases induced by conventional approaches. An important feature of our algorithm is that its computational requirements are similar to those of PCA, which enjoys wide use in large part due to its efficiency.

cs.LG↗

A Hybrid Method for Distance Metric Learning

We consider the problem of learning a measure of distance among vectors in a feature space and propose a hybrid method that simultaneously learns from similarity ratings assigned to pairs of vectors and class labels assigned to individual vectors. Our method is based on a generative model in which class labels can provide information that is not encoded in feature vectors but yet relates to perceived similarity between objects. Experiments with synthetic data as well as a real medical image retrieval problem demonstrate that leveraging class labels through use of our method improves retrieval performance significantly.

cs.LG↗

Directed Time Series Regression for Control

We propose directed time series regression, a new approach to estimating parameters of time-series models for use in certainty equivalent model predictive control. The approach combines merits of least squares regression and empirical optimization. Through a computational study involving a stochastic version of a well known inverted pendulum balancing problem, we demonstrate that directed time series regression can generate significant improvements in controller performance over either of the aforementioned alternatives.

cs.LG↗