Compressed linear algebra for large-scale machine learning
Large-scale machine learning (ML) algorithms are often iterative, using repeated read-only
data access and I/O-bound matrix-vector multiplications to converge to an optimal model. It …
data access and I/O-bound matrix-vector multiplications to converge to an optimal model. It …
A review of envelope models
The envelope model was first introduced as a parsimonious version of multivariate linear
regression. It uses dimension reduction techniques to remove immaterial variation in the …
regression. It uses dimension reduction techniques to remove immaterial variation in the …
Big data and partial least‐squares prediction
We give a commentary on the challenges of big data for Statistics. We then narrow our
discussion to one of those challenges: dimension reduction. This leads to consideration of …
discussion to one of those challenges: dimension reduction. This leads to consideration of …
Space-efficient re-pair compression
Re-Pair [5] is an effective grammar-based compression scheme achieving strong
compression rates in practice. Let n, σ, and d be the text length, alphabet size, and dictionary …
compression rates in practice. Let n, σ, and d be the text length, alphabet size, and dictionary …
Compressed linear algebra for large-scale machine learning
Large-scale machine learning algorithms are often iterative, using repeated read-only data
access and I/O-bound matrix-vector multiplications to converge to an optimal model. It is …
access and I/O-bound matrix-vector multiplications to converge to an optimal model. It is …
AWARE: Workload-aware, Redundancy-exploiting Linear Algebra
S Baunsgaard, M Boehm - Proceedings of the ACM on Management of …, 2023 - dl.acm.org
Compression is an effective technique for fitting data in available memory, reducing I/O, and
increasing instruction parallelism. While data systems primarily rely on lossless …
increasing instruction parallelism. While data systems primarily rely on lossless …
A space-optimal grammar compression
Y Takabatake, H Sakamoto - 25th Annual European …, 2017 - drops.dagstuhl.de
A grammar compression is a context-free grammar (CFG) deriving a single string
deterministically. For an input string of length N over an alphabet of size sigma, the smallest …
deterministically. For an input string of length N over an alphabet of size sigma, the smallest …
Impossibility results for grammar-compressed linear algebra
Impossibility Results for Grammar-Compressed Linear Algebra Page 1 Impossibility Results
for Grammar-Compressed Linear Algebra Amir Abboud IBM Almaden Research Center amir.abboud@gmail.com …
for Grammar-Compressed Linear Algebra Amir Abboud IBM Almaden Research Center amir.abboud@gmail.com …
[PDF][PDF] 支撑机器学习的数据管理技术综述
崔建伟, 赵哲, 杜小勇 - 软件学报, 2021 - jos.org.cn
应用驱动创新, 数据库技术就是在支持主流应用的提质降本增效中发展起来的. 从OLTP, OLAP
到今天的在线机器学习建模无不如此. 机器学习是当前人工智能技术落地的主要途径 …
到今天的在线机器学习建模无不如此. 机器学习是当前人工智能技术落地的主要途径 …
On dynamic bitvector implementations
S Dönges, SJ Puglisi, R Raman - 2022 Data Compression …, 2022 - ieeexplore.ieee.org
Bitvectors that support rank and select queries are the workhorses of succinct data
structures, implementations of which are now widespread, for example, in bioinformatics …
structures, implementations of which are now widespread, for example, in bioinformatics …