Encoding large information structures in linear algebra and statistical models
David Banh, Alan Huang

TL;DR
This paper presents methods to encode large information structures in linear algebra and statistical models, enabling faster parameter estimation and dimension reduction for large datasets.
Contribution
It introduces encoding techniques for large data in linear mixed and mixture models to accelerate computation and reduce dimensions.
Findings
Speeded up parameter estimation by a factor based on chosen dimension reduction
Demonstrated encoding reduces sample and feature dimensions effectively
Applicable to linear mixed and mixture models
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Gaussian Processes and Bayesian Inference · Control Systems and Identification
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
