Week beginning 16th November 2026

Every computer science paper posted to arXiv this week, with plain-language summaries and practical uses for each one. Includes commercial applications where relevant.

Language models improve by adding persistent per-layer states

Latent Lattice Language Models

Abstract: Language models typically increase per-token computation through deeper or looped layers and latent reasoning steps, while richer residual connections improve information flow across layers. We instead increase computational capacity: the number of active computational states a model maintains. We introduce the Lattice of Latents, a set of per-layer horizontal latent streams that run recurrently along time, alongside the vertical residual stream that flows through depth. Like hyper-connections, mHC, and attention or value residuals, the Lattice enhances the residual stream, but rather than adding or rerouting residual pathways through depth, it provides companion computational states that persist across tokens. Unlike hybrid Transformer-SSM architectures, whose recurrent states primarily serve as internal memory for sequence mixing, these latents directly condition the vertical stream's attention, KV-cache writes, MLP computation, and decoding. On Transformers trained on 20B FineWeb-Edu tokens, a 406M-parameter Lattice model lowers validation perplexity from 15.41 to 14.40 over a parameter-matched Transformer. These gains extend across architectural variants. The Lattice composes with prior residual-stream enhancements: with hyper-connections and input residuals, it lowers validation perplexity from 15.41 (base Transformer) and 14.22 (Transformer with the same enhancements) to 13.61. On Gated DeltaNet, Mamba-2, Triadic GDN, and GDN-Mamba-2 hybrids, it improves perplexity at every tested native state size, with Lattice-GDN and Lattice-Triadic-GDN variants outperforming pure baselines with 4x larger native states. These results identify persistent per-layer state as a complementary axis for scaling language-model computation.

Mon 16 NovMachine LearningArtificial IntelligenceComputation and Language
The gist
Language models usually get better by doing more calculations at each step or mixing information in deeper layers. This paper introduces a new way to improve models by keeping extra memory streams that run alongside the main processing steps over time. These extra states help the model better understand and generate text, leading to lower prediction errors. The authors show this method works across different model types and setups, making it a useful new tool for building better language models.
Open → 2611.21608v1

Frontier vision language models improve robot learning and control

ScaleVLA: Scaling Vision-Language-Action Models to 552 Billion Parameters

Abstract: Frontier Vision-Language Models (VLMs) such as GPT-6 Astra have demonstrated remarkable capabilities in robot control, suggesting that broad pretraining provides knowledge valuable for physical action. Yet most Vision-Language-Action (VLA) policies still rely on much smaller VLM backbones, leaving this potential largely untapped. We ask whether frontier-scale representations can provide a stronger foundation for robot learning. We introduce ScaleVLA, which connects a 552B DeepSeek-V4.1-Flash backbone to a trainable action DiT, and systematically compare VLMs from 2B to 552B under a shared training setup. We evaluate three fundamental capabilities of robot foundation models. In sample efficiency, just 10 demonstrations outperform a 2B backbone trained with 50 (87.8% vs. 85.6%). In generalization, LIBERO-PRO success reaches 45.1%, compared with at most 31.3% for smaller backbones. In precise manipulation, real-world charger insertion improves from 4/10 to 9/10 successes, with gains concentrated in contact-sensitive alignment. Despite its scale, ScaleVLA achieves 216 ms median latency per action chunk. Our findings suggest that frontier VLMs can serve not only as reasoning agents, but also as powerful representational foundations for efficient and generalizable robot policies.

Mon 16 NovRobotics
The gist
Big vision-language models, like those used to understand pictures and text, might help robots learn better how to act in the real world. The researchers connected a huge model with 552 billion parameters to a robot action system and found it learned tasks faster and performed more accurately than smaller models. Tasks included things like precise object alignment and general robot tasks. Even with its large size, the system responded fast enough for practical robot control. This work suggests that very large vision-language models can be a solid base for teaching robots to do complex actions.
Open → 2611.21607v1

Visual agents read ultra-high-res photos accurately by comparing image versions

ViRA: Toward Ultra-High-Resolution Visual Agents via Cross-Input Relative Policy Optimization

Abstract: Visual agents answer questions about ultra-high-resolution photos by zooming into the relevant regions. However, existing agents often answer from common sense instead of reading the evidence. Reinforcement learning (RL) on the final answer cannot correct this, because a guess earns the same reward as reading. We propose Cross-Input Relative Policy Optimization (CrossRPO), which trains agents on contrast sets. A contrast set asks one question about several versions of an image that differ only in a small region with the evidence and have different answers, so only reading the evidence solves the whole set. CrossRPO rewards solving the whole set, and we prove that it does not reinforce a set answered from common sense. We build contrast sets for training (ViRA-Train) and evaluation (ViRA-Bench) by editing one small object in images of 21 to 120 megapixels, and we photograph further sets with real changes (ViRA-Bench-Real) to exclude editing traces. We train two Visual Reasoning Agents, ViRA-9B and ViRA-27B, with CrossRPO on only about 3,500 items of ViRA-Train each. CrossRPO achieves 63.3% set accuracy on ViRA-Bench at the maximum resolution, against 59.3% for GRPO. ViRA-9B is the most accurate open model of its size on all benchmarks, and ViRA-27B outperforms Claude Haiku 5.5 and GPT-6-Luna, both at their highest thinking level, on most benchmarks.

Mon 16 NovComputer Vision and Pattern RecognitionArtificial Intelligence
The gist
Reading tiny details in huge photos is hard for AI agents because they often guess based on common sense instead of actual evidence. The authors designed a new training method called CrossRPO that makes agents compare different versions of an image with slight changes to ensure they really look at the evidence. They created special training and testing sets with ultra-high-resolution photos to teach and evaluate these agents. Their trained agents performed better than previous models at answering questions correctly by truly reading the image details.
Open → 2611.21605v1

Facial parts analysis improves face forgery detection accuracy

FaceJev: Direct Visual Decisions for Face Forgery Detection

Abstract: Face forgery detection methods often perform well on seen manipulations but generalize poorly to unseen ones. Multimodal Large Language Models (MLLMs) can recognize facial parts and assess their visual plausibility. Existing MLLM-based methods typically express these judgments through textual explanations, but seldom treat individual part decisions as explicit learning targets. We present FaceJev, an MLLM-based method for face forgery detection through direct visual decisions. Following the Jev formulation, FaceJev answers eight independent questions about facial parts using a shared image encoding and reads anomaly probabilities from the native answer logits. A face is classified as forged if any part is predicted to be abnormal, directly linking the detection result to the part decisions. We construct PartForensics, a dataset of approximately 160k images with binary anomaly targets for the eight facial parts, to supervise these decisions. We further propose FS-GRPO, which optimizes each part decision through an exact reward comparison with its alternative, using both detection and part rewards. FaceJev outperforms the strongest baseline by 7.25 percentage points on unseen manipulations. Extensive ablation studies validate our design choices and the effectiveness of the main components.

Mon 16 NovComputer Vision and Pattern Recognition
The gist
Detecting fake faces often works well on known fake types but struggles with new ones. The authors created FaceJev, a method that checks eight different facial parts separately to decide if a face is fake. They made a big dataset with labeled facial part anomalies to train this. This approach links which part looks abnormal directly to the fake detection, resulting in better accuracy on new fakes. Their tests show FaceJev performs significantly better than previous methods.
Open → 2611.21604v1

Human forecaster discussions improve tropical cyclone intensity predictions

Quantifying the added value of human forecaster discussions for tropical cyclone intensity prediction

