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.

UltraTex improves 3D texture maps with physical and material knowledge

UltraTex: Aligning Physical Knowledge for High-Fidelity PBR Texture Generation

Abstract: Generating physically based rendering (PBR) texture maps for a 3D mesh from a single reference image is highly ambiguous, as the observed appearance entangles material identity, surface reflectance, and illumination. While current generative methods produce realistic albedo maps, they still struggle to infer accurate metallic and roughness attributes for relighting. We present UltraTex, a cascaded multi-view framework that moves beyond appearance matching by integrating physical knowledge into multi-view diffusion-based PBR generation. UltraTex first jointly predicts albedo and world-space shading normals to generate more detailed albedo maps, and then predicts metallic-roughness (MR) maps conditioned on the generated albedo, reference image, and material semantic priors. To inject material semantics, a lightweight adapter transforms hidden-layer features of a vision-language model (VLM) into intrinsic material representation tokens, providing part-level knowledge anchors for MR estimation. To model material-light interaction, photometric representation alignment guides intermediate diffusion features toward ground-truth material renderings under controlled lighting. This makes metallic and roughness variations observable through highlight intensity, specular sharpness, and local reflectance contrast, providing stronger guidance for fine-grained material prediction without explicit lighting supervision. Extensive experiments show that UltraTex generates high-quality textures and outperforms existing open-source and commercial methods in visual fidelity, material accuracy, and physical plausibility.

Wed 18 NovComputer Vision and Pattern Recognition
The gist
Creating realistic surface textures for 3D objects from a single photo is difficult because the photo mixes up material, lighting, and shape. The authors introduce UltraTex, a method that uses multiple views and physical knowledge about materials to make better texture maps. UltraTex predicts color and shape details first, then estimates metal and roughness properties by understanding the type of material and how light interacts with it. This approach helps produce more accurate and realistic textures than existing techniques.
Open → 2611.24941v1

Z sight unifies robot vision language action with future prediction

$Z$-sight: Unifying Vision-Language-Action and Latent World Modeling

Abstract: We introduce $Z$-sight, a unified robot foundation model that couples vision-language-action (VLA) and generative latent world modeling. Video-based world action models (WAMs) show the value of joint future-and-action generation for control, yet inherit the heavy cost of video generators. Recent latent-space policies avoid pixel generation, yet typically align intermediate features or rely on frozen target encoders, decoupling future prediction from the VLM's native feature space. $Z$-sight instead predicts the future directly in the visual token space in which its VLM perceives the present. Coupling a foresight expert and a continuous action expert with the VLM in a mixture-of-transformers, $Z$-sight jointly denoises future spatial tokens and actions at inference without pixel reconstruction or external encoders. Trained on human video and robot trajectories, $Z$-sight achieves 81.9% success on SIMPLE (+9.6 points over the strongest baseline) and 73.3% across six Unitree G1 tasks (+20.0 points) at 110 ms per chunk, while remaining competitive on tabletop benchmarks.

Wed 18 NovRoboticsComputer Vision and Pattern Recognition
The gist
Robots need to understand what they see and decide what to do next. The authors present Z-sight, a model that helps robots predict future events and actions together using video and language information, without heavy computations of full video frames. It learns from both human and robot videos, improving performance on common robot tasks. This approach makes robots better at planning and acting quickly based on what they perceive.
Open → 2611.24940v1

Phoenix improves robot manipulation by learning scene structure

Phoenix: Learning Scene Structure Representations for Generalizable World-Action Models

Abstract: World-action models jointly predict future observations and actions, yet reconstruction-oriented visual representations do not explicitly emphasize the spatial relationships and object-state changes needed for manipulation. We introduce Phoenix, which learns representations of scene structure for world-action modeling. Specifically, Phoenix Encoder enriches DINOv3's general visual semantics through dual-teacher distillation of geometric and spatiotemporal semantic knowledge. Next, CS-VAE causally aggregates and compresses Phoenix Encoder features into generative latents while preserving scene information and spatial layout. Finally, Phoenix jointly predicts these latents, complementary appearance latents, and robot actions, linking scene evolution with action generation. To study pretraining data efficiency, we curate approximately 39,000 hours of egocentric and robot manipulation data for representation learning and use the robot demonstration subset for WAM pretraining. Following benchmark-specific post-training, Phoenix achieves state-of-the-art performance across simulation and real-robot benchmarks spanning single-arm, bimanual, and dexterous manipulation. It demonstrates strong robustness to perturbations, achieving success rates of 94.8% on LIBERO-Plus and 72.4% on RoboTwin 2.0 C2R, alongside strong cross-embodiment transfer and real-world manipulation performance on Bench2Dex and RoboDojo-RealWorld, respectively. Pretraining-scale analysis shows larger performance gains from data scaling than a video-VAE-only baseline, indicating stronger scaling benefits and more effective data utilization. Moreover, Phoenix maintains high success rates when adapted with limited downstream demonstrations, demonstrating strong few-shot adaptation. Our code, pretraining data, and models are available on the project page to help the community reproduce our results.

Wed 18 NovRobotics
The gist
Robots need to understand how objects and scenes change when they act, but most visual systems don’t focus well on this. The authors created Phoenix, a new approach that teaches robots to better recognize spatial relationships and how scenes evolve over time. Phoenix learns from a huge collection of robot and egocentric videos to predict future scenes and required actions. This helps robots perform complex tasks more reliably and adapt quickly with just a few examples.
Open → 2611.24938v1

Jailbreak detection improves with prototype-based contrastive learning

Jailbreak Detection on Large Language Models via Contrastive Prototype Structures

Abstract: Jailbreak attempts and harmful prompts remain a challenge for the safe deployment of large language models. We study whether contrastively learned representations can support safety detection without training an additional downstream classifier. We propose Jailbreak Detection with Prototype Inference (JDPI), which uses binary safety labels to construct harmful and benign prototypes and makes predictions from relative prototype distances. JDPI uses only binary safety labels for encoder adaptation, prototype construction, and validation. In our setup, it uses fewer labeled examples than the classifier baseline (Method A) by avoiding the separate split used to train the downstream classifier. Across four benchmarks covering different input formats, contrastive fine-tuning improves JDPI's detection accuracy by 9.1-18.0 percentage points. Using the same encoder, JDPI achieves slightly higher ROC-AUC on one benchmark and stays within 0.017 of the baseline across all four. With dataset-specific adaptation, JDPI exceeds the released Llama Guard 3-8B baseline by 0.173-0.310 in ROC-AUC across the four benchmarks. In multi-turn replay on TomGibbs, JDPI uses accumulated user history as the conversation unfolds, achieving higher conversation-level accuracy than when it uses the current turn alone. Across 12 directed transfers, JDPI outperforms the classifier by an average of 1.59 percentage points in accuracy, demonstrating stronger cross-dataset robustness.

Wed 18 NovComputation and Language
The gist
Jailbreaks and harmful requests make it risky to use large language models safely. The authors propose a new method called JDPI that detects unsafe prompts by learning typical examples of harmful and safe inputs and seeing how close a new input is to these. JDPI requires fewer labeled examples than traditional classifiers and works well across several tests. It also improves accuracy by using previous conversation history and shows better robustness when applied to different types of data.
Open → 2611.24936v1

Human calibration determines value in ai assisted decision review

Knowing What You Know: A Trait Theory of Reviewer Value in Human-AI Cognitive Systems

