arXiv:2607. 10474v1 Announce Type: cross Abstract: Partial differential equations (PDEs) are foundational to modeling in science and engineering, but constructing reliable numerical solvers remains labor-intensive, demanding expert knowledge of discretization schemes, stability conditions, and boundary treatments.
arXiv:2608. 03600v1 Announce Type: new Abstract: Partial differential equations (PDEs) become actionable in science and engineering not as isolated formulae, but as executable workflows that connect modelling assumptions, governing equations, numerical solvers, diagnostics, and decisions.
arXiv:2607. 05134v1 Announce Type: cross Abstract: We present PDEFlow, an autonomous agentic framework that turns user-level ODE and PDE descriptions into solver-backed neural-operator pipelines.
arXiv:2509. 08765v4 Announce Type: replace-cross Abstract: Data-driven acceleration of scientific computing workflows has been a high-profile aim of machine learning (ML) for science, with numerical simulation of transient partial differential equations (PDEs) being one of the main applications.
arXiv:2509. 03059v2 Announce Type: replace-cross Abstract: Recent advances in Large Language Models (LLMs) have shown that their reasoning capabilities can be significantly improved through Reinforcement Learning with Verifiable Reward (RLVR), particularly in domains like mathematics and programming, where ground-truth correctness can be automatically evaluated.
arXiv:2609.38409v1 Announce Type: new Abstract: Recent progress in large language model reasoning has been driven by benchmarks and reinforcement learning environments with automatically verifiable r...
Agnostics is a language‑agnostic post‑training pipeline that uses reinforcement learning with verifiable rewards (RLVR) to improve large language models on low‑resource programming languages. By rewriting unit‑test datasets into a language‑independent I/O format, providing a short configuration for compiling and running code, and employing a single verifier that judges code by observable behavior, Agnostics eliminates the need for language‑specific engineering. Applied to Lua, Julia, R, OCaml, and Fortran, it boosts Qwen‑3 4B to rival larger models, scales to diverse families, and achieves new state‑of‑the‑art pass@1 on MultiPL‑E and a new multi‑language LiveCodeBench.
The paper "Performance Foundations of Parallel & Distributed Reasoning Language Models" examines how reinforcement learning with verifiable rewards (RLVR) and similar post‑training methods improve reasoning in large language models, yet demand massive computational resources. It provides a compute‑centric analysis of key RL frameworks such as PPO and GRPO, and introduces a taxonomy of intra‑ and inter‑model parallelism strategies—including data, tensor, pipeline, sequence, context, expert, disaggregated placement, stage fusion, hybrid parallelism, and asynchronous execution—to address the parallel and distributed systems challenges of training reasoning language models. The authors also analyze existing RLM frameworks, offering practical guidelines and outlining open research directions for building scalable, fast, and cost‑effective RLMs.
The paper examines the computational challenges of training Reasoning Language Models (RLMs) using reinforcement learning with verifiable rewards (RLVR) and similar post‑training methods. It provides a compute‑centric analysis of popular RL algorithms such as PPO and GRPO, and introduces a taxonomy of intra‑ and inter‑model parallelism strategies—including traditional and novel techniques—to improve scalability and cost‑efficiency. The authors also evaluate existing RLM frameworks and offer practical guidelines and research directions for building high‑performance, scalable RLMs.
arXiv:2604. 07366v2 Announce Type: replace Abstract: Partial differential equations (PDEs) govern nearly every physical process in science and engineering, but solving them at scale remains prohibitively expensive.
arXiv:2507. 04136v2 Announce Type: replace Abstract: This survey offers a comprehensive foundation on the integration of RL with language models, highlighting prominent algorithms such as Proximal Policy Optimization (PPO), Q-Learning, and Actor-Critic methods.
arXiv:2604.02007v3 Announce Type: replace Abstract: Building general-purpose reasoning models using reinforcement learning with verifiable rewards (RLVR) across diverse domains has been widely adopte...
arXiv:2606. 17024v1 Announce Type: new Abstract: Sparse reward reinforcement learning (RL) has become a standard tool for improving LLM reasoning, but its success depends critically on the coverage present in the base model.