Abstract: The National Hurricane Center routinely releases Tropical Cyclone Discussions that offer insights into its tropical cyclone forecasts. This study examines the added value of these discussions for intensity forecasting beyond a set of numerical predictors. For 637 Atlantic and eastern North Pacific tropical cyclones from the 2002-2023 hurricane seasons, we analyze the discussion text and its combination with 13 hurricane environmental predictors from SHIPS and ERA5 10-meter wind fields, for forecasting intensity changes at lead times of 24 to 120 hours using three modeling methods. In one approach, an end-to-end deep learning framework for the text shows that the discussions alone offer comparable value for 24-hour intensity forecasts to the SHIPS predictors. Adding discussion information to the SHIPS predictors in an ensemble of five such models reduces the mean absolute error of 24-hour maximum sustained wind forecasts for 2022-2023 cyclones from 9.89 to 8.90 kt, with a confidence interval that excludes zero when whole storms are resampled. The ERA5 wind fields have a minor effect on mean absolute error in wind predictions, and model rankings differ across predicted variables, lead times and model types. We provide prediction intervals for these forecasts, whose coverage falls below the 90% target during rapid intensification. Analysis of the text shows that words related to intensity and intensity change (such as intensify, weaken, eyewall and category) are important for the model predictions. This retrospective study shows the added value of the forecasters' discussions and suggests that multi-modal learning can help understand the predictive contribution of expert human judgment. The reanalysis data differ from real-time analyses, and the discussions are issued at least three hours after the valid time of the other inputs, so these results should not be interpreted operationally.

Mon 16 NovMachine LearningComputation and Language
The gist
Predicting how strong a hurricane will get is very hard. This study found that the written discussions by expert forecasters add useful information to computer models that predict hurricane strength. Using both the forecasters’ discussion text and computer data improved 24-hour wind speed forecasts for tropical cyclones. Words like "intensify" and "eyewall" in the discussions were especially helpful for predictions. The research shows expert judgment can complement numerical data to better forecast hurricane intensity, though these results are retrospective and not for immediate use.
Open → 2611.21602v1

Vision language models plan image descriptions step by step

How VLMs Plan What's Next

Abstract: When a vision-language model describes an image, it names one object at a time and it rarely repeats itself, yet how the model plans this order is far from obvious. We characterize the mechanism a VLM uses to decide where to look before it looks. The mechanism has four main parts. First, binding heads match the relevant text tokens against the image and resolve them into pointers to the matched image region. Second, the same binding heads bind each written answer to the region it came from, and the model turns it into a progress signal: a cursor, the position in the image up to which the list has been written. Third, a select step chooses the nearest unwritten region after the cursor, or stops. Finally, gaze heads execute the chosen pointer and return a concept of what is drawn there, which language heads and the late MLPs turn into a word in the language of the question. We validate each part of this mechanism through causal patching in Qwen3-VL models on a synthetic visual retrieval task, and test our mechanisms against alternative hypotheses. We further show that the mechanism holds across input formats, natural photographs, and languages, and that its binding, relay, and gaze heads appear at every model size from 2B to 32B. This work allows us to investigate how a VLM turns a question and an image into a sequence of answers, layer by layer and token by token. More broadly, it opens a way to study how models plan over complex multi-step tasks with long rollouts. Our project is available at https://plan.baulab.info/

Mon 16 NovComputer Vision and Pattern RecognitionComputation and LanguageMachine Learning
The gist
When describing images, vision-language models choose what to mention one object at a time, but it wasn’t clear how they decide that order. The authors explain that the models use special parts called binding heads and gaze heads to point to image regions, keep track of what’s been described, and decide what to name next. They tested these parts by changing the model and seeing how it affected performance, confirming the process works consistently across different images, languages, and model sizes. This helps us understand how these models plan multi-step answers from images.
Open → 2611.21600v1

Parallel method proves stability of deep neural systems faster

Hyperlyve: Parallelized Enumeration and Exact Lyapunov Stability Certification for Deep ReLU Networks

Abstract: We introduce Hyperlyve (Hyperplane Partitioned Lyapunov Verification and Enumeration), a framework for proving the asymptotic stability of nonlinear dynamical systems, including those with neural network controllers. Hyperlyve learns and formally certifies continuous piecewise-affine (CPA) neural Lyapunov functions within a counterexample-guided inductive synthesis (CEGIS) loop. Hyperlyve's key innovation is a parallel algorithm that enumerates the hyperplane arrangement formed by the ReLU activations of deep networks and certifies that Lyapunov conditions hold within each polyhedral region. We derive sound and complete regional tests to verify the asymptotic stability of the exact smooth dynamics (rather than a piecewise-linear approximation) within a compact domain of interest. Furthermore, we formally characterize the computational complexity of the CPA neural Lyapunov verification problem as co-NP-complete, filling a key gap in the literature. Empirical results demonstrate that Hyperlyve enumerates ReLU networks over 150-times faster than competing tools, which contributes to Hyperlyve proving the asymptotic stability of systems that are currently intractable for state-of-the-art verifiers.

Mon 16 NovComputational GeometryMachine LearningLogic in Computer Science
The gist
Ensuring that systems controlled by deep neural networks remain stable over time is a big challenge. The authors present Hyperlyve, a tool that breaks down a neural network into regions defined by its ReLU activations and checks stability conditions precisely within each region. This allows it to certify that the system's behavior will settle down safely in cases where other methods are too slow. Hyperlyve’s approach is mathematically thorough and much faster than previous tools. It also clarifies the difficulty level of checking these stability guarantees.
Open → 2611.21599v1

Evolving specialized memories helps reinforcement learning handle changing tasks

Mitigating Catastrophic Forgetting with Physics-Indexed Specialist Memory: the Evolutionary Neuroplastic Agent

Abstract: Continual reinforcement learning requires adaptation to changing conditions while preserving performance under previously encountered dynamics. It was investigated whether specialists generated by evolutionary search can provide a reusable memory when combined with environment detection and failure-driven search. The Evolutionary Neuroplastic Agent (ENA) evolves small neural networks without gradients, archives selected policies by detected dynamic regime, and retrieves them through Bayesian policy reuse. The architecture was evaluated in non-stationary CartPole and HalfCheetah environments. In the 30-replicate CartPole ablation, the complete architecture achieved a mean success rate of 83.2% across the five test environments. Among variants that learned the harder CartPole environments, the complete architecture showed the most consistent retention. A selection ablation also showed that the retrieval rule affected performance. In the evaluated sequences, ENA adapted more slowly than PPO on CartPole and achieved lower returns than SAC on HalfCheetah. The evidence concerns the complete architecture and does not isolate gradient-free optimization as the cause of retention or establish superiority over other continual-learning methods.

Mon 16 NovMachine LearningArtificial IntelligenceNeural and Evolutionary Computing
The gist
Machines that learn from experience struggle to keep skills when the rules of the game change. The authors created a learning agent that stores small expert skills tied to different situations and picks the best one when needed. They tested it in changing game-like tasks and found it kept older skills more consistently than some simpler methods. However, it was slower and sometimes less effective than other advanced learning methods. The work shows a way to remember past solutions but doesn't prove it is the best for all cases.
Open → 2611.21598v1

Bagging technique optimizes learning of chain-of-thought token prediction

Optimal Autoregressive Chain-of-Thought Learning via Bagging

Abstract: We study how to learn an autoregressive next-token generator $f\colonΣ^\star\toΣ$ from a class $\mathcal{F}$, given chain-of-thought (CoT) demonstrations of length $T$ generated by $f$. We present a simple algorithm based on bagging, which outputs a majority vote of generators that are trained to be CoT-consistent on bootstrap samples of the training data. For binary token sets, it achieves the optimal sample complexity of $O((d_{\mathrm{VC}}+\log(1/δ))/ε)$, independent of the CoT length $T$, where $d_{\mathrm{VC}}$ is the VC dimension of $\mathcal{F}$. For finite token sets $Σ$, the VC dimension is replaced by a multiclass analogue, the Graph dimension $d_{\mathrm{G}}$, and the sample complexity is optimal up to a $\log|Σ|$ factor. The number of generators in the majority-vote ensemble is $O(\log(T/δ))$, and we show that the ensemble can be distilled into a single generator in $\mathcal{F}$ at the expense of $n\log(nT)$ unlabeled prompts.

Mon 16 NovMachine Learning
The gist
This paper studies how to efficiently learn a step-by-step text generator that predicts the next word given previous words. The researchers propose a simple approach that trains multiple models on different random samples of training data and combines their outputs by voting. This method achieves the best possible sample efficiency even when the step-by-step reasoning sequences are long. They also show how to compress the multiple models into a single model using additional unlabeled examples. This work helps improve learning for systems that generate reasoning or explanations token-by-token.
Open → 2611.21597v1