Abstract: When a capable model and a human reviewer cooperate on the same decision, which human still adds value? We argue this is a question about a single cognitive trait, metacognitive calibration: the alignment between a reviewer's behavioral confidence and the actual correctness of their judgments. We develop a trait theory of reviewer value to make it precise. The theory makes five claims: value is governed by calibration rather than by activity, speed, agreement, or tenure; calibration leaves observable traces in behavioral telemetry; those traces are non-diagnostic on their own, because the fast, low-revision signature of a calibrated expert is indistinguishable from that of a confident novice until it is gated by outcomes; human calibration and a model's self-knowledge are the same construct, so the joint system should defer to whichever agent is better calibrated on each item; and individual calibration is causally identifiable only above the level of the single judgment. We ground each claim in a six-month production window of an AI-assisted accounting system (541621 reviewer events, 483 reviewers), and find that a purely behavioral expertise profile inverts the ground truth, scoring an overconfident cohort (5.2 percent correction survival) higher than genuine experts (99.2 percent); that reviewer quality is flat across tenure, so the trait is not learned on the job; and that the same calibration logic that separates good from bad reviewers, applied to the model, concentrates 92.5 percent of human effort on genuine errors. We close with the boundary the theory must respect: under majority-vote aggregation, individual causal value is unidentifiable.

Wed 18 NovArtificial IntelligenceComputational Engineering, Finance, and ScienceHuman-Computer Interaction
The gist
This paper looks at how humans and AI work together to make decisions, especially who adds value when both review the same item. It finds that the key factor is how well a reviewer’s confidence matches their actual accuracy, called metacognitive calibration. The authors show that just looking at behavior isn’t enough to tell experts from confident novices until correctness outcomes are considered. They also find that humans and the AI model share the same kind of self-awareness about their judgments, so the system should trust whoever is better calibrated for each case. Finally, they explain it’s impossible to identify the exact value of a single human judgment in a group decision context.
Open → 2611.24932v1

Complexity boundaries found for network Cournot competition approximations

Sharp Complexity Thresholds for Network Cournot Competition

Abstract: We determine the approximation complexity of network Cournot equilibrium as a function of demand degree and the number of firms sharing a market. For common, nonincreasing concave polynomial inverse demands, convex quadratic costs of firms' allocation vectors, and rational total capacities, high-precision approximation is polynomial-time solvable for cubic demands, regardless of market size. Quartic demands remain tractable when each market has at most three firms, and quintic demands remain tractable with at most two. These thresholds are exact: approximation at a fixed positive profit-regret tolerance is PPAD-hard for quartic demands with four firms per market, quintic demands with three, and sextic demands with two. Each hardness result uses one fixed demand curve in every market, a constant number of markets per firm, and globally nondecreasing strongly convex quadratic costs. We also give a polynomial-time algorithm for arbitrary-degree nonincreasing concave polynomial demands when each firm's convex polynomial cost depends only on its total production. The algorithm applies to arbitrary access graphs and permits firm-specific inverse demands. Its running time is polynomial in the input size and the logarithm of the inverse accuracy. The algorithm assigns one marginal charge to each firm and adjusts the charges until each firm's total sales approximate the quantity it would produce at that charge.

Wed 18 NovComputer Science and Game TheoryComputational Complexity
The gist
Network Cournot competition studies how companies set quantities to sell when they share multiple markets. This paper finds exactly when approximating these market equilibria is computationally easy or hard, based on how demand curves behave and how many firms compete in each market. The authors identify precise thresholds—such as cubic demand curves being easy and quartic or higher becoming hard under certain conditions. They also provide an algorithm that can efficiently approximate equilibrium for some cases where costs depend only on total production. This helps clarify the limits of computing equilibria in complex market networks.
Open → 2611.24931v1

Mapping organizations and connections in the AI supply chain

Mapping the AI Supply Chain: Dependencies, Vulnerabilities, and Market Concentration in the AI Ecosystem

Abstract: AI systems are built across many organizations that contribute models, data, compute, capital, talent, and other assets. While the layers of the AI stack are relatively well understood, the relationships between actors and components across layers remains sparsely documented. In this work, we focus on the organizations that make up the AI supply chain: the complex network of actors that contribute to the development and deployment of AI. We motivate the examination of the organizational AI supply chain---highlighting concerns about concentration, power, chokepoints, cascading failures, fragmented accountability, and risk---then describe our pipeline for mapping the AI supply chain. Our pipeline yields our main contribution: a multilayered, large-scale dataset of actors and relationships in the AI ecosystem, annotated with dates, descriptions, types, tags, and more. This work takes a step toward systematically mapping and measuring the AI supply chain and its properties, cataloging how models, data, chips, infrastructure, capital, and even talent flow between organizations. This data enable critical examinations of industry relationships and yield insights into the political economy of AI development and concentration. We provide several illustrative analyses, including studying the most central actors, analyzing network concentration, and identifying communities and chokepoints. While our dataset is fairly comprehensive, it is also necessarily incomplete: public documents omit private deals, and coverage is shaped by search design. Together, the approach, data, and findings aim to serve as a resource for studying the AI ecosystem. The dataset is publicly available at https://huggingface.co/datasets/sarahcen/ai-supply-chain and can be explored interactively at https://aisupplychains.org/.

Wed 18 NovComputers and SocietyArtificial Intelligence
The gist
Building AI systems depends on many companies and resources like models, data, hardware, and talent. The authors created a detailed map showing how these parts and organizations connect and depend on each other. Their work helps reveal key players, risks, and bottlenecks in the AI world. This map can help people understand the AI industry better and identify where concentration or vulnerabilities happen.
Open → 2611.24927v1

Grana improves robot reward tracking for long tasks

Grana: Compositional Reward Modeling for Long-Horizon Robot Manipulation

Abstract: Robot reward modeling faces two challenges: generalizing across tasks and accurately tracking progress in long-horizon manipulation. General-purpose reward models demonstrate broad task transfer, but transfer from short-task pretraining to long-horizon tasks remains underexplored. Long-horizon progress models often rely on task-specific subtask classifiers or fixed action vocabularies, limiting the reuse of learned progress knowledge when adapting to new tasks. To address these challenges, we introduce Grana, a vision-language robot reward model that learns to identify unfinished subtasks and estimate their continuous progress using open-vocabulary subtask descriptions. We train a language-conditioned model to estimate progress in short-horizon tasks and individual subtasks of long-horizon tasks. For long-horizon tasks, we combine the selected subtask's predicted progress with credit for preceding completed subtasks to estimate whole-task progress. General progress prediction requires training the model across diverse tasks with progress supervision that accounts for imperfect execution. Elapsed-time proxies can misrepresent progress when relative subtask durations vary, or failures reverse local progress. We therefore introduce an annotation protocol that converts sparse subtask boundaries and action-quality annotations into dense progress targets, without requiring annotators to assign numerical progress scores. Pretraining with this supervision on 200 diverse, mostly short-horizon manipulation tasks enables zero-shot reward prediction on unseen tasks and improves progress prediction after adaptation to multi-minute, long-horizon tasks. Experiments demonstrate (i) generalizable reward prediction, including adaptation to five long-horizon tasks, (ii) benefits from pretraining and composing subtask progress estimates, and (iii) improved downstream policy performance.

Wed 18 NovRobotics
The gist
Robots need to know how well they are doing at complex tasks that take a long time and have many steps. The authors present Grana, a system that helps robots understand how much progress they’ve made on subtasks described in plain language and combine that to see the overall progress. They trained Grana on many short tasks to predict progress even on longer, more complex ones without extra training. This helps robots learn better and work longer on complicated tasks by tracking their progress more accurately.
Open → 2611.24926v1

Video world model predicts object motion across robot and human bodies

Render the Robot, Generate the World: One Video World Model Across Embodiments

Abstract: Predicting the consequences of an agent's actions requires modeling both the body's motion and the environment's response. Most video world models attempt to learn both from numerical actions, even though geometry and kinematics already specify the intended motion. We introduce Doppel, an embodiment-agnostic video world model conditioned on camera-aligned renderings of future body configurations and numerical action trajectories. By explicitly providing the intended motion, Doppel can focus on predicting object motion and interaction-driven changes in the environment. Rendered motion also provides a common visual interface across different embodiments and action spaces. To train on robot datasets without camera extrinsics, we recover camera poses and align rendered trajectories with recorded observations. We jointly train a single shared video backbone and conditioning adapter on eight datasets spanning eight robot and human embodiments, from single- and bimanual robot arms to a dexterous humanoid and human hands and bodies, using about 600 hours of video without embodiment labels. Across three robot-arm datasets, Doppel improves PSNR over action-only baselines by 1.00 dB on held-out trajectories and 1.20 dB under out-of-distribution evaluation, while predicting more consistent object motion. Training on all eight embodiments (Doppel-8) improves robot predictions over the three-robot model (Doppel-3) on four of six evaluation sets. Project page: https://doppelwm.github.io/.

