This paper confronts the design problem of building dashboards for novel computational techniques whose real-world meaning is still contested. It introduces TopoLA, a system applying Zigzag Persistent Homology to learning-management data, and derives three principles for managing interpretive uncertainty: separating measurement from interpretation, graduated disclosure, and explicit acknowledgment of methodological limits. The argument is timely because fields from explainable AI to bioinformatics increasingly face the same gap between analytical power and interpretive consensus.

Autonomous driving system designers face a persistent dilemma: should they build a decomposed modular pipeline or train an end-to-end neural policy? This survey-style paper addresses that question by comparing modular, imitation-learning, reinforcement-learning, and hybrid architectures across interpretability, scalability, and robustness. Its central contribution is a practical twelve-criterion, four-dimensional framework intended to guide practitioners in selecting the right paradigm for a given deployment context.

World Action Models (WAMs) jointly predict visual futures and robot actions, yet they often hallucinate locally plausible trajectories that never execute the critical state transition needed to finish the task. This paper identifies "task-incomplete imagination" as a failure mode arising from the mismatch between long-horizon video pretraining and short-horizon control generation, and proposes Completion Aware Guidance (CAG), a training-free sampling method that up-weights instruction tokens already attended to by the model. Across two WAM architectures, CAG boosts success rates and cuts incomplete-imagination failures, offering a lightweight inference-time fix for a structural objective mismatch.

Sampling from discrete, unnormalized distributions without curated data is a fundamental bottleneck in physics, chemistry, and combinatorics, because the state space is exponential and Markov chains mix too slowly. This paper introduces DIG-IN (Discrete Gibbs Iterative Neural Sampler), which trains masked diffusion models via fixed-point iteration by using Gibbs soft labels—local single-site conditionals derived from energy differences—as rich supervision instead of one-hot reconstruction targets. The method tempers importance weights by effective sample size to stabilize the bootstrap, and it scales to high-dimensional systems such as $D=2500$ lattice spin models and alloy phase diagrams.

Asynchronous online learning structurally fragments learner communities, and cohort-level topological indicators like $\beta_0$ can misleadingly suggest convergence when learners simply drop out. This paper tests whether $\beta_0$ from Zigzag Persistent Homology is participation-sensitive and whether deadline-driven fragmentation–convergence cycles replicate across all 22 OULAD courses. Clarifying this matters because AI-augmented dashboards risk spreading systematically misleading cohesion narratives if they misread attrition-driven $\beta_0$ declines.

Latent world models plan by scoring action sequences with latent-space distances, yet physical success criteria demand precision finer than these models typically encode. This work proposes a training-only auxiliary loss that supervises encoder and predictor outputs against the exact success-criterion quantities via a shared linear head, then discards the head at test time so planning remains unchanged. On manipulation tasks the approach yields statistically significant absolute gains of 3-5%, with the key insight that a task's success criterion itself should dictate what the latent state must retain.

This paper studies nonlinear in-context learning via single-index models, comparing a kernel learner (fixed spherical-harmonic features followed by linear attention) against a feature learner (linear attention on raw inputs followed by a learned nonlinear readout). Using the replica method, the authors derive predictions for memorization and generalization errors across varying pretraining data, task diversity, and context lengths, and validate them numerically over a broad parameter range. The analysis reveals phase diagrams for architectural advantage and qualitatively different context-length scalings: the kernel learner needs $L = \Theta(d^k)$ to recover degree-$k$ harmonics, while the feature learner exploits all teacher components at $L = \Theta(d)$.

This work tackles algorithmic mathematical reasoning, where final-answer rewards fail to expose intermediate errors and successful code execution does not guarantee correctness. The proposed Function-Structured Graph Reinforcement Learning (FSG-RL) framework connects typed subproblem graphs to executable Python nodes, then trains a policy with supervised fine-tuning followed by Group Relative Policy Optimization (GRPO) using multi-verifier rewards and span-level credit assignment. The core claim is that verifying interface compliance, local functional behavior, and final consistency together pushes a 9B parameter model past a 27B API baseline, while also providing statistically significant gains over a strong SFT stage.

Instead of hand-designing or training a neural network for time-series anomaly detection, this paper outsources the job to an LLM-driven autonomous research loop. The agent iteratively edits a short NumPy program, scoring candidates against synthetic anomalies in a held-out training slice, until it discovers compact spectral-Gaussian novelty detectors. The resulting univariate and multivariate programs reportedly top the TSB-AD benchmark while running on a single CPU, offering an unusual blend of accuracy, speed, and interpretability.

QK-Wanda attacks a blind spot in activation-aware LLM pruning: Wanda scores query and key weights independently even though their dot products jointly determine attention. The paper derives closed-form single-deletion costs under a coupled QK reconstruction objective, letting queries and keys share a pruning budget without gradients or weight updates. Across 15 models up to 72B parameters, the method cuts local QK reconstruction error by roughly half, yet downstream gains are uneven—Llama 2 and Qwen2.5 improve while Llama 3 degrades—highlighting that local reconstruction fidelity is an imperfect proxy for end-to-end model quality.