SADL method reduces representation collapse in AI models by matching supply and demand

SADL: On the Demand-Supply Geometry of Representation Collapse

Abstract: In Joint-Embedding Predictive Architectures (JEPAs), a well-constrained projector output does not by itself prevent representation collapse. We find that, from initialization, the encoder representation is dominated by a component shared by different inputs. A batch-normalized projector removes this component, so regularization after the projector cannot correct it, and the differences between representations shrink until they collapse. We propose SADL (Supply And Demand Loss), which keeps the original training objective and constrains the encoder directly when needed. SADL compares the representation differences that the projector output demands with the differences the encoder can retain and pass on to the projector, and adds a constraint on the encoder only when supply falls short of demand. It works with different Demand Regularizers and introduces no auxiliary networks, additional trainable parameters, or architectural changes. In single-task and jointly trained four-task LeWorldModel (LeWM) and INTACT experiments, SADL lowers the collapse rate over ten random seeds from 50% to 0%. After one epoch of training, encoder effective rank is 3.4-6.4 times that of the corresponding baseline without SADL, and latent prediction error falls to 1/20-1/303 of it. Without additional tuning, SADL stays robust as its loss weight spans orders of magnitude, and with several Demand Regularizers INTACT exceeds 95% mean search-free control success. On four image datasets, SADL also consistently improves accuracy and stability across random seeds. These results show that matching the representation differences a regularizer demands with the differences the encoder can supply leads to faster and more stable representation learning in control and image classification.

Mon 16 NovRoboticsMachine Learning
The gist
AI models that learn by comparing inputs sometimes end up representing everything too similarly, which is called representation collapse. The authors found that this happens because the part of the model that encodes the inputs shares too much common info across data points. They propose a new method called SADL that keeps track of how much difference the later parts of the model expect and how much the encoder can deliver, adding a penalty only when needed. This leads to more stable training and better performance in tasks like control and image classification.
Open → 2611.21596v1

Improved transistor modeling method for cryogenic SkyWater chips

Surrogate-Assisted Compact-Model Extraction for SKY130 CMOS at 77 K

Abstract: Cryogenic circuit design requires compact transistor models that reproduce measured low-temperature behavior and run in standard circuit simulators. We fit BSIM4 parameters to measured I-V curves of SkyWater 130 nm (SKY130) transistors at 77 K using a neural surrogate of NGSpice. The surrogate maps compact-model parameters and device geometry to the complete set of output and transfer characteristics. Extraction is a bounded least-squares search: a bank of NGSpice simulations supplies initial candidates, finite differences of the surrogate supply the local Jacobian, and NGSpice re-simulates the resulting cards before selection. On 18 measured geometries, we compare a search over seven card parameters with a search over 43 parameters selected by NGSpice sensitivity. Relative to NGSpice re-simulations of the previously released cards, the two searches reduce the in-sample mean relative root-mean-square error (RRMS) by 17% and 26%, respectively. The 43-parameter search has the lower overall error, but the seven-parameter search has the lower mean on high-bias curves, and some individual curves have higher error than with the released cards under both searches.

Mon 16 NovEmerging TechnologiesMachine Learning
The gist
Transistor behavior changes at very cold temperatures, making it hard to design circuits that work well in those conditions. The authors created a faster way to match a common transistor model to real measurements of SkyWater 130 nm transistors at 77 K using a neural network that mimics detailed simulations. This method helps find the best model settings more quickly and accurately, improving how well simulations match actual transistor performance. They showed that searching more parameters can reduce average errors, but sometimes simpler searches work better on certain data.
Open → 2611.21594v1

Private cloud computing can’t prove no photo learning occurred

The Provenance-Privacy Paradox: Can Private Cloud Compute (PCC) Prove That Apple Reference Images Are Not Used for Learning?

Abstract: Apple Reference Image (ARI) combines camera-sensor signatures, Secure Enclave attestation (SEP), cryptographic timestamp bounds, Private Cloud Compute (PCC), and a final post-quantum signature to establish photographic provenance. PCC is central to this process because it validates the secure digital negative and develops authenticated raw sensor measurements into a reference JPEG. Although the secure digital negative is encrypted during transmission, the authorized PCC workload must process the raw pixels in plaintext. This requirement creates a provenance-privacy paradox: cloud processing strengthens the provenance guarantee while giving an Apple-authorized, machine-learning-capable workload access to valuable, hardware-authenticated raw imagery. We argue that workload attestation and transparency-log inclusion verify software identity and authorization but do not, by themselves, prove that an authorized workload cannot learn from or retain information derived from the photograph. We implement this counterexample in a Python- and Docker-based experimental testbed that models relevant ARI and PCC functions. Across 27 public-domain photographs, a baseline workload and a learning-enabled workload both passed the same verification checks and returned byte-for-byte identical JPEGs. However, the learning-enabled workload retained a first-layer gradient of approximately 48 KB from which its 64 x 64 input was reconstructed with a maximum absolute per-pixel error of 6 x 10^-8. The additional processing overhead was small relative to image decoding and processing. These results do not demonstrate that Apple currently trains on ARI photographs or reproduce production PCC, but identify non-learning and non-retention as independently verifiable assurance requirements.

Mon 16 NovCryptography and Security
The gist
The paper looks at a way Apple tries to prove where photos come from using special secure processing in the cloud. But the authors found a tricky problem: while the cloud process keeps photos safe and verified, it must see the raw images plainly, which means it could secretly learn from them. They showed with experiments that even software that passes all security checks can still remember and reconstruct image details. This means that current security checks don’t guarantee that images aren’t being learned from or kept behind the scenes.
Open → 2611.21590v1

Deep learning reveals how early-career tech jobs differ by role and tasks

Beyond Job Titles: Interpreting Early-Career Job Advertisements with Sparse Autoencoders and Semantic Clustering

Abstract: Job titles and job descriptions alone provide limited insight into how technical roles differ in a changing job market. To assess how such roles differ in their work and industry applications, we design and compare two methods based on deep learning and transformer representations using 36,081 early-career job postings collected from LinkedIn in the United States between December 2025 and October 2026. We first apply PERC, short for Preprocessing (P), Embedding (E), Dimensionality Reduction (R) and Clustering (C). We employ GPT-6 Luna to classify job description passages into Team context, Role task and Qualifications. We then create combinations of these sections and examine whether embedding and clustering the segmented passages produce meaningful semantic clusters about different job roles. We use Maximum Mean Discrepancy (MMD) to rank observed differences between embedding distributions and employ a pretrained sparse autoencoder (SAE) to extract features from layer-19 representations of Llama-3.1-8B-Instruct. Lastly, we employ GPT-6 Luna to come up with hypotheses about job roles' feature patterns, and GPT-6.1 Terra to investigate whether those patterns exist in held-out job descriptions from unseen companies. Some example findings include Data Scientist advertisements placing more emphasis on machine learning model development, Data Analyst advertisements on reporting business performance, and Machine Learning Engineer advertisements on applying developed models in real-world settings. We also observe differences in the applications described by Data Analyst and Business Analyst advertisements across selected months, although our dataset's scale and uneven coverage limit their interpretation. Overall, we present a realistic application of SAEs and PERC to unstructured textual data and examine how automated insight extraction could support manual analysis of job descriptions.

Mon 16 NovComputation and Language
The gist
Job titles often don’t explain what people actually do in technical roles. The authors collected over 36,000 job ads for early-career positions and used advanced AI methods to group parts of job descriptions into categories like tasks and qualifications. They then analyzed these groups to find meaningful patterns that differentiate roles such as data scientist, data analyst, and machine learning engineer. This method helps to better understand how job roles are described beyond just titles, even suggesting differences in how similar roles are applied in different industries or times.
Open → 2611.21586v1

CertiSum ensures identical 4-bit training results across GPUs and layouts

CertiSum: Bitwise-Identical MXFP4 Training Across Platforms and Parallelism Layouts