Wed 18 NovRobotics
The gist
It can be hard for computers to predict what will happen when robots or people move because they have to understand both the body's movements and how the environment changes. The authors created Doppel, a method that uses pictures of how the body is supposed to move along with action plans to help predict what will happen in videos. This approach works for many kinds of bodies, like robot arms or human hands, and helps focus the predictions on how objects move and interact. Training on many different kinds of bodies at once made Doppel better at predicting the future in new situations.
Open → 2611.24925v1

Agentic harness engineering improves agent capabilities with user-driven evolution

Agentic Harness Engineering Beta: Requirement-Centered Evolution of Agent Harnesses

Abstract: Real-world harness engineering is driven by explicit and implicit user requirements, which guide development and validation. However, existing harness evolution methods often overlook implicit requirements and interaction needs, while using a single evolution agent to modify the harness and benchmark scores to select changes. This process often produces narrow patches and leads to benchmark-specific local optima. We introduce Agentic Harness Engineering Beta (AHE-Beta), a requirement-centered loop that brings real-world engineering practices into harness evolution. The loop consists of three steps: (1) User-driven evaluation lets simulated users raise their requirements as issues while they work with the harness over multiple turns. (2) Team-based modification implements those requirements as generalizable changes rather than task-specific patches. (3) Requirement-driven selection merges a change only when it resolves a verified requirement and passes review. Empirically, on held-out tasks, AHE-Beta raises pass@1 from 21.9% to 33.3% while using 40.8% fewer tokens than Base Harness, and achieves higher pass@1 than Claude Code, Meta-Harness, and AHE. In a blind human A/B test, real users prefer AHE-Beta in 31 of 48 valid pairs and rate it higher on all five dimensions, matching the directional preference of the user simulator. The human A/B results show that AHE-Beta achieves its goal of aligning harness evolution with real-world user requirements. Without further evolution, the gains transfer to GLM-5.3 and DeepSeek-V4.1-Flash with pass@1 improvements of 15.8% and 5.3% over Base Harness. Together, these results show that requirement-centered harness evolution is a more general method for improving agent capabilities.

Wed 18 NovSoftware EngineeringArtificial Intelligence
The gist
Improving AI agents often involves making changes based on test results, but this can miss important user needs and create patches that only work in specific cases. The authors created a new method called Agentic Harness Engineering Beta (AHE-Beta) that focuses on evolving AI agent systems based on real user requirements collected during use. This method uses a cycle of user feedback, team collaboration to fix issues broadly, and careful review to approve changes. Tests show AHE-Beta improves AI performance on tasks, uses less computing effort, and is preferred by human users compared to other methods.
Open → 2611.24924v1

Optimal online combinatorial auctions cannot ensure half the best outcome

The Optimal Competitive Ratio for Subadditive Online Combinatorial Auctions is Less Than 1/2

Abstract: We construct a four-buyer online combinatorial auction with independent subadditive valuations and a fixed, known arrival order in which every online rule earns strictly less than $1/2$ of the expected offline optimum. A common partition, revealed at the third arrival, gives the first three buyers one unit of welfare per item. If the rule uses three distinct partitions, either an item allocated early contributes zero or the fourth buyer's expected value for the remaining bundle is one less than its size. We compute the optimal online and offline welfare exactly and show that a $1/2$ guarantee always holds with at most three buyers.

Wed 18 NovComputer Science and Game Theory
The gist
This paper looks at a type of auction where items are sold to several buyers arriving one after another, with values that don't simply add up. The authors show an example where any method used online will earn less than half the total value possible if buyers were known in advance. They find this limit happens from four buyers onwards, but if there are three or fewer buyers, a method can always get at least half the best possible total value. This means there's a hard barrier in how well online auctions can perform compared to offline ones.
Open → 2611.24920v1

Infinite Energy puzzles show varied difficulty from simple to complex

Hardness of "Infinite Energy" Puzzles

Abstract: Infinite Energy (by Light Potato, 2025) is a single-player puzzle in which one wires a network of sockets so that, after every power source is unplugged, energy keeps circulating and leaves every board energized. We study several variants of the game and the complexity of deciding whether an instance can be won. The variants can be played at https://infinite-energy-peer-review.netlify.app, which also has worked examples of the reduction techniques. The colorless game, with connectability given by an arbitrary matrix, is NP-hard (by reduction from Hamiltonian Path) and lies in PSPACE. We give a seven-socket instance winnable only by charging a temporary battery loop and then breaking it, so the natural "charge and keep" strategy fails. We reduce NP-membership to one conjecture: that every winnable instance has a winning play in which no socket is charged twice. Two variants bound the complexity more tightly. The unconstrained variant, in which connectability is unrestricted, is $\mathsf{TC}^0$-complete under $\mathsf{AC}^0$ Turing reductions (hence in L). The geometric variant, in which connectability is set by proximity of points in $\mathbb{R}^k$, stays NP-hard for every fixed $k \ge 2$ via reduction from Hamiltonian Path over grid graphs. The one-dimensional case is open. The colored variant is NP-hard, though a matching upper bound remains open.

Wed 18 NovComputational Complexity
The gist
Infinite Energy is a puzzle game where you connect sockets so energy circulates endlessly after unplugging power sources. The paper studies how hard it is to solve different versions of this game. Some versions are very hard to decide (in computer science terms, NP-hard), while simpler versions can be solved efficiently by computers. The authors also found tricky cases where common strategies fail and identified open questions about certain game variations.
Open → 2611.24918v1

Unified method performs nearly all visual tasks from images

Unified Law for Visual Tasks (The Four Laws of Computer Vision)

Abstract: In this paper, we propose a Unified Law for Visual Tasks, which could be further divided into Four Laws of Computer Vision, with the goal of enabling a single framework or method to uniformly train on and perform nearly all visual tasks. Our starting point is an inspiration and hypothesis: if the world information is encoded into image, which we call World Snapshots, then image processing is world processing, and image generation is World Snapshot generation. Furthermore, if all visual and visualization tasks can be reformulated as generation tasks, then a unified method, World Snapshot Models (WSMs), can perform the vast majority of visual tasks, much as large language models have largely unified natural language processing. This paper validates these laws across more than 1,000 trained and evaluated visual tasks (defined by distinct input-output mappings) and presents a unified training framework for future visual-task research and applications.

Wed 18 NovComputer Vision and Pattern Recognition
The gist
This paper suggests that all visual tasks, such as recognizing objects, segmenting images, and generating new images, can be treated as a single type of problem: creating or interpreting 'world snapshots' captured as images. The authors propose four fundamental laws of computer vision that support this idea and introduce a unified training method called World Snapshot Models. They tested their approach on over 1,000 different visual tasks and found it works broadly across them. This approach aims to make visual computing tasks simpler by using one framework instead of many specialized ones.
Open → 2611.24917v1

PrismRestore compacts multi-task image fixes into one model

PrismRestore: A Compact Restoration Toolbox for Agentic Image Restoration

