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.

Posterior matching distillation speeds image generation with better diversity

Posterior Matching Distillation

Abstract: Diffusion distillation accelerates image and video generation by compressing a pretrained teacher's iterative sampling process into a few network evaluations. Distribution-based methods achieve this by matching the student's output distribution to the teacher's. This matching is often driven by reverse-KL objectives, whose mode-seeking bias favors dominant teacher modes at the expense of diversity across samples. We introduce Posterior Matching Distillation (PMD), a new member of the distribution-based distillation family that combines mode-covering posterior sampling with any-step generation. At zero population loss, PMD recovers the teacher's full posterior of clean images at each trained noise level. Its stochastic student supports any-step sampling budgets within the trained timestep grid without further training. To learn these posteriors, PMD matches exponentially reweighted averages of student samples conditioned on a fixed noisy state to corresponding teacher posterior means. Under Gaussian corruption, exponentially tilted posterior mean is a single teacher evaluation at a shifted input. We prove that, matching tilted means over an open neighborhood uniquely identifies the full posterior. PMD thus supervises the entire conditional distribution through a family of mean constraints, without any auxiliary student-score network. Experiments on SDXL and FLUX.2 [klein] 4B demonstrate that PMD achieves the best FID among 4-step methods on both models, while maintaining competitive or leading performance across prompt-alignment and perceptual-quality metrics.

Thu 19 NovComputer Vision and Pattern Recognition
The gist
Generating images step-by-step with AI models can be slow and sometimes misses less common but important details. The authors propose a new way called Posterior Matching Distillation (PMD) to teach a smaller, faster model to copy the full range of possible images the slower model creates. PMD captures the whole range of possible outputs without extra helper networks, allowing fast generation at different speeds without retraining. Tests show PMD improves image quality and keeps good variety even with very few steps.
Open → 2611.26629v1

Reinforcement learning boosts image generation by steering activations

RL Post-Training in Diffusion Transformers Is Activation Steering

Abstract: Reinforcement learning (RL) post-training substantially improves the visual quality, text rendering, and compositional accuracy of diffusion transformers. Because capabilities such as rendering requested text or composing multiple objects are inherently prompt-dependent, a natural hypothesis is that improving them requires learning complex, input-dependent transformations. To isolate how much of these gains an input-independent shift explains, we probe each RL-tuned model with a deliberately simple parameterization: a fixed set of steering vectors added to the block outputs of the frozen base model. On SD3.5-M, these vectors hold 65x fewer parameters than the RL-tuned LoRA (0.29M against 18.8M). We fit them to match the velocity predictions of public RL-tuned checkpoints, with no reward in the objective. Although the vectors are identical for every prompt, token, and sampling seed, they recover 90.0-96.3% of the reward gains of six RL-tuned image models, and 89.8% and 111.9% on two RL-tuned video models. Initialized at zero and trained with online RL, the vectors alone exceed the reward gains of weight-based RL on text rendering (OCR) and human preference (PickScore) on SD3.5-M. A constant shift thus suffices for most of the gain of policy-gradient RL post-training: without new input-dependent transformations, it steers the pretrained generator toward what it can already compute.

Thu 19 NovComputer Vision and Pattern RecognitionMachine Learning
The gist
Improving how AI creates pictures from text is often thought to need complex changes based on each prompt. The authors found that simply adding fixed shifts to parts inside the AI model—without changing how it reacts to each input—can explain almost all the improvements from reinforcement learning. This means that the AI was mostly being nudged toward better outputs it could already produce, rather than learning new, complex behaviors for each prompt.
Open → 2611.26627v1

PlayCraft improves game engagement using AI player feedback

PlayCraft: Designing Engaging Games from Agent Play Experience

Abstract: Recent AI agents can generate playable games, but these games are not necessarily engaging. Mastery is a key source of engagement, yet designing for it requires extensive human play and tuning. We propose PlayCraft, an automated framework that uses a vision-based agent to play games and draws on its detailed play experience to revise them for mastery. Starting from an initial game, PlayCraft alternates between playing and crafting. In the playing stage, a player agent watches the game screen, uses the controls, and pursues the game objective over repeated episodes while retaining memory. After each episode, it reports its progress, outcomes, decisions, and reflections. In the crafting stage, a crafter agent uses these reports to revise the game. It estimates player abilities, predicts performance at different proficiency levels, and compares those predictions with a target learning progression. It diagnoses the game and addresses the gaps by giving players meaningful opportunities to improve through better decisions and execution. We evaluate games in fresh runs with player agents across three intelligence settings, measuring learning gain and learning slope. Compared with the initial games, PlayCraft yields larger learning gains and steeper learning slopes in most games. It also outperforms the baselines on the macro-average of each metric at every intelligence setting.

Thu 19 NovArtificial IntelligenceComputer Vision and Pattern Recognition
The gist
Creating games that are fun and challenging can be hard because designers need lots of player feedback and fine-tuning. The authors designed PlayCraft, a system where an AI agent plays a game and then updates it based on what the AI learned about player skill and progress. By repeating this play-and-update cycle, the system makes games more engaging by fitting the difficulty and learning curve better. Tests show the revised games help players learn and improve faster than the originals.
Open → 2611.26624v1

Auto deleveraging rules balance fairness and platform risk effectively

Path-Independent Deleveraging Rules

Abstract: We characterise path-independent auto-deleveraging (ADL) rules as an extended log-exponential family. Immunity to account splitting, merging and reopening further restrict the class. Homogeneity (essentially) restricts the class to a one-parameter family ordered by both fairness and platform risk. Its split-proof members continuously interpolate between proportional division and water-filling. Among these rules, decreasing the parameter reduces risk at the cost of increasing inequality in how accounts are treated. This suggests selecting the parameter through an ex-ante calibration to a risk bound on historical data to choose a maximally fair rule subject to that bound. A counterfactual replay of Hyperliquid's ADL episode on 10 October 2025 finds that a range of intermediate parameters significantly improves on the observed allocation in both burden dispersion and subsequent risk statistics.

Thu 19 NovComputer Science and Game Theory
The gist
When financial platforms automatically reduce risky positions, how they distribute losses matters a lot. The authors study rules that split these losses in ways that don’t depend on the order of events and that handle account changes fairly. They find a set of rules that trade off between spreading risk evenly and being fair to all accounts. Testing their ideas on a real platform’s past event shows better results in sharing burden and reducing risk compared to what was actually used.
Open → 2611.26623v1

TideCache improves large language model speed and memory use on CPU GPU chips

TideCache: Efficient Hybrid LLM Serving with Transparent Cache Management and Layer-Wise Streaming

Abstract: Hybrid architectures have become mainstream among open-weight language models. Their global-attention and bounded-state layers maintain heterogeneous caches whose demands vary with context length and concurrency. We present TideCache, a serving system on CPU--GPU superchips with three components for allocating GPU memory among caches and managing their residency across GPU and host memory. The Transparent Cache Pool redistributes physical pages among cache components behind fixed virtual addresses, preserving cache layouts and backend interfaces. The Cache Streamer uses computation intervals provided by bounded-state layers to prefetch the next global-attention layer's prefix into GPU slots shared across global-attention layers, reducing GPU residency while overlapping layer-wise transfers with computation. Generated KV remains resident. The Request Scheduler selects resident or streamed execution and triggers capacity adjustments according to request size and queue state. Together, they let HBM released by streaming accommodate other cache components and additional requests. Implemented in SGLang and evaluated on GB300 and GH200 across seven model/platform configurations, TideCache completes up to 2.04x as many agent turns, reduces overall P50 per-token latency by 20--59%, and improves agent P50 TTFT by 1.40--3.05x compared with SGLang with HiCache.

Thu 19 NovDistributed, Parallel, and Cluster ComputingMachine Learning
The gist
Large language models need different types of memory cache to work efficiently, especially when handling long or many conversations. The authors present TideCache, a system that smartly manages memory between fast GPU and slower host memory to speed up these models. TideCache uses three parts to share memory, prefetch data while computing, and decide how to run requests to save space and time. Tests show TideCache can handle more tasks faster and with less waiting compared to previous methods.
Open → 2611.26619v1

Video models learn to find and predict hidden actions in unlabeled videos

