Encoding large information structures in linear algebra and statistical models
2022-01-15Code Available0· sign in to hype
David Banh, Alan Huang
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/askexplain/summary_sampling_via_foldingOfficialIn papernone★ 1
Abstract
Large information sizes in samples and features can be encoded to speed up the learning of statistical models based on linear algebra and remove unwanted signals. Encoding information can reduce both sample and feature dimension to a smaller representational set. Here two examples are shown on linear mixed models and mixture models speeding up the run time for parameter estimation by a factor defined by the user's choice on dimension reduction (can be linear, quadratic or beyond based on dimension specification).