Abstract: Agentic image restoration composes operations to handle mixed degradations, yet its toolbox often requires storing multiple restoration networks. We propose PrismRestore, which constructs a compact bank of callable restoration actions from a single frozen all-in-one model. Our approach builds on task-dependent yet overlapping channel responses in the shared model. An offline task-prior search uses activation and gradient statistics to group channels with similar response profiles, then searches task-specific modulation coefficients over non-representative channels while leaving representative channels unmodulated. The resulting prior bank enables explicit action selection and composition without additional restoration backbones or task-specific adapter modules. A state-conditioned policy learns to compose these actions using Group Relative Policy Optimization. Its objective separately normalizes fidelity and perceptual feedback within groups of trajectories sampled for the same input, and combines terminal evaluation with return-to-go derived from stepwise quality changes. Experiments on synthetic composite-degradation and real-world multi-task benchmarks show improvements over the evaluated all-in-one baselines and restoration quality competitive with multi-model agents. PrismRestore achieves these results with a single restoration backbone and faster inference than the evaluated agentic baselines.

Wed 18 NovComputer Vision and Pattern Recognition
The gist
Handling images with many kinds of damage usually means storing many separate fix-it tools. The authors propose PrismRestore, which creates a small set of fix-it actions from one all-in-one model. It groups parts of the model based on how they react to tasks, then picks which parts to adjust for each kind of fix. A policy learns to combine these actions for the best image restoration quality, all with one model that runs faster than other multi-tool approaches.
Open → 2611.24915v1

P-selective language recognition needs quarter n squared advice bits

A Sharp Quadratic Bound for the Advice Complexity of Selectors

Abstract: A language is P-selective if a polynomial-time algorithm, given two strings, picks one that belongs to the language whenever either does. Ko showed in 1983 that every P-selective language is recognized in polynomial time with quadratic advice; his argument uses $n^2+n$ bits, and for polynomial-time recognition the leading constant has stood since. We show that the right constant is $1/4$. In the selector-query model the answer is unconditional. A single computable decoder recognizes every legal cut on $n$-bit strings with $n^2/4+O(n)$ advice bits and $n$ nonadaptive comparisons. Conversely, every randomized decoder making polynomially many queries needs $n^2/4-O(n\log n)$ bits at error $1/3$, even when its queries are adaptive evaluations of individual-degree-two extensions of the selector table. The degree matters: with multilinear extensions, $n+1$ bits suffice and are optimal. Under the hypothesis that $\mathrm E$ requires exponential-size circuits with SAT gates, every P-selective language has a polynomial-time decoder with $n^2/4+O(n)$ advice bits. From this hypothesis no relativizing argument, and no argument that algebrizes with degree-two extensions, can lower the constant: one oracle satisfies the hypothesis and carries a selective language that needs $n^2/4-o(n^2)$ bits against randomized decoders with degree-two access. The cost is set by the two strong components of the selector tournament adjacent to the cut. If the smaller has $2^v$ vertices, the cost is $u(n-u)\pm O(n\log n)$ with $u=\min\{v,n/2\}$. When $\log n\ll v=o(n)$ this is $(1+o(1))nv$, attained in polynomial time with no hypothesis. The upper bounds rest on a fixed-point distribution on the vertices of a tournament. Its power moment shows that $2^{r^2-O(r)}$ different $r$-tuples cover any side, for a suitable $r$.

Wed 18 NovComputational Complexity
The gist
P-selective languages are special sets of strings where a fast algorithm can choose a string that belongs to the language from any pair. The authors found the exact amount of extra information (called advice) needed for a polynomial-time algorithm to recognize these languages. They proved that about one quarter times n squared bits of advice are necessary and sufficient, improving on the previous known bound. This result also sets limits on how much this requirement can be lowered by certain complexity assumptions or query types.
Open → 2611.24913v1

Neural network training outside teacher signals harms performance

Decomposing SGD Dynamics in Neural Networks: Teacher-Induced Spikes and Variance Inflation

Abstract: We study two-layer neural networks trained by stochastic gradient descent (SGD) on a multi-index teacher model, focusing on how first-layer parameters orthogonal to the teacher subspace affect generalization. We decompose the first-layer weights into a signal component aligned with the teacher and an orthogonal complement, and analyze their joint SGD dynamics together with the second layer in the proportional limit. We show that although SGD updates to the complement are initially isotropic, the training dynamics induce teacher-dependent spectral spikes in the complement Gram matrix. This emergent anisotropy provides a concrete mechanism by which representation variance is amplified, and generalization degrades. To isolate this effect, we introduce Decomposed Dynamics, an analytically tractable surrogate whose asymptotic test-error dynamics coincide with those of SGD. In simulations with a ReLU student, freezing the directions of the orthogonal complement improves generalization relative to training them. Finally, we show that the signal component rapidly aligns with the second-layer weights, revealing strong cross-layer coupling even in this shallow setting. Together, our results provide a dynamical explanation for how feature learning outside the teacher subspace harms generalization.

Wed 18 NovMachine Learning
The gist
Training neural networks often involves learning meaningful patterns called teacher signals. This paper finds that parts of the network that learn unrelated patterns can create noise and worsen the network's accuracy. The researchers developed a method to isolate and understand this harmful effect during training. They also found that keeping these unrelated parts fixed can actually improve performance. This work helps explain why focusing learning on useful features is important for better results.
Open → 2611.24908v1

Parallel algorithm maintains core numbers quickly for dynamic graphs

Batch-Dynamic Coreness and Applications with Logarithmic Work via Balanced Pressures

Abstract: We give a parallel algorithm that maintains a one-sided $(2+\varepsilon)$-approximation of all core numbers under batches of edge insertions and deletions. For fixed $\varepsilon>0$, the expected amortized work is $O(\log n)$ per edge update, and each batch has deterministic polylogarithmic depth. This improves on the previously known $(4+\varepsilon)$-approximation and $O(\log^2 n)$ amortized work bounds. This approximation factor approaches the factor-two limit for polylogarithmic update and query time under the OMv conjecture. Our algorithm is based on assigning each vertex a "pressure" and splits each edge's unit load smoothly between its endpoints according to their pressures. After each batch of updates, our dynamic algorithm adjusts the pressures of vertices in parallel to restore balance between the pressures and loads. We show that by maintaining balanced pressures we can obtain good approximations of core numbers. Our construction also gives a $(1+\varepsilon)$-approximation of the densest-subgraph value with logarithmic expected amortized work and supports batch-dynamic maximal matching, clique counting, forest decomposition, and coloring in low-arboricity graphs with improved or matching work bounds. We give a practical implementation of our batch-dynamic coreness algorithm and find that it is able to achieve smaller empirical error than the state-of-the-art parallel batch-dynamic implementation, while running faster. On six real-world graphs, it runs $32\times$ faster than that implementation in geometric mean and $4.1\times$ faster than a state-of-the-art heuristic baseline. On three graphs with up to 1.8 billion edges, it is $9.2\times$ faster than the heuristic baseline.

Wed 18 NovData Structures and Algorithms
The gist
Graphs—networks of connections—often change over time, and understanding how tightly connected parts of these graphs are is important for many uses. The authors introduce a new method that quickly estimates these connection levels when many connections change at once. Their approach assigns each point in the graph a pressure value and adjusts these pressures in parallel to keep the network balanced. This method is faster and more accurate than previous attempts and works well even on very large real-world graphs.
Open → 2611.24905v1

ShadowTransfer benchmark reveals limits of geographic shadow detection

ShadowTransfer: A Geographic Transfer Benchmark for Overhead Shadow Detection

Abstract: Overhead aerial imagery feeds dense-prediction pipelines that are routinely trained in one geographic region and deployed in another, yet no benchmark measures how shadow detection models transfer across regions. Existing overhead shadow datasets either lack a geographic transfer protocol or rely on automatically generated labels. We introduce ShadowTransfer, a benchmark of 4,500 human-verified shadow masks across three U.S. cities at two native resolutions, paired with a leave-one-city-out evaluation protocol. Under vanilla training, holding out the test city costs 3.5 to 7.8 mIoU across four architectures, the gap remains significant when the training set grows from 225 to 900 images, and six of eight adaptation methods degrade more than vanilla training on average. We propose a three-probe framework that diagnoses where and how the transfer breaks: the failure operates in feature space, beyond the reach of pixel-histogram matching, shows up as a confidence collapse on shadow pixels while background confidence stays intact, and is recoverable by retraining different architectural components depending on the model: encoder for some, decoder for others. These findings replicate on INRIA building footprints, suggesting they describe geographic transfer beyond shadows. Guided by the diagnosis, we build Spectral Information Bottleneck (SIB), a plug-in module with one component per finding. Across the 9 (architecture, held-out city) cells, SIB has the smallest mean gap to the within-city upper bound of the ten methods we evaluate (6.42 mIoU), level with FDA. The benchmark, LOCO protocol, code, and trained models are released to support reproducible evaluation of geographic transfer in overhead dense prediction.

