Model predictive control for laser thermal processing: operator learning, closed-loop validation, and out-of-distribution analysis

arXiv:2607.13289 2026 Architecture 2 ideas extracted · analyzed Aug 30, 2026

What the math gives to ML

The paper contains two transferable engineering mechanisms rather than merely a laser-specific controller: a separable branch-trunk operator representation for predicting an entire future trajectory in one forward pass, and a smooth ReLU replacement designed to preserve near-identical outputs while supplying reliable second derivatives to an interior-point optimizer. The first can turn autoregressive neural rollouts into compact, parallel multi-step predictors whose inference cost does not grow through sequential feedback at every horizon step. The second is relevant whenever a neural network is embedded inside constrained optimization, where ReLU kinks can damage Hessian-based solver steps. The most useful validation is to compare one-shot low-rank horizon prediction with autoregressive rollouts, and to compare ReLU, softplus, and the paper's algebraic smoothing under differentiable planning.

Ideas from this paper

✓✓ Beats tuned baseline 2026

Low-rank one-shot horizon predictor

Replace an autoregressive rollout of a learned dynamical model with a branch-trunk factorization that predicts all future steps simultaneously. The branch network encodes the future action sequence, while the trunk network encodes the current state and query coordinates; their inner products produce the complete horizon. This removes repeated state updates during inference and gives a compact differentiable model for planning.

Useful8/10
Difficulty5/10
Novelty6/10
Paper: Model predictive control for laser thermal processing: operator learning, closed-loop validation, and out-of-distribution analysis arXiv:2607.13289
Failed on benchmark 2026

Algebraically smoothed ReLU for differentiable planning

When a neural network is placed inside a Newton, SQP, or interior-point optimization loop, replace its ReLUs only in the embedded inference graph by a smooth algebraic approximation. The approximation is uniformly close to ReLU but has well-defined first and second derivatives, improving Hessian-based action optimization without retraining or changing the learned weights.

Useful7/10
Difficulty3/10
Novelty4/10
Paper: Model predictive control for laser thermal processing: operator learning, closed-loop validation, and out-of-distribution analysis arXiv:2607.13289