One Prior, Two Dynamics: Repurposing Video Diffusion Transformers for Self-Supervised Latent Action Learning

Abstract: Videos reveal how the world changes, but rarely the actions that cause those changes. Latent action learning recovers such supervision from visual transitions, yet often learns the underlying dynamics largely from scratch. We ask whether a pretrained video generator can instead provide the prior for both inverse and forward dynamics. We introduce O$^{2}$LaF, built on a simple principle: one prior, two dynamics. We initialize both models from the same pretrained video DiT and adapt them to their distinct roles: a feed-forward transition encoder with learnable action queries for inverse dynamics, and a causal, action-conditioned video generator for forward dynamics. By controlling information access and optimizing both dynamics end-to-end through a compact bottleneck, O$^{2}$LaF learns transferable actions from unlabeled videos. Across navigation and robotic manipulation, O$^{2}$LaF sets a new state of the art in few-shot action probing and enables stronger zero-shot action transfer across visual contexts and embodiments. Beyond generative video priors, we further extend our framework to predictive representation priors such as V-JEPA2, achieving competitive performance. Our findings suggest a broader paradigm for latent-action learning: repurposing pretrained video models to discover transferable actions and predict their consequences.

Thu 19 NovComputer Vision and Pattern RecognitionArtificial IntelligenceMachine Learning
The gist
Understanding what actions cause changes in videos is hard because those actions are often not labeled. The authors show that a pretrained video generation model can be adapted to learn both how to predict future frames and to identify the actions between frames without extra labels. This method, called O2LaF, uses one model reused in two ways to learn these hidden actions more effectively. Their approach works well for tasks like navigation and robot manipulation, even when only small amounts of labeled data are available. They also demonstrate that this idea can extend beyond video generation to other predictive representations.
Open → 2611.26617v1

ScaleWorld enables efficient high-resolution video world generation

ScaleWorld: High-Resolution World Generation through Shared Prediction and Refinement

