Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.16158

CIPHEUR: LLM-Guided Structural Search Control for Conflict-Graph Optimization

Yuqing Cheng·Yan Jia·Yanjie Song·Xiaolu Liu·Lining Xing·Feng Yao
View original source ↗Read source document ↗Export metadata ↓

Abstract

Conflict-graph search can stagnate despite effective operators when interventions fail to address the conflicts blocking progress. A disruptive intervention may also require further search before its value emerges. We propose CIPHEUR, a large language model (LLM)-guided framework that connects conflict evidence to coordinated intervention and recovery through Structured Intervention Units (SIUs). The shared control interface supports offline synthesis of executable policies and online contextual decisions. Asynchronous online control sustains native search during inference, while all policies preserve the original objective and feasibility constraints. Across eight satellite-ground scheduling conflict views with five runs per view and a 900-second evaluation cap, CIPHEUR-online achieves the highest mean objective among 11 configurations and increases mean scheduled contact duration by 14.84% over the greedy baseline GWMIN. It exceeds the strongest external per-view mean in seven of eight views and outperforms CHILS in all 40 paired runs. Within the same runs, its normalized objective improvement from 360 to 900 seconds is 1.50 to 1.86 times that of the two programmatic controllers. A separately frozen, one-shot LLM-generated controller also improves the mean objective over CHILS without runtime model calls. Together, these results demonstrate how structural search control translates LLM design knowledge and contextual reasoning into improved solution quality and sustained search progress.

Explore related subjects

cs.NE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuqing Cheng, Yan Jia, Yanjie Song, Xiaolu Liu, Lining Xing, Feng Yao. 2026-10-12. CIPHEUR: LLM-Guided Structural Search Control for Conflict-Graph Optimization. https://arxiv.org/abs/2610.16158

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Distribution Matching Evolutionary Algorithms for Rare Event Sampling

A novel discovery is one which is both useful and surprising: a generative model's output is a useful discovery if it has a low probability of being generated (it's surprising) and a high reward (it's useful). Global optimization can directly increase the probability of sampling high rewards but typically requires updating model weights. Such gradient based optimization is expensive and bars using capable closed-source models. Instead, modern search methods for discovery sacrifice the global target, and use evolutionary algorithms with local reward maximizing objectives, permitting the search to focus only on high probability samples. In this paper, we interpret various evolutionary algorithms as approximate Markov Chain Monte Carlo, an optimization-free method to sample from complex distributions. This interpretation allows developing Distribution Matching Evolutionary Algorithms (DME), a class of search methods which sample from a global target distribution without updating weights. Empirically, DME has a higher sample efficiency than existing methods on problems requiring many samples to find a solution.

cs.NE↗
arXiv2026

Neuromorphic Satellite Intelligence: A Formal Framework for Event-Driven Architectures, Spike-Based Algorithms, and Quantitative Energy-Accuracy Trade-offs

Satellite onboard computing faces an irreducible tension: mission intelligence requirements grow monotonically while power, mass, and radiation budgets remain fixed. This paper advances the state of the art on three fronts. First, we develop a formal mathematical model of spiking neural computation for satellite workloads, deriving closed-form expressions for energy consumption as a function of network sparsity, firing rate, and synaptic fan-out. Second, we propose three original algorithms -- a Spiking Kalman-Complementary Filter (SKCF) for attitude estimation, a Temporal Contrast Anomaly Detector (TCAD) for spacecraft health monitoring, and a Spike-Based Adaptive Modulation and Coding (SAMC) scheme for cognitive satellite links -- each with pseudocode and analytical complexity bounds. Third, we introduce a quantitative Energy-Accuracy-Latency (EAL) trade-off surface and populate it with numerical estimates derived from published silicon measurements of Loihi and SpiNNaker, enabling direct comparison with FPGA and GPU baselines. A taxonomy of four radiation-aware neuromorphic architecture classes is refined with fault-rate models. Continual on-orbit learning is formalized through a constrained Spike-Timing Dependent Plasticity (STDP) rule that provably bounds weight drift. Case studies for a 12U CubeSat Earth observation mission, a GEO communications payload, and an autonomous deep-space probe provide concrete, quantified design points. Our analysis shows that neuromorphic implementations can achieve 8 to 47 times energy reduction over GPU baselines while maintaining inference accuracy within 2.1\% for representative satellite workloads.

cs.NE↗
arXiv2026

TurboEvolve: Towards Fast and Robust LLM-Driven Program Evolution

LLM-driven program evolution can discover high-quality programs, but high API cost and run-to-run variance hinder reliable progress. We propose TurboEvolve, a multi-island evolutionary framework that improves sample efficiency and stability under matched API-cost budgets. Inspired by multiple-offspring strategies in evolutionary algorithms, TurboEvolve introduces Verbalized Sampling, which elicits K diverse candidates in one LLM call while using self-assigned probabilities only as generation signals, together with an online scheduler that adapts K to expand exploration under stagnation and reduce redundant generation during steady progress. To exploit existing solution pools, TurboEvolve further introduces island-aware initialization, which clusters seed programs into mode-specific subpopulations and applies controlled cross-cluster mixing with elitist preservation to balance diversity, sharing, and refinement. We also curate a reusable cross-task solution-pool dataset to support warm-start initialization studies and matched-resource comparisons. Across mathematical discovery and GPU-kernel optimization tasks, TurboEvolve achieves stronger cost-quality trade-offs and more stable performance than controlled baselines, while reaching competitive reported scores.

cs.NE↗