Wed 18 NovComputer Vision and Pattern Recognition
The gist
Detecting shadows in aerial images is important but models trained in one city often fail in others. The authors created ShadowTransfer, a dataset with hand-verified shadows across three U.S. cities to test this problem. They found that models' performance drops notably when applied to new cities, and many usual methods to adapt them actually worsen results. To understand why, they diagnosed specific failures mostly in the model’s features and confidence. Using these insights, they designed a new module, Spectral Information Bottleneck, which improves transfer performance closer to the best within-city results.
Open → 2611.24904v1

Local mining improves distributed event rule detection with less communication

Mine Locally, Verify Globally: Exact Recovery, Compilation, and Distortion of Mined Temporal Rules

Abstract: Specification mining extracts temporal rules that describe relationships between events in recorded system traces. Applying these rules in distributed monitoring systems is more difficult because observations come from different nodes, whose clocks may not be synchronized, and events may be lost or reordered during transmission. In this paper, we study how to aggregate the coverage of mined rules across observers, determine whether their temporal windows are needed during monitoring, and characterize their detection under event loss. Our evaluation uses IPv6 packet traces collected from 21 receivers across four continents. We show that local mining followed by global confirmation recovers centralized rule coverage under suitable conditions while substantially reducing communication overhead. In contrast, merging traces with unaligned clocks can distort coverage by introducing incorrect temporal matches. A window-gain criterion identifies rules that require temporal state, while our loss analysis and broker experiments demonstrate why contiguous losses can be more damaging than independent losses. The results identify separate requirements for aggregating observations, selecting monitor state, and handling event loss.

Wed 18 NovDistributed, Parallel, and Cluster ComputingLogic in Computer ScienceNetworking and Internet Architecture
The gist
When computers watch events happening on different machines, it’s tricky to combine what they see because clocks can be unsynchronized and some information might get lost. The authors studied how to collect and check patterns of these events efficiently by mining rules locally and then verifying them globally. This reduces the communication needed and still finds the important relationships between events. They also figured out when keeping track of timing details is important and how losing events affects detection accuracy.
Open → 2611.24902v1

Family barriers to stopping elder scams on reddit and baidu tieba

"I Don't Think It's a Scam": A First Look at Family Intervention Barriers in Elder Abuse Discussions on Reddit and Baidu Tieba

Abstract: When older adults trust scammers despite warnings, families face obstacles to intervention. Complainants aged 60 and older reported \$4.9 billion in losses in 2024 to the U.S. Internet Crime Complaint Center. To investigate family intervention barriers to elder scams, we collected 2M Reddit posts from May 2021 to June 2026 and 2B Baidu Tieba posts from 2007 to 2026. The final corpora contain 13,082 Reddit posts and 3,933 Baidu Tieba posts, labeled using platform-specific codebooks, manual reference annotations, and LLM coding. Through a mixed-methods analysis, we find that scams often extend beyond a single incident and are reported alongside debt problems and broken family relationships. In 68.0\% of Reddit posts recording reactions, older adults showed resistance or continued involvement; in Baidu Tieba family-confrontation posts, 41.9\% showed continued belief. Relatives identified fraud in 74.4\% of Reddit posts and narrated cases on Baidu Tieba, but without the victim's consent, relatives may lack the legal authority to intervene. In Reddit posts recording reactions, account locks or credential changes appeared in 8.9\% under resistance or continued involvement, compared with 33.3\% under acceptance. Measures such as phone or network monitoring and financial takeover were reported more often under resistance. Recovering funds is very limited in posts recording follow-up results of fraud; Baidu Tieba users reported that police classified older adults' voluntary transfers as civil disputes.

Wed 18 NovSocial and Information NetworksCryptography and SecurityComputers and Society
The gist
Older adults sometimes fall victim to scammers even when their families try to help. The authors looked at millions of online posts to understand why families struggle to stop these scams. They found that many older people resist help or keep trusting scammers, making intervention harder. Also, legal obstacles and limited police support make it difficult for families to act. This study highlights how scams often cause ongoing problems beyond money loss, affecting family relationships too.
Open → 2611.24899v1

Equivariant modeling framework speeds scientific predictions with fewer parameters

Equivariant Modeling with Polynomial Features via Minimal Homogeneous Generators

Abstract: We present a general framework for modeling and learning equivariant functions between finite dimensional semisimple real group representations, unifying constructions developed across many application areas. Our model is a linear combination of equivariant polynomial features whose coefficients are arbitrary learnable functions of invariant polynomial features. We take as features minimal homogeneous generators for the invariant algebra and the covariant module over the invariant algebra, up to prescribed degrees. We provide a Python package that automatically computes these features and fits the resulting models to training data. The algorithm for feature computation requires explicit isotypic decompositions of the input and output representations, along with explicit Clebsch-Gordan decompositions of the tensor product of irreducible representations, and achieves speedups over alternative methods in computational algebra. Numerical experiments in scientific modeling demonstrate the full learning pipeline and yield accurate predictors with few trainable parameters, using the model both for end-to-end prediction and within layers of larger architectures.

Wed 18 NovMachine Learning
The gist
Predicting how things change when you move or rotate them is tricky, but important in science and engineering. The authors developed a general way to build models that keep track of these changes correctly using special polynomial features. Their approach finds the simplest building blocks to represent these changes and learns from data efficiently. They also created software that automates this process, making it faster than existing methods. This helps make accurate predictions with smaller, easier-to-manage models.
Open → 2611.24896v1

ProvCards enable portable provenance tracking across diverse scientific workflows

ProvCards: Artifact-Oriented Provenance for Heterogeneous Scientific Workflows

Abstract: Reproducibility in scientific workflows is hindered by heterogeneous components and execution environments, as well as fragmented provenance capture. Although existing approaches offer established semantics and workflow-specific solutions, provenance remains difficult to capture, exchange, and compose across workflow boundaries. We present ProvCards, an artifact-oriented approach that treats provenance as a first-class artifact grounded in the W3C PROV Data Model. Individual workflow components can generate cards that are stored, exchanged, reused, and composed independently of any workflow system or centralized execution context. ProvDecks group related cards into portable scopes while preserving their identities. ProvGraphs provide derived views for provenance reconstruction, querying, visualization, and analysis. Together, these representations support coherent, task-specific provenance views across heterogeneous components, facilitating traceability, reuse, and reproducibility. We implement ProvCards using a graph-based infrastructure and evaluate them in a scientific data-processing workflow. The results demonstrate independent provenance capture at the component level, composition across component boundaries, and reconstruction for querying and analysis. ProvCards provide a portable, composable, and incrementally extensible foundation for provenance management in heterogeneous scientific workflows.

Wed 18 NovDatabases
The gist
Keeping track of how scientific results are made is hard because many different programs and systems are used together. The authors present ProvCards, which treat this tracking info as stand-alone digital cards that can be shared and combined independently of the systems that made them. These cards can be grouped and visualized to understand the full history of data across different tools. This helps scientists better trace, reuse, and repeat experiments even when using many varied software components.
Open → 2611.24894v1

User simulator evaluation methods miss key behavior errors in interactive agents

On Evaluating User Simulators for Interactive Agents