Abstract: High-resolution generation enables video world models to render fine-grained scene structures and textures, but directly generating high-resolution video incurs substantial computational and memory costs. We present ScaleWorld, a causal video model that unifies low-resolution world prediction and high-resolution refinement within a single shared backbone. By refining its own predictions, ScaleWorld produces high-resolution world videos without requiring a separate refinement model. For each video chunk, the shared backbone first completes a low-resolution prediction and then performs one-step high-resolution refinement conditioned on that prediction. To support efficient streaming generation, we maintain separate causal states with a long low-resolution history for prediction and a short high-resolution history for refinement. To address task interference during distillation, we separate specialist optimization from capability consolidation and introduce task-asymmetric on-policy distillation (TA-OPD). This procedure transfers prediction and refinement behaviors from specialized teachers into a shared student through local velocity matching under their respective sampling and history policies. {Extensive experiments demonstrate that ScaleWorld achieves high-quality world generation with improved computational and memory efficiency.

Thu 19 NovComputer Vision and Pattern Recognition
The gist
Generating detailed, high-resolution videos of virtual worlds usually takes a lot of time and computer power. The authors propose ScaleWorld, a model that first creates a low-resolution video prediction and then improves it within the same system. This approach makes it possible to produce detailed videos without needing separate models or huge resources. They also introduce a special training method to help the parts of the model work well together. Their experiments show the method is both efficient and produces high-quality video generation.
Open → 2611.26615v1

Frontier agents show promise and limits in robot control tasks

AgentRoboCritic: Understanding the Capability of Frontier Agents on Direct Robot Control

Abstract: Frontier multimodal language agents such as GPT-6 Astra have demonstrated strong capabilities in controlling robots directly via low-level numerical actions without high-level primitives. However, existing benchmarks report only episode-level success rates, which show neither how these agents succeed nor where they fail. In this paper, we present a systematic action-level analysis of frontier agents on direct robot control across 12 manipulation benchmarks. We introduce AgentRoboCritic, an intent-grounded critique framework in which the policy agent states a local intent alongside each action, and a critic evaluates the action's outcome and failure mode against this intent. Our action-level analysis demonstrates the promising capabilities of frontier agents on direct robot control, including closed-loop recovery from local execution failures, reliable semantic grounding across diverse scenes, and strong zero-shot manipulation without task-specific adaptation. It also identifies their current limitations, including task-relevant physical execution bottlenecks such as grasping and alignment, and uneven recovery across failure modes. Finally, we validate our critic on a 400-action human-annotated benchmark and release a dataset of 12,844 annotated actions alongside a fine-tuned open-source critic, Muse-Glimmer-30B, whose failure-mode accuracy rises from 32.58% to 74.24%, enabling low-cost action-level analysis.

Thu 19 NovRoboticsComputation and LanguageComputer Vision and Pattern Recognition
The gist
Controlling robots directly with language-driven AI agents is a challenging task. The authors developed a system called AgentRoboCritic that helps understand how these AI agents succeed or fail by checking each action against its intended goal. Their analysis shows that such agents can often recover from mistakes and complete tasks without extra training, but struggle with physical challenges like grasping objects precisely. They also created a new dataset and a tool to better detect why actions fail, making it easier to improve robot control.
Open → 2611.26613v1

Semantic data catalog improves discovery in decentralized solid dataspaces

Bridging the Discovery Gap in Solid Dataspaces with a Semantic Data Catalog

Abstract: Dataspaces are an emerging concept to enable secure and controlled data sharing between multiple stakeholders. However, most existing dataspace architectures, such as those based on the concepts of IDSA (International Data Spaces Association) and Gaia-X, are heavily concept-driven and require significant effort to implement, making it difficult to quickly build a functional dataspace. Solid (Social Linked Data) offers a compelling alternative by providing a lighter and more practical approach. However, for Solid to function as a true dataspace, like traditional dataspaces, it must be built in a decentralized manner, i.e., the dataspace must consist of more than a single Solid server. However, this decentralization introduces a key challenge: Data Discovery. Unlike traditional dataspace architectures, which often include predefined components such as data catalogs to facilitate data discovery and access, Solid does not inherently provide such mechanisms. As a result, managing and locating relevant data across multiple Solid servers and pods becomes a significant barrier to usability. To address this gap, we present a FAIR-compliant data catalog for Solid. Our catalog follows the FAIR principles (Findability, Accessibility, Interoperability, and Reusability) by integrating semantic models that describe all available data sources within the Solid ecosystem. This approach enables enhanced data discovery, improves accessibility through standardized metadata, enhances interoperability between different data sources, and promotes data reuse across applications. By bridging this critical gap, our catalog improves the usability of Solid-based dataspaces, making them a viable option for decentralized and open data ecosystems, such as smart city applications.

Thu 19 NovDatabases
The gist
Sharing data across different computer systems can be tricky, especially if the data is spread out over many places. Traditional systems have ways to find and organize data, but newer, lighter systems like Solid don’t have this built-in. The authors create a special catalog that helps find and use data from many different Solid servers, following principles that make data easy to find, access, and reuse. This helps make Solid a more practical way to share data securely and openly.
Open → 2611.26611v1

Adaptive beam search improves large scale nearest neighbor searches

Variants of Beam Search for DiskANN

Abstract: Graph-based data structures such as DiskANN, HNSW, and NSG constitute the state of the art for large-scale approximate nearest-neighbor (ANN) search. Indyk and Xu introduced the notion of $α$-reachable graphs, which include graphs built by DiskANN's slow-preprocessing construction, and proved that greedy search achieves an approximation factor of $\tfrac{α+1}{α-1}$. Independently, Al-Jazzazi et al. proposed adaptive beam search (ABS) with a relaxation parameter $γ> 0$, showing a $\tfrac{2}γ$ approximation on navigable graphs ($α\approx 1$), where greedy search admits no guarantees. In this work, we unify and generalize these results by proving that ABS with parameter $γ$ on $α$-reachable graphs achieves an approximation of $\tfrac{α+1}{α(γ+1)-1}$ for any metric. Moreover, on sorted $α$-reachable graphs (introduced by Gollapudi et al.) under the $\ell_2$ metric, we obtain the tighter bound $\max\bigl(\tfracα{α(γ+1)-1}, \tfrac{α^{2}+1}{α^{2}(γ+1)-1}\bigr)$. Beyond these theoretical results, we design a beam predictor using features inspired by fine-grained analysis of ABS, trained via a constrained objective that minimizes mean distance computations subject to a target recall. On three 100-million-point benchmarks, using graphs built by DiskANN's practical construction, beam predictor lowers mean query latency on SSD-resident indices at matched recall by up to $29.6\%$ relative to classical beam search (CBS). Relative to ABS, it is faster in $11$ of $15$ settings, by up to $6.5\%$, and at most $1.4\%$ slower in the other $4$; at $95\%$ recall, its advantage over ABS grows from $0.8$--$4.2\%$ for $100$ neighbors to $4.6$--$5.6\%$ for $500$ neighbors. In memory, it needs $1.3$--$23.7\%$ fewer distance computations than CBS and $0.0$--$3.9\%$ fewer than ABS.

Thu 19 NovData Structures and AlgorithmsDatabasesInformation Retrieval
The gist
Finding nearest neighbors quickly in huge datasets is hard, especially on disk-stored data. The authors analyze and generalize previous search methods used in graphs to get better approximations. They also create a smart way to predict beam size during search, which reduces the time needed for queries on massive datasets. Their method runs faster than classical and adaptive beam search while using fewer calculations on real benchmark data.
Open → 2611.26609v1

Synthetic IMU data improves human activity recognition across subjects

Bio-PM-Guided Synthetic IMU Generation

Abstract: Collecting and labeling inertial measurement unit (IMU) data for human activity recognition (HAR) is expensive, and models trained on one group of subjects often fail to generalize to unseen individuals. Even with balanced data, classifiers struggle to distinguish dynamically similar activity classes and benefit from targeted augmentation. We explore whether synthetic IMU data generated in the representation space of a pretrained biosignal encoder, Bio-PM \cite{b1}, can serve as a practical augmentation source. Rather than synthesizing raw signals, we leverage Bio-PM's frozen encoder to convert 10-second IMU windows into token embedding sequences and train class-conditional decoders in this space: (1) an autoregressive transformer decoder that predicts tokens sequentially, and (2) a diffusion decoder that learns the token distribution through a denoising objective. We analyze generation realism through distributional metrics and embedding-space visualizations, evaluate downstream utility through leave-one-subject-out HAR classification, and present a PatchDecoder for approximate raw waveform reconstruction. Our diffusion decoder achieves a Train-on-Synthetic-Test-on-Real (TSTR) macro-F1 of 0.68, demonstrating that generated tokens are realistic enough to train a classifier that transfers to real data. Combining synthetic-token augmentation with a 320-dimensional gravity-aware feature representation raises LOSO macro-F1 from 0.729 to 0.809 over a real-only baseline across 51 subjects on the WISDM benchmark, with statistically significant gains concentrated in the most challenging activity classes. These results demonstrate that high-fidelity generation in a pretrained encoder's representation space is achievable and practically useful for cross-subject HAR augmentation.

Thu 19 NovMachine Learning
The gist
It is hard and costly to collect real motion sensor data to recognize what activities people are doing, and models often do poorly when tested on new people. The authors created a way to generate realistic synthetic sensor data by working with a special hidden representation of the original signals, not the raw signals themselves. They showed that adding this synthetic data helps activity recognition systems work better across many different people, especially for activities that are usually confusing. This approach could make it easier and cheaper to build better activity recognition tools.
Open → 2611.26607v1

Depth Pro 2 improves sharpness and consistency in depth maps

Depth Pro 2: Sharp and Temporally Consistent Metric Monocular Depth

Abstract: We present Depth Pro 2, an approach to estimating dense metric depth for images and video at full resolution. By analyzing prior methods for monocular depth estimation, we find that they commonly trade off temporal consistency and boundary sharpness: multi-frame methods favor consistency, single-frame methods favor sharpness. To overcome this trade-off, we train a single, scalable network that processes both images and video and predicts depth maps at native resolution. Depth Pro 2 produces depth maps that are metrically accurate, sharp, and temporally consistent all at once, outperforming prior work in all of these dimensions. We release a family of models that define a new Pareto frontier in terms of metric accuracy, sharpness, temporal consistency, and runtime. We release code and weights at https://apple-aiml-research.github.io/ml-depth-pro-2/

Thu 19 NovComputer Vision and Pattern RecognitionMachine Learning
The gist
Estimating how far away things are from a single camera image is hard, especially when you want the results to be clear and stable over time in videos. The authors found that existing methods usually trade off between making the depth image sharp or making it consistent between frames. They created Depth Pro 2, a single neural network that works for both still images and videos, producing depth maps that are accurate, sharp at edges, and smoothly consistent over time. Their method outperforms previous work in all these aspects.
Open → 2611.26603v1

Efficient algorithm solves complex matroid cup problems fast

An Efficient Algorithm for Matroid Cups

Abstract: We design a polynomial-time algorithm for matroid cups with $O(1)$ discrepancy. Our matroid cups algorithm design consists of a sequence of reductions to simpler instances, culminating in $O(n)$ instances of matroid cups where the matroid has rank 1.

Thu 19 NovData Structures and Algorithms
The gist
Matroid cups are a mathematical problem that can be hard to solve efficiently. The authors designed a new algorithm that finds solutions quickly, even as the problem size grows. They do this by breaking down the big problem into simpler ones until arriving at the easiest cases to solve. This approach guarantees a small, controlled error margin and keeps the total work manageable. It helps computers handle complex matroid structures more effectively.
Open → 2611.26602v1

Large language models increase discovery and fixing of software bugs

SoK: Assessing the Evolution of LLM Capability in Software Vulnerability Research

Abstract: LLM-based agents are becoming increasingly capable at discovering, validating and patching vulnerabilities in real software, and vendors and researchers report that this is already changing how vulnerabilities are found and fixed. These claims, however, are scattered across papers, vendor reports and disclosures and are rarely comparable. We introduce a framework that rates these capabilities on an autonomy scale modeled on the levels of driving automation, and qualifies each claim by its correctness, its availability and the strength of its evidence. We use this framework to systematize the published evidence on LLM capability in vulnerability research. We find that agents discovered, validated, and patched vulnerabilities in real-world software without human intervention before the restricted frontier models of 2026, and that open-weight models subsequently attained comparable autonomy for discovery and validation. We then measure the consequences of evolving LLM security capabilities in a decade of public vulnerability records, advisories and exploitation data. In 2026 the number of disclosed vulnerabilities more than doubled, with an increasing share rated critical or high, and severe bugs that had survived a decade or more in widely used code were reported several times more often than before. Yet the time between the stages of a vulnerability's life, from report to fix and from disclosure to attack, has not shifted noticeably so far. We grade the mitigations proposed in the literature with an explicit rubric and draw guidance for each group of stakeholders from the best-supported ones.

Thu 19 NovCryptography and SecurityArtificial IntelligenceSoftware Engineering
The gist
Finding and fixing security bugs in software is important but challenging. The authors looked at how large language models (LLMs), like AI agents, are being used to discover, check, and fix these bugs more independently. They created a way to compare different claims about what these AI tools can do and found that even before 2026, some models could handle these tasks without human help. After 2026, more models, including open ones, reached similar levels. The study also noticed more serious bugs being found in 2026 but no big changes in how fast they are fixed or attacked. The authors suggest ways to reduce risks based on these findings.
Open → 2611.26601v1

Contact models explain robot movement and friction in simulations

A Tutorial on Complementarity-Based Contact Models for Robotics

Abstract: Simulating rigid-body dynamics with contact is fundamental to robotics, from motion synthesis and control to mechanism design. Many widely used simulators rely on cone complementarity formulations, whose physical assumptions and numerical solution require substantial background. While excellent surveys, monographs, and course notes exist, they mostly address computational mechanics or computer graphics or document a single simulator. To the best of our knowledge, a self-contained pedagogical treatment for robotics, bringing these formulations and their solvers together with complete derivations and a unified notation, does not yet exist. This tutorial addresses this gap by connecting rigid-body dynamics, conic optimization, and frictional contact. In particular, we explain how complementarity conditions encode non-penetration and frictional dissipation, determining separation, sticking, and sliding without prescribed contact modes. We distinguish equivalent transcriptions from convex relaxations, showing how the latter can introduce artifacts such as lift-off and creep. We examine the existence and uniqueness of motion and contact forces, including the solver's role in selecting among multiple solutions. We then compare first-order and Newton-based methods, explain regularization and proximal strategies, and discuss trade-offs between computational cost, robustness, and physical fidelity. Connections to widely used simulators, optimal control, and differentiable simulation help readers interpret simulation results, choose suitable formulations and solvers, and develop their own contact dynamics routines.

Thu 19 NovRoboticsGraphics
The gist
Robots need to understand how they touch and push things to move properly. This paper explains math models that describe how parts of robots and objects interact without passing through each other. The authors show how these models help simulate whether surfaces stay stuck, slide, or separate, without having to guess the situation beforehand. They also discuss different ways to solve these math problems, highlighting trade-offs between speed, accuracy, and realism. This helps people who build robots choose the right tools for simulating contact and friction.
Open → 2611.26600v1

Active feature acquisition reduces cost while maintaining accuracy

Active Feature Acquisition by Distilling an Oracle Teacher

Abstract: Acquiring every feature of an instance is often costly: a measurement can carry a monetary price, a time delay, or a privacy cost. Active Feature Acquisition (AFA) addresses this by learning a policy that decides, per instance, which features to acquire under a budget. Existing AFA methods train this policy by optimizing a self-constructed utility target rather than distilling an explicit teacher. We construct this teacher explicitly. At training time the label and the unobserved feature values are available, and together they determine the teacher in closed form: an oracle that ranks every candidate by its effect on the downstream predictor's error. OracleImitator distills this ranking into a deployable policy by soft-target imitation. Across multimodal medical diagnosis and the AFABench benchmark, OracleImitator matches or outperforms existing AFA methods across the budget range, recovering 90% of the attainable accuracy gain at under a quarter of the acquisition cost. Because the teacher is an explicit algorithmic object rather than an implicit optimization target, we can also measure directly how much of its ranking is recoverable by a policy restricted to what is visible at deployment.

Thu 19 NovMachine LearningArtificial Intelligence
The gist
Measuring all information about something can be expensive or slow, so it's better to decide which details to get first. The authors created a way to teach a computer model exactly which features are most helpful for making good predictions by showing it an all-knowing example during training. This approach helps the model learn which features to acquire and when to stop, saving money or time while keeping the accuracy high. Their method works well on medical diagnosis data and other tests, getting most of the benefits of buying all features but at much less cost.
Open → 2611.26598v1

Physically grounded execution improves humanoid robot tasks

PGX: Physically Grounded Execution for Long-Horizon Humanoid Loco-Manipulation

Abstract: Robotic vision-language-action (VLA) models can execute diverse individual manipulation skills, yet they still struggle with long-horizon loco-manipulation tasks, where temporal structure, skills, and precision are tightly coupled within a monolithic model. We propose Physically Grounded Execution (PGX), a framework that offloads temporal and precision control to two classical training-free components, allowing the VLA to focus on stage-specific skill dynamics. PGX decomposes long-horizon loco-manipulation into three layers: (i) a predicate-based state machine governs task progression, using physical predicates to gate phase transitions, trigger recovery, and coordinate navigation and waiting. Shared predicate semantics connect offline demonstration segmentation, online execution, and stage-wise evaluation; (ii) VLA skills operate within active manipulation phases, with flat or stage-trained models concentrating on task-relevant actions; and (iii) world-coordinate locking (WCL) maintains spatial consistency through base station keeping, object-relative positioning, and world-anchored contact targets. We demonstrate the effectiveness of PGX with extensive experiments conducted on three simulated tasks and one real-world task using a Unitree G1 humanoid robot for long-horizon loco-manipulation, showing improvements in stage progression and task success rates. Project page is available at: https://kl-research.github.io/pgx

Thu 19 NovRoboticsArtificial Intelligence
The gist
Robots that combine vision, language, and action can do many individual tasks, but struggle when tasks require many steps with precise timing and movement. The authors propose a new system called PGX that breaks down long tasks into simpler parts, using a mix of smart rules and specialized skills. This approach helps the robot know when to move, wait, or act carefully, keeping track of where everything is in the environment. They tested PGX on simulations and a real humanoid robot, showing it can complete complex tasks more successfully.
Open → 2611.26596v1

Code2video improves video generation with proxy guidance and adaptive control

Coda-DaVinci: Reimagining Video Generation with Code2Video

Abstract: Code2Video uses agent-authored 3D proxies to guide video generation, enabling explicit control over structure and dynamics. However, how to construct proxies and prompts for optimal downstream quality remains underexplored, as do the capabilities and limitations of this paradigm. Through controlled experiments and blinded human evaluation, we study proxy granularity, physics simulation, and prompting. The results reveal task-dependent trade-offs: coarse proxies favor natural motion, while medium-grained proxies favor consistency. Physics simulation and proxy-aligned prompting further improve average quality. Guided by these findings, we introduce Coda-DaVinci, a task-adaptive agentic framework for Code2Video generation that selects between proxy-guided and direct generation, adapts modeling granularity to each entity, and coordinates simulation with proxy-grounded prompting. Its multi-agent harness preserves scene assets and guides repairs through visual inspection and independent review. Experiments demonstrate leading instruction following on VTR and scene consistency on R2M, improved physical plausibility over direct generation, and higher visual realism than the compared Code2Video baselines. Long-video evaluations further show gains in event structure and consistency across successive interactions, while revealing limitations in transition stability and adherence to scene settings.

Thu 19 NovComputer Vision and Pattern Recognition
The gist
Generating videos that look realistic and follow directions well is challenging. The authors study how using simplified 3D models, called proxies, can guide video generation to control how things move and look. They find that different levels of detail in these proxies trade off between natural motion and consistency, and that adding physics simulations and matching prompts helps. To put these insights into practice, they build Coda-DaVinci, a system that adjusts how it creates videos depending on the task, improving the video quality and accuracy of following instructions.
Open → 2611.26595v1

Language model reasoning requires new tests for reliable self-checking

Realized versus Population Reliability: Anytime-Valid Self-Consistency Certification under Correlated Reasoning

Abstract: Self-consistency certification treats repeated sampling from a language model as sequential evidence accumulation and stops when an anytime-valid e-process crosses a threshold, guaranteeing finite-sample Type I error control by Ville's inequality. Prior constructions assume sampled rollouts are conditionally independent. We show this assumption fails in practice: reasoning streams are positively correlated through shared reasoning prefixes or across-prompt heterogeneity, changing not merely certificate efficiency but the hypothesis certified. Modeling dependence via a per-unit latent state (the random-effects / intraclass-correlation structure) induces exchangeable, equi-correlated increments with correlation $ρ$. Correlation splits the single null into a realized null about the drawn belief and a population null about average model behavior, which coincide only when $ρ=0$. We show: (i) the standard betting e-process remains anytime-valid for the realized null, not the population null; (ii) read as a population-null test, a suitable mixture has asymptotic crossing probability at least $π=P(μ(Z)>0)$, potentially exceeding nominal $ε$; (iii) the within-unit mean's effective sample size saturates at $1/ρ$, so extra within-unit rollouts cannot restore population validity; and (iv) a prompt-level e-process restores population validity, with optimal allocation at one rollout per prompt under a pure rollout budget. Simulations and Claude Haiku 4.5 rollouts confirm this regime dependence: on GSM8K ($\hatρ=0.435$, $\hatθ=+0.96$) the gap is dormant, whereas on AIME ($\hatρ=0.480$, $\hatθ=-0.15$) the single-unit rule crosses on 24% of prompts at nominal $ε=0.05$, while the prompt-level procedure declines (0.00). This correctness result identifies which reliability claim an anytime-valid certificate actually supports under dependence.

Thu 19 NovArtificial IntelligenceMachine Learning
The gist
When language models try to reason through problems several times, the usual tests to check their reliability assume that these attempts are independent. The authors show that this assumption is often false because attempts can be related or share common parts. They developed new ways to understand and fix these dependencies so that reliability checks remain trustworthy even when the model’s attempts are related. Their findings show when traditional checks work and when special adjustments are needed to be confident about a model’s reasoning.
Open → 2611.26592v1

Vision language models reveal how concepts are selectively accessed and shared

Probing the "Conscious" Mind: Selective Access and Global Workspace in Vision-Language Models

Abstract: Vision-language models (VLMs) integrate visual and textual information, but their outputs do not reveal internal concept representations. Global workspace theory (GWT) proposes that information is selected from parallel brain processes, integrated in a shared workspace, and made available to specialised processes. We introduce the Multimodal Concept Lens (MC-Lens), a multimodal Jacobian lens, to study these functions in VLM concept processing. Its vision encoder and language decoder lenses map intermediate states to a shared semantic space defined by the decoder's output vocabulary to compare concept accessibility across modalities. MC-Lens supports internal concept interventions to examine the role of accessed concepts in downstream computation. (i) Accessibility and selective access. Multimodal concept information is readable in intermediate states and selectively accessible as tasks require. We extend "readout carriers" from one name token to a token set to better capture and express concept information and support counterfactual experiments. (ii) Concepts in downstream computation. Counterfactual experiments show that accessed concept information participates in downstream computation and reasoning. (iii) Development of cross-modal alignment and selective access. We develop two J-space metrics tracking the development of cross-modal concept alignment more clearly than hidden state cosine in controlled VLM training. The experiment also shows that reliable selective access develops later than concept accessibility. (iv) Shared functions across models. Across VLM families and sizes, we find shared patterns of concept accessibility, query-dependent selectivity and cross-task intervention effects despite differences in internal organisation. These findings offer an experimental basis to study GWT in multimodal artificial systems and how it can guide cross-modal alignment improvements.

Thu 19 NovArtificial IntelligenceComputer Vision and Pattern RecognitionMachine Learning
The gist
Vision-language models combine pictures and words but it’s hard to see how they understand concepts inside their ‘mind.’ The authors created a tool called MC-Lens to peek inside these models and see how different ideas are accessed and shared between vision and language parts. They found that these models selectively focus on relevant ideas depending on the task, and those ideas influence what the model outputs next. Their work also shows how these abilities develop during training and work similarly across different models.
Open → 2611.26590v1

Large language model finds hidden bugs missed by hardware tests

Verify the Verifier: Specification-Grounded LLM Cross-Checking for Bugs That Escape UVM Scoreboards

Abstract: A passing UVM regression shows the design agrees with the reference model on what the scoreboard checks, not that it meets the specification. Bugs that pass every test yet violate the specification, termed scoreboard escapes, survive mature testbenches. We present Verify the Verifier, to our knowledge the first framework whose LLM-based Anomaly Cross-Checker examines a passing regression's traces against the specification. Of 564 bugs inserted into four OpenTitan IPs, 68 are candidate scoreboard escapes: non-equivalent, exercised by the tests, yet passing. The framework confirmed 41 as scoreboard escapes with assertions failing on the buggy design and proven on the original.

Thu 19 NovSoftware EngineeringArtificial IntelligenceHardware Architecture
The gist
Sometimes, computer chips pass all their tests but still have hidden bugs because the tests only check part of the design. The authors created a system called Verify the Verifier, which uses a smart language model to compare test results against the official chip specification. This approach found many bugs that slipped past normal testing in real hardware designs, proving it can catch problems that would otherwise go unnoticed. Their results show this new method can improve chip quality by finding subtle errors earlier.
Open → 2611.26588v1

ProtoDiffusion speeds up layered graphic design generation and editing

ProtoDiffusion: Token-per-Layer Generative Modeling of Multi-Layer Images

Abstract: Graphic designs are ordered compositions of RGBA layers whose separation enables selection, movement, and reuse. Existing layered models represent each layer with a full-canvas or region-sized spatial latent grid, so representation size grows with the cumulative spatial extent of the layers. We present ProtoDiffusion, a latent-diffusion framework built on ProtoVAE, a multi-layer variational autoencoder that encodes a design into one shared spatial prototype and one candidate vector per layer. Each candidate conditions a shared decoder to reconstruct its corresponding RGBA layer. For $N$ layers, the representation contains $HW+N$ tokens before backbone-specific packing, compared with $NHW$ for full-grid-per-layer representations. ProtoDiffusion jointly denoises the prototype and a fixed set of candidate slots, conditioned on an image or text, with bounding boxes as optional layout guidance. The model leaves unneeded slots empty and determines the number of layers and, in absence of boxes, their layout, requiring neither as input. The same architecture supports both image-to-design and text-to-design. ProtoVAE achieves high-fidelity reconstruction from its compact shared latent representation, reaching 40.43 dB PSNR on layer crops. On the LayerD evaluation split, image-to-design achieves RGB L1 scores of 0.040 with bounding boxes and 0.057 without, with box-guided alpha soft IoU (0.850) comparable to the strongest fine-tuned baseline (0.871). On merged images, text-to-design reaches 66.41 FID versus 86.84 for FLUX.2 [klein], achieves a 0.860 text-accuracy score, and runs $19.1\times$ faster than the same-backbone generation-then-decomposition cascade.

Thu 19 NovArtificial Intelligence
The gist
Creating graphics often involves stacking layers of images and colors, which can get large and complex. The authors developed ProtoDiffusion, a new way to represent and generate these layers more efficiently by sharing some parts of the image and only separately handling the parts that change. This approach makes it faster to create, edit, and rearrange layers from images or text descriptions. It also figures out how many layers are needed and where they go without extra instructions, making design generation more flexible.
Open → 2611.26586v1

Post-training changes how language models interpret and answer questions

Represented but misread: Post-training changes how language models read out what they represent

Abstract: Does post-training change what a language model represents, or how this representation is read out into an answer? We compared linear probes with the models' own answers, analyzed with signal detection theory, in six open-weight base models and their post-trained versions. For judgments of whether German texts were written by a human or an AI, probes and word n-gram classifiers separated the classes well, but the answers did not and often ordered the texts inversely. Post-training lowered the sensitivity of the answers on average ($Δd' = -0.34$ across model families; -0.29 across three prompts). It also changed the use of a stated base rate: Base models shifted their log-odds by less than the stated change in prior odds, most post-trained models by more. In two models with stage-wise checkpoints, the change occurred during supervised fine-tuning, model stitching implicated the early layers, and from mid-depth on internal states at positions after the text, not those of the text, transferred the change between checkpoints. Our corpora cannot be shared, so we add a case reproducible from public data, the truth of negated statements. Here, post-training acted in the opposite direction: Probes decoded truth at or near ceiling in every model, the answers of several base models did not use it, and post-training repaired them; by mid-depth the repair resided at the positions after the statement; below it, the representation of the statement contributed, strongly in one of four models. In a training study, adding 2,000 correctly labeled authorship judgments of news texts to otherwise identical fine-tuning data improved the answers on our newspaper and textbook corpora and inverted them on the chats, where they followed a news-trained probe of the base model. Post-training thus changed how a judgment is read out of what a model represents, and a small training signal can set its direction.

