AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Static Automatic Batching In TensorFlow

ICML 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization · 6 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace sequential loop for Jacobian computation with auto-vectorized pfor loopJacobian computation (VGG16, LSTM) · GPU jacobian benchmarkjacobian rows per second: up to 60x at high output sizesHelped
Use vectorized_map (pfor) for per-example gradients instead of sequential loopPer-example gradients (LSTM, ConvMNIST) · GPU, batch size 256 LSTMexample gradients per second: outperforms tf.while_loop by a factor of 38Helped
Auto-vectorize pfor instead of tf.while_loop for forward pass of linear projectionLinear projection · GPU and CPU forward passGFLOPS vs batch size: iterative approaches 1 to 1.5 orders of magnitude slowerHelped
Auto-vectorize pfor for LSTM forward pass with variable-length sequencesLSTM · GPU and CPU tokens/sectokens per secondMixed
Auto-vectorize pfor for ConvMNIST forward passConvMNIST · GPU and CPU images/secimages per secondHelped
Auto-vectorize pfor for GatedGraphNNGatedGraphNN · GPU edges/secedges processed per secondHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy