implementation detail · filed under optimization
CUDA graph capture of the optimizer step
Capturing the whole optimizer step in a CUDA graph to reduce launch overhead.
Also called We capture the whole step in a CUDA graph.
- source
- 1
- model
- 1
- lab adopt it
- 1
- strongest
- used
How sources treat it
One count per evidence span, weakest treatment to strongest.
used 1
Documented in
Evidence
1 span quoted from the sources, strongest treatment first.
We capture the whole step in a CUDA graph to remove this overhead.
usedsoftware implementationin Qwen3.8-NextQwen
Filed alongside
Other methods under optimization :: optimizer.
MuonPer-Head MuonAdamWCategory-specific assignment of Muon and AdamWSplit fused gradients before orthogonalizationNesterov momentumSinkhorn-balanced updateAdam without weight decay for the N-gram embedding tableAdamW for attention and GDN output gatesAdamW for gated-residual low-rank projectionsAdamW for input embeddings and output headAdamW for the MoE routerAsynchronous Micro-Group pipelineCanzonaEight-step Newton–Schulz iterationHybrid Muon and AdamW parameter-group optimizer assignmentHybrid Newton–Schulz iterationsHybrid optimization with Muon and AdamMoonlight-style learning-rate scalingMuon orthogonalization accuracy refinementMuon restricted to two-dimensional linear-map weightsMuon SplitMuownPeer-to-peer shard retrieval for Muon orthogonalization