Thu 19 NovComputation and LanguageMachine Learning
The gist
Sometimes, language models seem to know something but answer in unexpected ways. The authors studied whether this happens because the model’s understanding changes after extra training or just how it turns that understanding into answers. They found that after further training, models often changed how they 'read out' what they knew, not what they actually represented inside. Also, a small amount of extra training data could shift this reading process significantly in different directions.
Open → 2611.26584v1

German regional rail reform faces challenges after 30 years

A Success Model at the End of Its Life Cycle: 30 Years of Regionalised Regional Rail in Germany

Abstract: On 1 January 1996, Germany transferred responsibility for regional passenger rail services from the federal government to the states. Three decades later, passenger-kilometres have doubled and competitive tendering has lowered operating costs substantially, making regionalisation the most successful element of the German rail reform. Its organisational model, however, has reached the end of its life cycle: tenders now attract on average only 1.3 bids, 26 contracting authorities and some 60 transport associations maintain overlapping structures, rolling-stock procurement has repeatedly shifted risk onto passengers, and since the Court of Justice of the European Union struck down the German track-access charge cap in 2026, funding no longer covers the ordered service volume. This article reviews the motives and results of regionalisation, identifies three structural design flaws, and argues for a second reform: consolidating authorities, standardising rolling stock, deciding between a repaired market model and integrated public operation, and indexing funding to real infrastructure cost development. The submission contains an English translation followed by the German original.