Abstract: User simulators offer a scalable way to evaluate interactive agents, but how to assess their quality remains underexplored. In particular, it is unclear whether existing user simulator evaluation frameworks reliably detect meaningful failures in simulated user behavior. This uncertainty makes it difficult to interpret simulator evaluation. To understand what a high benchmark score tells us about simulator quality, we (meta-)evaluate the metrics themselves. To instantiate this meta-evaluation, we deliberately perturb simulated replays to induce failures such as altered goals, omitted constraints, premature stopping, and acceptance of broken work, then test whether the metrics penalize these failures. Evaluation methods from three prior studies detect only 5-6 of the 10 perturbations; their combined scores even favor populations instructed to accept broken work over unmodified controls. Motivated by these gaps, we propose a new evaluation suite that combines utility of user simulators for evaluating agents and two measures of fidelity to real users: population-level fidelity assesses collective interaction patterns, while trace-level fidelity assesses the preservation of individual users' goals, constraints, and persona. Under the same detection criterion, our evaluation suite detects all 10 perturbations. Evaluating six user simulators on 351 real multi-turn sessions in which 348 distinct users across 23 languages and agents work together to create and refine artifacts such as full-stack web apps, games, design assets, and automated workflows, we find that population-level measures can miss when a simulated user pursues the wrong goal, ignores a constraint, or behaves out of character, highlighting the need to assess fidelity at comprehensive granularities.

Wed 18 NovMachine Learning
The gist
Testing computer programs that talk to users usually uses simulated users to save time, but it's hard to tell if these simulations are really good. The authors checked whether tests for simulated users can spot when the simulated users make big mistakes, like ignoring goals or stopping too soon. They found older tests often miss these errors. The authors made a better testing method that catches all the problems and shows how to verify simulated users match real users closely in how they behave and what they try to do.
Open → 2611.24892v1

Cap-and-Track improves large model requests using adaptive dispatch

Cap-and-Track: Optimizing LLM Inference Request Dispatch Across Shifting Capacity

Abstract: A fixed dispatch rate for LLM inference becomes stale as serving fleets resize and request sizes change. Generative output length is unknown at admission, and shared provider pools can lose capacity. We present Cap-and-Track, a design for asynchronous inference across provider capacity and internal GPUs. Meta's traffic shaper implements Cap-and-Track for post and live-video understanding. Refusals signal the backend's current admission ceiling. Durable priority queues hold excess work outside execution, including refused requests for retry. Cap is a fail-fast admission check at the saturated resource that refuses work before a long wait. Using only those refusals, the Track dispatcher probes upward and backs off. It follows the ceiling without output-length prediction or a fleet-level rate to retune. In a concurrent same-traffic production A/B, the shaper ran per-replica Cap plus Track. It served a classifier on 43% fewer H100s than its queued, fixed-rate precursor, though lower-priority work waited longer at backfill peaks. In steady-capacity real-engine replay, Track ran within 1% of the goodput of a fixed rate tuned above measured capacity, with about a quarter of that rate's refusal share. The shaper carries more than 300 million online requests and hundreds of terabytes of media a day. During a backfill, it handled 1.1 billion requests in its busiest 24 hours. Lessons include keeping queues inside inference engines just long enough to fill batches, steering dispatch by capacity refusals alone, keeping dispatch stateful, and sizing fleets by how long low-priority work can wait.

Wed 18 NovMachine Learning
The gist
Handling requests to big AI models is tricky because it's hard to know in advance how long each response will be. The authors created Cap-and-Track, a method that watches when the system refuses work due to capacity limits and adjusts how many requests to send accordingly. This helps keep the system busy without overloading it or making requests wait too long. It was tested at Meta and helped save computing resources while still handling lots of requests smoothly.
Open → 2611.24891v1

Improved cost estimates for lost sales and dual sourcing inventory models

Improved Asymptotic Approximation Guarantees for Continuous-Review Lost-Sales and Dual-Sourcing Inventory Models

Abstract: We study continuous-review inventory models with unit Poisson demand and deterministic lead times: single sourcing with lost sales and dual sourcing with backlogging. Xin [Operations Research. 70(1):111--128 (2022)] establishes an asymptotic approximation factor of 1.79 for each model in its proportional-growth regime. Under the same assumptions, we obtain a factor of 1.248977 for the better of base-stock and constant-order policies for lost sales and a factor of 1.599528 for the better of dual-index and tailored base-surge policies for dual sourcing. The benchmark is the optimal long-run average cost over all policies using only current and past information. For lost sales, lead time and the lost-sales penalty grow proportionally. For dual sourcing, the lead-time difference grows proportionally to the express premium, the extra unit cost of faster supply, while express lead time and backorder penalty remain fixed. For sufficiently large fixed backorder penalties, the dual-sourcing factor improves to 1.248977. The improvements follow from stronger lower bounds on the optimal cost. We retain intermediate constraints on mean inventory for lost sales and use events determined only by future demand to bound backlog costs for dual sourcing.

Wed 18 NovData Structures and Algorithms
The gist
The paper looks at how companies can better manage inventory when demand follows a random pattern and supply takes time to arrive. The authors improve previous mathematical guarantees on how close certain straightforward stocking strategies come to the best possible method. They focus on two cases: one where unsold demand is lost forever and one where delayed supply uses two sources, one faster and more expensive. Their findings help estimate how well simple policies perform compared to any complex method in the long run.
Open → 2611.24889v1

Large language models try to imitate specific people in chat

Who are you? The Personal Imitation Game

Abstract: Large Language Models (LLMs) now perform strongly on Alan Turing's 1950 Imitation Game, so we propose a harder challenge, the Personal Imitation Game, which asks whether a machine can replicate a specific individual in conversation rather than a generic human. Testing with 30 participants, we establish a human baseline and report the identity signals interrogators rely on: stylometric features, personality traits, and biographical facts. To demonstrate the framework, we design an LLM-based system that plays the game for one of the paper's authors, drawing on an autoethnographic dataset spanning ten years of personal digital communication. In a 20-person deception study, interrogators choose our system over the author's own friends in 7 of 10 rounds, and the author over our system in 13 of 20; neither rate is distinguishable from chance at this sample size. We consider design improvements, applications of personal AI agents, and implications for identity and privacy.

Wed 18 NovHuman-Computer InteractionArtificial IntelligenceComputation and Language
The gist
Instead of asking if a computer can act like any person in conversation, this paper asks if it can imitate one particular person. The authors tested a new challenge where a machine uses personal writing and chats collected over ten years to mimic one of the paper's authors. Human judges often couldn’t tell if they were talking to the real person or the computer system, showing the machine could pass as that individual sometimes. The work also looks at how this technology might affect privacy and the idea of personal identity.
Open → 2611.24888v1

AI system breaks down and tracks research idea steps for novelty

Ground, Iterate, Trace: Decomposing AI Research Ideation

Abstract: Large language models have been widely used to generate plausible research ideas, yet it remains unclear what makes automated ideation effective and how generated novel proposals arise from prior scientific work. We introduce the Creative AI Researcher (CAR), an agentic framework combining literature grounding, iterative development and explicit conceptual operators. CAR constructs a semantic knowledge graph from retrieved literature and equips an ideation agent with graph-retrieval tools and four operators: bisociation, analogy, exploration and elaboration. Each operator call is checked against structural acceptance conditions and recorded, producing a trace of intermediate transformations and declared literature sources. We evaluate CAR with two language-model backbones across 40 LiveIdeaBench research topics and two execution benchmarks. CAR achieves significantly higher methodological novelty (MN) than single-shot prompting and The AI Scientist. Its methodological novelty does not differ significantly from the Research Ideation Agent, while its feasibility scores are higher on both backbones. With a shared experiment executor, CAR achieves the highest pairwise win rate among the evaluated AI methods on FML-bench-Lite and BioXArena. In a ten-condition ablation study, MN point estimates favor CAR over one-step proposal on both backbones, but no MN contrast survives correction for multiple comparisons. The results do not establish a consistent quality benefit from explicit operators beyond free-form iteration. CAR makes the sequence of operations and declared literature sources inspectable, separating judged idea quality from procedural traceability.