Abstract: Training with MXFP4, a 4-bit microscaling format, is non-deterministic: identical inputs can produce different results across parallelism layouts and GPU vendors. These differences complicate debugging and training audits and can cause training and inference engines to disagree. We present CertiSum to make MXFP4 training bitwise invariant across runs, parallelism layouts, and GPU vendors. Its key insight is that native FP32 accumulation of MXFP4 products is often already exact for every summation order. CertiSum collects statistics during quantization to certify native matrix multiplication results, recomputes uncertified outputs exactly, and uses exact kernels directly where certification rarely succeeds. CertiSum keeps quantization blocks unchanged across layouts and merges partial sums without rounding, including in attention and weight-gradient computation. In 200-step Qwen3-8B-Base experiments, CertiSum preserves training states bit for bit across AMD MI350X and NVIDIA GB200 and across changes in data, tensor, and context parallelism on MI350X. Across three 8B--14B models on FineWeb-Edu using MI350X, it adds 11.8--60.5% to training-step latency relative to its non-exact MXFP4 counterpart at the larger evaluated input shapes, with speedups of up to $1.24\times$ over BF16 and $1.70\times$ over deterministic BF16.

Mon 16 NovMachine LearningDistributed, Parallel, and Cluster Computing
The gist
Training deep learning models using a 4-bit format called MXFP4 usually leads to tiny differences in results depending on the type of GPU or how the training is split up. The authors develop CertiSum, a method that guarantees the training produces exactly the same numbers every time, no matter the GPU or parallel setup. They achieve this by checking when sums of small numbers are exact and recalculating only when needed, preserving exactness while keeping the training efficient. This helps make debugging and verifying training more reliable across different hardware.
Open → 2611.21584v1

ScenarioForge automates creating and testing cyberattack training scenarios

ScenarioForge: Resource-Grounded Generation and Execution Validation of Cyber Exercises

Abstract: Cyber-range and capture-the-flag scenario construction remains labor-intensive because authors must coordinate infrastructure, vulnerable services, attack paths, artifacts, and success conditions. LLMs can propose detailed exercises, but plausible descriptions do not guarantee deployable software or verifiable objectives. We present ScenarioForge, which turns high-level requirements into resource-grounded topologies, services, traffic, segmentation, and challenge chains, then instantiates and validates them in the Common Open Research Emulator (CORE). The ScenarioForge Execution Dataset contains 226 materialized scenarios covering 294 Vulhub images and all 85 custom-built challenge-resource generators developed with our AI-assisted scaffolding. All 226 passed construction, preview, sequencing, deployment, strict runtime validation, and live artifact checks; their 867 steps, each an individually verifiable challenge objective, comprise 457 vulnerability-backed and 410 generated-resource-backed instances. In a separate 50-prompt matched benchmark, ScenarioForge+Qwen3.8 and ScenarioForge+GPT5.6 each achieved 50/50 (100%) topology/build success and 160/160 intent fields; direct frontier generation reached 41/50 builds and 147/160 fields only with the full cumulative scaffold: structure, vocabulary, policy, and container-image guidance. The test still omitted ScenarioForge's downstream challenge-resource generation, dependency/flag sequencing, deployment, and live validation. The artifacts support operationally rich, reproducible exercises for training and evaluation.

Mon 16 NovCryptography and SecurityArtificial Intelligence
The gist
Creating cyberattack training exercises is usually hard and time-consuming because it needs many parts to work together. The authors made ScenarioForge, a system that turns simple requirements into real, working cyber training setups and checks that everything runs correctly. It uses AI to design detailed and deployable cyber exercises that can be tested automatically, helping trainers prepare better lessons and assessments. The system also makes sure each challenge in the exercise can be checked for success automatically.
Open → 2611.21579v1

Misbinding risk affects tool provider identity in AI agent systems

When Tool Names Are Not Identities: Measuring Provider Misbinding in MCP-Based AI Agents

Abstract: Large language model (LLM) applications increasingly act as agents that select and invoke external tools. The Model Context Protocol (MCP) standardizes this interaction by allowing clients to compose tools advertised by multiple servers. However, tool metadata used for discovery and selection is not, by itself, necessarily bound to a verified provider identity. This paper studies this gap as tool-provider misbinding: a failure in which a request intended for a legitimate provider is instead resolved to an attacker-controlled tool. The attacker does not compromise the host, LLM, legitimate server, or network channel; it only operates another MCP server that advertises tools with chosen metadata. We formulate tool provider misbinding as an attacker-controlled tool-selection optimization problem and evaluate it in a controlled MCP environment across five LLM-based clients. The results show that interactions drive misbinding. The strongest failures occur when exact-name collision, task-aligned description, and compatible schema reinforce one another, but authority-enhanced descriptions with compatible schema can also cause wrong-provider execution or unresolved provider ambiguity without name collision. Different models expose the same provider-binding weakness differently, including attacker-controlled provider selection, clarification requests, and unstable or inconsistent provider resolution.

Mon 16 NovCryptography and SecurityArtificial Intelligence
The gist
AI agents use tools from different sources, but they might mix up which tool comes from whom because the tool names and descriptions can be misleading. The authors show that attackers can trick AI agents into using fake tools without breaking into the system itself. This confusion happens especially when the fake tool’s name, description, and format look just right to the AI. Different AI clients handle this problem in unique ways, sometimes asking for clarification or making inconsistent choices.
Open → 2611.21577v1

DynSurvX explains changing survival predictions using patient data

DynSurvX: Time-Resolved Explanations for Dynamic Survival Predictions

Abstract: Recent survival models integrating longitudinal data achieve strong predictive performance, but their predictions are often difficult to interpret, limiting their clinical use. We propose DynSurvX, a model-agnostic explainability framework for dynamic survival prediction with mixed static and longitudinal covariates. Based on Shapley values, DynSurvX introduces a hierarchical two-phase strategy that first identifies influential longitudinal features and then adaptively refines their temporal importance, enabling fine-grained explanations while reducing computational cost. The framework provides time-resolved explanations that evolve as new patient data become available. Experiments on simulated and two clinical datasets show varying agreement with theoretical importance across prediction models, with closer agreement for better-performing models, alongside clinically interpretable insights in real-world settings. It remains robust across prediction settings and reduces computation time by 41--80\% relative to the temporal explanation baseline, making dynamic explanations practical.

Mon 16 NovMachine Learning
The gist
Predicting how long patients might survive based on their changing health information is helpful but often hard to understand. The authors created DynSurvX, a method that explains which patient details most affect survival predictions and how their importance changes over time. This approach is faster than previous methods and works well on both simulated and real clinical data. It helps doctors better understand predictions as new patient information comes in.
Open → 2611.21571v1

Ai coding outpaces human review but errors remain in math software

Trustworthy Numerical Software in the Age of AI: What Would Turing Do?

Abstract: AI coding agents can now produce numerical software faster than human experts can review it, raising serious concerns about usability and reliability. These and other AI tools are already transforming mathematics and software, and they will soon transform mathematical software. These concerns motivated us to assess AI-generated numerical linear algebra (NLA) kernels, which we did through an audit of a recent public GPU QR competition. All five leading kernels passed the competition's accuracy tests, and the winning kernel achieved a 107-fold speedup over the competition's baseline, which calls NVIDIA's QR routine. Yet each failed at least once on new inputs, even those from the competition's generator, under the same checker, while the baseline passed them all. In light of this, we want to develop reusable formalizations of numerical analysis methods, which remain sparsely represented in existing formal libraries. We describe VSCL, our Lean library of mathematical foundations for numerical computing. We also propose VERNA to connect these tasks by using formalized results to guide kernel assessment against explicit specifications. Drawing on Turing's work on rounding-error analysis and program checking, we discuss design principles for developing trustworthy numerical software when direct human checking is impractical.

Mon 16 NovMathematical Software
The gist
AI tools can generate math software much faster than humans can check it, which might lead to mistakes going unnoticed. The authors studied AI-created software for solving certain math problems on GPUs and found that although it was fast and passed initial tests, it sometimes failed on new examples. To improve trust, they built a library of math foundations and proposed a method to automatically check software correctness. They drew inspiration from Alan Turing’s ideas about error detection to guide the development of more reliable math software when human checking is not practical.
Open → 2611.21570v1

Histology models need less geometric test-time augmentation over time

When Do Histology Foundation Models Need Geometric Test-Time Augmentation?