Thu 19 NovComputers and Society
The gist
Germany transferred regional rail services from federal to state control in 1996, which led to more passengers and lower costs. However, after 30 years, the system faces problems like fewer bids for contracts and complicated overlapping government structures. The authors show that funding no longer covers services properly, and they suggest reforms including simplifying authorities, standardizing trains, and adjusting funding to real infrastructure costs.
Open → 2611.26583v1

Quantum algorithm solves biomolecular equation with faster scaling

End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System

Abstract: Quantum algorithms for differential equations have the potential for substantial algorithmic speedups over classical methods. However, they rely on certain assumptions and abstract oracle specifications that leave their practical feasibility and computational advantages for realistic applications unclear. Here we formalize the concept of an end-to-end quantum algorithm for differential equations as one that accepts classical inputs and returns classical outputs, and provide implementations for algorithmic primitives in constructing such algorithms. We present a tailored end-to-end quantum algorithm for the linearized Poisson-Boltzmann (LPB) equation, a partial differential equation (PDE) with variable coefficients widely used in simulating a biomolecular system. We explicitly implement all aspects of the algorithm, from preparing an initial state to generating a quantum solution and estimating properties of the system. In particular, we develop a new discrete representation for variable-coefficient PDEs on a grid that enables efficient implementation of the operator oracle, and build on a recent technique based on optimal wavelet preconditioning to generate a quantum solution with a cost independent of the condition number of the discretized operator. We show the algorithm can be implemented by quantum circuits of size polylogarithmic in both the number of grid points $N_g$ and the inverse of the desired accuracy $\varepsilon$, with an overall gate cost polylogarithmic in $N_g$ and quasilinear in $1/\varepsilon$. We also show the classical preprocessing to construct the circuits has polylogarithmic cost in $N_g$ and $1/\varepsilon$. Our work provides a concrete end-to-end quantum algorithm for a PDE of practical value, demonstrates an exponential improvement in scaling with $N_g$ over classical methods, and provides a foundation for assessing its potential quantum advantage in practice.