Wed 18 NovComputation and Language
The gist
It is hard to know what makes AI-generated research ideas good or new. The authors created a system called CAR that builds a graph from scientific papers, then uses special steps to invent ideas and keeps track of those steps and sources. When tested, CAR made ideas that were more novel and practical than some other AI methods, but the advantage of the special steps was not always clear. The system helps people see how ideas emerge from existing knowledge and the reasoning path taken.
Open → 2611.24887v1

Robotic haircutting improves internet control despite real delays

Teleoperated Haircutting with Delay Compensation and Passivity-Based Control for Unilateral Internet Teleoperation under Real Communication Uncertainties

Abstract: Robotic haircutting requires accurate motion execution and reliable communication to safely reproduce the operator's commands. Internet-based teleoperation is a key enabling technology to remotely perform precise manipulation tasks such as haircutting. However, communication uncertainties, including variable transmission delays and packet jitter, degrade synchronization between the master and slave systems and affect tracking performance. This paper presents a unilateral Internet teleoperation framework for robotic haircutting that takes into account experimentally measured communication uncertainties. Three delay-compensation techniques, namely Zero-Order Hold (ZOH), First-Order Hold (FOH), and Low-Pass Filtering (LPF), are evaluated together with a classical proportional-derivative (PD) controller and a passivity-based synchronization controller. Unlike conventional studies based on synthetic delay models, the proposed framework is validated using communication data acquired from a real cloud-based teleoperation platform, where both packet delay and effective delay are characterized. The results demonstrate that combining delay-compensation techniques with passivity-based synchronization improves the robustness of unilateral Internet teleoperation under realistic communication uncertainties, providing a reliable control framework for robotic haircutting applications.

Wed 18 NovRobotics
The gist
Performing a haircut using a robot controlled over the internet is tricky because network delays and interruptions can cause the robot to move incorrectly. The paper shows how combining several methods to handle delay with a special safety control improves the robot’s ability to follow commands accurately. The authors tested their approach using real internet communication data rather than simulated delays. Their method makes remote robotic haircutting more reliable despite the natural hiccups of internet communication.
Open → 2611.24883v1

Learning multiple accurate models from one dataset reduces shared errors

Monoculture Robust Learning

Abstract: We introduce a notion of monoculture robustness in Probably Approximately Correct (PAC) learning, as a way to mitigate the problem of algorithmic monoculture (Kleinberg and Raghavan, 2021): the tendency of models sharing the same components (e.g., training data) to fail on the same inputs. Specifically, we ask whether a learner with access to a single dataset can output $k$ individually accurate hypotheses whose joint failure probability is comparable to training on $k$ independent datasets. We say that such a learning procedure achieves monoculture robustness, and we quantify this by bounding the conjunctive error that all $k$ hypotheses misclassify points in an individual sense. We design methods for achieving this type of guarantee by drawing a surprising connection between replicability (Impagliazzo et al., 2022) and monoculture robustness. Specifically, we show that if the base learner is $ρ$-replicable, then running it independently $k$ times on the same sample yields individual monoculture error that shrinks exponentially with $k$, controlled by the single-run error of the base learner at the point and $ρ$. We complement these positive results with a lower bound: for individual monoculture robustness, we prove a worst-case lower bound showing that, for learners, driving the individual conjunctive error down to $γ$ can require a sample-size multiplier of $t = Ω(\log(1/γ))$.

Wed 18 NovMachine Learning
The gist
When many computer programs learn from the same data, they tend to make mistakes on the same tricky examples, which is a problem called algorithmic monoculture. The authors introduce a way to measure if one dataset can produce multiple good models that don’t all fail on the same examples. They connect this idea to a concept called replicability, showing that running a reliable learner several times can create diverse models whose errors don’t overlap much. They also explain that to reduce these shared errors significantly, you might need much more data.
Open → 2611.24881v1

Local ai agents measured for energy and time costs in power electronics

Local AI Agents in Power Electronics Simulation: Deployment, Measurements and Costs

Abstract: Agentic artificial intelligence (AI) is emerging in power electronics, where it drives the simulation loop that engineers used to close largely by hand. In this loop, a converter design, or a study of the network it connects to, is built, run, measured and revised until it satisfies its specification. Such an agent can be served from a cloud API or from an inference device on the premises. For organizations whose designs, customer data or export-controlled material cannot leave the site, and whose simulators are licensed there, local deployment is the natural choice. In such a deployment, the agent becomes an electrical load on the organization's own equipment, i.e., every run consumes power and energy on a local device, generates tokens and takes time. However, existing work focuses mainly on what the agent can achieve with cloud-hosted models. What a local deployment costs in power, energy, tokens and time on real simulation tasks, and what its choices trade against one another, has received little quantitative investigation under comparable conditions. To address this gap, a systematic evaluation framework is presented in this paper. It applies locally served models to agentic power electronics tasks, from the converter level to the system level, and measures their power, energy, token and time costs. Based on these measurements, the capability boundary of a local agent on such tasks and the cost per solved task are characterized. The results are expected to provide practical insight for the use of agentic AI in power electronics and the power systems it serves.

Wed 18 NovArtificial Intelligence
The gist
Designing power electronics often involves testing and tweaking simulations repeatedly. The authors studied how AI agents running on local devices (not cloud servers) perform these tasks, measuring their power use, energy consumption, and run time. They found that these local AI setups come with real costs in electricity and time, which is important for organizations that can't send data to the cloud. Their work gives practical numbers and limits for using AI locally in power electronics design.
Open → 2611.24880v1

Large language model audits clinical prediction models with high accuracy

Auditing black-box clinical prediction models with a large language model through queries alone: a blinded test with planted flaws

Abstract: Large language models (LLMs) are used to explain clinical prediction models, on the promise that they can say what a model computes, find its faults and even reveal new knowledge in it. We tested the three promises where the answers could be checked. From the International Stroke Trial we trained four kinds of model (logistic regression, explainable boosting machine, gradient-boosted trees, neural network) for two outcomes on patients randomised earlier, planted one flaw in each of 24 copies (an under-predicted subgroup, a reversed risk factor or an implausible step) and mixed them with the 8 clean models. GPT-6 Astra audited each model three times, blind, through a tool that only returned the model's predictions; the judging rules were committed before any run and applied by program. Its surrogate models, with a median of 128 terms, reproduced the audited models' log-odds with a mean $R^2$ of 0.976 (0.959 for an additive surrogate of 42 terms fitted by an analyst). It found the planted flaw in 69 of 72 runs (96%; 95% CI 80% to 99%); a script written for the purpose found all 24. It also reported many more problems: 60% of 1,089 checkable reports failed the pre-specified check against the model's average behaviour; post hoc, most of these were real but small steps, and 15% of the checkable reports were not found in the model. Of 601 unexpected relationships it read out of the clean models, 11% held in patients randomised later (random pairs 6%; a regression scan's shorter list of its strongest candidates, 28%); after a check on the training data, 33% against 30%. With query access alone, an LLM can describe a black-box model faithfully and find nearly every planted flaw, as a purpose-written script also did; its reports of problems must be checked on the model and its discoveries on data.

Wed 18 NovMachine LearningArtificial Intelligence
The gist
It is hard to check if computer models used in medicine are working correctly or if they have hidden problems. The authors trained different medical prediction models and secretly added mistakes to some of them. They then asked a large language model, GPT-6 Astra, to find these mistakes just by looking at the models' predictions. The model found almost all the hidden flaws and gave detailed explanations, although some of its extra findings needed further checking. This shows that large language models can help safely review complex medical prediction tools without needing full access to their inner workings.
Open → 2611.24877v1

Multi-agent system creates targeted driving scenarios for testing

Learning to Interact in Multi-Agent Self-Play for Controllable Autonomous Driving Scenario Generation