Abstract: Test-time augmentation (TTA) aggregates model predictions across multiple transformed views of an input during inference. Because histology images lack a canonical orientation, $D_4$ TTA---pooling across the 8 rotations and reflections of a square---is a standard default in computational pathology. However, the rise of self-supervised histology foundation models (FMs) with inherent rotational invariance calls its continued utility into question. We benchmark 9 histology FMs and 6 general-purpose models across four patch-level and two whole-slide image (WSI) datasets. We find that $D_4$ TTA remains a reliable post hoc improvement, but benefits diminish from $+1.98$ percentage points (pp) for general-purpose backbones to $+0.50$ pp for histology FMs on TCGA-UT, and shrink further for the largest models. To eliminate computational overhead, our experiments demonstrate that entropy routing---applying TTA selectively to uncertain predictions---recovers most of the gain while augmenting only ${\sim}13\%$ of samples. Finally, we show that patch-level TTA improvements do not transfer to slide-level multiple instance learning (MIL). Code: https://github.com/lars-chen/histology-tta

Mon 16 NovComputer Vision and Pattern RecognitionMachine Learning
The gist
When looking at tissue images, computers often rotate and flip images multiple ways at test time to improve predictions, because these images don’t have a standard orientation. The authors studied whether this trick is still needed for newer, self-supervised models that already understand rotation well. They found that although rotating and flipping images still helps, the improvement is much smaller for these modern models and especially tiny for the biggest ones. They also showed that running these rotations only on uncertain cases can save time while keeping most of the advantage. However, this approach didn’t help when analyzing whole slide images using a common method called multiple instance learning.
Open → 2611.21565v1

Wildfire risk prediction improves using street views and satellite images

Wildfire-SSR: Geolocation-Aware Multimodal Fusion for Structure-Level Wildfire Risk Assessment

Abstract: Structure-level wildfire vulnerability assessment is critical for reducing losses in wildland-urban interface communities, yet existing methods often fail to combine parcel-scale ignition pathways with community-scale geographic coverage. This study introduces Wildfire-SSR (Satellite and Street-view for wildfire Risk), a geolocation-aware multimodal framework that integrates macro-scale satellite context with micro-scale street-view evidence. A Vision-Language Model extracts wildfire-relevant building and site attributes from pre-event street-view panoramas and converts them into structured semantic text. These features are spatially aligned with satellite imagery through a decoupled cross-attention fusion decoder, while a frozen satellite-pretrained DINOv3 encoder captures overhead visual context. Alternative geolocation embedding strategies are evaluated to anchor text-derived features within each satellite patch. The framework is tested on approximately 37,000 structures affected by the 2025 Eaton and Palisades fires in Los Angeles, using wildfire risk labels derived from relative post-event damage patterns to better represent inherent structural vulnerability. Rotary Positional Embedding provides the strongest spatial grounding, achieving a building localization F1 score of 0.6735 and a harmonic mean F1 score of 0.2476 for five-class pixel-level risk classification, outperforming unimodal baselines and an unanchored multimodal configuration. The model also shows a conservative bias in higher-risk classes, reducing severe-risk underestimation, and completes end-to-end assessment of the study area in 37 minutes on a single GPU. Wildfire-SSR reframes cross-view fusion as localized semantic alignment and provides a scalable tool for mitigation prioritization, resilience planning, and insurance-oriented wildfire risk assessment.

Mon 16 NovComputer Vision and Pattern Recognition
The gist
Wildfires threaten homes, especially where neighborhoods meet wild areas, but it's hard to tell which houses are most vulnerable using just one type of data. The authors created Wildfire-SSR, a system that combines satellite pictures with street-level photos to better identify risks for each building. This tool uses AI to understand details about buildings from street views and matches them with satellite images, improving the accuracy of wildfire damage predictions. It processes large areas quickly and helps focus efforts on the most vulnerable structures.
Open → 2611.21563v1

Severity measures fail to predict frozen time-series forecaster errors

Severe but Harmless: Stress-Testing Shift Severity for Frozen Time-Series Forecasters

Abstract: Zero-shot time-series foundation models (TSFMs) have become attractive alternatives to task-specific models because they handle diverse downstream tasks, including anomaly detection and forecasting, without per-series training. However, time-series data undergo distribution shifts, and the dissimilarity between two regimes is commonly scored with statistical measures such as Wasserstein-1, where a higher score is read as a more severe shift. In systematic experiments using three established severity measures on nine regime shifts from three standard traffic datasets, we show that these measures do not reliably predict degradation for instance-normalized TSFMs. The regimes rated most severe are not the regimes that degrade the models most, and degradation reaches 29% in the lowest-scoring regime. In most cases, the audit shows no positive relationship between measured severity and model degradation. We provide an equivariance-based stress-testing analysis that explains why severity readings can become decoupled from model degradation.

Mon 16 NovMachine LearningArtificial Intelligence
The gist
Time-series models that handle different tasks without retraining sometimes face changes called distribution shifts in data. The authors found that common ways to measure how big these changes are do not actually predict when the model’s predictions will get worse. In fact, big measured shifts don’t always cause big errors, and small measured shifts can cause big errors. They explain this mismatch through a technical analysis based on model behavior when changes happen.
Open → 2611.21562v1

New method improves consistency in long video generation

Reference Forcing: Long Video Generation with Region-Guided Drift Correction

Abstract: Long video generation should keep the subject and background consistent while supporting rich, natural motion. However, autoregressive models are often distilled with distribution matching distillation (DMD) over short windows, which does not train them to keep this consistency over long ranges. As a result, the subject and background can drift over time. Methods that manage the key-value (KV) cache retain or retrieve history to reduce drift. Yet this history may itself have drifted. We propose Reference Forcing, which uses the initial frames as an appearance reference. We first build a teacher that uses attention masks to force each region of a new frame to attend to the same region in the initial frames. The teacher finds these regions with off-the-shelf segmentation models. We then distill this behavior into a separate attention path of the student, which needs no external models at inference. We further introduce value correction, which corrects drifted values in the KV cache toward the matching values of drift-free initial frames. Experiments show that Reference Forcing achieves state-of-the-art subject and background consistency among long-video methods on different base models, and its advantage grows with video length. Ablations show both components are needed to gain consistency without losing motion. More visualizations and code are available at https://zhaosheng-thu.github.io/reference-force/

Mon 16 NovComputer Vision and Pattern Recognition
The gist
Generating long videos is hard because over time, characters and backgrounds can change in unwanted ways, called drift. The authors designed a technique called Reference Forcing to keep these elements consistent by always comparing new video parts to initial reference frames. They use a system that learns how to keep focus on specific regions and corrects past mistakes during generation. Tests show their method better maintains consistent scenes and characters even in very long videos.
Open → 2611.21559v1

Counselors find AI help efficient but worry about skill loss

Benefits and Barriers to Human-AI Teaming for Crisis Counseling

Abstract: Background: AI systems are increasingly deployed to support mental health clinicians, yet real-world evidence remains limited. In crisis counseling, where clients often seek human connection, understanding whether AI augmentation preserves or undermines meaningful human engagement is essential. Methods: In a mixed-methods study of a counselor-facing AI copilot on a WhatsApp-based crisis hotline in India (Mar.-Oct. 2025), counselors could request, edit, and send AI messages. We analyzed 20 interviews, 8 shadowing sessions, 56 survey responses, and edits in 27,778 copilot messages from 108 counselors via thematic analysis (Technology Acceptance Model 2, plus inductive coding of emergent factors), and survey statistics. Results: Counselors reported high copilot acceptance (survey): 98.2% found it helpful; 89.3% likely to continue use; 80.4% reported efficiency gains. Interviews highlighted sentence scaffolding, empathetic phrasing, stress reduction, catching missed details, and efficiency. Barriers (survey) included repetitive outputs (23.2%), lack of context (17.9%), and authenticity concerns (10.7%). While 69.6% (survey) reported skill enhancement, interviews surfaced skill atrophy concerns. Counselors frequently accepted copilot suggestions, editing to remove questions, adjust tone, or personalize style. Conclusion: In one of the largest real-world deployments of a counselor-facing mental health AI copilot, counselors reported reduced cognitive load, empathetic communication, and greater efficiency, alongside concerns about skill atrophy, authenticity, and over-reliance. In settings like crisis counseling where clients seek human connection, AI tools must balance operational support with preserving clinical skill and genuine therapeutic engagement. Designs soliciting approval or editing of complete drafts may overweight efficiency at the expense of sustained human engagement.

