Name
Abstract | ||
|---|---|---|
We consider the problem of inference in a linear regression model in which the relative ordering of the input features and output labels is not known. Such datasets naturally arise from experiments in which the samples are shuffled or permuted during the protocol. In this work, we propose a framework that treats the unknown permutation as a latent variable. We maximize the likelihood of observations using a stochastic expectation-maximization (EM) approach. We compare this to the dominant approach in the literature, which corresponds to hard EM in our framework. We show on synthetic data that the stochastic EM algorithm we develop has several advantages, including lower parameter error, less sensitivity to the choice of initialization, and significantly better performance on datasets that are only partially shuffled. We conclude by performing two experiments on real datasets that have been partially shuffled, in which we show that the stochastic EM algorithm can recover the weights with modest error. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ALLERTON.2018.8635907 | Allerton |
Keywords | Field | DocType |
Linear regression,Optimization,Approximation algorithms,Markov processes,Computational modeling,Linear programming | Approximation algorithm,Mathematical optimization,Markov process,Expectation–maximization algorithm,Computer science,Latent variable,Synthetic data,Linear programming,Initialization,Linear regression | Conference |
ISSN | ISBN | Citations |
2474-0195 | 978-1-5386-6596-1 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abubakar Abid | 1 | 6 | 5.28 |
| James Y. Zou | 2 | 19 | 4.82 |