Abstract: Large-scale, multi-agent self-play trains robust driving policies effectively in simulation, but controlling these models to generate specific, safety-critical edge cases remains a key challenge. Existing goal-conditioned self-play frameworks rely primarily on static map-location goals and fail to reliably produce complex agent interactions such as aggressive tailgating or adversarial cut-offs. These agent interactions are necessary for rigorous autonomous vehicle (AV) testing. To address this, we present an extended multi-agent self-play framework that introduces agent-relative dynamic goals. By conditioning policies on this extended goal representation, our framework enables targeted, controllable scenario synthesis. We demonstrate that our approach successfully generates interactive driving behaviors that static-goal baselines cannot simulate, providing a flexible tool for long-tail scenario generation in AV testing.

Wed 18 NovRoboticsMachine Learning
The gist
Testing self-driving cars requires simulating tricky situations where cars interact in risky ways, like tailgating or cutting off others. The authors found that existing simulation methods focus on fixed map goals and can't easily create these complex interactions. They developed a new approach that lets simulated cars pursue goals relative to other cars, enabling more realistic and controllable scenarios. This helps test autonomous vehicles better by exposing them to rare but important driving behaviors.
Open → 2611.24876v1

TangentPDE improves neural PDE operators with local sensitivity training

TangentPDE: Learning Local Operator Responses with Sparse Finite-Difference Supervision

Abstract: Neural PDE operators are often optimized through state reconstruction, which largely constrains operator values at observed inputs but does not fully characterize their sensitivity to local perturbations. A more faithful approximation of operator behavior requires not only accurate state predictions, but also correct variations along local perturbation directions. We present TangentPDE, which uses finite differences to approximate directional derivatives and constructs task-relevant finite-step responses from the state outputs of a reference solver at sparse paired inputs. Its objective jointly constrains state fidelity, response-direction alignment, and response-magnitude calibration, thereby learning both operator values and their local variations. Because the response labels are constructed solely from state outputs at paired inputs, the method requires neither explicit derivative labels, linearized or adjoint PDE solves, nor full Jacobians, and remains applicable to nonlinear solvers without derivative interfaces. Building on this, we additionally propose a selectively executed adaptation mechanism to strengthen local operator representations under finite-difference supervision. Budget-matched and correspondence-perturbed controls isolate the effect of relational supervision from improvements attributable to additional state observations or increased data volume. Designed as a plug-and-play training framework, TangentPDE integrates with diverse neural-operator backbones. Across four PDE systems and 20 task-backbone settings, TangentPDE lowers the three-seed mean state error in 18 settings and the corresponding Rollout@20 error in 18, while intrinsic finite-step response gains are strongest on DiffReact and remain task- and backbone-dependent elsewhere.

Wed 18 NovMachine Learning
The gist
Solving partial differential equations (PDEs) with neural networks usually focuses on matching the final solution but overlooks how the solution changes when inputs are slightly altered. The authors present TangentPDE, a method that teaches neural models to better understand these local changes by comparing how small input tweaks affect outputs using finite differences. This approach doesn’t need complex derivative calculations and works with nonlinear PDE solvers. Their tests show TangentPDE reduces errors in many cases by learning both the solution and its local variations more accurately.
Open → 2611.24873v1

Microarchitecture aware assertion generation improves cpu verification

MicroAssert: Microarchitecture-Aware Structured Assertion Generation for CPU Verification

Abstract: Automatic assertion generation reduces manual verification effort, yet existing approaches struggle to capture microarchitectural behaviors and cross-region interactions in CPUs. We present MicroAssert, a microarchitecture-aware framework that identifies functional regions directly from RTL and generates local and composite assertions through structured contracts and deterministic verification primitives. Coverage-guided feedback further improves verification completeness by progressively expanding proof-relevant RTL coverage. Evaluated on five open-source RISC-V CPUs against three existing assertion generation approaches, MicroAssert achieves 100% syntax correctness and complete branch, statement, and toggle coverage, with an average proven rate of 74.82% and Proof Core coverage of 90.96%. Mutation testing further demonstrates its advantage, achieving an average error detection rate of 28.73%, 1.99 to 3.51 times higher than existing methods. These results demonstrate the effectiveness of microarchitecture-aware assertion generation.

Wed 18 NovHardware ArchitectureSoftware Engineering
The gist
Verifying that computer processors work correctly is very complicated because of their detailed internal structure. The authors present MicroAssert, a new method that understands the processor's inner parts to automatically create checks that confirm the processor behaves as expected. MicroAssert improves test coverage and detects errors more effectively than earlier methods. This helps make sure CPUs are reliable without as much manual effort.
Open → 2611.24872v1

WorldRuler enables interactive 3D worlds with consistent rule control

WorldRuler: Interactive World Modeling under Configurable Rules

Abstract: Rules govern how player actions change interactive worlds. Different rules create distinct gameplay experiences within similar scenes and action spaces. For customizable gameplay, generative world models must follow user-defined rules beyond real-world behaviors. However, realizing user-defined rules presents two challenges: Rule-State Persistence and Rule-to-Visual Realization. The former requires preserving rule definitions, dependencies, and world states across saving and loading, so that restored worlds follow the established rules. The latter requires accurately realizing rule-induced changes on designated objects and attributes, particularly when affected objects are unseen. In this paper, we propose WorldRuler, which organizes rule definitions, dependencies, and object states in an executable 3D rule graph and connects rule execution, video generation, and perceptual feedback in a closed loop. The graph supports joint saving and restoration of rules and world states, while dynamic object binding grounds rule-specified entities in visual instances and uses stored states to constrain generation from their first appearance. We further introduce object attribute state replacement and counterfactual reconstruction training, enabling accurate attribute control and compatible appearance and motion changes while limiting interference with unrelated content. We develop an automated data collection and annotation pipeline using GTA-V and Habitat to construct RuleVerse, a dataset of rule-driven interactions with detailed state and event annotations, including cases where rules take effect before affected objects become visible. Extensive experiments demonstrate the effectiveness of WorldRuler in preserving rule-state consistency across saving and loading and accurately realizing rule outcomes on designated objects and attributes.

Wed 18 NovArtificial Intelligence
The gist
Interactive worlds, like video games, change based on rules about how things act and respond. The authors address how to keep these rules working correctly when saving and reopening worlds, and how to make sure rule effects appear properly even on things not yet seen on screen. They created WorldRuler, a system that uses 3D rule graphs to keep rules, objects, and world states connected so the world behaves consistently and changes look correct. They also made a dataset called RuleVerse to help train and test these rule-based world models. Tests show WorldRuler keeps rules and world states intact across sessions and realistically applies rule effects to specific objects and features.
Open → 2611.24869v1

Visual agents evaluated for accuracy using budget-paired counterfactual audits

Choosing What to Observe: Budget-Paired Counterfactual Audits for Credible Evaluation of Visual Agents

Abstract: Visual agents that read dense documents must ration a finite observation budget across candidate regions, yet answer accuracy conflates where an agent looks, how it adapts to the reads that remain, and how it an?swers once observation stops. We introduce budget-paired counterfactual audits, an evaluation protocol that holds public evidence and region bindings fixed while perturbing only the remaining budget or de?clared task parameters, and credits every acquired history with exact continuation values. The resulting accounting decomposes lost expected accuracy into stepwise acquisition loss and terminal decision loss, separating planning from fixed-role heuristics. Across forty paired routing anchors, five open-weight

Wed 18 NovArtificial Intelligence
The gist
Visual agents that read and answer questions about documents have to pick which parts to look at because they have limited time or attention. The authors propose a new way to test these agents fairly by keeping some information fixed and changing only the budget or task rules, allowing clear measurement of how much is lost due to decision steps versus final answers. This approach separates the effects of planning where to look from how the agent answers once it stops looking. The method was tested on multiple cases to better understand the agent's behavior and accuracy.
Open → 2611.24867v1