Many physical systems are driven and observed only on lower-dimensional submanifolds embedded in a larger ambient domain, forcing classical solvers to waste computation on full volumetric states and preventing black-box surrogates from reusing a fixed medium representation. This paper introduces the Green’s Observation Operator (GObO), which learns a time-dependent Green’s kernel restricted to the source and observation submanifolds so that, after a single conditioning pass on the ambient medium, evaluating an entirely new source requires only a cheap lower-dimensional integral with no additional network inference. The idea is supported by exponential spectral approximation guarantees, an exact finite streaming state, and strong empirical speedups and source-generalization gains on three-dimensional heat and advection–diffusion problems.

Understanding when neural-network loss landscapes contain spurious local minima is a foundational problem in deep learning. This paper studies shallow bias-free ReLU networks in a Gaussian teacher-student setting and proves that a learned linear skip connection eliminates all spurious local minima for planar teacher features with positive output weights once the student is at least as wide as the teacher. In contrast, without the skip, spurious minima can persist at every width—a striking separation between architectural bias and overparameterization.

Wrist electrodermal activity differs in amplitude from person to person, so affect-recognition models normalize the signal before classification. A hidden protocol choice is whether the normalization statistics come from training subjects only or from the held-out user's own complete recording, which retroactively gives the model a calibration that a newly worn device lacks. The paper introduces SAFE-EDA, a compact convolutional network pretrained on expert artifact annotations, and shows that its measured benefit over training from scratch ranges from 0.020 to 0.227 depending on this normalization choice, with the larger gains occurring in the realistic first-use setting. The authors also survey fifty published WESAD studies and find only ten percent report the source of their normalization statistics, making published scores difficult to compare.

Range-GRPO addresses semi-supervised LLM post-training when labeled data is scarce by treating LLM-as-a-Judge scores as conformally calibrated reward intervals instead of scalars. Its core idea is to replace standard GRPO pointwise comparisons with pairwise comparisons of interval midpoints, weighting each pair by $\omega_{ij}=\lambda/(h_i+h_j+\lambda)$ so that uncertain rewards can actually flip the direction of the learning signal. When all intervals collapse to points ($h_i=0$), the method exactly recovers Dr.GRPO, and experiments suggest it improves both in-distribution and out-of-distribution reasoning with a smaller compute budget.

The paper tackles autoregressive modelling of mineral-exploration drillholes, where lithology is revealed sequentially from shallow to deep. It introduces DrillBench, a 49,671-hole benchmark across Western Australia with a graded transfer spectrum from local prediction to cross-province generalisation, evaluating next-layer prediction (macro-F1) and free-running generation (joint $\mathrm{KL}(\text{true}\|\text{generated})$). The core finding is a stark transfer boundary: spatial and geochemical conditioning boosts local accuracy but collapses under shift, while sequence-only autoregressive models degrade more gracefully. To address this, the authors propose a backbone-agnostic recipe combining large-scale pretraining on historical archives with spatial retrieval of neighbouring lithology, showing that retrieval aids local cover prediction and pretraining aids bedrock and cross-province transfer.

Existing methods for structured imitation learning rely on extensive human input or static LLM knowledge that can conflict with expert demonstrations. This paper proposes a closed-loop framework that treats policy development like software debugging: an LLM writes diagnostic analysis code to test semantic latents from tabular rollouts, identifies structure-demonstration misalignment, and iteratively edits the symbolic policy structure before re-fitting continuous parameters through imitation learning. The work matters because it automates refinement of interpretable policies and shows on two control tasks that it can outperform zero-shot LLM structures while using far less subsequent RL compute.

Primal-dual hybrid gradient methods can solve large linear programs on GPUs, but their speed depends on delicately coordinated step sizes, restarts, and acceleration heuristics. GALLOP replaces these hand-tuned rules with a reinforcement learning policy that jointly picks continuous parameters and discrete restart decisions inside a generalized PDHG update. The approach is notable because the learned policy is dimension-agnostic and reportedly generalizes from small training instances to LPs hundreds of times larger without retraining.

Low-budget active learning seeks a tiny labeled subset—a coreset—that still trains an accurate model, which is crucial in medical domains where labeling is expensive. The authors propose using the Sinkhorn divergence, an entropic optimal transport distance, as a coreset quality criterion, and develop a Frank–Wolfe warm-started swap heuristic (FW-Swap) to optimize it. Their framework yields dimension-free generalization guarantees and shows competitive or superior accuracy on vision and EEG benchmarks with very small budgets.

MiLoop addresses a key inefficiency in constructive neural combinatorial optimization: dynamic-embedding methods typically rebuild subproblem representations from scratch at each step with deep attention stacks, and often depend on external solution labels or aggressive training-time pruning. The paper proposes Memory-in-the-Loop (MiLoop), an autoregressive framework that propagates a global node-wise memory matrix across construction steps, fusing current inputs with historical context before shallow attention layers and updating memory selectively via adaptive gates. By leveraging the multi-step rollouts already required for RL, MiLoop enables a three-layer policy to learn effective dynamic embeddings without external labels. Strong results on four COPs from 100 to 10 million nodes demonstrate both high solution quality and cross-scale generalization.

Cross-architecture weight-space transformations map trained networks into different architectures (e.g., compression, upscaling), yet prior equivariant weight-space models only handle fixed architectures. CrossGMN addresses this by treating the task as refining a target initialization using a source network, making equivariance well-defined: invariant to source permutations and equivariant to target permutations. The authors prove universality for continuous cross-architecture operators and show strong empirical speedups for knowledge distillation, especially on implicit neural representations.