Optimal memory-aware backpropagation of deep join networks
From MaRDI portal
Recommendations
- Pipelined model parallelism: complexity results and memory considerations
- scientific article; zbMATH DE number 166796
- The Data-Flow Equations of Checkpointing in Reverse Automatic Differentiation
- Convergence of back-propagation with momentum for network architectures with skip connections
- Using machine learning to model the training scalability of convolutional neural networks on clusters of GPUs
Cites work
- Algorithm 799: revolve
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- Complete Register Allocation Problems
- Deep metric learning using triplet network
- H-revolve: a framework for adjoint computation on synchronous hierarchical platforms
- scientific article; zbMATH DE number 4141383 (Why is no real title available?)
- Optimal memory-aware backpropagation of deep join networks
- Optimal multistage algorithm for adjoint computation
- Scheduling series-parallel task graphs to minimize peak memory
Cited in
(3)
This page was built for publication: Optimal memory-aware backpropagation of deep join networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993499)