Skip to main content

Mathematics

  1. arXiv

    Hyperlyve splits ReLU activation regions into parallel subtrees, enumerating 6.3 million regions in under 16 minutes

    Hyperlyve turns activation-region enumeration for deep ReLU networks into parallel work over independent hidden-layer subtrees, then checks the Lyapunov conditions on the true nonlinear dynamics inside each affine region with sound and complete regional tests. Earlier enumerators were bottlenecked by per-neuron checks or network flattening: on Rejoin RL's 6.3 million 8-dimensional regions, RPM and Relucent both hit a one-hour timeout while Hyperlyve finished in under 16 minutes. It also characterizes verification of continuous piecewise-affine neural Lyapunov functions as co-NP-complete and embeds the verifier in a counterexample-guided synthesis loop.

  2. arXiv

    Same WZW current algebra, two neural realizations, different errors: level–rank duality carries charged correlators across paired theories

    Neural network field theory writes field-theoretic correlators as expectations over network parameters, yet one continuum current algebra can be realized by different networks. This work builds positive-level WZW current algebras from bosonic Wakimoto fields and fermionic Fourier–Berezin fields, and uses level–rank duality to connect the charged sectors of paired theories. At fixed regulator and finite width, direct and coset constructions differ in error, spectral distribution and regulator choice shift accuracy, and source-sector measurements predict paired-sector responses without measuring the target preparation.

  3. arXiv

    Physics-informed operator learning for nonlinear PDEs gains an error guarantee: the first-order least-squares residual matches the error near a solution branch

    Physics-informed operator learning trains on a PDE residual instead of solution snapshots, but whether a small residual means a small error was unproven for nonlinear equations. Writing the state as a first-order system of flux and primal variable, this work proves that the least-squares residual is equivalent to the error in the equation's own norm near a solution branch, provided the linearized residual is stable and its derivative Lipschitz continuous, and verifies the conditions for monotone reaction, solution- or gradient-dependent diffusion, and compressible Neo-Hookean hyperelasticity. A reduced basis neural operator trained on this loss kept the ratio of error to the square root of loss excess at medians comparable to the linear case.

  4. arXiv

    Turing Agent turns formal verification into an agent pipeline: 57–62% faithful formalization on TCS benchmarks, plus three previously unresolved proofs

    AI systems now generate mathematical proofs faster than anyone can check them, and a Lean statement can compile while quietly changing the claim it was meant to capture. Turing Agent splits the job into a theorem-formalization agent and a proof-formalization agent, coordinated by structured decomposition, parallel verification, an experience pool and selective semantic review. On the 143 problems of Formal TCS Bench it reaches 57.34% and 61.54% semantic success with GLM-5.3 and DeepSeek-V4-Pro, at compilation rates of 97.20% and 99.30%, and above 82% overall pass@1 on the 248-theorem RLMEval subset.

  5. arXiv

    One pretrained transformer stops re-solving each dynamical inverse problem: shared computation yields both parameter estimates and trajectory forecasts

    For a family of ordinary differential equations indexed by unknown parameters, a pretrained transformer can estimate those parameters and predict trajectories from a few noisy observations of a new system without updating its weights. The construction casts estimation as two-stage approximate maximum likelihood: a coarse search places the initial value inside a locally strongly convex region, then gradient descent contracts linearly; prediction evaluates a neural approximation of the solution map at the recovered parameters. Error bounds separate finite observations, finite pretraining tasks, context length and transformer size, and numerical experiments show error falling then plateauing as inference context grows.

  6. arXiv

    A summary's sufficiency now comes with its error bar: a classifier estimates the Barber–Agakov gap, making earthquake-catalog comparisons trustworthy

    In simulation-based inference, high-dimensional or variable-length data are often compressed into low-dimensional summaries, and how much parameter information a summary retains is measured by mutual information, which is intractable without a likelihood. A trained neural posterior yields a Barber–Agakov lower bound used in place of that mutual information, but a small bound can mean either an insufficient summary or an inaccurate density estimator. This work estimates the gap between bound and mutual information with a classifier and restricts comparisons to a data-space neighborhood around the observation; on temporal ETAS earthquake catalogs, the learned summary has both the larger bound and the larger gap, so the bound difference understates the mutual-information difference.

  7. arXiv

    CompCert4Lean moves a verified C compiler into Lean: one expert directing parallel agents completes the port in six weeks

    The verified compiler core of CompCert 3.17 existed only in Rocq, and its definitions and proofs could not be imported directly into Lean. CompCert4Lean partitions the development along its dependencies into 166 units, translates definitions and theorem statements first under independent audit, then reconstructs proofs in parallel; one expert directing parallel LLM agents completed the port in about six weeks, discharging all 4,908 recorded proof obligations without project-specific axioms and producing executable Linux binaries.

  8. arXiv

    Invertible networks learn Morse Lyapunov functions: hyperbolic equilibria get stability certificates on compact sets

    For dynamical systems with a hyperbolic equilibrium, invertible neural networks can approximate a Morse Lyapunov function on compact sets and thereby certify global asymptotic stability. Previously, neural learning of Lyapunov functions guaranteed approximation only in norms that do not control derivatives, which is not enough for a Lyapunov inequality. The approach writes a Morse Lyapunov function as the squared norm of a diffeomorphism and approximates that diffeomorphism with a neural-ODE invertible network in a Sobolev norm.

  9. arXiv

    Structured neural Lyapunov functions guarantee positive definiteness by design, and PLNet reaches the largest certified region on the inverted pendulum

    For known nonlinear discrete-time systems, a controller and a control Lyapunov function can be trained jointly while positive definiteness of the candidate no longer rests on penalties at sampled states. Input convex neural networks and Polyak-Łojasiewicz networks, which carry lower and upper quadratic bounds and are therefore positive definite by construction, satisfy positivity and radial unboundedness directly, leaving only the closed-loop decrease condition for formal verification. On an inverted pendulum and a path-tracking benchmark, the PLNet attains the largest base and expanded certified regions on the inverted pendulum, and all five seeds certify in a single round.

  10. arXiv

    UNIDE turns equation discovery into cross-PDE transfer: exact term sets survive 80% noise where WSINDy collapses

    Recovering a governing equation from noisy space-time trajectories has meant fitting sparse or symbolic regression from scratch on each trajectory, with differentiation amplifying observation noise. UNIDE learns across six one-dimensional PDE families: a blind-spot denoiser that needs no clean targets cleans the trajectory, a shared encoder predicts which candidate terms are active, and weak-form least squares with residual pruning estimates their coefficients. On 900 held-out trajectories at 80% noise it recovers the exact term set for 0.924, against 0.003 for WSINDy.