Thu 19 NovData Structures and Algorithms
The gist
Solving complex equations helps scientists understand molecules in biology, but it can take a long time on regular computers. The authors created a complete quantum algorithm that takes simple inputs and gives clear outputs for one such equation used in biomolecular simulations. Their method uses new techniques to represent the problem and solve it efficiently, making the quantum computing cost grow very slowly as the problem gets bigger or more precise. This shows how quantum computers could one day speed up important scientific calculations.
Open → 2611.26582v1

Quantum proofs outperform classical hierarchies despite equal classical computing power

Classical Oracle Separation of QMA from the QCMA Hierarchy and Quantum Cryptography Even When P = QCMA

Abstract: Remark: This work is in submission at STOC'27 and thus the full manuscript has been publicly posted on the conference website since November 3rd, 2026. Inspired by the Codeword-Hash Structure problem recently introduced by Cakan (arXiV, 2026) to separate $\mathsf{QMA}$ from $\mathsf{QCIP}$, we introduce a new problem called Codeword-Hash pairs in Noise ($\mathsf{CHN}$) and prove that, in the query complexity model, it is in $\mathsf{QMA}$ but hard for the $\mathsf{QCMA}$ hierarchy $\mathsf{QCMAH} = \bigcup_{d\geq1}\mathsf{QCMA}^{\mathsf{QCMA}^{\cdots^{\mathsf{QCMA}}}}$, the classical-witness quantum-verifier analogue of $\mathsf{PH}=\bigcup_{d\ge1}\mathsf{NP}^{\mathsf{NP}^{\cdots^{\mathsf{NP}}}}$. Using this problem, we show that there exists a classical oracle ${O}$ such that $\mathsf{P}^{O}=\mathsf{BQP}^{O}=\mathsf{QCMA}^{O} =\mathsf{QCMAH}^{O} \subset \mathsf{QMA}^{O} \text{ but } \mathsf{QMA}^{O}\not\subseteq\mathsf{QCMAH}^{O},$ thus showing that quantum state or quantum proof advantage could exist even if classical computers can efficiently solve any problem that can be quantumly verified with a classical proof. Further, using our problem, we show that various quantum cryptographic primitives can exist even when $\mathsf{P} = \mathsf{QCMA}$ and thus neither quantum-computable one-way functions nor (verifiable) quantum computational advantage exist. In particular, relative to a classical oracle ${O}$ with $\mathsf{P}^{O}=\mathsf{BQP}^{O}=\mathsf{QCMA}^{O}=\mathsf{QCMAH}^{O}$, there exist pseudorandom states with classical keys and public-key encryption with copy-protected quantum decryption keys and classical public keys and ciphertexts, among other primitives, answering an open question of Kretschmer, Qian, and Tal (STOC 2025).

Thu 19 NovCryptography and Security
The gist
Some problems can be checked easier if you have a quantum proof rather than a classical one, even when classical computers are just as powerful as quantum ones for many tasks. The authors created a new problem that shows quantum proofs have an advantage over any classical proof system no matter how many layers of classical verification you stack. They also demonstrated that certain quantum cryptography methods can exist even if classical and quantum computers are equally powerful. This challenges previous assumptions about how classical and quantum computing relate to one another.
Open → 2611.26574v1

Walkable neighbourhoods linked to lower heart and metabolism diseases in London

Neighbourhood Walkability and Cardiometabolic Morbidity in Greater London: A Fine-Grained Spatial Analysis

Abstract: Cardiometabolic diseases are leading causes of ill health, and neighbourhoods that support everyday walking may help reduce them. Studies often report lower disease prevalence in more walkable neighbourhoods. However, because walkability operates across multiple spatial scales, city-wide associations may conflate local neighbourhood form with broader metropolitan structure and co-varying environmental exposures. Here we show that while much of the walkability--morbidity association in Greater London operates through the city's macro-scale spatial structure, local alignment persists beyond it. Using an open five-component walkability index for 4,994 London census units and recorded prevalence of eight cardiometabolic conditions from primary-care registers, we found that higher walkability was inversely associated with all eight outcomes after adjusting for demographic composition and deprivation; one standard deviation higher walkability corresponded to 1.43 percentage points lower hypertension prevalence. Walkability followed a centre--periphery gradient, with a radial model explaining 74.2\% of its variation. Coefficients were reduced by 2--43\% within boroughs and 11--75\% after centre--periphery adjustment. After spatial-error adjustment, no clear association remained for obesity; coefficients for the other seven were reduced by 83--99\% relative to comparable log-scale models. Nevertheless, observed associations were more extreme than those from surrogate walkability surfaces preserving this spatial structure, for all eight outcomes in the primary analyses and for five after adjustment for nitrogen oxides. These findings caution against interpreting city-wide walkability coefficients as neighbourhood effects independent of wider metropolitan structure, and highlight the need for studies of neighbourhood form and health to disentangle global and local spatial structure explicitly.

Thu 19 NovComputers and Society
The gist
Heart and metabolism-related diseases are common and harmful. The authors studied how easy it is to walk in different parts of London and how that relates to these diseases. They found that areas where walking is easier tend to have fewer such diseases, but this link is partly because of how the whole city is laid out. So, just looking at city-wide walking measures might be misleading without considering the bigger picture of city structure.
Open → 2611.26573v1

Multimodal image editing systems miss risks in combined text and images

Text-Aware, Vision-Blind: How Multimodal Image Editing Systems Handle Unsafe Inputs