Mon 16 NovHuman-Computer InteractionComputers and Society
The gist
Counselors working on a crisis hotline in India used an AI assistant to help with messages to people in distress. The AI helped them write empathetic and clear replies more quickly and caught details they might miss. However, some worry that relying too much on AI might reduce their own counseling skills or feel less genuine to clients. The study shows AI can support counselors but needs careful design to keep human connection strong.
Open → 2611.21558v1

Language models remember future facts when reading past economic text

Reading or Remembering? Measuring Temporal Contamination in Language Models

Abstract: Language models are now used to read central-bank text for economic forecasting, but most were trained on text written after the documents they read. A model reading a 2021 FOMC statement may already know that inflation rose in 2022, so part of its apparent skill can be memory of the outcome, a temporal form of test-set contamination. We measure this memory on FOMC statements and minutes from 2000 to 2026 by comparing modern open models with chronologically consistent models, which are trained only on text from before a fixed date. Asked about past GDP outcomes given only a date, models that cannot know the answer still reach an AUC of up to 0.64 from priors on dates and eras, so chance is the wrong baseline. Against these memory-free models on the same questions, most modern models recall which years had strong growth. Membership-inference scores sort documents by era and document type rather than by whether a model saw them, as exact counts in an open pretraining corpus show. In real-time nowcasts, every lookahead premium we estimate on US GDP is smaller than the forecast comparison can detect at macroeconomic sample sizes, and none on GDP or inflation survives correction for multiple testing. Lookahead audits should therefore measure memory directly against memory-free models on the same items.

Mon 16 NovMachine LearningComputation and Language
The gist
Language models that analyze economic documents sometimes already know events that happened after those documents were written, like inflation rising after a 2021 report. The authors found this causes the models to appear better than they are because they 'remember' future outcomes instead of truly 'reading' the original text. They tested models trained only on past data and showed that some skill comes from general knowledge about dates, not from seeing the documents. This work helps distinguish whether models are understanding or just recalling information.
Open → 2611.21554v1

BLIP-Live improves timely and accurate responses in video streaming AI

BLIP-Live: Balancing Timeliness & Firing Precision in Proactive Streaming Video Agents

Abstract: Streaming video understanding is becoming increasingly important for real-world interactive systems. Such systems must be proactive for natural and useful human interaction: they should respond as soon as sufficient evidence becomes available while avoiding premature, redundant, or incorrect responses. We present BLIP-Live, a framework unifying data, metrics, harness, and training around a shared formulation of proactivity as effective causal response decisions balancing the two competing objectives of responding vs silence. First, we construct BLIP-Live-780K dataset containing human annotations of proactive response content and timing, which defines this desired behavior. We then propose PAUC-F, a metric to effectively measure our desired proactive behavior. PAUC-F combines existing response timeliness metrics with firing precision to reward early useful responses without rewarding excessive firing. With our desired behavior defined and measurable, we finally investigate model-agnostic inference harnesses that draw out proactive streaming capabilities of offline vision language models (VLMs), together with training pipelines that learn to further improve their proactive responsiveness. Across both settings, we find that combinations of sliding visual windows, online interaction memory, and structured response outputs consistently yield strongest proactive performance. Our experiments result in two models, with our BLIP-Live-Qwen model achieving state-of-the-art performance across four proactive streaming benchmarks, with gains up to 44% over baselines and outperforming multiple closed API models. Our code and data will be released publicly.

Mon 16 NovComputer Vision and Pattern Recognition
The gist
Interactive video systems need to respond quickly but avoid giving wrong or repeated answers. The authors created BLIP-Live, a framework that helps AI decide when to respond based on how much useful information it has seen. They built a large dataset with human feedback on good response timing and content, and invented a new way to measure how well the AI balances quickness with accuracy. Using these tools, they improved existing vision-language AI to give better and faster answers during ongoing video streams.
Open → 2611.21553v1

Quantum recurrent neural networks perform similarly to classical models on time series

Benchmarking memory and nonlinear processing capacity of quantum recurrent neural networks for time series prediction

Abstract: Quantum machine learning has emerged as a promising approach to time series prediction. While quantum reservoir computing has been widely explored for this setting, variational quantum models tailored to sequential data remain comparatively understudied, largely because they are difficult to train. In this work, we present a rigorous benchmark of variational quantum recurrent neural networks (QRNNs) on time series prediction tasks, focusing on two key capabilities: memory and nonlinear processing. We introduce a task-driven methodology that quantifies model capacity, enabling an intuitive and fair comparison across architectures, including classical recurrent baselines. We evaluate the proposed framework on two generic benchmark tasks and on a synthetic dataset describing a chaotic system. Overall, the quantum models achieve performance comparable to their classical counterparts, but classical models scale better with the memory size within the range studied. Notably, one QRNN variant shows higher average capacity on the task designed to jointly probe memory and nonlinear capacity. Moreover, our results show that quantum models offer better capacity when we are able to find a good parameter initialization. However, the increasing sensitivity to initialization leads to a lower probability of finding good solutions as the model size increases. These results provide a principled starting point for designing richer quantum recurrent architectures and for assessing where they may offer practical benefits.

Mon 16 NovMachine Learning
The gist
Predicting future values in a sequence, like weather or stock prices, requires remembering past information and handling complex patterns. The authors tested special quantum-based neural networks called QRNNs against classical ones to see how well they remember information and learn nonlinear patterns. They found quantum models can perform similarly but classical ones handle larger memory sizes more reliably. Quantum models show promise if starting parameters are tuned well, but training them gets harder as they grow bigger.
Open → 2611.21552v1

Post hoc method reveals feature contributions in black-box models

ONAM: Fitting Orthogonal Neural Additive Models for Post-Hoc Interpretability of Black-Box Predictions

Abstract: Modern machine learning models, such as artificial neural networks, achieve high predictive performance through increasingly complex black-box architectures, limiting their use in settings where transparency, interpretability, and fairness are required. Here we present the R package ONAM, which provides a novel and practical implementation of functional decomposition, a technique to facilitate the interpretability of black-box models through structured effect representations. ONAM implements an algorithmic framework for the post-hoc decomposition of predictions into components associated with different input features. The package is designed for usability and efficiency, including functionalities for visualization as well as quantitative measures to assess interpretability. As a model-agnostic method, it can be applied to a wide range of prediction models. We describe the mathematical foundations, algorithmic design, and software architecture of ONAM. A central result of the proposed methodology is that the resulting decomposition satisfies the condition of hierarchical orthogonality, thereby guaranteeing that all components are identifiable and uniquely defined.

Mon 16 NovMachine Learning
The gist
Many powerful AI models are hard to understand because their decisions come from complex processes. The authors introduce ONAM, a tool that breaks down AI predictions into parts linked to each input feature, making decisions easier to interpret. This method works after the model has made predictions and does not depend on the type of AI model used. Their approach ensures the breakdown is clear and mathematically well-defined, helping users see how each feature affects the outcome.
Open → 2611.21550v1

Characterizing unique measures of quantum relative entropy in operator algebras

Axioms for relative entropy

Abstract: For normal states of arbitrary von Neumann algebras, we characterize positive finite multiples of Araki relative entropy among non-degenerate divergences. The axioms are monotonicity under normal unital completely positive maps, tensor additivity, superadditivity for product second states, and separate lower semicontinuity in the predual norm. Alternatively, a conditional-expectation identity replaces the two tensor assumptions. The proof uses order bounds and asymptotic estimates on tensor powers. An appendix proves the known analytic estimates needed here, using standard modular theory and Haagerup L^p spaces. We also obtain the corresponding characterization in the C* algebraic setting.

