Direct Forcing tackles few-step autoregressive text-to-video generation by eliminating the costly ODE initialization stage that prior distillation methods require. The authors propose a single-stage recipe that jointly learns causal continuation alignment and rollout distribution matching from reference videos, using maximum mean discrepancy and dynamic gradient balancing. Starting from a bidirectional Wan2.1-$1.3$B checkpoint, the method trains in just $250$ updates and achieves $84.63$ VBench Total, offering a markedly shorter path to a fast causal generator.

MIG-COW addresses a critical vulnerability in deepfake detection: the difficulty of crafting adversarial examples that simultaneously fool both CNN and ViT architectures. The method combines momentum-integrated gradients with a consensus-orthogonal decomposition to separate shared vulnerabilities from model-specific decision cues. While it achieves near-perfect white-box success, the work is most valuable for highlighting how fragile cross-architecture transferability remains in practice.

VLTest addresses the problem of testing vision-language models (VLMs) where mutating an image, a text prompt, or both can change the expected answer, making naive output-change counting unreliable. Its core idea is to generate controlled visual variants via VQGAN latent code editing and textual variants via a rewrite–expand–prune pipeline, then confirm failures with an automated oracle and attribute joint failures to the specific image-text combination using matched four-cell evidence. This matters because VLMs are increasingly embedded in software systems, and existing robustness evaluations systematically overcount failures by ignoring whether an input still has the same correct answer.

Scientific optimization is expensive and constrained, yet the search policy is usually fixed ahead of time. ADAPT treats the complete policy $\pi=(W,O)$—where to start and how to move—as the object of optimization, using historical designs for target-aware initialization and multi-agent LLM evolution to adapt the procedure itself. Evaluated on eight held-out gravitational-wave detector topologies under matched budgets, it reduces mean loss by 54.9% versus the best classical optimizer and by 62.2% versus the best agentic baseline. The work is compelling within its domain but leaves open questions about generality and reproduction.

LLM agents improve by distilling experience into external knowledge, but different analyses of the same trajectories can produce guidance with wildly different utility. This paper introduces SPLICE, a framework that adapts consistency regularization to knowledge evolution: it perturbs the textual instructions that transform experience into skills or memories, replays tasks under each resulting view, and updates knowledge only where utility gains are consistent across views. A co-evolution loop interleaves this knowledge evolution with GRPO and gated contrastive self-distillation to internalize the guidance. The core idea matters because current agents can be misled by plausible-looking but ineffective skills, and SPLICE offers a principled filter for generalizable knowledge.

This randomized experiment with 297 knowledge workers and 594 essays tests dynamic metacognitive scaffolds for goal specification and task decomposition in AI-assisted writing. The authors show that scaffolds improve output quality, prompting behavior, and three-day topic recall, even after the support is removed. Yet participants rated the AI as less helpful and reported higher cognitive load while using the scaffold. The paper argues this tension reveals a productive friction that designers should embrace rather than eliminate.

Parametric dynamical systems supply a rare benchmark with analytic ground truth for weight-space methods, because bifurcation locations are known exactly. The paper extends JEPAWG—a joint-embedding hypernetwork originally developed for lattice field theories—to populations of forecasters trained across a grid of control parameters. Its core idea is to decode weights at unseen parameters and measure their parameter derivative $G(p) = \|\nabla_p \hat{\theta}(p)\|_F$, treating this response as an interpretable probe of local and global bifurcations. The work matters because it offers a falsifiable testbed for reading physical structure directly from the geometry of trained network weights.

World models have become a buzzword spanning everything from video generators to robot policies, yet the term remains loosely defined. This paper tackles the ambiguity by placing generalist agents in a POMDP framework and showing that policies, forward dynamics, and inverse dynamics are simply different conditional distributions factorized from the same joint distribution over observations and actions. Written as a conceptual introduction rather than an empirical survey, it aims to clarify modeling principles and connections across classical control, reinforcement learning, and modern generative approaches.

Open-vocabulary 3D segmentation relies on CLIP features lifted into Gaussian reconstructions, but raw cosine similarity ignores scene-specific directional concentration. This paper proposes a query-time calibration pipeline that subtracts a shared scene direction, whitens text prototypes with a fixed generic reference vocabulary, and recalibrates scores via soft clustering or a CSLS-based relevance margin. The result is a training-free boost in mIoU across seven lifting methods and four datasets, demonstrating that simply changing how features are compared can be as impactful as redesigning the lifting itself.

The paper addresses the gap between restrictive linear Gaussian Bayesian networks and computationally expensive fully semiparametric models for continuous variables. It proposes Semi-Linear Gaussian Bayesian Networks (SLGBN), which preserve Gaussian conditional distributions while allowing nonlinear conditional means via generalized additive models with penalized B-splines. The core contribution is a unified framework that mixes linear and nonlinear nodes within a single network, learned through a greedy hill-climbing algorithm with BIC or an extended EBIC* score.

Accurate intra-hour solar irradiance forecasting from ground-based sky images is essential for grid balancing and storage scheduling as PV penetration rises. GateFormer tackles this by embedding observed global horizontal irradiance directly into a Vision Transformer token stream, then producing two complementary forecasts—a multi-step trajectory and a direct final-horizon displacement—that are adaptively blended and residual-corrected in prediction space. The core claim is that this forecast-space decomposition, rather than conventional latent fusion or ensemble combination, yields consistent gains across three heterogeneous sky-imaging datasets.

