Tue, Nov 14, 2017 @ 10:00 AM - 12:00 PM
Thomas Lord Department of Computer Science
Tuesday, November, 14th, 10 a.m. to 12 p.m., PHE 223
Title: Improving machine learning algorithms with efficient data relevance discovery
This is the era of big data, where both challenges and opportunities lie ahead for the machine learning research. The data are created nowadays at an unprecedented pace with an unignorable cost in collecting, storing, and computing with the current scale of data. As the computational power that we possess gradually plateaus, it is an ever-increasing challenge to fully utilize the wealth of big data, where better data reduction techniques and scalable algorithms are the keys to a solution. We observe that to answer a certain query, the data are not equally important. Based on the models and the query, we provide efficient access to the numerical scores of the data points that represent their relevance in the current task. It enables us to wisely devote the computation resources to the important data, which improves the scalability and the reliability. We present our work under three applications: 1) tensor CP decomposition, 2) random-walk matrix-polynomial sparsification, where we provide an efficient access to the statistical leverage score for a faster numerical routine; and 3) matrix completability analysis, where we analyze the underlying completability structure for a more reliable estimation.
Location: Charles Lee Powell Hall (PHE) - 223
Audiences: Everyone Is Invited
Contact: Lizsl De Leon