Mon 16 NovInformation Theory
The gist
Measuring how different two quantum states are is important in quantum information theory. This paper identifies a set of basic rules or axioms that uniquely define a standard way to measure this difference, called Araki relative entropy, for complex quantum systems described by advanced mathematical structures called von Neumann algebras. The authors show that any measure following these natural rules must be essentially the Araki relative entropy. Their proof uses deep mathematical tools and also applies in related algebra settings.
Open → 2611.21549v1

Topology aware anomaly detection improves some intrusion systems

TRACE: Topological Representations for Anomaly detection through Contrastive Embeddings

Abstract: Intrusion detectors must recognize evolving malicious behavior even when confirmed attack labels are scarce or incomplete. We present TRACE, a topology-aware graph contrastive learning framework for label-efficient intrusion detection. TRACE learns from benign system-activity graphs by combining message-passing and topological representations, then assigns anomaly scores in the same projected embedding space optimized by the contrastive objective. This design captures both local interactions and graph-scale structural deviations without using attack labels during representation learning. A labeled validation set containing benign and malicious graphs is used only to calibrate the anomaly threshold. We evaluate TRACE on StreamSpot, GraSec-IoT, and Unicorn Wget against a supervised graph neural network and the benign-only GraphCL baseline. TRACE obtains F1 scores of 0.923, 0.790, and 0.583, respectively. Compared with GraphCL, this is higher on StreamSpot (0.450) and Unicorn Wget (0.203), but lower on GraSec-IoT (0.975). The supervised model leads on StreamSpot and GraSec-IoT, whereas TRACE has the highest F1 on Unicorn Wget. The mixed results show that topology-aware benign-only learning can improve detection in some graph settings but does not provide a uniform advantage.

Mon 16 NovCryptography and SecurityArtificial Intelligence
The gist
Detecting computer attacks is hard when examples of attacks are rare or incomplete. The authors propose TRACE, a method that learns normal behavior from system activity represented as graphs without needing examples of attacks. TRACE uses graph structures and topology to spot unusual patterns likely caused by attacks. When tested on several datasets, TRACE did better than similar methods in some cases but not all, showing it can help in certain situations but is not always the best choice.
Open → 2611.21548v1

Tradeoffs in sampling and transmission for fresher information over channels

Fundamental Tradeoffs in Sampling, Transmission and Information Freshness: Instantaneous Feedback

Abstract: We study a time-slotted generate-at-will status-update system over an erasure channel with transmission success probability $q$, subject to average sampling- and transmission-rate constraints $f_s$ and $f_r$, respectively. The sampler-transmitter pair jointly decides whether to idle, retransmit a stale packet, or replace it with a fresh sample. We derive a universal lower bound on the optimal average age of information, analyze a class of stationary randomized policies, and obtain an optimal policy within this class that provides a $4$-approximation guarantee. The joint problem reduces to the sampling-constrained problem when $f_s\leq qf_r$ and the transmission-constrained problem when $f_s\geq f_r$. For $qf_r<f_s<f_r$, we formulate a constrained Markov decision process (CMDP) and introduce the class $\barΠ$ of $(W,R)$ policies, where $W$ specifies a waiting threshold for transmission and $R$ specifies a packet-replacement threshold. We prove that, for every choice of Lagrange multipliers, the corresponding Lagrangian-relaxed Markov decision process admits an optimal policy in $\barΠ$. We then formulate a linear program (LP) over distributions of $(W,R)$ policies and prove that choosing a policy according to an optimal LP solution yields an optimal CMDP policy. Moreover, there exists an optimal LP solution assigning positive probability to at most three $(W,R)$ policies. Since $\barΠ$ is countably infinite, for every $ε>0$ we construct a finite subset $\barΠ_ε\subset\barΠ$ and show that the LP restricted to this set yields an $ε$-optimal policy. Finally, we derive a stronger pair of lower bounds by considering systems with only the sampling-rate or transmission-rate constraint. Using these bounds, we construct a policy randomizing among four $(W,R)$ policies with a $2$-approximation guarantee for $qf_r<f_s<f_r$.

Mon 16 NovInformation TheoryNetworking and Internet Architecture
The gist
This paper looks at the problem of keeping information fresh when it is sent over a channel that sometimes loses data. The authors study systems where new data samples can be generated on demand but with limits on how often sampling and sending can happen. They develop mathematical models to find the best ways to decide when to send new data, retransmit old data, or wait, balancing freshness and constraints. They also provide guarantees about how close their solutions come to the ideal freshness levels. Their work includes simplifying the problem using policies with waiting and replacement thresholds and shows how to find near-optimal strategies.
Open → 2611.21547v1

Language models explanations often fail to guide denied request fixes

Right Reason, Wrong Advice: Evaluating Recourse in LLM Explanations of Denied Requests

Abstract: Language models increasingly write the explanations people receive when a rule system denies their request. If several rules deny the request independently, an explanation can name a true reason and still leave the person denied after they fix it. We call the missing property recourse validity: changing what the explanation cites, without changing what was asked for, can flip the decision. We compute it exactly, and a hitting-set argument predicts from the policy alone when a correct reason fails. In six of seven rule systems ported from access control and US benefit eligibility, a single correct reason almost never gives recourse when several reasons apply. Across 20 LLMs, checks of whether the cited reasons are correct, computed or asked of an LLM judge, are close to chance at spotting this failure, as the argument predicts. A strong judge asked whether acting on the explanation would work does spot it. Stronger and reasoning models do better but still fail on many denials with four or more independent reasons. Asking for every rule helps every open model with room to improve. Explanations of eligibility decisions should be built from the decision function and judged by whether acting on them works.

Mon 16 NovArtificial IntelligenceComputation and LanguageComputers and Society
The gist
When a computer denies a request based on many rules, it can explain the reason, but fixing that reason might not help get approval. The authors show that explanations often lack "recourse validity," meaning a person can't change the outcome by addressing the cited reason alone. They tested many models and found that most fail to detect when explanations don’t provide a helpful path to success. Better explanations come from linking explanations closely to the decision rules and checking if acting on them would actually help.
Open → 2611.21545v1

Trade-offs arise in ensuring reliable long-term prediction intervals online

The cost of enforcing long-run coverage: a phase transition in online conformal prediction

Abstract: Consider an online prediction setting, where at each time, we are given a new feature vector and asked to provide a prediction interval or prediction set that will likely contain the corresponding response. In this setting, if the data points are i.i.d. (or more generally, exchangeable), conformal prediction provides a mechanism for building valid prediction sets around the output of any trained model, offering coverage probability $\geq 1-α$ at each time $t$. In practice, however, issues such as distribution drift, changepoints, or other challenges may cause violations of the i.i.d. assumption. In this adversarial setting, online conformal prediction methods can still offer guarantees on long-run empirical coverage. However, there is a trade-off between these two types of goals: enforcing tight constraints on long-run empirical coverage to protect against the adversarial setting can lead to unstable oscillations in the instantaneous training-conditional coverage in the i.i.d. setting. In this work, we seek best-of-both-worlds algorithms that aim to minimize cumulative error in instantaneous training-conditional coverage when in the i.i.d. setting, while also offering long-run empirical coverage guarantees in the adversarial setting. Specifically, consider a condition that requires long-run empirical coverage to deviate from the target level $1-α$ by at most $\mathcal{O}(T^{-β})$, for some $β\in[0,1]$. We prove that this family of conditions can be described with a phase transition. For $β\in[0,\frac{1}{2}]$, it is possible to construct algorithms satisfying such a constraint in the adversarial setting, while offering the same instantaneous coverage performance as split conformal prediction if the data is in fact i.i.d. On the other hand, for $β\in(\frac{1}{2},1]$, this type of condition comes at a cost, and does not achieve best-of-both-worlds behavior.

Mon 16 NovMachine Learning
The gist
When computers make predictions over time, they can give ranges that likely contain the true answer. This works well when data behaves consistently but struggles if data changes or is unpredictable. The authors study the balance between guaranteeing long-term accuracy and keeping predictions stable moment to moment. They find there is a clear boundary — for certain levels of strictness, it’s possible to have both stable and long-term reliable predictions, but beyond that boundary, trade-offs appear and you can’t have both.
Open → 2611.21542v1

SciResearch-Eval benchmarks AI scientific judgment with flawed simulators