PopDRP tackles multimodal brain-disorder diagnosis by learning population graphs whose edges encode who-should-influence-whom across subjects. The core problem is that demographic or acquisition similarity does not imply diagnostic agreement, so naive similarity graphs leak confounders. The authors propose a three-stage pipeline: Contrastive Affinity Refinement (CAR) calibrates non-imaging affinities toward training-label agreement; Neural Graph Rectification (NGR) fuses imaging and non-imaging features to denoise the graph via reconstruction and dual-view alignment; and a Selective Pyramid State-Space (SPSS) backbone performs input-dependent state updates within a hierarchical U-Net graph encoder. The idea matters because site and demographic noise are chronic problems in neuroimaging cohorts, and refining edges with label priors could in principle boost cross-subject information sharing.

ECT asks whether inversion-free image editing can be done with just one noise-level evaluation instead of averaging fields at multiple times. It proposes Endpoint-Calibrated Transport (ECT), a training-free method that extracts both an angular semantic tangent and a clean endpoint displacement from a single shared noisy state, then calibrates the update via a closed-form projection. The result is a one-step editor that halves the temporal support of recent one-step baselines and claims competitive quality with lower latency.

Ultra-low-bit weight-only quantization is essential for deploying sparse Mixture-of-Experts LLMs, but existing mixed-precision PTQ methods collapse under tight bit budgets. ProQuant addresses this with two interventions: a Prune-or-Prioritize allocator (PoP) that treats pruning as a 0-bit option in joint ILP-based bit allocation over candidate set $\{0,2,3\}$, and a Routing-Consistent RMSNorm fine-tuner (RoCo) that compensates quantization error without altering router behavior. Experiments on Qwen3 MoE variants show large generation-quality gains at 1.5–2.5 bits, though evaluation is limited to two model families.

LLM multi-agent systems are increasingly deployed in settings where one model's output becomes another's input, creating endogenous feedback loops that could destabilize collective judgment. This paper adapts the classic Music Lab experiment to test whether populations of LLM agents are vulnerable to herding and runaway cascades when making sequential song recommendations. Across 13 models and 168,480 agents, the authors find that LLM populations diverge drastically from independent judgment, produce unpredictable outcomes across replicate worlds, and largely fail to show the self-correcting dynamics observed in human benchmarks. The results matter because they shift evaluation from isolated model behavior to emergent population-level dynamics in feedback-driven systems such as recommender systems and automated evaluation.

Generative reward models judge text by generating verdicts instead of scalars, but it remains unknown whether stronger static judges give better online training signals. This paper sweeps Qwen3 judges from 0.6B to 14B parameters, comparing thinking GRPO judges against answer-only SFT judges as rewarders for online DPO in creative writing. The central finding is an evaluator–rewarder gap: thinking models lead on fixed-distribution Gold accuracy yet usually lose on downstream policy Elo, with larger judges helping even beyond policy size. The work is framed as practical guidance rather than an isolated causal claim.

Navigating the EU AI Act is especially hard for small and medium-sized enterprises that lack dedicated legal staff. This paper introduces TESSA, a governance-oriented Custom GPT that embeds domain-specific instructions, a curated EU AI Act knowledge base, and human-validated regulatory updates to turn complex legal text into practical compliance guidance. Using design science research, the authors evaluate TESSA against baseline ChatGPT across 100 benchmark questions, measuring governance alignment, expert-reviewed educational quality, and response consistency. The work matters because it tests whether lightweight custom grounding can materially improve regulatory guidance for resource-constrained organizations.

This paper investigates why user-stated preferences for AI responses often fail to predict their actual ratings. Using the public PRISM dataset, the authors show that the gap between stated and revealed preferences largely disappears when attributes are measured via aggregate human perceptions rather than simple text proxies, yet concrete features like length dominate ratings regardless of what users claim to value. The findings suggest that personalization systems should treat preference elicitation format as a design parameter matched to the decision at hand, not as a direct window into stable, latent utility functions.

Deploying open-source AI models on embedded hardware is notoriously labor-intensive because developers must repeatedly compress, convert, and tune models for heterogeneous runtimes. AgentDP automates this end-to-end pipeline by coordinating specialized LLM agents that standardize fuzzy user requirements, partition models across incompatible inference engines, and bootstrap hyperparameter search from previously solved tasks. The paper reports dramatic time savings and accuracy improvements over manual and generic-agent baselines.

Mahran asks what AI evaluation can certify when both examinee and evaluator have perceptual limits. The paper models each agent as a partition over stimuli—inputs it cannot distinguish—and proves a one-sided bound: a sharper examinee can always emulate a coarser evaluator's expected behavior and hide extra capability, while a coarser examinee cannot hide its blind spots under exhaustive probing. This yields predictions about sandbagging, monitor evasion, and weight noise, plus a worrying corollary: exact imitation of a weaker model is undetectable by any behavioural evaluator. The results suggest that behavioural evaluation alone can only establish lower bounds on discrimination, never upper bounds on capability.