Agentic Stage-One Stellarator Optimization: Autonomous Multi-Objective Search for Finite-Beta Equilibria

• URL: http://arxiv.org/abs/2608.01344v2
• Date: Mon, 10 Aug 2026 02:47:18 GMT
• Title: Agentic Stage-One Stellarator Optimization: Autonomous Multi-Objective Search for Finite-Beta Equilibria
• Abstract summary: We present a proof of concept for emphagentic stage-one optimization.<n>Agentic outer-loop control can sustain finite-beta, multi-objective search and turn repeated optimization into a scalable source of improved equilibria.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Stage-one stellarator design searches a high-dimensional family of three-dimensional plasma boundaries and fixed-boundary MHD equilibria for configurations that jointly meet requirements on confinement, field-line topology, force balance, stability proxies, and geometry. These specifications do not provide a general constructive map to a validated finite-beta equilibrium. High-quality targets are commonly developed through iterative numerical optimization whose outcome depends on the initial configuration, active Fourier resolution, objective priorities, and local solver budget. Coordinating this process is computationally costly and expert-intensive, limiting both design throughput and the production of consistently evaluated data. We present a proof of concept for \emph{agentic} stage-one optimization. A bounded language-model agent diagnoses the current equilibrium and selects the next local optimization experiment, while deterministic DESC execution owns prescribed profiles and flux, symmetry, metric evaluation, solver validity, and acceptance. On a common-budget subset from an expanding finite-beta campaign, the number of gate-valid configurations increases from five inputs to nineteen outputs; median Boozer QS RMS decreases from $2.39\times10^{-4}$ to $1.07\times10^{-4}$, and median maximum principal curvature decreases from $62.56$ to $33.00\,\mathrm{m}^{-1}$. A complementary long route achieves a $9.10\times$ QS reduction while repairing magnetic-well and curvature defects. The system also records every attempted local action as transition evidence, yielding 734 structured parent--action--outcome records in the reported experiments. These results show that agentic outer-loop control can sustain finite-beta, multi-objective search and turn repeated optimization into a scalable source of improved equilibria and reusable decision data.

Related papers

• Frozen Cores Need Task Signal: Fisher-Whitened Cross-Covariance for Low-Resource LLM Adaptation [18.8104643146881]
  We study the choice of constructor-efficient fine-tuning under a severe trainable-state budget.<n>We introduce FCCA, which estimates the signed input--error cross-covariance, whitens it with diagonal Fisher moments, truncates it in the resulting local metric, maps the selected directions back, and applies thin QR to obtain stable core coordinates.<n>On Qwen2.5-3B, FCCA reaches an 83.0 macro-average, 2.3 points above the next-best matched-budget constructor, and exceeds its unwhitened RawGrad control on all 11 tasks.
  arXiv  Detail & Related papers  (2026-09-01T05:52:38Z)
• Reliability-Aware Bayesian Optimization of 1310 nm PCSELs with FDTD Verification [5.856516229808983]
  Near 1310 nm photonic-crystal surface-evaluation lasers (PCSELs) are attractive narrow-beam sources for optical communication and sensing.<n>Small geometry changes simultaneously shift the band-edge resonance, cavity leakage, far-field divergence, and the numerical stability of a high-$Q$ decay fit.<n>We couple a commercial finite-difference time-domain solver to a reliability-aware Bayesian optimization (BO) loop over eight local design variables.
  arXiv  Detail & Related papers  (2026-07-23T19:35:55Z)
• A Defense of the Quadratic Model [71.57026347416729]
  We stress test the simplest possible model of optimization -- the quadratic model.<n>We show that it can be predictive surprisingly in an LLM setting with 150M parameters and 3B training tokens.
  arXiv  Detail & Related papers  (2026-07-23T18:02:03Z)
• The Deterministic Horizon: When Extended Reasoning Fails and Tool Delegation Becomes Necessary [13.891522069967507]
  Extended chain-of-thought reasoning can degrade performance on deterministic state-tracking tasks.<n>We show that tool-integrated reasoning consistently outperforms neural chain-of-thought.<n>Our results provide principled guidance for when pure neural reasoning should yield to hybrid approaches in agentic systems.
  arXiv  Detail & Related papers  (2026-05-29T21:35:23Z)
• Model Compression with Exact Budget Constraints via Riemannian Manifolds [39.54576236079211]
  Assigning one of K options to each of N groups under a total cost budget is a recurring problem in efficient AI.<n>We present a new approach by showing that, under softmax relaxation, the budget constraint defines a smooth Riemannian manifold in logit space with unusually simple geometry.<n>Building on these properties, we propose Riemannian Constrained Optimization (RCO), which augments a standard Adam step with tangent projection, binary-search retraction, and momentum transport.
  arXiv  Detail & Related papers  (2026-05-01T13:30:23Z)
• Provably Adaptive Linear Approximation for the Shapley Value and Beyond [73.0940890296463]
  A fundamental and long-standing challenge is their efficient approximation.<n>We develop a linear-space algorithm that requires $P(|hatboldsymbol-boldsymbol|_2geq)leq $ for all commonly used semi-values.<n>Our algorithm allows explicit minimization of the mean square error for each specific utility function.
  arXiv  Detail & Related papers  (2026-04-09T16:38:14Z)
• ALMAB-DC: Active Learning, Multi-Armed Bandits, and Distributed Computing for Sequential Experimental Design and Black-Box Optimization [0.0]
  ALMAB-DC is a sequential design framework for black-box experimentation.<n>We present cumulative regret bounds for the bandit components and characterize parallel scalability via Amdahl's Law.<n> Distributed execution achieves $7.5times$ speedup at $K = 16$ agents, consistent with Amdahl's Law.
  arXiv  Detail & Related papers  (2026-03-22T11:47:20Z)
• Causal Direction from Convergence Time: Faster Training in the True Causal Direction [0.0]
  We introduce Causal Computational Asymmetry (CCA), a principle for causal direction identification based on optimization dynamics.<n>CCA operates in optimization-time space, distinguishing it from methods such as RESIT, IGCI, and SkewScore.<n>We further embed CCA into a broader framework termed Causal Compression Learning (CCL), which integrates graph structure learning, causal information compression, and policy optimization.
  arXiv  Detail & Related papers  (2026-02-24T21:34:57Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization [57.179679246370114]
  A potential limitation of existing methods is the bias inherent in most perturbation estimators unless a stepsize is proposed.<n>We propose a novel family of unbiased gradient scaling estimators that eliminate bias while maintaining favorable construction.
  arXiv  Detail & Related papers  (2025-10-22T18:25:43Z)
• Fast Batch Nuclear-norm Maximization and Minimization for Robust Domain Adaptation [154.2195491708548]
  We study the prediction discriminability and diversity by studying the structure of the classification output matrix of a randomly selected data batch. We propose Batch Nuclear-norm Maximization and Minimization, which performs nuclear-norm on the target output matrix to enhance the target prediction ability. Experiments show that our method could boost the adaptation accuracy and robustness under three typical domain adaptation scenarios.
  arXiv  Detail & Related papers  (2021-07-13T15:08:32Z)
• Momentum Accelerates the Convergence of Stochastic AUPRC Maximization [80.8226518642952]
  We study optimization of areas under precision-recall curves (AUPRC), which is widely used for imbalanced tasks. We develop novel momentum methods with a better iteration of $O (1/epsilon4)$ for finding an $epsilon$stationary solution. We also design a novel family of adaptive methods with the same complexity of $O (1/epsilon4)$, which enjoy faster convergence in practice.
  arXiv  Detail & Related papers  (2021-07-02T16:21:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.