SciResearch-Eval: Evaluating Scientific Judgment in Autonomous Experimental Agents

Abstract: We introduce SciResearch-Eval, an interactive benchmark of scientific judgment built on a standard laboratory problem: measuring a material's thermal properties by heating it and fitting a heat-conduction simulator. An agent designs its own experiments, uses a supplied simulator that may be under-resolved or physically wrong, and reports each property with a 95% interval. To our knowledge it is the first benchmark to combine agent-designed experiments, a deliberately flawed simulator, and proper scoring of calibrated intervals against exact ground truth. On a held-out split (93 tasks, 9 models, 2,511 episodes), models handle procedural traps. When the simulator is missing physics, most report wrong values while stating they are 95% sure: their ranges contain the truth in 20-62% of cases, against 94% for GPT-6 Astra and 99% for Claude Fable 5.2. At default effort the failing Claude 5.5 models rarely diagnose the missing physics (Opus in 35% of episodes, against 66% for Astra), and even when they do, their ranges often miss; Astra and Fable design experiments in which the flawed simulator is accurate, such as gentle heating, which keeps Astra calibrated even when it does not name the cause. Asking for wider intervals does not help; stating the strategy improves interval scores 1.6-2.5-fold, replicated on a pre-registered fresh split, but coverage barely moves. A pre-registered effort ablation shows that the correction is latent in the Claude 5.5 models: at maximum effort Opus improves more than tenfold and is no longer detectably behind Astra at default, but only with 13-31 times more reasoning; older and open-weight models gain nothing. Fable 5.2 is the most accurate model at default effort (interval score 1.9 times better than Astra's) but writes 6 times as many tokens, and at Astra's token count it falls short. We release the environment, graders and harness.

Mon 16 NovArtificial IntelligenceMachine Learning
The gist
Measuring how well AI can design experiments and judge scientific data is hard, especially when the tools used have errors. The authors created SciResearch-Eval, a test where AI agents try to find material heat properties by designing experiments while using imperfect computer simulations. They found most models are often overconfident and wrong when simulations miss physics, but some advanced AIs manage better by choosing experiments that work well despite flaws. This helps compare how well AIs can gauge uncertain science problems and suggests better ways to calibrate their confidence.
Open → 2611.21541v1

Minimum spanning tree leaf edges weights converge with new bounds

The Sum of Leaf Weights in the Minimum Spanning Tree of the Complete Graph

Abstract: Let $G_n$ be a random weighted complete graph on $n$ vertices, where edges have i.i.d. $\text{Unif}(0,1)$ weights. Let $T_n$ be the Minimum Spanning Tree (MST) of $G_n$. The expected weight of $T_n$ is known to converge to $ζ(3) = \sum_{k=1}^{\infty} \frac{1}{k^3}$ (Frieze 1985). We investigate the sum of weights of edges incident to the leaves of $T_n$, denoting this quantity by $L_n$. We give tight upper and lower bounds on $\mathbb{E}[L_n]$ and determine its limit as $n$ diverges, leveraging typical behavior of sparse Erdős--Rényi random graphs. We also establish concentration of $L_n$ around $\mathbb{E}[L_n]$ and almost sure convergence to this value. These results directly yield substantial improvements to state-of-the-art bounds for two important variants of the MST problem: (1) an improved upper bound on the weight of the optimal random instance Steiner tree, as studied by Bollobás, Gamarnik, Riordan, and Sudakov (2004); and (2) an improvement over the upper bound for the Probabilistic Minimum Spanning Tree, introduced by Bertsimas (1988).

Mon 16 NovDiscrete Mathematics
The gist
When you connect points using the cheapest possible connections, you get what's called a minimum spanning tree. The paper studies how the total cost of edges touching the 'end' points (or leaves) behaves as the number of points grows large. The authors find precise limits and show that the leaf edge costs don’t vary much from these limits. Their findings also improve understanding of two challenging variations of this cheap-connection problem.
Open → 2611.21540v1

Vision language models fail to compare matching points across images

Seen but Unsaid: Locating and Repairing Cross-Image Comparison in Vision-Language Models

Abstract: Vision-language models (VLMs) often fail to match a point or an object across two images, even when the answer can be decoded from their own hidden states. We trace this failure from the visual tokens to the answer letter, in Qwen3-VL (2B-32B), InternVL3.5-8B, and Gemma-3-12B, on synthetic shape matching, same-instance point correspondence (HPatches), and semantic correspondence (SPair-71k), and find two distinct failure points, a small set of attention heads that carries the comparison, and a repair that touches 0.02% of the parameters. Two failure points: exact copies are compared but not read out. An answer-position probe exceeds the calibrated output by 15 to 25 points in every family, for nameable and unnameable shapes alike, and steering along the probe's direction moves no more answers than random directions. Semantic correspondences are present in the visual tokens but never reach the answer. One pathway: redistributing the cross-image attention of 16-32 heads, with its mass preserved, removes 17-22 points of synthetic and 15-32 points of HPatches accuracy, against at most 7 for random or attention-matched heads. A lever that training finds on its own: training only these heads' query and key projections raises SPair-71k accuracy by 28.3 points (Qwen3-VL-8B) and 25.1 points (InternVL3.5-8B), beats both layer-matched and attention-matched heads, and transfers to HPatches and BLINK. An unconstrained all-layer adapter routes 21-51% of its gain through the attention of the same heads, against at most 7% for random heads, and does so by changing what they read (83-86% of the effect) rather than their weights. Every decision rule was frozen before its run, and every reported number is recomputed by independent verification scripts.

Mon 16 NovComputer Vision and Pattern RecognitionComputation and LanguageMachine Learning
The gist
Vision-language models sometimes struggle to recognize the same point or object in two different images, even though they have the information internally. The authors identified that specific parts of the models, called attention heads, carry out this comparison but the answer does not get properly read out. They found a way to fix this by adjusting only a tiny fraction of the model’s parameters, which improves accuracy on several tests. This fix helps the models better connect related objects across multiple images.
Open → 2611.21539v1

Optimistic verification methods fail under exact reward processes

Optimistic Verifiers Get Hacked: Reward Hacking Under an Exact Process Oracle

Abstract: Reinforcement learning from verifiable rewards inherits whatever its verifier gets wrong. Outside mathematics and code the verifier is a proxy, a rubric, a learned judge or a hand-written checker, and its distance from the true objective is never measured, so a rising reward cannot be told apart from a hack. We build a setting where the true reward is exactly computable at the process level: executable authorization policies over 124,416 contexts admit an oracle that lists every minimal sufficient reason for every decision. We compile these policies into exact process rewards, degrade the verifier along seven realistic axes (outcome-only, sufficiency, recall-only, extraction noise, coarse taxonomy, stale policy, LLM judge), and train against each while the exact verifier scores every rollout. Four phenotypes appear. Optimistic verifiers are hacked by padding: the sufficiency proxy ends at 0.940 while true faithfulness falls from 0.731 to 0.667 on 96 held-out episodes. Outcome-only verifiers saturate and stop teaching, noise dilutes, and ranking-preserving gaps do no harm. A model-free audit of the verifier, its selection error and gap sign, together with a short saturation pilot, anticipates which phenotype a run will produce. Across nine configurations spanning two frameworks, two model vendors, two adapter sizes, three precisions, two initialisations and two seeds, the phenotypes recur, sufficiency damage is positive in all 10 replication cells and beyond two standard errors in 7, and optimistic gaps remain the steeper branch. The damage magnitude does not replicate, and five pre-registered attempts to explain it are reported as they fell. We release the testbed, the training instrumentation, and 14 real public policies (Cedar, OPA, Gatekeeper) ported to executable oracles.

Mon 16 NovMachine LearningArtificial IntelligenceComputation and Language
The gist
When machines learn by rewards that come from judges (called verifiers), any mistake the verifier makes can mislead the machine. The authors created a way to know the true reward exactly by using precise policies in many situations. They tested different imperfect verifiers and found that some types, called optimistic verifiers, can be tricked by machines padding their behavior to get higher rewards without actually doing better. The work helps predict which verifier types will cause problems and provides tools for checking reward systems.
Open → 2611.21538v1