Pith. sign in

REVIEW 1 cited by

Auto-Differentiating Linear Algebra

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.08717 v5 pith:HHNXXLB2 submitted 2017-10-24 cs.MS cs.LGstat.ML

classification cs.MScs.LGstat.ML
keywords learningmodelsbayesiangaussianlinearmxnetoperatorsprimitives
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Development systems for deep learning (DL), such as Theano, Torch, TensorFlow, or MXNet, are easy-to-use tools for creating complex neural network models. Since gradient computations are automatically baked in, and execution is mapped to high performance hardware, these models can be trained end-to-end on large amounts of data. However, it is currently not easy to implement many basic machine learning primitives in these systems (such as Gaussian processes, least squares estimation, principal components analysis, Kalman smoothing), mainly because they lack efficient support of linear algebra primitives as differentiable operators. We detail how a number of matrix decompositions (Cholesky, LQ, symmetric eigen) can be implemented as differentiable operators. We have implemented these primitives in MXNet, running on CPU and GPU in single and double precision. We sketch use cases of these new operators, learning Gaussian process and Bayesian linear regression models, where we demonstrate very substantial reductions in implementation complexity and running time compared to previous codes. Our MXNet extension allows end-to-end learning of hybrid models, which combine deep neural networks (DNNs) with Bayesian concepts, with applications in advanced Gaussian process models, scalable Bayesian optimization, and Bayesian active learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Variational Quantum Simulation of Anyonic Chains

    quant-ph 2024-12 conditional novelty 5.0 of 10

    RSOS anyonic chains can be encoded into qubit registers with ceil(log2 p) qubits per site, and variational Euler-Cartan circuits prepare their critical ground states with energy errors below 0.5% for A_p chains with p...

Pith tools