These are preliminary results reproducing the paper’s findings, so of course YMMV across workloads. n=50 and the 1.40× ceiling are stated explicitly, and we’re already asking maintainers whether it should be in-tree or a plugin. BWAP also doesn’t discard weights. The mask is periodically refreshed.
Salma Mayorquin PRO
salma-remyx
AI & ML interests
None yet
Recent Activity
repliedto their post about 7 hours ago
Inspired by the methods described in "Batch-wise Adaptive Pruning" (arxiv 2608.14003, COLM '26), we implemented a training-free FFN-neuron-pruning knob for SGLang.
Authors were motivated by the reality that decode is HBM-bandwidth-bound; the gated MLP is the bulk of weights read per step. Threshold methods (TEAL/CATS) collapse under batching; BWAP's periodic top-k over a max-aggregated score keeps the shared batch mask stable.
The method is complementary to KV-sparsity (FFN-weight bandwidth vs KV read, context-length-independent).
Our implementation uses an adaptive mask under a captured graph (topology static = k-wide GEMM; mask change = between-replay buffer update via version-gated post_fill; prune steps replay, explore steps eager).
Preliminary Results GSM8K n=50, ±6pp: 7B dense 92% → ρ=0.5 84% (−8pp) at up to 1.40× (probe ceiling; ~10% realistic under the adaptive schedule; smaller models need lower ρ as accuracy scales with size).
Read more in the upstream issue: https://github.com/sgl-project/sglang/issues/35987 posted an update about 8 hours ago
Inspired by the methods described in "Batch-wise Adaptive Pruning" (arxiv 2608.14003, COLM '26), we implemented a training-free FFN-neuron-pruning knob for SGLang.
Authors were motivated by the reality that decode is HBM-bandwidth-bound; the gated MLP is the bulk of weights read per step. Threshold methods (TEAL/CATS) collapse under batching; BWAP's periodic top-k over a max-aggregated score keeps the shared batch mask stable.
The method is complementary to KV-sparsity (FFN-weight bandwidth vs KV read, context-length-independent).
Our implementation uses an adaptive mask under a captured graph (topology static = k-wide GEMM; mask change = between-replay buffer update via version-gated post_fill; prune steps replay, explore steps eager).
Preliminary Results GSM8K n=50, ±6pp: 7B dense 92% → ρ=0.5 84% (−8pp) at up to 1.40× (probe ceiling; ~10% realistic under the adaptive schedule; smaller models need lower ρ as accuracy scales with size).
Read more in the upstream issue: https://github.com/sgl-project/sglang/issues/35987 reacted to TravisMuhlestein's post with 🔥 1 day ago
One of the most underrated parts of AI-assisted engineering may have nothing to do with the model.
It's the infrastructure around the engineer.
Shriyash Balshetwar and Shubham Jangle, engineers at GoDaddy, were spending roughly 16 mechanical pull requests per week managing localization branches. None of the work was particularly difficult—it was repetitive, easy to forget, and occasionally capable of blocking releases.
They built a GitHub App to remove the entire workflow.
What I find interesting is what happened underneath the simple idea of "automate the PRs."
The production system needed idempotent webhook handling, installation-scoped authentication, retry logic around GitHub's asynchronous mergeability state, per-repository configuration, and safe pattern matching.
The app itself is under 900 lines of JavaScript.
The interesting lesson is that the hard part of automation isn't always the automation.
It's building the reliability around it.
As AI agents take on more software engineering tasks, I expect this distinction to become even more important. The systems surrounding an agent—events, permissions, state, retries, validation, and feedback—may matter as much as the model making the decision.
🔗 https://www.godaddy.com/resources/news/how-a-github-app-saved-us-hours-of-manual-effort
Curious what other engineering workflows people have found worth automating end-to-end.