Abstract: Multimodal image generation systems have made rapid progress and increasingly emphasize content safety. However, their safety mechanisms tend to rely on a single modality and lack joint consideration of both visual content and text prompts, particularly in instruction-guided image editing, where the uploaded image may itself carry risk. We thus introduce EditSafetyBench, a benchmark that measures system-level safety awareness of advanced image editing systems, containing 5,940 image-instruction pairs, covering safe and unsafe images across 11 risk categories and three edit intents. We then probe the benchmark dataset on four systems, including Gemini, GPT, Qwen API, and Qwen Local. Based on our evaluation, we observe a systematic text-vision safety mismatch: Gemini and GPT refuse 87.1\% and 81.6\% cases containing unsafe-intent editing prompts, while only refusing 24.2\% and 22.4\% cases with both unsafe images and neutral instructions. At the category level, most risks are considered inconsistently by different systems, e.g., GPT allows 70.4\% editing attempts of unsafe political content while Gemini only allows 34.8\%. Notably, sexual content shows the strongest visual sensitivity, likely benefiting from mature NSFW identification works. Our findings highlight the need for safety guardrails that jointly reason over both visual and textual modalities in image editing systems.

Thu 19 NovCryptography and SecurityComputer Vision and Pattern RecognitionMachine Learning
The gist
Many tools that edit images using instructions don’t check both the picture and the text for unsafe content together. The authors created a test called EditSafetyBench to see how well these tools handle risky images and unsafe editing directions. They found that some systems refuse to make unsafe edits based on the text but often miss risks in the images. Different systems handle types of risky content very differently, especially for political and sexual content. This shows that better safety checks need to look at both pictures and text at the same time.
Open → 2611.26569v1

Analog cam hardware accelerates tree machine learning with noise resilience

Efficient and Variation-Tolerant Tree Inference via Compact and Scalable Mapping in Analog CAMs

Abstract: Tree-based machine learning methods are widely adopted for their interpretability and state-of-the-art accuracy on tabular data. These methods face efficiency challenges on conventional architectures due to irregular memory access patterns during tree traversal. Prior work uses analog CAM to accelerate tree traversal, but inefficient mapping requires exponentially more analog CAM columns as tree depth increases. Accuracy is also degraded by device non-idealities such as programming variations and soft decision boundaries. To address these challenges, we propose ACTIVAR, a compact variation-tolerant tree implementation in a dense analog CAM array via software-hardware codesign. On the software side, we introduce an analog-CAM-aware compact tree model that employs hierarchical subtrees with shared features to maximize hardware utilization. This dense mapping introduces redundancy, improving both model accuracy and hardware defect tolerance. Additionally, we develop Variation-Enhanced Training, which utilizes a fuzzy overlap boundary strategy to build models resilient to analog noise. On the hardware side, we design a FeFET-based analog CAM cell with a driver to sharpen decision thresholds and implement a pipelined multi-core architecture to optimize throughput and energy consumption. Across 13 classification and regression datasets, ACTIVAR maintains near-software-level accuracy while reducing hardware overhead by up to 99% compared with prior analog-CAM-based soft-tree designs. Under realistic hardware noise conditions, ACTIVAR limits accuracy degradation to just 3.7% on the MNIST dataset, whereas baseline models suffer a catastrophic 49.6% drop. Furthermore, the ACTIVAR architecture achieves energy efficiency gains ranging from $10^4$ to $10^6$ times over commercial general-purpose processors, establishing it as a highly efficient solution for high-capacity machine learning at the edge.

Thu 19 NovEmerging Technologies
The gist
Tree-based machine learning models are good for understanding data but slow to run on normal computers because they jump around memory a lot. The authors created ACTIVAR, a new hardware-software approach that uses a special kind of memory called analog CAM to run these tree models faster and with less energy. Their method cleverly packs tree parts together to save space, trains models to handle hardware noise, and designs hardware to make decisions clearer. This lets ACTIVAR keep accuracy close to software models while being much smaller, more energy-efficient, and better at dealing with errors than previous analog CAM designs.
Open → 2611.26567v1

Vision language action models struggle with physical object throws

PhyDEX: A Benchmark for Physical Reasoning in Vision-Language-Action Models via Dynamic Extrinsic Dexterity

Abstract: Vision-Language-Action (VLA) models have advanced rapidly in language-conditioned robotic manipulation, yet existing benchmarks mainly evaluate gripper--object contact and largely ignore how objects interact with the environment through gravity, friction, inertia, and mass distribution. As a result, it remains unclear whether current policies truly understand physics or merely interpolate from their training data. We address this gap through the lens of dynamic extrinsic dexterity and introduce PhyDEX, a throwing benchmark in which a robot must infer an object's mass, center of mass, and friction to send it to a destination beyond its kinematic workspace. PhyDEX contains 35K trajectories (143 hours) across nine tasks and 100 scenes, covering uniform, irregular, and dynamic-mass objects with static, multiple, and moving destinations. All data are generated by a scalable, fully automatic pipeline that combines grasp generation, motion planning, and closed-loop throw optimization under randomized physical properties. We evaluate three representative VLAs, GR00T N1.7, DynamicVLA, and ForceVLA, and find that all achieve success rates below 3\%. Our analysis reveals two key bottlenecks: limited robustness of pretrained models, which causes most failures before the throw, and physical blindness, as providing ground-truth physical properties roughly doubles success. Experiments on a humanoid robot and in the real world show the same failure patterns. We hope PhyDEX will drive the development of physically grounded robot policies.

Thu 19 NovRobotics
The gist
Current robot systems that combine vision, language, and action often fail to understand how objects behave physically, like how their weight or slipperiness affects movement. The authors created PhyDEX, a new set of tests where robots must figure out object properties to throw them accurately beyond their usual reach. They found that existing robots perform poorly, mostly because they don’t effectively grasp physical details and are not robust enough before throwing. Their work highlights the need for robots that truly understand physics to succeed in tasks involving complex object interactions.
Open → 2611.26565v1

Generative engines influenced by coordinated promotional content networks

GEOHunter: Mapping a Generative Engine Optimization Network in the Wild

Abstract: Generative engines synthesize retrieved web pages into answers, recommendations, and rankings. Generative engine optimization (GEO) services sell visibility in these answers by publishing promotional articles on user-generated-content (UGC) platforms for paying clients. Such promotion raises concerns in medical and financial domains, where misleading advice can cause harm. To study the severity of this problem, we measure one such paid-content operation across three major Chinese UGC platforms, uncovering 1,985 accounts associated with the network comprising 466,357 inferred promotional placements. We find that the network promotes products across diverse categories through a growing pool of accounts, conducting coordinated campaigns spanning months across multiple platforms while evolving its listicle content over time. Across nine generative engines from both the US and China, we find that 4.5% to 20% of retrievable cited pages are attributable to the network, depending on how strictly attribution is drawn. On eight of these engines, its clients are named in 52% of answers, against 68% for category leaders. Our work demonstrates the effectiveness of UGC GEO placement at influencing generative engine outcomes, and reveals content-level defenses as insufficient against coordinated UGC placements, where account-level and platform-level signals are necessary for proper defense.

Thu 19 NovCryptography and SecurityArtificial IntelligenceSocial and Information Networks
The gist
Some companies pay people to write articles promoting their products on popular websites to appear in answers generated by AI engines. The authors studied such a network on three major Chinese content platforms, finding nearly two thousand accounts and hundreds of thousands of promotional posts. These posts help the paying clients appear frequently in AI-generated answers across multiple platforms over long periods. They show that it is hard to block this kind of coordinated promotion using content filters alone and suggest that looking at user accounts and platforms is needed to defend against it.
Open → 2611.26564v1

Type system improves message safety in elixir actor processes

You Have Mail: Set-Theoretic Types for Actors

Abstract: We present a type system for the processes of Elixir, a dynamic language based on the actor model whose static type system covers only its functional core. Each process is typed by $\mathtt{pid}(t)$, where the ``interface'' $t$ is the type of the messages the process expects in its mailbox: sends are checked against the recipient's interface, and receives rely on the interface of the process that performs them. One of the difficulties of typing Elixir is that mailboxes are implicit: a function shipped in a message may evaluate $\mathtt{self()}$ and execute receive instructions, and both refer to whichever process eventually runs the function---$\mathtt{self()}$ returns that process's pid, receive reads that process's mailbox---so the mailbox they act on is not known where the function is written. We solve this problem by inferring, for every function, bounds on the type of the mailboxes it can be used with; as a result, the system types higher-order functions that travel in messages even when they contain reference to $\mathtt{self()}$ and receive instructions. The only new annotation the programmer writes is the interface of each spawned process; everything else is inferred by reusing the existing subtyping and constraint-resolution machinery of Elixir, and the system is proved sound. For legacy code, the interface can be reconstructed from the receive clauses: what the branches do with their messages bounds it from above, and the most permissive solution is sharp enough to recover received pids and closures.

