SearcharxivSearch

arXiv subjects

Kai-Ling Lo

Publications and source records attributed to Kai-Ling Lo.

4 recordsLinked to original sources

Learning Item Embeddings and Hyperparameters for IRT Calibration via Monte Carlo EM

High-stakes computerized adaptive tests (CATs) must continually calibrate new items in their item bank. When an item is new, few responses are available, so item parameter estimates -- and thus test scores -- are poor. Item features and explanatory item response theory (IRT) models mitigate this by folding item content into calibration. Neural IRT models, whose item parameters are neural-net outputs, are powerful, but tuning hyperparameters and architectures in real time while a CAT is scoring is impractical and threatens validity. We propose a pre-launch step that fits a neural net to produce low-dimensional item embeddings, so the production system can use a simple linear explanatory IRT model on top of them. We use a neural parameterization of the 3-parameter logistic (3PL) model in which a feature network maps each item's content features to a representation $h_j = z(x_j) \in \mathbb{R}^d$, from which the discrimination and difficulty $(a,b)$ follow generalized linear forms; the guessing parameter $c$ is fixed to a global constant to avoid identifiability issues. The feature network and latent abilities $θ$ are fit jointly via Monte Carlo Expectation-Maximization (MCEM), with no separate ability-estimation or pre-calibration stage. Using an item-split protocol that holds out entire items to simulate feature-only evaluation, we apply this to two Duolingo English Test practice task types -- yes/no vocabulary and vocabulary-in-context -- searching over feature sets, architectures, and dimensions $d$. A shallow two-layer ReLU network with $d=6$ and hand-engineered scalar features matches or beats larger architectures on held-out items for both. This is a first step toward a compact, content-derived item embedding for the Scalable Parametric Item Calibration Engine (SPICE), the fully Bayesian engine at the core of the S2A3 adaptive-testing system.

stat.AP

GPoeT-2: A GPT-2 Based Poem Generator

This project aims to produce the next volume of machine-generated poetry, a complex art form that can be structured and unstructured, and carries depth in the meaning between the lines. GPoeT-2 is based on fine-tuning a state of the art natural language model (i.e. GPT-2) to generate limericks, typically humorous structured poems consisting of five lines with a AABBA rhyming scheme. With a two-stage generation system utilizing both forward and reverse language modeling, GPoeT-2 is capable of freely generating limericks in diverse topics while following the rhyming structure without any seed phrase or a posteriori constraints.Based on the automated generation process, we explore a wide variety of evaluation metrics to quantify "good poetry," including syntactical correctness, lexical diversity, and subject continuity. Finally, we present a collection of 94 categorized limericks that rank highly on the explored "good poetry" metrics to provoke human creativity.

cs.CL

Knowledge-Grounded Response Generation with Deep Attentional Latent-Variable Model

End-to-end dialogue generation has achieved promising results without using handcrafted features and attributes specific for each task and corpus. However, one of the fatal drawbacks in such approaches is that they are unable to generate informative utterances, so it limits their usage from some real-world conversational applications. This paper attempts at generating diverse and informative responses with a variational generation model, which contains a joint attention mechanism conditioning on the information from both dialogue contexts and extra knowledge.

cs.CL

Natural Language Generation by Hierarchical Decoding with Linguistic Patterns

Natural language generation (NLG) is a critical component in spoken dialogue systems. Classic NLG can be divided into two phases: (1) sentence planning: deciding on the overall sentence structure, (2) surface realization: determining specific word forms and flattening the sentence structure into a string. Many simple NLG models are based on recurrent neural networks (RNN) and sequence-to-sequence (seq2seq) model, which basically contains an encoder-decoder structure; these NLG models generate sentences from scratch by jointly optimizing sentence planning and surface realization using a simple cross entropy loss training criterion. However, the simple encoder-decoder architecture usually suffers from generating complex and long sentences, because the decoder has to learn all grammar and diction knowledge. This paper introduces a hierarchical decoding NLG model based on linguistic patterns in different levels, and shows that the proposed method outperforms the traditional one with a smaller model size. Furthermore, the design of the hierarchical decoding is flexible and easily-extensible in various NLG systems.

cs.CL