Computation and Language · arXiv:2611.26358 v1 · submitted 19 Nov 2026 · 199 references
Beam Model Technical Report
The paper says
“Beam is a sparse Mixture-of-Experts (MoE) model with 501.3B total parameters and 23.4B active parameters, specifically built and optimized for coding, reasoning, and agentic workloads.”
more of the abstract
Beam delivers frontier level reasoning, while requiring 3-4x less inference compute than many models of its class. Pretrained on 23.8T diverse, curated, high-quality tokens, Beam features a 1M-token context window achieved through a novel two-stage midtraining phase, built on verifiable, correctness-anchored data. Post-training leveraged a large-scale, fully asynchronous reinforcement learning (RL) campaign across 10.5K GB300 GPUs, generating over 100M rollouts over 4 weeks of training. We believe this is one of the largest scale RL runs conducted by any open lab to date. Across our evaluation suite, capabilities continued to improve as we increased RL compute, with no sign of a plateau. Supported by deep hardware-model co-design, FP8/NVFP4 quantization, and a 1.93B-parameter speculative decoding drafter (DFlash 2), Beam maximizes serving throughput with efficient, flexible deployment. Averaged across conversation turns and harm categories, Beam refuses or pivots on 88.9% of harmful requests while complying with 81.5% of harmless requests, achieving the highest refusal/pivot rate on harmful requests among open-weight models on the Pareto frontier.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 20 Nov 2026 · read 599,600 of 609,632 characters · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions.
18 minor · 1 open question
How often objections from reviews like this one are right: not yet measured
The paper, first character to last
Not given to the reviewer: 10,032 of the paper's 609,632 characters. Not checked: figures, code, what the 199 references say.
18 minor objections
The paper says, at §1 (Introduction)
Pith says: minor objection 1 of 18
The phrase 'while delivering frontier-level reasoning, while requiring 3-4x less inference compute' is redundant and grammatically awkward. Consider rephrasing for clarity.
The paper says, at §2.1.1 (Model Architecture, Table 1)
Pith says: minor objection 2 of 18
The table lists 'Total Parameters' as 501.3B and 'Activated Parameters' as 23.4B. It would be helpful to also include the number of parameters for the embedding layer and the LM head, as these are often excluded from 'non-embedding' parameter counts used in scaling laws.
show 16 more
The paper says, at §2.1.2 (Training Recipe, Table 2)
Pith says: minor objection 3 of 18
The peak learning rate is given with many decimal places (7.63701912×10^{-4}). It is unclear whether this level of precision is meaningful or an artifact of the tuning process. The authors should comment on the sensitivity of the training to small changes in the learning rate.
The paper says, at §2.2.1 (Web Data Curation, Figure 2)
Pith says: minor objection 4 of 18
The figure is described but not visible in the supplied text. The caption mentions 'domain-specific filtering and quality partitioning' but does not specify the criteria used for partitioning. The authors should ensure the figure clearly illustrates the decision boundaries and thresholds used.
The paper says, at §2.2.3 (STEM and PDF Data Curation)
Pith says: minor objection 5 of 18
The paper does not specify which OCR model was used. This is important for reproducibility. The authors should either name the model or provide sufficient detail about its architecture and training data.
The paper says, at §3.1 (Optimization)
Pith says: minor objection 6 of 18
The paper states that 5% of the maximum pretraining learning rate was found to be optimal, but does not provide details on the sweep range or the number of configurations tested. This makes it difficult to assess the robustness of this finding.
The paper says, at §4.2.2 (Asynchronous rollouts)
Pith says: minor objection 7 of 18
The paper mentions that inference workers are updated after every optimizer step, but does not specify the mechanism for this update (e.g., whether it involves broadcasting weights or using a parameter server). This is important for understanding the system's scalability and potential bottlenecks.
The paper says, at §4.2.2 (Reward integrity)
Pith says: minor objection 8 of 18
The paper mentions a 'reward-hacking rubric' but does not provide details on its construction or validation. Given the importance of reward integrity for RL, the authors should describe how the rubric was developed and tested.
The paper says, at §4.3.2 (SFT Data Mixture, Table 5)
Pith says: minor objection 9 of 18
The table shows that 'Safety: direct requests + jailbreak/over-refusal' constitutes only 1.62% of the SFT mixture by trace and 0.18% by tokens. This seems very small for a component that is critical for safety. The authors should explain why this proportion is sufficient and how it was determined.
The paper says, at §4.3.3 (RL Training, Knowledge Calibration)
Pith says: minor objection 10 of 18
Similar to the previous comment, the paper should justify why 3% is the right proportion for knowledge calibration in the RL mixture, and discuss how this was determined experimentally.
The paper says, at §5 (Evaluations, Table 8)
Pith says: minor objection 11 of 18
The table includes many benchmarks but does not provide confidence intervals or error bars. Given the stochastic nature of LLM evaluations, especially with temperature sampling, the authors should report uncertainty estimates (e.g., bootstrap confidence intervals) to allow meaningful comparisons between models.
The paper says, at §5 (Evaluations, Table 9)
Pith says: minor objection 12 of 18
The paper reports HLE (no tools) scores but does not specify the evaluation protocol (e.g., number of samples, temperature). This is important for reproducibility. The authors should provide these details in the main text or in an appendix.
The paper says, at §6 (Infrastructure, Figure 14)
Pith says: minor objection 13 of 18
The figure is described but not visible. The caption mentions 'logical interactions rather than transport protocols.' The authors should ensure the figure is clear and includes all components mentioned in the text (control service, rollout workers, training service, etc.).
The paper says, at §6.4.2 (Goodput, Figure 16)
Pith says: minor objection 14 of 18
The figure is not visible. The caption mentions 'operational events' taking 1.7 days. The authors should clarify what constitutes an 'operational event' and whether this time is included in the goodput calculation.
The paper says, at §7 (Safety, Figure 18)
Pith says: minor objection 15 of 18
The figure is not visible. The caption mentions 'observed safety-helpfulness Pareto frontier.' The authors should define what models are included in the 'observed' set and how the frontier is constructed.
The paper says, at §7.3.2 (Conversational ISE, Table 14)
Pith says: minor objection 16 of 18
The table shows results for many models but does not include confidence intervals. Given the relatively small number of prompts per category (100 conversations per category), the authors should report uncertainty estimates to assess the reliability of the comparisons.
The paper says, at §7.3.3 (Agentic ISE, Table 17)
Pith says: minor objection 17 of 18
The paper reports harmful compliance rates but does not specify the number of scenarios or rollouts per scenario. This information is necessary to assess the statistical significance of the reported differences between models.
The paper says, at §A (Hyperparameter Tuning)
Pith says: minor objection 18 of 18
The appendix describes a method for tuning the effective learning rate using a quadratic fit. However, it does not report the goodness of fit or the number of data points used. The authors should provide these details to allow readers to assess the reliability of the tuning procedure.
Open questions (1)
Pith raised these and could not confirm them against the text of the paper it read. They are questions for the authors, not findings.
- §4.2.2 (Generalization) Pith raised a concern here that it could not check against the text of the paper it was given, so it is not published as an objection.
What would settle it
Train a model with the same architecture, data, and RL recipe but with a different random seed or on a different hardware configuration. If the RL training plateaus or shows diminishing returns earlier than reported, or if the model fails to achieve comparable benchmark scores, the central claim of predictable scaling and continued improvement would be undermined.
from Pith's summary of the paper
How the review went
4 passes by deepseek-v4-flash · 20 Nov 2026
- Reader holds up, with conditions
- Skeptic concern withdrawn: Pith's reviewer misread the paper
- Referee 18 minor
- Check against the paper kept 0 of 6 objections
Not run on this paper: the editor, the simulated authors' defence.
Pith's passes raised 6 objections. A check against the paper's text kept 0, withdrew 5 (5 Pith's reviewer misread the paper) and left 1 as a question.
The review in full
The stress test's concern
Withdrawn: Pith's reviewer misread the paper.
The paper says
“Beam delivers frontier level reasoning, while requiring 3-4x less inference compute than many models of its class.”
The referee's report
Not published. Pith's referee wrote this assessment before its objections were checked against the paper, and 5 of its 5 major objections did not survive that check.
Pith's reading of the paper (a machine's summary, not the authors')
The paper introduces Beam, an open-weight sparse Mixture-of-Experts (MoE) language model with 501.3B total parameters and 23.4B active parameters, developed by Reflection. The authors claim that Beam delivers frontier-level reasoning performance on coding, mathematics, and agentic tasks while requiring 3-4x less inference compute than comparable models. This efficiency is achieved through a combination of novel architectural components (depth-scaled residual connections, adaptive expert bias updates), rigorous data curation pipelines (domain-specific filtering, quality-aware upsampling, large-scale OCR), a two-stage midtraining pipeline that extends context length to 1M tokens, and a massive asynchronous reinforcement learning campaign that generated over 100M rollouts on 10.5K GPUs. The paper also reports that Beam achieves the highest refusal/pivot rate on harmful requests among open-weight models on the Pareto frontier (88.9% harmful refusal, 81.5% harmless compliance). If true, this would represent a significant advance in open-weight model capabilities, particularly for agentic and reasoning-heavy workloads, while maintaining strong safety alignment.
What carries the argument. The central object is the depth-scaled residual connection (DSRes), which rescales the residual stream by 1 over the square root of the number of accumulated sublayers: $\mathbf{x}_n = \frac{1}{\sqrt{n}} \sum_{t=1}^n \mathbf{h}_t$. This ensures that the RMS of the residual stream remains approximately constant across depth, preventing unbounded activation growth. The adaptive expert bias update schedule uses a cosine decay from a maximum learning rate, improving routing stability at scale. The two-stage midtraining pipeline first develops core reasoning capabilities at 32K context, then extends to 512K context using a mixture of organic and synthetic long-context data. The asynchronous RL system uses GRPO-style policy gradients with routing replay, nucleus sampling consistency, and task-dependent rollout deadlines to handle heavy-tailed rollout durations.
Core claim. The central claim is that Beam, a 501.3B-parameter sparse MoE model (23.4B active parameters), achieves frontier-level reasoning and agentic capabilities while being 3-4x more inference-efficient than many models of its class. The authors argue that this efficiency-performance combination is enabled by: (1) a depth-scaled residual connection (DSRes) that preserves activation norms across depth, (2) an adaptive expert bias update schedule that improves routing stability at scale, (3) domain-specific data curation pipelines that preserve high-value technical content, (4) a two-stage midtraining pipeline that extends context to 1M tokens without degrading general capabilities, and (5) a large-scale asynchronous RL campaign that shows continued improvement without plateau. The paper also claims that Beam achieves the best safety-helpfulness tradeoff among open-weight models on the Pareto frontier.
The premise it rests on. The claim that Beam's RL training shows 'no sign of a plateau' and that capabilities 'continued to improve as we increased RL compute' is based on a single large RL run, and the paper's own Figure 4 shows that some benchmarks plateau or decline in later stages, suggesting this is an overgeneralization.
If the paper is right (Pith's inferences, not the authors')
If Beam's scaling claims hold, it suggests that the combination of DSRes, adaptive expert bias updates, and quality-aware data curation can produce frontier-level reasoning in a model with only 23.4B active parameters, potentially democratizing access to advanced AI capabilities.
The reported 3-4x inference efficiency gain over comparable models would make Beam significantly more cost-effective for deployment in coding, mathematics, and agentic applications, potentially shifting the cost-performance frontier for open-weight models.
The claim that RL capabilities continued to improve without plateau over 100M rollouts suggests that further scaling of RL compute could yield additional gains, though the paper acknowledges this is based on a single run.
The safety results (88.9% harmful refusal, 81.5% harmless compliance) suggest that strong safety alignment can be achieved alongside frontier-level capabilities in open-weight models, potentially influencing safety practices in the open-source community.
The paper's claim that RL shows 'no sign of a plateau' is based on a single large run; the authors acknowledge that some benchmarks (e.g., BrowseComp) plateau or decline in later stages. A reader should treat the 'no plateau' claim as a description of the observed trend rather than a proven law.
The depth-scaled residual connection (DSRes) is presented as a drop-in replacement for standard residual connections in pre-normalization architectures. If validated, this technique could be adopted broadly in large-scale transformer training to improve stability without architectural changes.
The paper's data curation methodology—particularly domain partitioning and quality-aware upsampling—could be applied independently of the model architecture to improve training data quality for other large language models.
The multi-teacher on-policy distillation (MOPD) approach for combining agentic and alignment capabilities into a single model could serve as a template for other organizations seeking to merge specialized expert models.
Check this review
What was read
The passes were given 599,600 of the 609,632 characters of the paper's LaTeX source.
Fingerprint of that text (SHA-256): df087627d6664a0cb24150e999823cf601ccf43419608451c7306b747f4b9a72
Pith does not keep that text. Rebuilt from the paper's source or PDF by the same code, it has this fingerprint if it is the same text. From a copy of Pith's code:
PYTHONPATH=. python scripts/review_input_check.py 2611.26358
The passes, in the order they ran
- Reader deepseek-v4-flash · medium effort · $0.015 · instructions of the Reader, fingerprint f9ead7300382…
- Skeptic deepseek-v4-flash · medium effort · $0.023 · instructions of the Skeptic, fingerprint 8f88c0f61488…
- Referee deepseek-v4-flash · medium effort · $0.015 · instructions of the Referee, fingerprint a852d99aea0d…
- Check against the paper deepseek-v4-flash · medium effort · $0.018 · instructions of the Check against the paper, fingerprint 6c7a6883d551…
- Circularity check deepseek-v4-flash · medium effort · $0.017 · instructions of the Circularity check, fingerprint e9946e39d67b…
- Summary for the page deepseek-v4-flash · medium effort · temperature 0.2 · $0.014 · instructions of the Summary for the page, fingerprint e4f56bf568e7…
The passes cost $0.102 in model calls together.
Version stamped on this review: pith-pipeline@v1.4.1-daily-deepseek-or-medium+deepseek/deepseek-v4-flash+p.ce10e2b95288
Each link opens a pass's instructions as plain text, the exact bytes its fingerprint was taken over. Every stored set of instructions.
curl -s https://pith.science/methodology/prompts/f9ead730038216984cfb56d7cb34332bdf691828296a1de4245f3d6667d4bf56 | sha256sum
prints the fingerprint of the reader's instructions. The same works for every pass.
The receipt
The review's fingerprint was taken on 20 Nov 2026. The review you are reading still matches it.
Fingerprint of the review (SHA-256): a85f6b0f88af8fc4ffc61a200cd4b8cedd6ddf293c562ce195e9a1f099384b16
curl -s 'https://pith.science/api/v1/verdicts/2611.26358?form=canonical' | sha256sum
prints the fingerprint of the review as it stands now. The rule, in four steps.
A matching fingerprint shows the review has not changed since that date. It does not show that the review is right.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, from the paper's LaTeX source.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
How Pith checks papers · The full audit of this paper · Review history (2 versions)
The paper
Abstract
Beam is a sparse Mixture-of-Experts (MoE) model with 501.3B total parameters and 23.4B active parameters, specifically built and optimized for coding, reasoning, and agentic workloads. Beam delivers frontier level reasoning, while requiring 3-4x less inference compute than many models of its class. Pretrained on 23.8T diverse, curated, high-quality tokens, Beam features a 1M-token context window achieved through a novel two-stage midtraining phase, built on verifiable, correctness-anchored data. Post-training leveraged a large-scale, fully asynchronous reinforcement learning (RL) campaign across 10.5K GB300 GPUs, generating over 100M rollouts over 4 weeks of training. We believe this is one of the largest scale RL runs conducted by any open lab to date. Across our evaluation suite, capabilities continued to improve as we increased RL compute, with no sign of a plateau. Supported by deep hardware-model co-design, FP8/NVFP4 quantization, and a 1.93B-parameter speculative decoding drafter (DFlash 2), Beam maximizes serving throughput with efficient, flexible deployment. Averaged across conversation turns and harm categories, Beam refuses or pivots on 88.9% of harmful requests while complying with 81.5% of harmless requests, achieving the highest refusal/pivot rate on harmful requests among open-weight models on the Pareto frontier.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-20
The authors' main claim, as the classifier picked it out 0.53
“Beam delivers frontier level reasoning, while requiring 3-4x less inference compute than many models of its class.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.12 · states limitation 0.11 · human participants 0.06 · controlled comparison 0.15 · randomized assignment 0.02 · states quantitative result 0.98 · compares with prior results 0.82 · mentions code or data availability 0.12
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Beam is a sparse Mixture-of-Experts (MoE) model with 501.3B total parameters and 23.4B active parameters, specifically built and optimized for coding, reasoning, and agentic workloads. | method 0.59 | 0.80 | 0.07 | asserted 1.00 |
| Beam delivers frontier level reasoning, while requiring 3-4x less inference compute than many models of its class. | result 0.93 | 0.76 | 0.25 | asserted 1.00 |
| Pretrained on 23.8T diverse, curated, high-quality tokens, Beam features a 1M-token context window achieved through a novel two-stage midtraining phase, built on verifiable, correctness-anchored data. | method 0.92 | 0.91 | 0.08 | asserted 1.00 |
| Post-training leveraged a large-scale, fully asynchronous reinforcement learning (RL) campaign across 10.5K GB300 GPUs, generating over 100M rollouts over 4 weeks of training. | method 0.98 | 0.95 | 0.05 | asserted 1.00 |
| We believe this is one of the largest scale RL runs conducted by any open lab to date. | interpretation 0.82 | 0.69 | 0.06 | hedged possibility 0.57 |
| Across our evaluation suite, capabilities continued to improve as we increased RL compute, with no sign of a plateau. | result 0.93 | 0.95 | 0.19 | asserted 1.00 |
| Supported by deep hardware-model co-design, FP8/NVFP4 quantization, and a 1.93B-parameter speculative decoding drafter (DFlash 2), Beam maximizes serving throughput with efficient, flexible deployment. | method 0.91 | 0.79 | 0.05 | asserted 1.00 |
| Averaged across conversation turns and harm categories, Beam refuses or pivots on 88.9% of harmful requests while complying with 81.5% of harmless requests, achieving the highest refusal/pivot rate on harmful requests among open-weight models on the Pareto frontier. | result 1.00 | 0.93 | 0.20 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 0.96 · evidence from observation or experiment 0.93
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-20: 1 request, 6,478 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (72)
Figures are the authors', reproduced from the paper.
References (199)
- [1] N.Shazeer,A.Mirhoseini,K.Maziarzetal.,“OutrageouslyLargeNeuralNetworks: TheSparsely-Gated Mixture-of-ExpertsLayer,”2017.[Online].Available: https://arxiv.org/abs/1701.06538 on PithPith's reviewarXiv
- [2] A.Vaswani,N.Shazeer,N.Parmaretal.,“AttentionIsAllYouNeed,”inAdvancesinNeuralInformation ProcessingSystems,vol.30,2017.[Online].Available: https://proceedings.neurips.cc/paper/2017/hash/3f5 ee243547dee91fbd053c1c4a845aa-Abstract.html on Pith
- [3] J.Kim,B.Lee,C.Parketal.,“Peri-LN:RevisitingNormalizationLayerintheTransformerArchitecture,” 2025.[Online].Available: https://arxiv.org/abs/2502.02732 on PithPith's reviewarXiv
- [4] Gemma Team, S. E. Abd, V. Aggarwalet al., “Gemma 4 Technical Report,” 2026. [Online]. Available: https://arxiv.org/abs/2607.02770 on PithPith's reviewarXiv
- [5] Y.Yin,W.Huang,K.Songetal.,“PanguUltra: PushingtheLimitsofDenseLargeLanguageModelson AscendNPUs,”2025.[Online].Available: https://arxiv.org/abs/2504.07866 on PithPith's reviewarXiv
- [6] J.Ainslie,J.Lee-Thorp,M.deJongetal.,“GQA:TrainingGeneralizedMulti-QueryTransformerModels fromMulti-HeadCheckpoints,”2023.[Online].Available: https://arxiv.org/abs/2305.13245 on PithPith's reviewarXiv
- [7] M.Dehghani,J.Djolonga,B.Mustafaetal.,“ScalingVisionTransformersto22BillionParameters,”2023. [Online].Available: https://arxiv.org/abs/2302.05442 on PithPith's reviewarXiv
- [8] Gemma Team, A. Kamath, J. Ferretet al., “Gemma 3 Technical Report,” 2025. [Online]. Available: https://arxiv.org/abs/2503.19786 on PithPith's reviewarXiv
- [9] J. Su, Y. Lu, S. Panet al., “RoFormer: Enhanced Transformer with Rotary Position Embedding,” 2023. [Online].Available: https://arxiv.org/abs/2104.09864 on PithPith's reviewarXiv
- [10] N.Shazeer,“GLUVariantsImproveTransformer,”2020.[Online].Available: https://arxiv.org/abs/2002.052 02 on Pith
- [11] DeepSeek-AI, A. Liu, B. Fenget al., “DeepSeek-V3 Technical Report,” 2025. [Online]. Available: https://arxiv.org/abs/2412.19437 on PithPith's reviewarXiv
- [12] B. Zhang and R. Sennrich, “Root Mean Square Layer Normalization,” 2019. [Online]. Available: https://arxiv.org/abs/1910.07467 on PithPith's reviewarXiv
- [13] GemmaTeam,M.Riviere,S.Pathaketal.,“Gemma2: ImprovingOpenLanguageModelsataPractical Size,”2024.[Online].Available: https://arxiv.org/abs/2408.00118 on PithPith's reviewarXiv
- [14] A. Kazemnejad, I. Padhi, K. N. Ramamurthyet al., “The Impact of Positional Encoding on Length GeneralizationinTransformers,”2023.[Online].Available: https://arxiv.org/abs/2305.19466 on PithPith's reviewarXiv
- [15] Y.Bondarenko,M.Nagel,andT.Blankevoort,“QuantizableTransformers: RemovingOutliersbyHelping AttentionHeadsDoNothing,”2023.[Online].Available: https://arxiv.org/abs/2306.12929 on PithPith's reviewarXiv
- [16] Z.Qiu,Z.Wang,B.Zhengetal.,“GatedAttentionforLargeLanguageModels: Non-linearity,Sparsity,and Attention-Sink-Free,”2025.[Online].Available: https://arxiv.org/abs/2505.06708 on PithPith's reviewarXiv
- [17] OpenAI,S.Agarwal,L.Ahmadetal.,“gpt-oss-120b&gpt-oss-20bModelCard,”2025.[Online].Available: https://arxiv.org/abs/2508.10925 on PithPith's reviewarXiv
- [18] K. M. Nakanishi, “Scalable-Softmax Is Superior for Attention,” 2025. [Online]. Available: https: //arxiv.org/abs/2501.19399 on PithPith's reviewarXiv
- [19] L.Wang,H.Gao,C.Zhaoetal.,“Auxiliary-Loss-FreeLoadBalancingStrategyforMixture-of-Experts,”2024. [Online].Available: https://arxiv.org/abs/2408.15664 on PithPith's reviewarXiv
- [20] Team OLMo, P. Walsh, L. Soldainiet al., “2 OLMo 2 Furious,” 2025. [Online]. Available: https://arxiv.org/abs/2501.00656 on PithPith's reviewarXiv
show 80 more
- [21] V.Singh,L.Krauss,S.Jaghouaretal.,“ArceeTrinityLargeTechnicalReport,”2026.[Online].Available: https://arxiv.org/abs/2602.17004 on PitharXiv
- [22] A. Defazio, “Why Gradients Rapidly Increase Near the End of Training,” 2025. [Online]. Available: https://arxiv.org/abs/2506.02285 on PithPith's reviewarXiv
- [23] I. Loshchilov and F. Hutter, “Decoupled Weight Decay Regularization,” inInternational Conference on LearningRepresentations,2019.[Online].Available: https://arxiv.org/abs/1711.05101 on PithPith's reviewarXiv
- [24] Microsoft AI Team, “MAI-Thinking-1: Building a Hill-Climbing Machine,” 2026. [Online]. Available: https://microsoft.ai/pdf/mai-thinking-1.pdf 139 BeamModelTechnicalReport,ReflectionTeametal on Pith
- [25] N.Muennighoff,A.M.Rush,B.Baraketal.,“ScalingData-ConstrainedLanguageModels,”2023.[Online]. Available: https://arxiv.org/abs/2305.16264 on PithPith's reviewarXiv
- [26] J.Bjorck,A.Benhaim,V.Chaudharyetal.,“ScalingOptimalLRAcrossTokenHorizons,”inInternational ConferenceonLearningRepresentations,2025.[Online].Available: https://arxiv.org/abs/2409.19913 on PithPith's reviewarXiv
- [27] S.Malladi,K.Lyu,A.Panigrahietal.,“OntheSDEsandScalingRulesforAdaptiveGradientAlgorithms,” inAdvancesinNeuralInformationProcessingSystems,vol.35,2022.[Online].Available: https://proceeding s.neurips.cc/paper_files/paper/2022/hash/32ac710102f0620d0f28d5d05a44fe08-Abstract.html on Pith
- [28] J.W.Rae,S.Borgeaud,T.Caietal.,“ScalingLanguageModels: Methods,Analysis&InsightsfromTraining Gopher,”2021.[Online].Available: https://arxiv.org/abs/2112.11446v1 on PithPith's reviewarXiv
- [29] G.Penedo,Q.Malartic,D.Hesslowetal.,“TheRefinedWebDatasetforFalconLLM:OutperformingCurated CorporawithWebData,andWebDataOnly,”2023.[Online].Available: https://arxiv.org/abs/2306.01116 on PithPith's reviewarXiv
- [30] J. Li, A. Fang, G. Smyrniset al., “DataComp-LM: In search of the next generation of training sets for languagemodels,”inAdvancesinNeuralInformationProcessingSystems,vol.37,2024.[Online].Available: https://arxiv.org/abs/2406.11794 on PithPith's reviewarXiv
- [31] G.Penedo,H.Kydlíček, L.B.allaletal., “TheFineWebDatasets: DecantingtheWebfortheFinestText DataatScale,”2024.[Online].Available: https://arxiv.org/abs/2406.17557 on PithPith's reviewarXiv
- [32] TeamOlmo,A.Ettinger,A.Bertschetal.,“Olmo3,”2025.[Online].Available: https://arxiv.org/abs/2512.1 3961v1 on Pith
- [33] A. Joulin, E. Grave, P. Bojanowskiet al., “Bag of Tricks for Efficient Text Classification,” 2016. [Online]. Available: https://arxiv.org/abs/1607.01759 on PithPith's reviewarXiv
- [34] A. Joulin, E. Grave, P. Bojanowskiet al., “FastText.zip: Compressing Text Classification Models,” 2016. [Online].Available: https://arxiv.org/abs/1612.03651 on PithPith's reviewarXiv
- [35] A. Wettig, K. Lo, S. Minet al., “Organize the Web: Constructing Domains Enhances Pre-Training Data Curation,”2025.[Online].Available: https://arxiv.org/abs/2502.10341 on PithPith's reviewarXiv
- [36] A.H.Kargaran,A.Imani,F.Yvonetal.,“GlotLID:Languageidentificationforlow-resourcelanguages,”in FindingsoftheAssociationforComputationalLinguistics: EMNLP2023. AssociationforComputational Linguistics,2023,pp.6155–6218.[Online].Available: https://aclanthology.org/2023.findings-emnlp.410/ on Pith
- [37] “go-enry: A Faster File Programming Language Detector,” Software repository. [Online]. Available: https://github.com/go-enry/go-enry on Pith
- [38] Y.Fratantonio,L.Invernizzi,L.Farahetal.,“Magika: AI-PoweredContent-TypeDetection,”2024.[Online]. Available: https://arxiv.org/abs/2409.13768 on PithPith's reviewarXiv
- [39] “chardetng: A Character Encoding Detector for Legacy Web Content,” Software repository. [Online]. Available: https://github.com/hsivonen/chardetng on Pith
- [40] T.Zadouri,M.Hoehnerbach,J.Shahetal.,“FlashAttention-4: AlgorithmandKernelPipeliningCo-Design forAsymmetricHardwareScaling,”2026.[Online].Available: https://arxiv.org/abs/2603.05451 on PitharXiv
- [41] D.Narayanan,M.Shoeybi,J.Casperetal.,“EfficientLarge-ScaleLanguageModelTrainingonGPUClusters Using Megatron-LM,” inProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, ser. SC ’21. Association for Computing Machinery, 202... on Pithdoi:10.1145/3458817.3476209
- [42] J.Zhang,Y.Bai,X.Lvetal.,“LongCite: EnablingLLMstoGenerateFine-grainedCitationsinLong-context QA,”2024.[Online].Available: https://arxiv.org/abs/2409.02897 on PithPith's reviewarXiv
- [43] Y.Bai,X.Lv,J.Zhangetal.,“LongAlign: ARecipeforLongContextAlignmentofLargeLanguageModels,” 2024.[Online].Available: https://arxiv.org/abs/2401.18058 on PithPith's reviewarXiv
- [44] Z. Shao, P. Wang, Q. Zhuet al., “Deepseekmath: Pushing the limits of mathematical reasoning in open languagemodels,”arXivpreprintarXiv:2402.03300,2024 on PithPith's reviewarXiv
- [45] A.Pichéetal.,“PipelineRL:Fasteron-policyreinforcementlearningforlongsequencegeneration,”arXiv preprintarXiv:2509.19128,2025 on PitharXiv
- [46] KimiTeam,“Kimik1.5: ScalingreinforcementlearningwithLLMs,”arXivpreprintarXiv:2501.12599,2025 on PithPith's reviewarXiv
- [47] A.Holtzman,J.Buys,L.Duetal.,“Thecuriouscaseofneuraltextdegeneration,”inInternationalConference onLearningRepresentations,2020. 140 BeamModelTechnicalReport,ReflectionTeametal on Pith
- [48] DeepSeek-AI,A.Liu,A.Meietal.,“Deepseek-v3.2: Pushingthefrontierofopenlargelanguagemodels,” 2025.[Online].Available: https://arxiv.org/abs/2512.02556 on PithPith's reviewarXiv
- [49] W.Maetal.,“StabilizingMoEreinforcementlearningbyaligningtrainingandinferencerouters,”arXiv preprintarXiv:2510.11370,2025 on PithPith's reviewarXiv
- [50] R.Greenblatt,A.Cotra,andH.Wijk,“Briefindependentinvestigationofagents’behavior,reasoningand collaborationintheOpenAI/HuggingFacehackingincident,”METRBlog,Aug.2026.[Online].Available: https://metr.org/blog/2026-08-26-openai-hugging-face-incident-investigation/ on Pith
- [51] I. Badertdinov, M. Nekrashevich, A. Shevtsovet al., “SWE-rebench V2: Language-Agnostic SWE Task Collection at Scale,” inProceedings of the 43rd International Conference on Machine Learning, ser. ProceedingsofMachineLearningResearch,vol.306. PMLR,2026,pp.4820–4843.[Online].Avai... on Pith
- [52] R. Cao, M. Chen, J. Chenet al., “Qwen3-Coder-Next Technical Report,” 2026. [Online]. Available: https://arxiv.org/abs/2603.00729 on PithPith's reviewarXiv
- [53] M.Chen,L.Zhang,Y.Fengetal.,“SWE-Universe: ScaleReal-WorldVerifiableEnvironmentstoMillions,” 2026.[Online].Available: https://arxiv.org/abs/2602.02361 on PithPith's reviewarXiv
- [54] J.Zhang,L.Ma,F.Wanetal.,“DockSmith: ScalingReliableCodingEnvironmentsviaanAgenticDocker Builder,”2026.[Online].Available: https://arxiv.org/abs/2602.00592 on PithPith's reviewarXiv
- [55] G.A.Oliva,G.K.Rajbahadur,A.Bhatiaetal.,“SPICE:AnAutomatedSWE-BenchLabelingPipelineforIssue Clarity,TestCoverage,andEffortEstimation,”2025.[Online].Available: https://arxiv.org/abs/2507.09108v5 on PitharXiv
- [56] J. Pan, X. Wang, G. Neubiget al., “Training Software Engineering Agents and Verifiers with SWE-Gym,” inProceedings of the 42nd International Conference on Machine Learning, ser. Proceedings of Machine Learning Research, vol. 267. PMLR, 2025, pp. 47717–47737. [Online]. Availabl... on Pith
- [57] N.Jain,J.Singh,M.Shettyetal.,“R2E-Gym: ProceduralEnvironmentGenerationandHybridVerifiersfor ScalingOpen-WeightsSWEAgents,”inSecondConferenceonLanguageModeling,2025.[Online].Available: https://openreview.net/forum?id=7evvwwdo3z on Pith
- [58] D.Zan, Z. Huang, W. Liuetal., “Multi-SWE-bench: AMultilingual Benchmarkfor Issue Resolving,” in AdvancesinNeuralInformationProcessingSystems,vol.38. CurranAssociates,Inc.,2025,datasetsand BenchmarksTrack.[Online].Available: https://proceedings.neurips.cc/paper_files/paper/2025... on Pith
- [59] C. Guo, J. Wu, S. Heet al., “MEnvAgent: Scalable Polyglot Environment Construction for Verifiable Software Engineering,” inProceedings of the 43rd International Conference on Machine Learning, ser. ProceedingsofMachineLearningResearch,vol.306. PMLR,2026,pp.38471–38495.[Online]... on Pith
- [60] J. Yang, K. Lieret, C. E. Jimenezet al., “SWE-smith: Scaling Data for Software Engineering Agents,” in AdvancesinNeuralInformationProcessingSystems,vol.38. CurranAssociates,Inc.,2025,datasetsand BenchmarksTrack.[Online].Available: https://proceedings.neurips.cc/paper_files/pap... on Pith
- [61] J.Zhao,G.Chen,F.Mengetal.,“ImmersionintheGitHubUniverse: ScalingCodingAgentstoMastery,” 2026.[Online].Available: https://arxiv.org/abs/2602.09892 on PitharXiv
- [62] M. A. Merrill, A. G. Shaw, N. Carliniet al., “Terminal-Bench: Benchmarking Agents on Hard, Realistic Tasks in Command Line Interfaces,” inInternational Conference on Learning Representations, 2026, pp. 40903–40986.[Online].Available: https://proceedings.iclr.cc/paper_files/pap... on Pith
- [63] Harbor Framework Team, “Harbor: A framework for evaluating and optimizing agents and models in containerenvironments,”Zenodo,2026.[Online].Available: https://doi.org/10.5281/zenodo.20953922 on PithPith's reviewdoi:10.5281/zenodo.20953922
- [64] Q.Yu,Z.Zhang,R.Zhuetal.,“DAPO:AnOpen-SourceLLMReinforcementLearningSystematScale,” 2025.[Online].Available: https://arxiv.org/abs/2503.14476 on PithPith's reviewarXiv
- [65] M. Luo, S. Tan, J. Wonget al., “DeepScaleR: Surpassing O1-Preview with a 1.5B Model by Scaling RL,” NotionBlog,Feb.2025.[Online].Available: https://pretty-radio-b75.notion.site/DeepScaleR-Surpassing-O 1-Preview-with-a-1-5B-Model-by-Scaling-RL-19681902c1468005bed8ca303013a4e2 on Pith
- [66] I. Moshkov, D. Hanley, I. Sorokinet al., “AIMO-2 Winning Solution: Building State-of-the- Art Mathematical Reasoning Models with OpenMathReasoning dataset,” 2025. [Online]. Available: https://arxiv.org/abs/2504.16891 141 BeamModelTechnicalReport,ReflectionTeametal on PithPith's reviewarXiv
- [67] S.Alshammari,K.Wen,A.Zainaletal.,“MathNet: AGlobalMultimodalBenchmarkforMathematical ReasoningandRetrieval,”inInternationalConferenceonLearningRepresentations,2026,pp.12477–12507. [Online].Available: https://proceedings.iclr.cc/paper_files/paper/2026/hash/1516a7f7507d5550db5c7... on Pith
- [68] J. Dekoninck, N. Jovanović, T. Gehrungeret al., “Beyond Benchmarks: MathArena as an Evaluation PlatformforMathematicswithLLMs,”2026.[Online].Available: https://arxiv.org/abs/2605.00674 on PithPith's reviewarXiv
- [69] A.Meurer,C.P.Smith,M.Paprockietal.,“SymPy: symboliccomputinginPython,”PeerJComputerScience, vol.3,p.e103,Jan.2017.[Online].Available: https://doi.org/10.7717/peerj-cs.103 on Pithdoi:10.7717/peerj-cs.103
- [70] H.Kydlíček,“Math-Verify: MathVerificationLibrary,”Softwarerepository,2025,version0.6.1.[Online]. Available: https://github.com/huggingface/math-verify on Pith
- [71] Z. Cheng, S. Hao, T. Liuet al., “Revisiting Reinforcement Learning for LLM Reasoning from A Cross-DomainPerspective,”2025.[Online].Available: https://arxiv.org/abs/2506.14965 on PithPith's reviewarXiv
- [72] J. Cai, J. Zhu, R. Sunet al., “CodeContests-O: Powering LLMs via Feedback-Driven Iterative Test Case Generation,”2026.[Online].Available: https://arxiv.org/abs/2601.13682 on PitharXiv
- [73] Q. Shi, M. Tang, K. Narasimhanet al., “Can Language Models Solve Olympiad Programming?” 2024. [Online].Available: https://arxiv.org/abs/2404.10952 on PithPith's reviewarXiv
- [74] Z. Xia, K. Luo, H. Qianet al., “Open Data Synthesis For Deep Research,” 2025. [Online]. Available: https://arxiv.org/abs/2509.00375 on PithPith's reviewarXiv
- [75] Y.Du,R.Ye,S.Tangetal.,“OpenSeeker: DemocratizingFrontierSearchAgentsbyFullyOpen-Sourcing TrainingData,”2026.[Online].Available: https://arxiv.org/abs/2603.15594 on PitharXiv
- [76] R. Lu, Z. Hou, Z. Wanget al., “DeepDive: Advancing Deep Search Agents with Knowledge Graphs and Multi-TurnRL,”2025.[Online].Available: https://arxiv.org/abs/2509.10446 on PitharXiv
- [77] A.Gallant,“ripgrep,”Softwarerepository,2016.[Online].Available: https://github.com/BurntSushi/ripgrep on Pith
- [78] M.Senghaas,“GeneralAgent: ASelf-Evolving,SyntheticAgentEnvironment,”PrimeIntellectBlog,May 2026.[Online].Available: https://www.primeintellect.ai/blog/general-agent on Pith
- [79] Z.Xu,A.MezaSoria,S.Tanetal.,“TOUCAN:Synthesizing1.5MTool-AgenticDatafromReal-WorldMCP Environments,”2025.[Online].Available: https://arxiv.org/abs/2510.01179 on PitharXiv
- [80] NVIDIA, “Nemotron-SFT-Agentic-v2,” Hugging Face dataset, 2025. [Online]. Available: https: //huggingface.co/datasets/nvidia/Nemotron-SFT-Agentic-v2 on Pith
- [81] I. Gabriel and G. Keeling, “A matter of principle? AI alignment as the fair treatment of claims,”Philosophical Studies, vol. 182, no. 7, pp. 1951–1973, 2025. [Online]. Available: https: //link.springer.com/article/10.1007/s11098-025-02300-4 on Pithdoi:10.1007/s11098-025-02300-4
- [82] W. Zhao, X. Ren, J. Hesselet al., “Wildchat: 1m chatgpt interaction logs in the wild,”Proceedings of the Twelfth International Conference on Learning Representations, 2024. [Online]. Available: https://openreview.net/forum?id=Bl8u7ZRlbM on Pith
- [83] H.SheahanandM.Carroll,“Canpublicchatdatapredictreal-worldAImisalignments?” OpenAIAlignment ResearchBlog,Jun.2026.[Online].Available: https://alignment.openai.com/validating-public-evals/ on Pith
- [84] J. Engels, A. Conmy, B. Chughtaiet al., “SFT Drives Gemini’s Safety Properties,” LessWrong, Jun. 2026. [Online].Available: https://www.lesswrong.com/posts/nLrrYweeFxgXACSmS/sft-drives-gemini-s-safet y-properties-1 on Pith
- [85] F. Cairns, “SFT Also Drives Safety Eval Results in Olmo 3,” LessWrong, Sep. 2026. [Online]. Available: https://www.lesswrong.com/posts/d9rEnYcfCk4pn2PK8/sft-also-drives-safety-eval-results-in-olmo-3-1 on Pith
- [86] A.Wong,J.Engels,andN.Nanda,“SteeringRLTraining: BenchmarkingInterventionsAgainstReward Hacking,”LessWrong,Dec.2025.[Online].Available: https://www.lesswrong.com/posts/R5MdWGKsuvdP wGFBG/steering-rl-training-benchmarking-interventions-against on Pith
- [87] S. Marks, J. Lindsey, and C. Olah, “The Persona Selection Model: Why AI Assistants might Behave like Humans,” Anthropic Alignment Science Blog, Feb. 2026. [Online]. Available: https: //alignment.anthropic.com/2026/psm/ on Pith
- [88] C. Lu, J. Gallagher, J. Michalaet al., “The Assistant Axis: Situating and Stabilizing the Default Persona of Language Models,” inProceedings of the 43rd International Conference on Machine Learning, ser. ProceedingsofMachineLearningResearch,vol.306. PMLR,2026,pp.80955–81003.[O... on Pith
- [89] A.T.Kalai,O.Nachum,S.S.Vempalaetal.,“WhyLanguageModelsHallucinate,”2025.[Online].Available: https://arxiv.org/abs/2509.04664 on PithPith's reviewarXiv
- [90] M. A. Mohamadi, T. Wang, and Z. Li, “Honesty over Accuracy: Trustworthy Language Models through ReinforcedHesitation,”2025.[Online].Available: https://arxiv.org/abs/2511.11500 on PithPith's reviewarXiv
- [91] P.Kirichenko,M.Ibrahim,K.Chaudhurietal.,“AbstentionBench: ReasoningLLMsFailonUnanswerable Questions,”inAdvancesinNeuralInformationProcessingSystems,vol.38. CurranAssociates,Inc.,2025. [Online].Available: https://proceedings.neurips.cc/paper_files/paper/2025/hash/fb122bfc3f0127... on Pith
- [92] D. Jackson, W. Keating, G. Cameronet al., “AA-Omniscience: Evaluating Cross-Domain Knowledge ReliabilityinLargeLanguageModels,”2025.[Online].Available: https://arxiv.org/abs/2511.13029 on PitharXiv
- [93] E. Choi, “GoodWiki Dataset,” Hugging Face dataset, Sep. 2023. [Online]. Available: https: //huggingface.co/datasets/euirim/goodwiki on Pith
- [94] A.Jacovi,A.Wang,C.Albertietal.,“TheFACTSGroundingLeaderboard: BenchmarkingLLMs’Abilityto GroundResponsestoLong-FormInput,”2025.[Online].Available: https://arxiv.org/abs/2501.03200 on PithPith's reviewarXiv
- [95] G. Dong, K. Lu, C. Liet al., “Self-play with Execution Feedback: Improving Instruction-following CapabilitiesofLargeLanguageModels,”inInternationalConferenceonLearningRepresentations,2025,pp. 39286–39313.[Online].Available: https://proceedings.iclr.cc/paper_files/paper/2025/ha... on Pith
- [96] Y.He,W.Li,H.Zhangetal.,“AdvancedIF:Rubric-BasedBenchmarkingandReinforcementLearningfor AdvancingLLMInstructionFollowing,”inProceedingsofthe64thAnnualMeetingoftheAssociationfor ComputationalLinguistics(Volume1: LongPapers). AssociationforComputationalLinguistics,2026,pp. 18003–... on Pith
- [97] Y. Bai, A. Jones, K. Ndousseet al., “Training a Helpful and Harmless Assistant with Reinforcement LearningfromHumanFeedback,”2022.[Online].Available: https://arxiv.org/abs/2204.05862 on PithPith's reviewarXiv
- [98] Y.Bai,S.Kadavath,S.Kunduetal.,“ConstitutionalAI:HarmlessnessfromAIFeedback,”2022.[Online]. Available: https://arxiv.org/abs/2212.08073 on PithPith's reviewarXiv
- [99] L.Gao,J.Schulman,andJ.Hilton,“ScalingLawsforRewardModelOveroptimization,”inProceedingsof the40thInternationalConferenceonMachineLearning,ser.ProceedingsofMachineLearningResearch,vol on Pith
- [100] J. Skalse, N. H. R. Howe, D. Krasheninnikovet al., “Defining and Characterizing Reward Hacking,” in AdvancesinNeuralInformationProcessingSystems,vol.35. CurranAssociates,Inc.,2022,pp.9460–9471. [Online].Available: https://proceedings.neurips.cc/paper_files/paper/2022/hash/3d71... on Pith
The first 100 of 199 references are listed here. All of them are in this paper's citation record.
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment