arXiv:2606.17436v1 Announce Type: new Abstract: Fingerprint recognition is still dominated by task-specific pipelines, where enhancement, structural parsing, alignment, and matching are optimized in isolation. Although effective in narrow settings, this design limits representation reuse across sensors, qualities, and downstream applications. We therefore present UoU, short for ``a \textbf{U}niversal fingerprint foundation model based \textbf{o}n large-scale \textbf{U}nsupervised learning,'' which reframes fingerprint feature extraction as a domain-specific foundation-model problem. UoU is organized around a multi-level representation hierarchy spanning image restoration, structural fields, semantic tokens, point-level biometric entities, and compact global descriptors. Its training recipe combines a supervised cold start on precise annotations, large-scale weakly supervised refinement, and large-scale unsupervised consolidation, with the latter two stages iterated during large-scale training so that weak supervision broadens semantic coverage while unsupervised learning stabilizes correspondences, invariances, and representation geometry. Rather than treating fingerprint imagery as generic texture, UoU exploits domain-specific symmetries and intermediate structure, including orientation flow, periodic ridge patterns, sparse biometric entities, and spatial equivariance. The framework is intentionally architecture-agnostic: while the present study includes an initial transformer-based structured-prediction instantiation, the broader design supports multi-task learning, scalable model configurations, and downstream specialization for matching, alignment, enhancement, registration, and related fingerprint applications. This paper presents the technical motivation, system design, and validation protocol of UoU, and part of the baseline implementation is publicly available at https://github.com/XiongjunGuan/UoU.
Science Journals
arXiv:2606.17461v1 Announce Type: new Abstract: Fine-grain clock gating (FGCG) is among the most effective techniques for reducing dynamic power, yet current FGCG optimization flows remain largely manual. Recent LLM-based RTL optimization approaches remain limited by two key drawbacks: (1) the inability to process long waveform traces spanning millions of cycles, and (2) the difficulty of scaling optimization to large hierarchical codebases while preserving correctness. In this work, we present AUTOGATE, the first agentic framework for industry-grade RTL power optimization, enabling workload-aware clock-gating optimization across large hierarchical codebases. AUTOGATE introduces a Machine Learning (ML)-LLM co-design that bridges waveform-level analysis and RTL rewriting. Specifically, we design an ML-based clustering algorithm that distills raw toggling traces into compact, structured representations that guide LLM-based RTL rewriting. This enables accurate identification and application of clock-gating opportunities without requiring LLMs to directly process raw waveform data. To enhance scalability, AUTOGATE employs a hierarchical multi-agent architecture that decomposes large designs into independently optimizable modules, enabling coordinated optimization across deep design hierarchies. We evaluate AUTOGATE on a diverse set of designs ranging from small RTL designs to large industrial-grade codebases. Experimental results show that AUTOGATE consistently reduces dynamic power relative to baselines. Across the small-design suite, AUTOGATE reduces dynamic power by 49.31% on average. On industry-scale designs, it achieves 19.34% and 7.96% dynamic power reductions on NVDLA and BlackParrot, respectively, and up to 6.86% on highly optimized proprietary production designs.
arXiv:2606.17516v1 Announce Type: new Abstract: Causal discovery from observational data remains challenging due to the need to recover directed structure and latent confounding without interventions. We propose FoundCause, an amortized causal discovery model trained entirely on synthetic data that maps datasets directly to causal graphs in a single forward pass. By learning from large collections of simulated structural causal models, FoundCause captures transferable statistical patterns that generalize beyond individual datasets. The architecture incorporates several key inductive biases for causal discovery. It uses a permutation-invariant transformer encoder with alternating attention over samples and variables to jointly model cross-variable dependence and per-variable distributions. Pairwise statistical features derived from classical asymmetry measures are injected through statistics-conditioned attention, guiding the model toward known causal signals. A factorized decoder separates edge existence from direction, while a triangular refinement module enables reasoning over higher-order causal motifs such as chains and colliders. In addition, a dedicated confounder module based on learnable latent tokens explicitly models hidden common causes, and the model explicitly handles missing data via its masked input representation. To our knowledge, FoundCause is the first amortized causal discovery approach to explicitly model latent confounding. FoundCause outperforms 11 classical non-amortized methods (e.g., PC, GES, NOTEARS-style optimization) and 4 amortized causal discovery methods on 15 real-world datasets, achieving +9.6% improvement in $F_1$, +1.2% in AUROC, and an 18.9% reduction in structural Hamming distance relative to the strongest non-amortized methods, while performing inference in a single forward pass.
arXiv:2606.17526v1 Announce Type: new Abstract: Efficient optimization is essential for training large language models. Although intra-layer selective updates have been explored, a general mechanism that enables fine-grained control while ensuring convergence guarantees is still lacking. To bridge this gap, we propose \textbf{MGUP}, a novel mechanism for selective updates. \textbf{MGUP} augments standard momentum-based optimizers by applying larger step-sizes to a selected fixed proportion of parameters in each iteration, while applying smaller, non-zero step-sizes to the rest. As a nearly {plug-and-play} module, \textbf{MGUP} seamlessly integrates with optimizers such as AdamW, Lion, and Muon. This yields powerful variants such as \textbf{MGUP-AdamW}, \textbf{MGUP-Lion}, and \textbf{MGUP-Muon}. Under standard assumptions, we provide theoretical convergence guarantees for \textbf{MGUP-AdamW} (without weight decay) in stochastic optimization. Extensive experiments across diverse tasks, including MAE pretraining, LLM pretraining, and downstream fine-tuning, demonstrate that our \textbf{MGUP}-enhanced optimizers achieve superior or more stable performance compared to their original base optimizers. We offer a principled, versatile, and theoretically grounded strategy for efficient intra-layer selective updates, accelerating and stabilizing the training of large-scale models. The code is publicly available at https://github.com/MaeChd/MGUP.
arXiv:2606.17527v1 Announce Type: new Abstract: Perfect resource placement in dense Gaussian networks partitions the network into Lee balls centered at resource nodes. The fault-free placement problem is already classified; this paper studies the complementary post-deployment problem of repairing such placements after resource faults. The paper gives exact local repair theorems for the dense Gaussian placement generated by $t+(t+1)i$; by conjugation and rotation symmetry, the same results hold for the companion generator $(t+1)+ti$. For one failed resource, we prove failure-cell locality, derive the exact replacement number $\rho_G(1)=3$ and $\rho_G(t)=2$ for all $t\ge2$, and prove the sharp minimum-overlap formula $\Omega_G(t)=t+1$ among minimum-size repairs. The overlap lower bound is proved from the corner structure of equal-size Lee balls in the rotated coordinates $u=x+y$ and $v=x-y$, where Gaussian Lee balls become parity-constrained squares. For two failed resources, we prove exact additivity: every pair of failed resource cells requires exactly four local replacements for $t\ge2$, and four always suffice. The two-fault lower bound reduces all relevant resource displacements to two canonical neighboring cases and exhibits four mutually incompatible failed-cell corners in each case. For multi-failure repairs, we prove a general inclusion--exclusion identity for overlap inside the failed region; hence the formula remains exact for arbitrary higher-order dense cores. When a canonical repair instance is certified to have maximum multiplicity three, the identity reduces to the compact correction $\Omega_{\rm extra}=P_2-A-C_3$. A ground-truth audit over 7,494 Gaussian cases recomputes coverage from lattice geometry, verifies all exact formulas, and records reproducible multiplicity witnesses.
arXiv:2606.17534v1 Announce Type: new Abstract: Simultaneous localization and mapping using radar sensors has gained increasing attention due to radar's inherent robustness to adverse weather and lighting conditions. However, radar measurements are characteristically sparse and noisy compared to LiDAR and visual data, posing significant challenges in achieving dense, continuous, and consistent map representations. In this paper, we present RICH-SLAM, a radar SLAM framework designed to address these challenges. Our approach features a Rao-Blackwellized particle filter-based back end that employs particle filtering for pose estimation and Kalman filtering for map updates. We propose an incremental Hilbert-space reduced-rank Gaussian process mapping strategy that enables continuous and uncertainty-aware map representations given sparse radar inputs. We further introduce a posterior-aware particle weighting scheme that leverages the full posterior distribution of map parameters for more robust likelihood evaluation. Experiments on self-collected and public ColoRadar datasets show that RICH-SLAM constructs continuous occupancy maps from sparse radar measurements and supports uncertainty-aware planning for mobile robots.
arXiv:2606.17536v1 Announce Type: new Abstract: Generative world models for autonomous driving face two unresolved tensions: heterogeneous control injection, where free-form language, HD-maps, trajectories, and camera poses reside in incompatible representational spaces, and post-hoc cross-view fusion, where per-camera latents fail to encode global 3-D geometry. We trace both to a single root cause: the absence of a shared symbolic interlingua aligning language, geometry, and pixels at the latent-token level. We present DRIVE-CHOREO, an LLM-choreographed multi-agent world model that recasts controllable multi-view video generation as latent choreography. Three Qwen2.5-VL agents - a Director parsing user intent into a structured WorldScript, a Cartographer grounding it into spatially-anchored layout tokens, and an Auditor feeding cross-view critiques back as auxiliary supervision - jointly author a single position-aware token sequence. This sequence is co-compressed with the multi-view video via a view-time permutation that enforces inter-camera geometry within the convolutional receptive field of a 3-D VAE. On nuScenes, DRIVE-CHOREO sets new state-of-the-art multi-view consistency and BEV mAP (21.6) with competitive FVD (45.7); a detector trained purely on our synthetic data gains +2.4 NDS on the real validation split, validating downstream utility.
arXiv:2606.17546v1 Announce Type: new Abstract: Self-evolving LLM-based agents improve mainly by changing their agent harness: the structured execution layer around a base model, including prompts, memory, tools, middleware, runtime state, and the model-tool interaction loop. Existing evaluations often reduce this process to isolated task scores or a single sequential curve, obscuring whether an update produces reusable improvement, overfits recent tasks, increases cost, or harms older behavior. We introduce SEAGym, an evaluation environment for measuring agent harness updates across training, validation, test, replay, and cost records. SEAGym turns Harbor-compatible benchmarks into dynamic self-evolution task sources with train batches, frozen update-validation, held-out ID and OOD transfer views, replay diagnostics, and saved snapshot and metric records. Instantiating SEAGym on Terminal-Bench 2.0 and HLE, we compare ACE, TF-GRPO, and AHE under a shared epoch/batch protocol. The results show that these evaluation views provide complementary signals about the evolution process: frequent updates may fail to improve held-out performance, useful intermediate snapshots may collapse later, and source diversity and model backend can affect harness reliability.
arXiv:2606.17566v1 Announce Type: new Abstract: Video diffusion has quickly grown into a key generative serving workload, yet producing each clip demands many denoising iterations over large spatio-temporal latents, which puts low-latency inference out of reach on a single device. A denoising step is therefore typically distributed across multiple accelerators, and TPU sub-slices have become an attractive and practical fabric for doing so. Current auto-parallel systems, however, search almost exclusively over logical device meshes and disregard how a chosen sharding is actually laid out on the physical TPU interconnect -- an oversight that leaves large, topology-dependent performance on the table. We address this gap with AoiZora, a compiler-mediated topology planner built for low-latency video diffusion inference on TPU sub-slices. Its guiding principle is to reconnect logical sharding with physical placement by drawing on different points in the compilation flow: AoiZora first eliminates weak sharding candidates from inexpensive pre-compilation IRs, then compiles only the ones that survive and orders their physical placements using compiled HLO together with a topology-aware communication model. The winning plan is realized along the ordinary compiler path, leaving model code, compiler lowering, collective kernels, and network routing entirely intact. On TPU v5e sub-slices, AoiZora reduces Wan 2.1 one-step denoising latency by as much as 1.42x relative to existing solutions.
arXiv:2606.17568v1 Announce Type: new Abstract: It has been well known that inverter-based resources (IBRs) can lead to converter-driven stability issues under weak grid connections. However, as the number of IBRs increases, instabilities can also occur even under strong grid connections. A practical case is presented to demonstrate this conclusion, using large-scale energy storage systems (ESSs) as an example. In this study, the ESSs induce oscillations with a frequency of 150 Hz in the d-q coordinates while providing both capacitive and inductive reactive power support (achieved by ESS functional control loops) to the connected power system. Theoretical analysis reveals that under strong grid connections, the dynamic interactions among power conversion systems (PCSs) of ESSs can be superimposed and intensified as the ESS scale extends, which reduces oscillation damping and leads to system instability. This indicates that ESS functional control loops also have potential instability risks when providing supports to power systems, which should be carefully examined. Finally, major impact factors are identified to mitigate the oscillations, and the conclusions are validated based on the SIMULINK platform. This paper provides valuable practical insights into system instabilities even under strong grid conditions, emphasizing the importance of functional control design and careful planning of the scale for IBR-dominated systems.
arXiv:2606.17575v1 Announce Type: new Abstract: This study investigates the small-signal stability of centralized energy storage systems (CESSs) using grid-following (GFL) and grid-forming (GFM) controls, particularly focusing on bidirectional power flow and multiple energy storage systems (ESSs). To address the issue of complex dynamics in CESSs when comprehensive GFL and GFM control loops are considered, high-order dynamics are simplified using the virtual damping method by focusing on the dominant oscillation mode. Damping analysis verifies that CESSs using a single-type control (either GFL or GFM) have dynamic superimposition characteristics. Specifically, as ESS number increases, the damping of GFM-CESSs improves but that of GFL-CESSs decreases. The damping sensitivity shows that the damping of GFM-CESSs is more sensitive to bidirectional power flow and all control loops, whereas that of GFL-CESSs is more sensitive to d-axis control loop. Consequently, GFM-CESSs are preferred for large-scale integration but are limited in scenarios with significant power reversal. If GFL and GFM controls are hybridized in CESSs, the ratio of GFM-CESSs should be constrained to avoid instability from modal resonance between GFL-CESSs and GFM-CESSs. This highlights that implementing GFM-CESSs necessitates considering scenario limitations rather than pursuing maximal integration under hybrid integration conditions. The conclusions are validated through modal analysis and time-domain simulations.
arXiv:2606.17584v1 Announce Type: new Abstract: Finding the initial noise that generates a given data sample, known as inversion, is a key component for downstream applications such as training-free image editing. Existing fixed-point inversion methods improve inversion accuracy by formulating each inversion step as a fixed-point problem, but they lack a principled mechanism for selecting among multiple fixed-point solutions that can arise in practice. We observe that different selections induce different inversion trajectories, leading to substantial variation in reconstruction and editing quality. For rectified flows, we further find that this variation is closely associated with trajectory straightness, motivating straightness as a principled selection criterion. We propose SelFix, a fixed-point inversion method that selects fixed-point solutions inducing straighter inverse trajectories while retaining convergence to an exact inverse root under standard local assumptions. Experiments on FLUX.1-dev and PIE-Bench show that SelFix improves fixed-point inversion, achieving stronger real-image reconstruction and better source-preserving prompt-based editing than prior inversion baselines. The code is available at https://github.com/seminkim/selfix.
arXiv:2606.17590v1 Announce Type: new Abstract: Video tokenization is fundamental to scalable video generation, as the number of tokens directly determines the computational cost and the length of videos that can be modeled. Existing tokenizers mainly improve scalability by compressing videos into fewer tokens, but they often continue to represent persistent content, such as static backgrounds and consistent object appearances, repeatedly across frames and chunks. In this paper, we propose \textbf{TivTok} (\textit{Time-Invariant Tokenizer}), a reuse-aware video tokenizer that makes persistent information reusable across time. TivTok represents a clip with Time-Invariant (TIV) tokens that encode information shared across frames and Time-Variant (TV) tokens that encode frame-specific residuals. To obtain this factorization, we introduce Scope-Induced Factorization (SIF), which assigns different attention scopes to the two token groups: TIV tokens attend to the full clip, whereas each TV token only accesses its corresponding frame together with the TIV tokens. In the decoder, Invariant Broadcasting (IB) reuses the same TIV tokens across frames and chunks for parallel reconstruction and long-video tokenization. Experiments show that TivTok achieves an rFVD of 12.65 on the standard $16{\times}256{\times}256$ benchmark and improves compression efficiency by 2.91$\times$ for 128-frame videos compared with the evaluated baselines, while using only 1.1\% of the tokens required by downsample-based tokenizers in our evaluation.
arXiv:2606.17619v1 Announce Type: new Abstract: Reference-driven image generation has made rapid progress on identity preservation, but reliable viewpoint control across different subjects remains poorly understood. The difficulty is not merely generating a new image of the target subject: the model must infer the implicit viewpoint of one subject and transfer it to another subject using only image-level evidence, without camera poses, depth, or ray-based conditions. In this setting, existing generators conditioned on multiple image references often rely on spurious semantic correlations, which lead to viewpoint drift, part-level structural mismatches, and missing or unsupported target-specific content. We formulate this challenge as cross-subject viewpoint alignment and propose RAVA, a retrieval-augmented framework that supplies explicit geometric evidence before generation. RAVA first learns a cross-instance viewpoint embedding that retrieves target-subject images aligned with the anchor viewpoint, then applies a LogDet-based subset selection strategy to retain a compact reference set that is both view-consistent and structurally complementary. The selected references are finally consumed by a fine-tuned multi-reference image generator. Experiments show that generic semantic embeddings are nearly random for this task, while the proposed retriever substantially improves viewpoint retrieval quality. On cross-subject generation, RAVA consistently outperforms zero-shot baselines and stronger retrieval alternatives under the same generation backbone. These results indicate that cross-subject viewpoint alignment benefits from retrieval-augmented geometric grounding rather than relying on end-to-end generation alone.
arXiv:2606.17628v1 Announce Type: new Abstract: Memory has become a standard substrate for self-evolving agents, yet retaining experience is not the same as learning how to evolve through it. Existing memory agents can store trajectories, retrieve reflections, or accumulate skills, but often lack the holistic competence to select useful experience, act on it, write reusable knowledge, and maintain a growing repository. We introduce OPD-Evolver, a slow-fast co-evolution framework that cultivates such an agent evolver through on-policy self-distillation. In the fast loop, OPD-Evolver interacts with a four-level memory hierarchy to read, use, write, and maintain experience for rapid test-time evolution. In the slow loop, outcome-calibrated memory attribution and privileged hindsight distill these four abilities into the deployable policy. Across multi-domain benchmarks, OPD-Evolver surpasses memory systems such as ReasoningBank by up to 11.5%, and training-based methods such as Skill0 by ~5.8%. Further analysis shows that OPD-Evolver internalizes high-value experience and memory management, enabling OPD-Evolver-9B to challenge giant counterparts such as Qwen3.5-397B-A17B and Step-3.5-Flash, pointing beyond memory-augmented agents toward genuinely qualified agent evolvers.
arXiv:2606.17633v1 Announce Type: new Abstract: Due to educational inequality, high-quality lesson plans often mismatch the needs of disparate educational contexts. Teachers typically modify existing lesson plans to fit new contexts, but current tools instead focus on generating content from scratch, creating additional workload. Moreover, a critical gap remains in supporting teachers to quickly adapt to new learning profiles. To bridge these gaps, we present AdaPT, a system leverages LLMs to support transformation of existing lesson plans for cross-regional and differentiated instruction. AdaPT features an interactive interface that allows teachers to input student profiles, offers structured lesson representation, provides explanations for lesson-plan transformations, automatically adapts lesson content for new contexts, and supports iterative, teacher-in-the-loop refinement. We evaluated AdaPT through a user study with 9 teachers and an expert evaluation with 3 specialists. Results show that AdaPT supports workflows of teachers and offers a promising pathway toward promoting educational equity.
arXiv:2606.17644v1 Announce Type: new Abstract: Datasets in practical document processing scenarios typically grow over time, and their class annotations undergo continuous refinement. This creates significant re-annotation efforts, which are time-consuming and costly. A promising remedy is to re-annotate only a small subset of available documents manually and apply semi-supervised learning techniques that leverage both labelled and unlabelled data. Although there are numerous approaches to tackle this problem for classification, there exists no adaptation for the problem of re-classifying object detection instances, e.g. for document layout analysis. To this end, we propose Bounding Box Label Propagation (BBLP), a pseudo-labelling framework for object detection. An object encoder integrates visual, textual, and positional embeddings from object detection samples to come up with a joint embedding that can be used for Label Propagation on partially annotated datasets in a plug-and-play fashion. Evaluation results indicate that the proposed approach produces high-quality class annotations of bounding boxes. In the D4LA layout analysis dataset, it achieves a mAP of 54.0%, corresponding to 81.6% of fully supervised performance, while using only 10% labelled data. Our work demonstrates the potential of Label Propagation for object detection and lays the groundwork for reducing manual annotation efforts in real-world document processing applications.
arXiv:2606.17646v1 Announce Type: new Abstract: Saliency map visualizations explain image-based AI predictions by pointing to regions, but these are often unintuitive and semantically unclear, leaving an interpretability gap. We argue that AI explanations should be intuitive -- coherent to user knowledge, yet simple and selective to accelerate interpretation. Inspired by artistic drawings, we propose SketchXplain to generate sketch-based visual explanations for intuitive image-based explainable AI (XAI). Combining techniques in saliency maps, concept-bottleneck models, and sketch optimization, SketchXplain integrates saliency to select coherent observation artifacts, concepts for knowledge coherence, cues to represent them, and abstraction for simplicity. Evaluating on face expression recognition, modeling and user studies showed that SketchXplain supported quicker interpretation with more aligned visualizations than saliency maps or simple drawings. Further evaluation on skin lesion diagnosis found that SketchXplain more coherently visualized disease symptoms, better supporting lay diagnosis. Thus, this work illustrates the value of sketches for intuitive, simple, coherent, and quick image-based XAI visualizations.
arXiv:2606.17653v1 Announce Type: new Abstract: Future wireless networks must enhance their capacity to sustain deterministic service levels and support emerging time-sensitive services in key verticals. The ability to guarantee bounded latencies heavily depends on efficient radio resource management. Configured Grant (CG) scheduling can reduce latency by pre-allocating resources, but its effectiveness and efficiency decrease under variable traffic patterns. This study presents a novel predictive CG scheduling scheme that pre-allocates resources based on traffic predictions while accounting for prediction inaccuracies. By considering these inaccuracies, the scheme significantly improves the ability to meet bounded latency requirements, which are essential for supporting deterministic service levels. Our evaluations show that the proposed scheme significantly enhances the capacity to support deterministic service levels while improving resource utilization, even in scenarios with variable and mixed traffic flows with diverse requirements.
arXiv:2606.17654v1 Announce Type: new Abstract: Teleoperated driving (ToD) enables the remote driving or control of vehicles. For this purpose, vehicles must transmit video feeds to the ToD control center so that the remote operator is fully aware of the driving conditions and can safely control the vehicle. 5G (and beyond) networks are fundamental for the deployment of ToD as they can provide the low latency, reliable and broadband connection necessary to connect the vehicle and ToD control center. However, it is unclear whether common 5G network architectures and configurations are well-suited to support the simultaneous teleoperation of multiple vehicles with demanding uplink bandwidth, as current networks are mainly configured to support mobile broadband services. This paper demonstrates that MEC or edge-based 5G networks are better suited to support and scale the ToD service than centralized networks, and quantifies the bandwidth required to simultaneously teleoperate multiple vehicles under various 5G network architectures and configurations, including different duplexing modes and TDD frame structures. Finally, the study shows that the configuration of the control channels can help mitigate the impact that the processing time of the video feeds has on the capacity to support and scale the ToD service.
arXiv:2606.17656v1 Announce Type: new Abstract: The fluctuation theorem and detailed fluctuation theorem are formulated for classical systems whose governing equations can be written in Schr\"{o}dinger-type equations and which possess either a unitary or an antiunitary time-reversal operator. The initial state vector is treated as a random variable drawn from a time-reversal-symmetric probability distribution, and a stochastic relative entropy defined from its probability density is used to formulate these theorems. The framework is applied to two collisionless plasma systems: the linear Vlasov-Poisson and linear gyrokinetic systems. For the linear Vlasov-Poisson system, the governing equations are recast into Schr\"{o}dinger form, and Hamiltonian eigenvectors corresponding to Case-Van Kampen modes are derived to construct explicit solutions. The stochastic relative entropy is interpreted as entropy generation associated with Landau damping, in which electric-field energy is transferred from the lowest Hermite state to higher-order Hermite states acting as thermal reservoirs. For a specific class of initial distributions, a new analytical expression for the probability density function of the stochastic relative entropy is derived and validated numerically. For the linear gyrokinetic system in a uniform magnetic field, the governing equations are likewise transformed into Schr\"{o}dinger form, and the corresponding time-reversal operators are identified. The state-vector space is constructed as a tensor product of species, perpendicular-velocity, and parallel-velocity spaces. The resulting state vectors decompose into two orthogonal components: one coupled to electromagnetic fluctuations and the other corresponding to ballistic modes. These results establish a nonequilibrium statistical-mechanical framework for collisionless plasma dynamics and provide useful examples for future quantum-computing applications to plasma simulations.
arXiv:2606.17657v1 Announce Type: new Abstract: People make decisions differently in strategic interactions. Some update beliefs like a Bayesian; others exhibit biases like motivated reasoning. Although creators of large language models use simulated humans for safety evaluations and training, they often fail to cover this breadth of human behavior. We argue that cognitive science and economics provide a convenient tool for doing so, making use of mathematical models of human decision-making. We propose an approach that we call Equation-to-Behavior Prompting for guiding large language models to match cognitive models, and evaluate this approach on persuasion games based on legal decision-making. We find that large models can approximate equation-based specifications -- Bayesian updating, affine distortion, motivated updating, and Grether's $\alpha$-$\beta$ model -- using prompting, but small models fail to do so. However, training small models with reinforcement learning to adhere to mathematical rules, Equation-to-Behavior RL, reduces belief error by 26.5% in out-of-distribution parameterizations. We show that these simulations can help create diverse training environments; training small models to consider different kinds of decision-makers improves average belief change by 2.5%--12% over Bayesian-only training, even when persuading GPT-5-mini. Our work could improve human simulations for training and evaluation in increasingly realistic settings, and could also enable novel research into more complicated mathematical models of human decision-making.
arXiv:2606.17659v1 Announce Type: new Abstract: This study introduces enhancements to physics-constrained neural networks (PCNNs) that improve the accuracy and stability of hybrid short-term weather forecasting models. Building on the WeatherGFT architecture, three innovations are proposed. First, an upgraded numerical solver, combining a fifth-order weighted essentially non-oscillatory scheme (WENO-5), a beta-plane approximation, and subgrid-scale viscosity, permits a fourfold increase in the integration time step to 1200 s while reducing the daily mean squared error by up to 26%. Second, a unified autoregressive hybrid block replaces the original chain of 24 specialised modules, eliminating overfitting to specific lead times. Third, the physical core is integrated with two state-of-the-art neural backbones, resulting in PI-PredFormer and PI-IAM4VP. Evaluation on the WeatherBench South Pacific subset from 2000 to 2004 shows that these hybrids reduce root mean squared error at 1-12 h lead times by 8-22% compared to purely neural counterparts, while better preserving physical consistency. These results demonstrate that incremental refinement of hybrid components offers a practical route toward more accurate and efficient short-range weather forecasting.
arXiv:2606.17661v1 Announce Type: new Abstract: Kirigami, the art of cutting flat sheets into deployable 3D structures, has recently inspired a new class of parachutes which can deploy into a naturally stable inverted canopy. However, the dynamic mechanism, fluid forces, and geometrical parameters that grant this stability have not yet been clearly identified. In this paper, we use a novel Biot-Savart far-field boundary condition to perform prescribed acceleration and free-falling simulations in effectively infinite domains, tracking the descent of a parameterized kirigami parachute. The far-field velocity is reconstructed from the interior vorticity, resulting in less than 0.1% variation in the predicted dynamics as the domain size is doubled. We first show the linear forces drop 2-5 times as the parachute is deployed due to increased permeability, whereas the moments increase due the counterbalancing effect of the increased lever-arm. Next, we find that the kirigami parachute achieves stable flight for deployment heights as small as half its radius, quickly damping out applied perturbations. For smaller deployments, the parachute tumbles due to side-slip and rotational coupling, as in falling disks. These effectively unbounded simulations identify that deployments approximately equal to the radius offer high drag forces with strong dynamic stability, providing a simple design rule for deployable parachutes.
arXiv:2606.17671v1 Announce Type: new Abstract: Photonic reservoir computing offers a hardware-efficient route to processing temporal and sequential data, but delay-based implementations often rely heavily on temporal multiplexing, where long temporal masks are required to generate a sufficiently rich reservoir state. Here we show numerically that the spatial degrees of freedom of an active multicore fiber placed inside a delayed optical feedback loop can reduce this dependence on serial temporal encoding. The input signal is encoded by temporal and spatial masks, the pump distribution across the cores controls the reservoir operating point through the core-dependent effective gain and saturation energy, and the detected core intensities serve as readout features for a single trained linear layer. The system is modeled by linearly coupled nonlinear Schr\"odinger equations with saturable gain and solved using a split-step Fourier method. On the Mackey-Glass one-step-ahead prediction benchmark, a seven-core reservoir with equal temporal masks reduces the validation normalized root mean square error from 0.5956 for the single-core baseline to 0.0651 at a modulation rate of 40 GHz. At 1 GHz, spatial-only encoding reaches an error of 0.0323 using one temporal sample per symbol and no temporal mask. These results show that an active multicore fiber can provide both parallel readout channels and a tunable nonlinear transformation, offering a route to photonic reservoirs with reduced reliance on temporal multiplexing.