{"success":true,"data":[{"id":"arxiv:2611.26629","source":"arxiv","source_id":"2611.26629","title":"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.","authors":[{"name":"H"},{"name":"J"},{"name":"A"},{"name":"P"}],"categories":["cs.CV"],"primary_category":"cs.CV","published_date":"2026-11-19T18:59:57Z","updated_date":"2026-11-19T18:59:57Z","pdf_url":"https://arxiv.org/pdf/2611.26629v1","abs_url":"https://arxiv.org/abs/2611.26629v1","doi":null,"journal_ref":null,"comment":"Project Page: https://pmd-distillation.github.io/","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:01","updated_at":"2026-11-22 06:01:01"},{"id":"arxiv:2611.26627","source":"arxiv","source_id":"2611.26627","title":"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.","authors":[{"name":"T"},{"name":"K"},{"name":"A"},{"name":"A"},{"name":"D"},{"name":"P"}],"categories":["cs.CV","cs.LG"],"primary_category":"cs.CV","published_date":"2026-11-19T18:59:53Z","updated_date":"2026-11-19T18:59:53Z","pdf_url":"https://arxiv.org/pdf/2611.26627v1","abs_url":"https://arxiv.org/abs/2611.26627v1","doi":null,"journal_ref":null,"comment":"Project page: https://rl-is-steering.github.io","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:01","updated_at":"2026-11-22 06:01:01"},{"id":"arxiv:2611.26624","source":"arxiv","source_id":"2611.26624","title":"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.","authors":[{"name":"W"}],"categories":["cs.AI","cs.CV"],"primary_category":"cs.AI","published_date":"2026-11-19T18:59:34Z","updated_date":"2026-11-19T18:59:34Z","pdf_url":"https://arxiv.org/pdf/2611.26624v1","abs_url":"https://arxiv.org/abs/2611.26624v1","doi":null,"journal_ref":null,"comment":null,"pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:01","updated_at":"2026-11-22 06:01:01"},{"id":"arxiv:2611.26619","source":"arxiv","source_id":"2611.26619","title":"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.","authors":[{"name":"J"},{"name":"X"},{"name":"S"},{"name":"Z"},{"name":"S"},{"name":"Q"}],"categories":["cs.DC","cs.LG"],"primary_category":"cs.DC","published_date":"2026-11-19T18:58:31Z","updated_date":"2026-11-19T18:58:31Z","pdf_url":"https://arxiv.org/pdf/2611.26619v1","abs_url":"https://arxiv.org/abs/2611.26619v1","doi":null,"journal_ref":null,"comment":"13 pages","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:02","updated_at":"2026-11-22 06:01:02"},{"id":"arxiv:2611.26617","source":"arxiv","source_id":"2611.26617","title":"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.","authors":[{"name":"Y"},{"name":"W"},{"name":"J"},{"name":"Y"},{"name":"L"},{"name":"I"},{"name":"M"}],"categories":["cs.CV","cs.AI","cs.LG","cs.RO"],"primary_category":"cs.CV","published_date":"2026-11-19T18:58:14Z","updated_date":"2026-11-19T18:58:14Z","pdf_url":"https://arxiv.org/pdf/2611.26617v1","abs_url":"https://arxiv.org/abs/2611.26617v1","doi":null,"journal_ref":null,"comment":"Project page: https://showlab.github.io/o2laf Code: https://github.com/showlab/O2LaF","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:02","updated_at":"2026-11-22 06:01:02"},{"id":"arxiv:2611.26615","source":"arxiv","source_id":"2611.26615","title":"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.","authors":[{"name":"Y"},{"name":"W"},{"name":"Q"},{"name":"Z"},{"name":"X"},{"name":"S"},{"name":"L"}],"categories":["cs.CV"],"primary_category":"cs.CV","published_date":"2026-11-19T18:58:04Z","updated_date":"2026-11-19T18:58:04Z","pdf_url":"https://arxiv.org/pdf/2611.26615v1","abs_url":"https://arxiv.org/abs/2611.26615v1","doi":null,"journal_ref":null,"comment":null,"pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:02","updated_at":"2026-11-22 06:01:02"},{"id":"arxiv:2611.26613","source":"arxiv","source_id":"2611.26613","title":"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.","authors":[{"name":"Y"},{"name":"Y"},{"name":"Q"},{"name":"Y"},{"name":"Z"},{"name":"Y"},{"name":"X"},{"name":"W"},{"name":"L"},{"name":"C"}],"categories":["cs.RO","cs.CL","cs.CV"],"primary_category":"cs.RO","published_date":"2026-11-19T18:57:25Z","updated_date":"2026-11-19T18:57:25Z","pdf_url":"https://arxiv.org/pdf/2611.26613v1","abs_url":"https://arxiv.org/abs/2611.26613v1","doi":null,"journal_ref":null,"comment":"28 pages. Project page: https://adu2021.github.io/blog/AgentRoboCritic/","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:03","updated_at":"2026-11-22 06:01:03"},{"id":"arxiv:2611.26609","source":"arxiv","source_id":"2611.26609","title":"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.","authors":[{"name":"V"},{"name":"K"}],"categories":["cs.DS","cs.DB","cs.IR"],"primary_category":"cs.DS","published_date":"2026-11-19T18:57:05Z","updated_date":"2026-11-19T18:57:05Z","pdf_url":"https://arxiv.org/pdf/2611.26609v1","abs_url":"https://arxiv.org/abs/2611.26609v1","doi":null,"journal_ref":null,"comment":"22 pages, 1 figure, 9 tables","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:03","updated_at":"2026-11-22 06:01:03"},{"id":"arxiv:2611.26607","source":"arxiv","source_id":"2611.26607","title":"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.","authors":[{"name":"D"},{"name":"D"},{"name":"A"}],"categories":["cs.LG"],"primary_category":"cs.LG","published_date":"2026-11-19T18:56:25Z","updated_date":"2026-11-19T18:56:25Z","pdf_url":"https://arxiv.org/pdf/2611.26607v1","abs_url":"https://arxiv.org/abs/2611.26607v1","doi":null,"journal_ref":null,"comment":null,"pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:03","updated_at":"2026-11-22 06:01:03"},{"id":"arxiv:2611.26603","source":"arxiv","source_id":"2611.26603","title":"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/","authors":[{"name":"P"},{"name":"M"},{"name":"L"},{"name":"L"},{"name":"W"},{"name":"A"},{"name":"S"},{"name":"V"}],"categories":["cs.CV","cs.LG"],"primary_category":"cs.CV","published_date":"2026-11-19T18:55:41Z","updated_date":"2026-11-19T18:55:41Z","pdf_url":"https://arxiv.org/pdf/2611.26603v1","abs_url":"https://arxiv.org/abs/2611.26603v1","doi":null,"journal_ref":null,"comment":"Code and weights available at https://apple-aiml-research.github.io/ml-depth-pro-2/","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:04","updated_at":"2026-11-22 06:01:04"},{"id":"arxiv:2611.26601","source":"arxiv","source_id":"2611.26601","title":"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.","authors":[{"name":"A"},{"name":"M"},{"name":"A"},{"name":"V"},{"name":"M"},{"name":"D"}],"categories":["cs.CR","cs.AI","cs.SE"],"primary_category":"cs.CR","published_date":"2026-11-19T18:54:19Z","updated_date":"2026-11-19T18:54:19Z","pdf_url":"https://arxiv.org/pdf/2611.26601v1","abs_url":"https://arxiv.org/abs/2611.26601v1","doi":null,"journal_ref":null,"comment":null,"pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:04","updated_at":"2026-11-22 06:01:04"},{"id":"arxiv:2611.26600","source":"arxiv","source_id":"2611.26600","title":"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.","authors":[{"name":"O"},{"name":"A"},{"name":"M"},{"name":"M"},{"name":"J"},{"name":"G"}],"categories":["cs.RO","cs.GR","math.OC"],"primary_category":"cs.RO","published_date":"2026-11-19T18:54:07Z","updated_date":"2026-11-19T18:54:07Z","pdf_url":"https://arxiv.org/pdf/2611.26600v1","abs_url":"https://arxiv.org/abs/2611.26600v1","doi":null,"journal_ref":null,"comment":"32 pages, 9 figures, 3 tables, 14 algorithms","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:04","updated_at":"2026-11-22 06:01:04"},{"id":"arxiv:2611.26598","source":"arxiv","source_id":"2611.26598","title":"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.","authors":[{"name":"Y"},{"name":"Z"},{"name":"R"},{"name":"Y"}],"categories":["cs.LG","cs.AI"],"primary_category":"cs.LG","published_date":"2026-11-19T18:52:57Z","updated_date":"2026-11-19T18:52:57Z","pdf_url":"https://arxiv.org/pdf/2611.26598v1","abs_url":"https://arxiv.org/abs/2611.26598v1","doi":null,"journal_ref":null,"comment":"16 pages","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:05","updated_at":"2026-11-22 06:01:05"},{"id":"arxiv:2611.26596","source":"arxiv","source_id":"2611.26596","title":"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","authors":[{"name":"K"},{"name":"C"},{"name":"I"}],"categories":["cs.RO","cs.AI"],"primary_category":"cs.RO","published_date":"2026-11-19T18:52:18Z","updated_date":"2026-11-19T18:52:18Z","pdf_url":"https://arxiv.org/pdf/2611.26596v1","abs_url":"https://arxiv.org/abs/2611.26596v1","doi":null,"journal_ref":null,"comment":null,"pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:05","updated_at":"2026-11-22 06:01:05"},{"id":"arxiv:2611.26595","source":"arxiv","source_id":"2611.26595","title":"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.","authors":[{"name":"Y"},{"name":"Q"},{"name":"Y"},{"name":"Z"},{"name":"Y"},{"name":"T"},{"name":"Y"},{"name":"X"},{"name":"S"},{"name":"J"},{"name":"X"},{"name":"X"},{"name":"Y"},{"name":"Y"},{"name":"Z"},{"name":"X"},{"name":"S"},{"name":"H"},{"name":"W"},{"name":"Z"},{"name":"Y"},{"name":"P"},{"name":"J"}],"categories":["cs.CV"],"primary_category":"cs.CV","published_date":"2026-11-19T18:51:58Z","updated_date":"2026-11-19T18:51:58Z","pdf_url":"https://arxiv.org/pdf/2611.26595v1","abs_url":"https://arxiv.org/abs/2611.26595v1","doi":null,"journal_ref":null,"comment":"47 pages","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:05","updated_at":"2026-11-22 06:01:05"},{"id":"arxiv:2611.26592","source":"arxiv","source_id":"2611.26592","title":"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.","authors":[{"name":"T"},{"name":"T"}],"categories":["stat.ME","cs.AI","cs.LG"],"primary_category":"stat.ME","published_date":"2026-11-19T18:47:51Z","updated_date":"2026-11-19T18:47:51Z","pdf_url":"https://arxiv.org/pdf/2611.26592v1","abs_url":"https://arxiv.org/abs/2611.26592v1","doi":null,"journal_ref":null,"comment":null,"pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:06","updated_at":"2026-11-22 06:01:06"},{"id":"arxiv:2611.26590","source":"arxiv","source_id":"2611.26590","title":"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.","authors":[{"name":"J"},{"name":"J"}],"categories":["cs.AI","cs.CV","cs.LG"],"primary_category":"cs.AI","published_date":"2026-11-19T18:46:50Z","updated_date":"2026-11-19T18:46:50Z","pdf_url":"https://arxiv.org/pdf/2611.26590v1","abs_url":"https://arxiv.org/abs/2611.26590v1","doi":null,"journal_ref":null,"comment":null,"pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:06","updated_at":"2026-11-22 06:01:06"},{"id":"arxiv:2611.26588","source":"arxiv","source_id":"2611.26588","title":"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.","authors":[{"name":"A"},{"name":"M"},{"name":"A"},{"name":"M"},{"name":"D"}],"categories":["cs.SE","cs.AI","cs.AR"],"primary_category":"cs.SE","published_date":"2026-11-19T18:45:54Z","updated_date":"2026-11-19T18:45:54Z","pdf_url":"https://arxiv.org/pdf/2611.26588v1","abs_url":"https://arxiv.org/abs/2611.26588v1","doi":null,"journal_ref":null,"comment":null,"pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:07","updated_at":"2026-11-22 06:01:07"},{"id":"arxiv:2611.26586","source":"arxiv","source_id":"2611.26586","title":"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.","authors":[{"name":"A"},{"name":"H"},{"name":"L"},{"name":"E"},{"name":"Y"},{"name":"D"},{"name":"S"},{"name":"G"},{"name":"P"},{"name":"S"},{"name":"P"}],"categories":["cs.AI"],"primary_category":"cs.AI","published_date":"2026-11-19T18:45:31Z","updated_date":"2026-11-19T18:45:31Z","pdf_url":"https://arxiv.org/pdf/2611.26586v1","abs_url":"https://arxiv.org/abs/2611.26586v1","doi":null,"journal_ref":null,"comment":"20 pages, 16 figures","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:07","updated_at":"2026-11-22 06:01:07"},{"id":"arxiv:2611.26584","source":"arxiv","source_id":"2611.26584","title":"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.","authors":[{"name":"J"}],"categories":["cs.CL","cs.LG"],"primary_category":"cs.CL","published_date":"2026-11-19T18:43:56Z","updated_date":"2026-11-19T18:43:56Z","pdf_url":"https://arxiv.org/pdf/2611.26584v1","abs_url":"https://arxiv.org/abs/2611.26584v1","doi":null,"journal_ref":null,"comment":"64 pages, 7+2 figures, 4+6 tables","pdf_downloaded":false,"pdf_path":null,"trending_score":0,"citation_count":0,"github_stars":0,"created_at":"2026-11-22 06:01:07","updated_at":"2026-11-22 06:01:07"}],"meta":{"page":1,"per_page":20,"total":13772,"total_pages":689}}