Thu 19 NovProgramming Languages
The gist
Elixir programs use many independent parts called processes that talk by sending and receiving messages. The authors designed a way to check what types of messages a process should expect and send, even when messages contain functions using the process’s own mailbox in tricky ways. This system figures out limits for what mailboxes the functions can access, making it easier to find mistakes without extra hassle for programmers. It works by automatically guessing most information and only needs programmers to specify the interface when starting a process.
Open → 2611.26563v1

Deep learning system grades Barrett's esophagus dysplasia accurately across hospitals

Multi-institutional grading of Barrett's esophagus dysplasia without stain normalization using a pathology foundation model and multiple instance learning

Abstract: Barrett's esophagus dysplasia grading suffers substantial inter-observer variability, particularly for low-grade dysplasia, complicating clinical decision-making. We conducted a retrospective multi-institutional diagnostic accuracy study of a foundation model-based deep learning system for dysplasia grading, using 969 H\&E-stained whole slide images from four institutions. Patch-level classifiers trained on expert annotations identified diagnostically relevant regions, followed by attribute-aware multiple instance learning for slide-level classification as non-dysplastic Barrett's esophagus (NDBE), low-grade dysplasia, or high-grade dysplasia. On a held-out test set (n = 130), macro-averaged AUC was 0.96 (95\% CI 0.93--0.98). For binary dysplasia detection, sensitivity was 98\% (80/82) and specificity 81\% (39/48), with a negative likelihood ratio of 0.030 and quadratic-weighted \kap{} of 0.83 against expert consensus. No high-grade dysplasia case was misclassified as NDBE. Performance was consistent across institutions without stain normalization, indicating that stain-robust foundation-model representations may remove the site-specific preprocessing that has constrained prior systems to institution-specific deployment.

Thu 19 NovComputer Vision and Pattern RecognitionArtificial Intelligence
The gist
Grading Barrett's esophagus dysplasia, a precancerous condition, can vary a lot between doctors, especially for mild cases, making treatment decisions hard. The authors developed a deep learning system that looks at microscope images and can classify the condition as normal, low-grade, or high-grade dysplasia. This system was tested on images from four different hospitals without needing to adjust for variations in how the samples were stained. It performed very well and consistently across all hospitals, helping reduce diagnostic uncertainty.
Open → 2611.26562v1

Multimodal decision models show greater stability under presentation changes

MM-SystemOneBias: Evaluating Bias in Multimodal Jev-Style System One Decision Models

Abstract: When multimodal decision models determine actions, moderation outcomes, or quality judgments, their reliability depends on preserving semantic decisions across presentation changes, ignoring irrelevant additions, and distinguishing information consistent with task evidence from information that conflicts with it. Existing evaluations study decision-interface biases and multimodal model behavior in separate settings, leaving no common protocol to compare multimodal decision models with their backbones on practical tasks. We introduce \textbf{MM-SystemOneBias}, which evaluates 13 models on 5,323 original instances from nine public datasets and 11 task scenarios using six paired interventions: option order, option label, external judgment, image--text description, irrelevant information, and rating scale. Across seven matched decision-model--backbone pairs, decision models are more stable under option-label, irrelevant-information, and rating-scale changes in all seven pairs; six pairs also show lower option-order flip rates. They incur smaller accuracy losses under incorrect external judgments in all seven pairs and conflicting descriptions in six. In six pairs, they gain less accuracy from correct external judgments and show less favorable accuracy changes under consistent descriptions. Among pairs with unchanged semantic decisions, mean absolute changes in answer probabilities range from 4.56 to 11.55 percentage points, revealing input effects that accuracy alone misses.

Thu 19 NovArtificial Intelligence
The gist
Multimodal decision models use different types of input, like images and text, to make decisions. The authors found that these models tend to keep their answers more stable when irrelevant changes are made, such as swapping option orders or adding unrelated information. They tested 13 models across nine datasets and various task scenarios, showing that these models handle tricky situations better than their simpler versions, though some input changes still affect their confidence levels in subtle ways.
Open → 2611.26557v1

Agents replicate security failures in software with warning reduces harm

Replication of Agentic Security Events: Audit and Investigation (ROGUE-AI)

Abstract: Agents based on large language models (LLMs) can now delete files and send payments on behalf of their users. News media reports routinely describe failures of these agents (e.g., Replit's coding agent deleting a production database), but a report often only says what went wrong and rarely (in)validates the incident or finds its root cause. Incident catalogs collect these reports, and benchmarks record whether agents fail, but neither replicates an incident nor tests the cause its report might identify. In this paper, we present ROGUE-AI (Replication of Agentic Security Events: Audit and Investigation), a multi-agent framework that closes the above gap and rebuilds each reported incident offline together with a matched control that lacks only the blamed cause, and runs agents on both. Our results suggest that ROGUE-AI is able to reproduce the reported harm in 89% of its 108 attempted replications. Agents built on five current GPT, Claude, Gemini and DeepSeek models made the reported mistake in 18% to 33% of runs, against at most 1% without the blamed cause. Of the 72 incidents with real-world harm, 62 had no underlying attacker, and in these, agents did what their task asked for but missed an ordinary hazard, such as a database shared with the live site. Replications without an attacker caused more harm than replications of prompt injection for all five models. Defenses against prompt injection look for injected instructions, but these replications contain none. Further, a warning after each tool output that names the hazard and its consequence lowered harm for all five models, whereas a note of the same length that does not mention the hazard left most of the harm in place. Built from real incidents, the ROGUE-AI replications form a reusable audit framework that vendors can rerun before each new release.

Thu 19 NovCryptography and SecurityArtificial IntelligenceMultiagent Systems
The gist
AI agents that use large language models can perform tasks like deleting files or sending payments, but sometimes they cause accidental harm. The authors created ROGUE-AI, a framework that reproduces reported AI agent failures to see if the causes really explain the mistakes. They found most real incidents could be recreated, often without any attacker involved, meaning agents just missed common risks. Adding warnings about these risks after agent actions significantly reduced the mistakes.
Open → 2611.26553v1

Detecting lies in large language models using persona and knowledge cues

The Geometry of Lies: Knowledge and Persona Directions for Detecting Deception in Large Language Models

Abstract: Linear probes are the cheapest LLM lie detectors but often fail to transfer across kinds of lie. Label-free directions from honest and deceptive role-play are untested at 70B scale and on lies about knowledge, where a lie and an honest denial can be identical. We widen a published persona bank with roles that deny knowledge they have, plus honest counterparts. At each model's middle layer the resulting persona direction ranks lies across Liars' Bench better than single-dataset probes on three of its four models; it fails on Qwen, even when Qwen stays in role far more often. On Llama-3.3-70B-Instruct it beats directions from a random persona bank, but its gain over the published direction is within the range of random widenings. On lies about knowledge, persona directions mainly track a reply's wording: where lies and honest denials share their words, our three main contrasts stay inside the random-direction band on Llama and Qwen and reach only its edge on Gemma, though on Mistral one clears it. A knowledge direction contrasts questions the model can answer with ones nobody can, each followed by the same scripted denial. It separates lies from identical honest denials on two models and narrowly on a third, but not on the fourth; its other results partly depend on the benchmark's wording. On the Gender-Secret fine-tune it clears the band by a few hundredths on Llama and fails on Mistral. The sum of the two directions ranks lies better than a supervised probe at the same depth on all four models (on one, both near chance) but is level with the persona direction on Llama's average and behind that probe on held-out lies. More varied role-play questions do not help the persona direction on Liars' Bench.

Thu 19 NovArtificial Intelligence
The gist
It can be hard to tell when AI language models are lying, especially when lies look like honest answers. The authors tested ways to find clues about lying using role-playing personas and knowledge-based questions in four big AI models. They found that some methods work better on some models than others, and that clues based on the wording of answers aren’t always reliable. Combining clues about persona and knowledge can improve lie detection, but there’s still no perfect method.
Open → 2611.26545v1