跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 10:54 — 2026-11-22 10:54(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 21,490 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
新论文 · v1arXiv:2611.10345

The Power of Two Choices in Dynamic Pricing: As Good As Full Feedback, Instance-Wise

Yan Dai, Tao Lin, Aleksandrs Slivkins

原文摘要

We study the dynamic pricing problem, where a firm sells a product to $T$ myopic customers and their values are independent samples from an unknown value distribution $F$. With posted prices, the firm only sees whether each customer buys, and the minimax regret is $\widetilde Θ(T^{2/3})$ [KL03]. A menu instead offers several options, each selling the product with some probability at some expected payment. Infinitely many menu options allow the seller to fully reveal customer values, reducing the regret to $Θ(\sqrt T)$. How many options are needed? Perhaps surprisingly, a second menu option suffices, achieving the same regret as infinite menus (up to $\log$ factors). This holds broadly: without knowing any property of $F$, our algorithm with two menu options attains $\tilde O(\sqrt T)$ regret in general, $\tilde O(T^{1/3})$ regret for monotone-hazard-rate distributions, and $\tilde O(T^{d/(d+1)})$ instance-dependent regret when $d\in(0,1)$ is a suitable notion of "dimension". All are optimal even with infinite menus. Moreover, we argue, via a novel lower-bound construction, that our algorithm is near-optimal for each problem instance. Along the way, we study the query complexity of revenue maximization, where an algorithm issues a query to each customer to learn the property of interest (either the best price or the CDF) up to some precision. We show that interval queries suffice to achieve the same query complexity as value queries (up to $\log$ factors) for both properties and across several classes of value distributions. We provide a new interval-query algorithm for each property. The best-price-estimation algorithm is the key ingredient in our main dynamic pricing algorithm, and the CDF-estimation algorithm underpins a simpler algorithm attaining $\tilde O(\sqrt T)$ regret with three menu options.

cs.GT · cs.LG

新论文 · v1arXiv:2611.10343

GUARD: Anomaly-Informed Q-Steering for Generative Robot Policies in Dexterous Manipulation

Aryaman Gupta, Xiaoyue Wu, Rana Soltani Zarrin, Mark Van der Merwe

原文摘要

Generative robot policies based on diffusion and flow matching can model complex, multimodal behaviors, but remain susceptible to covariate shift during closed-loop execution. Existing approaches mitigate such failures through additional demonstrations, policy fine-tuning, or test-time guidance, but often require human intervention, engineered rewards, or other task-specific signals. We introduce GUARD, an anomaly-informed Q-steering framework that leverages the policy's training distribution to construct a dense, failure-anticipatory steering signal. GUARD pairs sparse task rewards with dense anomaly scores learned from policy training data and propagates both through a learned Q-function. Its gradients then steer the denoising process toward actions that improve task return while preventing trajectories from entering poorly supported regions, without directly modifying the pretrained policy. Across four Adroit dexterous manipulation tasks, GUARD achieves average success rates of $96.0\%$ and $80.0\%$ under nominal and perturbed dynamics, outperforming the strongest baseline by $21.0$ and $20.0$ percentage points while maintaining the lowest anomaly score. GUARD further demonstrates direct sim-to-real transfer on in-hand screwdriver rotation and reorientation tasks, achieving $40$ and $25$ percentage-point gains in success rate. These results demonstrate that anomaly signals can serve not only for failure monitoring but also to complement sparse task rewards as effective supervision for robust policy steering.

cs.RO

版本更新 · v2arXiv:2610.01002

What Can Analogy Tell Us About Artificial Consciousness?

Keith J. Holyoak, Martin M. Monti

原文摘要

Who or what is conscious? Because subjective experience is directly accessible only in the first person, judgments about consciousness in other entities depend partly on analogy. Historically, such inferences have focused on nonhuman animals, but advances in artificial intelligence have raised the possibility of conscious AI. Here we develop a causal framework for evaluating such evidential analogies. The key distinction is between similarities in factors plausibly involved in generating consciousness and similarities in downstream behavioural or cognitive effects. Our framework weights source-target similarity by causal relevance while allowing for unknown causes, disabling differences and alternative routes to consciousness. Applied to biological systems, it explains why analogical support generally weakens with increasing causal distance from humans. Applied to contemporary AI, it suggests that behavioural similarity provides only limited evidence for consciousness because relevant causal correspondences remain poorly established. The framework also clarifies what evidence would strengthen claims of artificial consciousness.

cs.AI

版本更新 · v2arXiv:2609.07868

SGD in Multiclass Logistic Regression: Sequential Learning and Scaling Laws

Konstantinos Christopher Tsiolis, Denny Wu, Christos Thrampoulidis, Murat A. Erdogdu

原文摘要

We study the training dynamics of multiclass logistic regression on high-dimensional mixture models with a large number of classes and establish precise scaling laws governing the cross-entropy risk under gradient-based optimization. We show that learning proceeds sequentially across classes, from most to least frequent. When the class priors follow a power law distribution, the risk dynamics decompose into three phases: an initial plateau until the first class is learned, a power-law decay regime during which sequential learning occurs, and a final convergence regime. We then analyze how model capacity interacts with optimization under a fixed compute budget. When the effective dimension is restricted via projection onto leading principal components, the risk decomposes into a capacity term (a power law in the retained dimension) and an optimization term (a power law in training time). Optimizing this tradeoff yields a compute-optimal scaling law for logistic regression, with explicit prescriptions for model size and training time as functions of compute. These results extend theoretical scaling laws from linear regression to multiclass classification, while connecting to empirical scaling laws observed in large-scale neural networks.

stat.ML · cs.LG

新论文 · v1arXiv:2611.10341

Collaboration Signatures: Tracking Long-Horizon Dynamics of Cross-Meeting Collaboration Networks

Shengqi Zhu, Sheshera Mysore, Bahareh Sarrafzadeh

原文摘要

Enterprise platforms have received increasing attention as a core component of social networks and the Web. However, existing work mostly relies on fragmented logs of small units of work, like emails and chats, and focuses on who connects with whom without sufficient account of collaboration content and dynamics. This work systematically explores tracking collaborations across sequences of meetings as a new approach to interpreting their long-horizon dynamics. Linking 45,426 meetings in a large multinational technology company based on full transcripts and 1.6 million extracted agenda items, we establish a cross-meeting collaboration network of 6,065 collaborations. The network recovers the natural shapes of workplace collaborations: meetings, as snapshots of ongoing collaboration, link into largely tree-shaped structures, while the work content forms nested directed acyclic graphs (DAGs). Further, we explore how these networks evolve over time, examining three established perspectives: task division, team composition, and temporal continuity. Each explains part of the dynamics but does not capture the distinctness of long-horizon workplace collaboration: e.g., work flows in a consistent direction between a few pairs of subjects, yet a collaboration's subject explains little of how its meetings are conducted. Instead, accumulating the agenda, interaction, and language of meetings along each tree yields a signature of the collaboration, a distinctive profile that picks out the collaboration of a held-out meeting at 4.5 times chance. The signature models collaboration better than team or task views, individually or combined, in next-meeting prediction and tree-level fitting. We discuss the implications of these cross-meeting dynamics for designing office applications and support tools, and call for next-generation Web systems that represent collaborations over their long horizon.

cs.SI · cs.CL · cs.CY · cs.HC

新论文 · v1arXiv:2611.10340

IdealCache: Rethinking Cache Scheduling in Diffusion Transformers via Ideal Trajectories

Shang Xue, Li Zhu, Ping Chen

原文摘要

Feature caching accelerates Diffusion Transformers by reusing intermediate computations across denoising timesteps, yet existing methods share a fundamental blind spot: they treat the standard reference denoising trajectory as the optimisation target, approximating its per-step states and thus inheriting its output as an implicit quality ceiling. We argue that this target is arbitrary -- what truly matters is the ideal result, not the intermediate path taken to reach it. We propose IdealCache, a training-free framework that abandons step-wise imitation of the reference trajectory. Instead, it anchors caching on a per-input ensemble of ideal trajectories constructed from candidate target results, aggregates their geometry into a single graph, and discovers optimal non-uniform schedules via a constrained shortest path on this graph. By decoupling from the reference process, IdealCache breaks the performance bottleneck of trajectory-approximation; our schedules can attain near-lossless fidelity in generation and even surpass on task-specific metrics (e.g., maintaining higher semantic consistency in image editing). Without retraining, IdealCache achieves 6.35x speedup on Qwen-Image, 5.84x on Qwen-Image-Edit, and 4.32x on HunyuanVideo, with competitive or superior quality across tasks.

cs.AI

新论文 · v1arXiv:2611.10338

On the universal structure in deterministic generative diffusion

Defang Chen, Zhenyu Zhou, Can Wang, Zeyu Zheng, Siwei Lyu

原文摘要

Diffusion-based generative modeling has emerged as a general computational framework for simulating high-dimensional, structured data across various domains. Understanding its generative mechanisms is paramount for advancing model training and inference in a principled way. Here, we demonstrate that deterministic sampling trajectories share a universal geometric structure invariant to data modalities and diffusion model implementations. This structure can be largely explained by an exactly solvable model based on the optimal linear denoiser.

cs.LG · cond-mat.stat-mech · cs.CV · stat.ML

版本更新 · v3arXiv:2606.30901

GRAPE: Graph-Augmented Prototype Explanations for Interactive Medical Image Diagnosis

Rasul Khanbayov, Erchin Serpedin, Hasan Kurban

原文摘要

Prototype-based medical image classifiers present three clinical limitations: they treat findings as independent, silently amplify unsafe physician feedback, and require full retraining whenever a new finding is needed. We present GRAPE (Graph-Augmented Prototype Explanations), a unified architecture that targets all three challenges. First, a Graph Attention Task Head boosts macro-F1 by +13.8,pp over the prototype baseline on TBX11K but not on NIH ChestX-ray14, with no graph-specific benefit established. Second, a Concept-Mismatch Safety Check, to our knowledge the first such mechanism in prototype-based medical classifiers, warns when the model's dominant finding inside a doctor-drawn region conflicts with the claimed label, catching 85% of simulated erroneous annotations with no extra inference cost at a favorable operating point, though sensitivity falls substantially at clinically realistic false-positive budgets. Third, Open-Vocabulary Prototype Anchoring aligns visual prototypes to clinical text, allowing a new finding to be added from a single labeled image without modifying any other component, evaluated for localization only. On NIH ChestX-ray14, one Effusion example matched that concept's low fully-supervised Pointing Game ceiling in one run but not in a second. On TBX11K, prototype maps achieve 2.1x better lesion localization than end-to-end concept-based baselines. The graph head adds only +1~ms latency at interactive batch size. The project page is available at https://kurbanintelligencelab.github.io/GRAPE.

cs.CV

新论文 · v1arXiv:2611.10337

TimeTraveler: Temporal Strategy Planning with Time Dictionary for Streaming Video Understanding

Minkuk Kim, Junho Kim, Seong Tae Kim

原文摘要

Streaming video understanding (SVU) requires models to answer user queries over continuously evolving video streams. Unlike offline video QA, SVU must handle queries whose evidence may lie in the past, appear in the current scene, or emerge only after future observations. Existing streaming video systems often rely on compact visual memories or fixed evidence-access schemes, which can lose fine-grained details and fail to adapt the answering process to the temporal intent of each query. In this paper, we propose TimeTraveler, a streaming VQA framework that performs temporal strategy planning with a Time Dictionary. Inspired by the need to search across different temporal regions of a stream, TimeTraveler stores each observed moment as a timestamp-indexed structured caption and uses this dictionary as an explicit source of queryable evidence. Given a query, TimeTraveler determines whether to recall past evidence, read the present context, or wait for future observations, and then applies a strategy-specific evidence acquisition process. Comparative experiments on streaming video QA benchmarks show that TimeTraveler improves streaming question answering by preserving fine-grained temporal evidence and selecting the appropriate temporal strategy for each query. The project page is available at https://geppa.github.io/TimeTraveler.

cs.CV

新论文 · v1arXiv:2611.10331

Evaluating classification and explainability in multimodal petrographic image analysis

Thomas James Wood, Oktay Karakuş, Can Eyüpoğlu

原文摘要

Automated thin-section classifiers increasingly combine plane-polarised and cross-polarised light (PPL and XPL), two complementary views central to petrographic identification. Classification accuracy alone does not reveal whether model errors reflect mineralogical relationships, how predictions depend on each optical view, or whether attribution maps identify regions that influence model decisions. Here, we examine these complementary aspects of the released LITHOS dual-stream vision transformer using outputs from an earlier evaluation of 105,802 expert-annotated grains across 25 categories. Classification errors frequently followed the label taxonomy: 72.6\% of misclassified plagioclase, microcline and sanidine grains were assigned the generic Feldspar label, while 87.1\% of quartz-family grains received a label within that family, compared with 66.6\% assigned their exact label. Replacing the XPL input with its per-channel spatial means produced a greater reduction in true-class probability than equivalent PPL replacement in 20 of 25 categories, but not in the three quartz categories. Five explainable artificial intelligence (XAI) attribution procedures generated visually distinct maps for identical inputs. In a superpixel-deletion analysis involving 30 grains from 29 thin sections, method-minus-random contrasts ranged from $-0.043$ to $0.057$, with all 41 simultaneous 95\% confidence intervals including zero. Together, these findings show that error structure, modality sensitivity and attribution behaviour capture distinct aspects of model performance that cannot be established from classification accuracy or visual inspection of attribution maps alone.

cs.AI · cs.CV

新论文 · v1arXiv:2611.10329

SIRIS: Can LLMs Tell When Simulation Errors Matter in AI-Driven Systems Research

Jinwoo Hwang, Sukmin Cho, Tao Zhang, Soheil Abbasloo, Jongse Park, Peng Cheng

原文摘要

LLM agents increasingly drive systems research and rely on simulators to evaluate candidate designs at scale. Simulators are imperfect by design: their modeling limitations can distort predictions yet leave the recommended design correct, or change which design should be selected. We introduce Siris to test whether LLMs can tell these cases apart, judging from their systems understanding when a limitation invalidates the simulator's recommendation. By perturbing a simulator, Siris constructs workload pairs with the same candidates, limitation, and simulator recommendation. The perturbation changes predictions on both workloads, yet a reference simulator supports the recommendation on only one. Evaluating thirteen frontier LLMs on LLM serving design problems, we find that identifying a limitation does not ensure a correct choice, and even the strongest models sometimes abandon valid recommendations. Self-correction through a review turn helps these models restore valid choices but introduces new errors in several others. These findings motivate evaluating systems understanding through design decisions under imperfect simulators.

cs.AI

新论文 · v1arXiv:2611.10327

Policy Over Purpose: Auditing LLM Content Moderation of Reclaimed Slur Usage

Christina Chance, Kai-Wei Chang

原文摘要

As Perspective API is deprecated, platforms are turning to large language models for content moderation, encoding policy as natural language that the model must interpret at inference time. Reclaimed slurs test this design directly. The same term can express in-group pride or target the community that reclaimed it, and misreading it silences the speech moderation is meant to protect. We audit four general-purpose LLMs and four moderation-specific systems, with Perspective API as a legacy baseline, on IYKYK, a corpus of reclaimed and derogatory usage of three slurs annotated by community members. Across the policy, decision, reasoning, disparity, and steering layers of this audit, we find that whether a system was purpose-built for moderation explains little about how it handles reclaimed language. No system reliably agrees with community judgment, and all fail most on language reclaimed within Black communities. What separates systems is instead how their policy is represented. Only systems whose policy is expressed in the prompt can be steered at all, and even then, explicit definitions change how models justify a decision more than how they make it. We argue that policy transparency determines whether moderation failures can be corrected, but that correcting them requires contextual judgment that definitions supplied at inference time cannot provide.

cs.CL

版本更新 · v2arXiv:2605.05403

When Helpfulness Becomes Sycophancy: Sycophancy is a Boundary Failure Between Social Alignment and Epistemic Integrity in Large Language Models

Jiechen Li, Catherine A. Barry, Rishika Randev, Janet Chen, Ella Jorgensen, Brinnae Bent

原文摘要

This position paper argues that sycophancy in LLMs is a boundary failure between social alignment and epistemic integrity. Existing work often operationalizes sycophancy through external behavior such as agreement with incorrect user beliefs, position reversals, or deviation from an objective standard of correctness. These formulations capture overt forms of the phenomenon but leave subtler boundary failures involving epistemic integrity and social alignment underspecified. We argue that sycophancy should be defined not by agreement or factual incorrectness alone, but by cue-driven degradation of epistemic integrity. To clarify this boundary, we propose a three-condition decision rule requiring (1) a user cue, (2) a model response that shifts toward that cue, and (3) a resulting degradation of epistemic integrity. Building on this definition, we also introduce a taxonomy consisting of alignment targets, mechanisms, and severity to characterize cases identified as sycophantic. An initial 48-item annotation pilot provides preliminary evidence that the framework can be operationalized using structured guidelines, although broader empirical validation remains necessary. The paper concludes by discussing implications for alignment evaluation, including boundary-aware assessment, structured rubrics, and mitigation strategies, while situating these proposals alongside alternative views of sycophancy.

cs.AI

新论文 · v1arXiv:2611.10325

Update Slope Is Bounded by Prior Calibration: A Structural Bound and Its Contingent Empirical Signature

Ben Jenkins, Mihaela Cardei

原文摘要

Evaluations of LLM forecasters increasingly measure how forecasts improve as richer evidence is supplied. We identify two confounds in this update-slope metric. First, outcome-aware evidence construction substantially inflates measured responsiveness: on the same models and questions, slopes are roughly four times larger than with resolution-blinded evidence ladders. Second, update slope is a change score with a prior-dependent structural ceiling, so raw comparisons can reflect differences in starting calibration rather than updating behavior. The ceiling defines only a feasible region; whether slope and prior calibration are empirically coupled depends on headroom utilization and varies across our Manifold, ForecastBench, and ACLED pools. Despite this variability, conditioning on prior calibration roughly triples the association between intermediate updating and final Brier score under both blinded and outcome-aware construction. Question identity also explains substantially more variance than model identity across the evaluated pools. We recommend building evidence ladders blind to outcomes, conditioning on prior calibration, and reporting headroom-normalized measures alongside raw slopes.

cs.LG · cs.AI · stat.AP

版本更新 · v2arXiv:2606.29164

Latent Reasoning Does Not Lack Signal, It Lacks Invariance: Subspace-Constrained Refinement for Robust Reasoning

Arun Vignesh Malarkkan, Manan Roy Choudhury, Utkarsh Byahut, Yash Ravindra Charde, Vivek Gupta, Xiquan Cui, Xiangliang Zhang, Yanjie Fu

原文摘要

Latent reasoning models perform multi-step inference in embedding space, reducing the token overhead of chain-of-thought reasoning. Recent training-free refinement methods steer latent trajectories using contrastive signals from stronger and weaker reference checkpoints. We identify three sources of fragility in these methods: hyperparameter sensitivity, reference-pair dependence, and input sensitivity. We propose Trajectory-Invariant Latent Refinement (TILR), a training-free framework that constrains corrections to a stable refinement subspace and adaptively controls their magnitude. First, we extract a spectrally concentrated subspace from strong-weak reference differences across a calibration set and project contrastive updates onto it to filter unstable variation. Second, an adaptive gate scales each update according to its alignment with the learned subspace, suppressing unreliable corrections and recovering the unmodified backbone when alignment is low. Across six reasoning benchmarks, TILR improves robustness to input perturbations and reference selection while maintaining competitive accuracy. On the Coconut backbone, TILR improves answer agreement under semantically equivalent paraphrasing by 11.4% and reduces latent trajectory variance by approximately 30% relative to existing refinement baselines. These results support invariant subspaces as a practical basis for reliable latent refinement without retraining or backpropagation.

cs.LG · cs.AI · cs.CG

版本更新 · v2arXiv:2505.10700

Inquisitive Team Semantics of LTL

Laura Bozzelli, Tadeusz Litak, Munyque Mittelmann, Aniello Murano

原文摘要

In recent years, hyperproperties (i.e., properties of sets of traces) have been identified as a crucial concept for capturing information-flow security policies and knowledge of agents in distributed systems. In the synchronous linear-time setting, a well-known approach for the specification of hyperproperties is based on the set semantics of standard LTL. The resulting logic (TeamLTL) inherits the powerful split interpretation of disjunction from dependence logic. In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic, whose main features are the intuitionistic interpretation of implication and the inquisitive semantics of disjunction. We investigate expressiveness, decidability, and complexity issues of the novel logic that we call InqLTL and its extension with strong negation. We show that InqLTL with strong negation is highly undecidable and strictly less expressive than TeamLTL with strong negation. On the positive side, we identify a meaningful fragment of InqLTL with a decidable model-checking problem that can express relevant classes of hyperproperties. To the best of our knowledge, this fragment represents the first hyper logic with a decidable model-checking problem that allows unrestricted use of temporal modalities and conditional second-order universal quantification over system refinements via intuitionistic implication.

cs.LO · cs.FL

版本更新 · v2arXiv:2607.16189

Searching Videos as Trees: Self-Correcting Agents for Grounded Long Video QA

Ce Zhang, Ziyang Wang, Yulu Pan, Oluwatumininu Oguntola, Pranav Wagh, Qiyu Wu, Hiromi Wakaki, Mohit Bansal 等 9 位作者

原文摘要

Grounded long-video question answering (Grounded LVQA) requires answering a question about a long video while localizing the short evidence interval that supports the answer. Recent agentic methods frame this task as multi-turn exploration with a single crop_video(start, end) action, which supports coarse-to-fine narrowing but provides no primitive for fine-to-coarse backtracking. As a result, these agents typically converge prematurely and cannot recover from an early mistake. We propose VideoTreeSearch (VTS), a framework that casts grounded LVQA as iterative self-correcting search over an adaptive temporal tree. VTS constructs a non-uniform tree through adaptive temporal segmentation so that each node corresponds to a semantically coherent segment, and trains an agent to navigate the tree through four discrete operations: zoom_in, zoom_out, shift, and answer. These operations expose backtracking and recovery as explicit, learnable primitives rather than implicit behaviors. To train this navigation, we introduce a trajectory synthesis pipeline that produces multi-step paths through the tree, including deliberate detours into incorrect branches followed by recovery. We use these trajectories for supervised fine-tuning, followed by reinforcement learning with grounding and answer-accuracy rewards. On three Grounded LVQA benchmarks (CG-Bench, Haystack-LVBench, Haystack-Ego4D), VTS outperforms the strongest prior multi-turn cropping agents by +12.5 mIoU on CG-Bench and +7.4 T-F1 on Haystack-Ego4D. The learned policy also transfers to general long-video QA, surpassing all prior multi-turn cropping agents on Video-MME, MLVU, and LVBench by up to +7.1 accuracy points. Ablations confirm that self-correcting hierarchical search is the central mechanism behind these gains: removing either adaptive descent or explicit backtracking substantially degrades performance.

cs.CV

版本更新 · v3arXiv:2602.06643

HuMI: Humanoid Whole-Body Manipulation from Humanoid-Free Demonstrations

Ruiqian Nai, Boyuan Zheng, Junming Zhao, Haodong Zhu, Sicong Dai, Zunhao Chen, Yihang Hu, Yingdong Hu 等 11 位作者

原文摘要

Current approaches for humanoid whole-body manipulation, primarily relying on teleoperation or visual sim-to-real reinforcement learning, are hindered by hardware logistics and complex reward engineering. Consequently, demonstrated autonomous skills remain limited and are typically restricted to controlled environments. In this paper, we present the Humanoid Manipulation Interface (HuMI), a portable and efficient framework for learning diverse whole-body manipulation tasks across various environments. HuMI enables humanoid-free data collection by capturing rich whole-body motion using portable hardware. This data drives a hierarchical learning pipeline that translates human motions into dexterous and feasible humanoid skills. Extensive experiments across five whole-body tasks--including kneeling, squatting, tossing, walking, and bimanual manipulation--demonstrate that HuMI achieves a 3x increase in data collection efficiency compared to teleoperation and attains a 70% success rate in unseen environments.

cs.RO · cs.AI · cs.LG

新论文 · v1arXiv:2611.10319

Prove What You Can: Hybrid Neurosymbolic Reasoning for Logical Natural Language Inference

Ada Canoğlu, Sadiq Qara

原文摘要

Logical reasoning over natural language requires both semantic interpretation and deductive search. Large language models (LLMs) can propose plausible intermediate derivations, but they often fail to compose them into a complete proof and overpredict uncertainty. Neurosymbolic methods improve search by translating an entire problem into first-order logic and handing it to a prover, but a single bad clause can make the whole translation nonexecutable. We present Hybrid Reasoning, a three-stage pipeline that decouples proposing a proof, validating its steps, and deciding a label. An LLM proposes a structured proof tree with a raw verdict; a theorem prover validates each derivation locally, keeping only the subset it can prove; and an uncertainty-gated repair attempts to re-derive the label from the premises plus the validated derivations, when the raw verdict is UNCERTAIN. Across four benchmarks (FOLIO, ProofWriter, ProverQA, PrOntoQA) and five contemporary LLMs, Hybrid Reasoning is the top-performing method on the two hardest datasets, improving on the strongest baseline by 5.3 points on FOLIO and 4.9 on ProverQA, and reaches ceiling-level accuracy on the easiest. The repair stage operates at 78-98% precision, producing 326 correct relabellings against 19 regressions.

cs.CL

新论文 · v1arXiv:2611.10318

AI-Driven Repair of Missing Automotive Components

Kazim Abbas, Zheng Liu

原文摘要

Due to supply constraints, replacing damaged automotive components can be expensive and time-consuming, while replacing the entire component can be wasteful when much of it remains usable. This paper presents a pipeline to investigate whether missing geometry can be reconstructed as a repair patch using paired observations of the intact models and synthetically damaged components. Noise-free color, depth, and silhouette images were produced using the camera viewpoints. Depth differences were then used to identify the potential missing regions, while multi-view voxel reconstruction was used to estimate the missing portion. A pretrained DINOv2 model was also added to validate missing candidates and determine whether pretrained visual features could improve reconstruction. We tested the pipeline on 20 automotive CAD models, each with a synthetically removed portion. Each model was tested under four different conditions using two reconstruction methods for a total of 160 trials. The predictions were compared with the missing geometry of the unchanged ground-truth using predefined thresholds of the voxel intersection-over-union over 0.85 and the absolute relative volume error less than 15%. Of the 160 experimental trials, 109 of them satisfied both thresholds. Geometry-only reconstruction passed 16 of 20 components with eight views but only 10 of 20 with four adjacent views. Further analysis showed that 24 out of the 37 failed reconstructions could be categorized as unsuccessful because extra material was incorrectly added to areas that should have been empty. The implementation of DINOv2 into the pipeline did not improve the overall reconstruction accuracy and made prediction generation slower. For 13 verified tests, printing only the repaired sections instead of the entire parts reduced filament use by 93.08% and printing time by 89.39% based on the median results.

cs.CV

版本更新 · v2arXiv:2605.10642

Composing diffusion priors with explicit physical context via generative Gibbs sampling

Weizhou Wang, Jonathan Weare, Aaron R. Dinner

原文摘要

Pretrained diffusion models provide powerful learned priors, but in scientific sampling the target distribution often depends on physical context that a single generative model can neither fully represent nor learn from scarce joint-system data. We introduce Generative Gibbs for Physics-Aware Sampling (GG-PA), a training-free framework that composes learned partial priors with explicit physical context through Gibbs sampling. We prove that this sampler is asymptotically exact as the diffusion time vanishes and remains exact at finite diffusion time for quadratic interactions. As a special case, the finite-time result corrects a finite-noise bias in plug-and-play split Gibbs samplers for linear inverse problems at no additional cost. We further introduce replica exchange over diffusion time to accelerate mixing. In experiments, a one-dimensional double-well prior recovers a context-induced distribution shift when coupled to an environment, and copies of such a prior composed on a lattice reproduce the emergent collective behavior of the $φ^4$ model. In atomistic peptide systems, GG-PA captures a context-induced distribution shift and the spontaneous formation of hydrogen-bonded dimers from two copies of a prior trained only on the monomer.

cs.LG · cond-mat.stat-mech

新论文 · v1arXiv:2611.10316

The World Model Planning Accelerator (WMPA): Hardware-Algorithm Co-Design for Embedded AI in Robotics

Prerana Ramkumar, Suhas Suresh Bharadwaj, Fazal Hameed

原文摘要

Embedded AI is moving from perception to prediction. Robots now use world models$\unicode{x2014}$learned simulators that predict the outcome of candidate actions in a compressed latent space before any is executed. Every predicted step must be computed on board within a tight power and thermal budget, yet the energy these steps fundamentally require, and how far real hardware sits from it, have not been characterized. We derive lower bounds on the arithmetic operations and the CMOS dynamic energy of a latent state transition from information theory and Boolean circuit complexity. Profiling a DreamerV3-style Recurrent State Space Model (RSSM) shows that every rollout operation is memory-bandwidth bound and that a GPU consumes at least $5.9\times10^{10}$ times the CMOS energy floor. Transient 3D thermal simulations show that this inefficiency is also a thermal one, since sustained back-to-back planning heats a millimeter-scale silicon tile to 556 K even behind an ideal copper heat spreader. Guided by this chain from bound to bottleneck, we propose the World Model Planning Accelerator (WMPA), a chip architecture for embedded world model planning that combines near-memory computation, real-time entropy estimation, variable-precision rollout units, and copy-on-write latent scratchpads. With a design target of 40x lower power, the same tile stays near ambient at 306 K in simulation, pointing toward practical planning on thermally constrained robots.

cs.AR · cs.LG · cs.RO

版本更新 · v2arXiv:2610.12613

Maximal Linear Arrangement is NP complete on Bipartite Graphs

Aparna Das, Jonathan Needleman

原文摘要

The linear arrangement of a simple graph $G = (V,E)$ is a bijective labeling $π$ of the vertices of $G$ to the set $\{1, \ldots, n\}$. The maximum linear arrangement ($\texttt{maxLA}$) problem is to determine whether $G$ has a labeling such that the sum of labels across $G$'s edges, $\sum_{uv \in E} |π(u) - π(v)|$, is at least a given value $k$. Minimum linear arrangement ($\texttt{minLA}$) is defined analogously. Both $\texttt{maxLA}$ and $\texttt{minLA}$ are known to be NP complete for general graphs. $\texttt{minLA}$ has shown to be NP complete for bipartite graphs by Evans and Shiloah in 1975. It has been an open problem whether the same holds for $\texttt{maxLA}$. In this paper we prove that $\texttt{maxLA}$ is NP complete for bipartite graphs.

cs.DM · math.CO

新论文 · v1arXiv:2611.10313

Multi-objective drift-aware MLOps agent for model retraining

Kumuda Valli, Anli Ji

原文摘要

Deployed ML models face non-stationary data and delayed labels, yet most retraining strategies rely on fixed schedules or brittle drift thresholds that ignore operational cost. In this setting, retraining is a sequential decision problem rather than a one-time threshold choice. We present DARE (Drift-Aware Retraining Engine), an offline, event-driven retraining framework that separates ingestion, monitoring, policy decisions, training, and logging through explicit schemas and deterministic replay. We compare DARE against practical heuristic retraining baselines, including fixed-interval, threshold-persistence, and action-rate-matched fixed scheduling policies. On Airline, the locked LinUCB policy achieves a higher mean F1 while substantially reducing intervention frequency relative to heuristic and action-rate-matched baselines. Additional runtime-calibrated evaluation shows that these gains persist when measured using the cumulative update wall-clock time. These results suggest that conservative sequential retraining policies can improve performance while reducing unnecessary operational overhead under delayed feedback.

cs.LG

新论文 · v1arXiv:2611.10312

Device-Life Boundary Indicators and the Classification of Restored Versus Native Records on Android

Daniel Kwaku Ntiamoah Addai, Selorm Adjabeng, Kingsley Albert Egyir, Sanders Larweh Tetteh

原文摘要

A phone that shows calls, messages and photographs from years ago may have been set up recently and carried them over from an earlier handset, so its screen dates do not date the device's own life. Which traces fix where that life begins, how well they agree and how much of what is visible predates it is unmeasured. We read 14 Android full file system extractions (12 Samsung; Android 10 to 16), seven bug reports and 33 iOS extractions (a probe). Every Android device recorded a first boot, but the first evidence of user setup came a median of 98 days later (0 to 563). Of the 13 devices with messages, 7 held some dated before the first boot, a majority of them on 5; 24% of the apps outside the system image were installed as restored. Against the creator field that a migration tool leaves on messages, a boundary at user setup recalled all but 1 of 46,968 such messages, the first-boot boundary 94 to 100%. On synthetic fixtures, the labelling error followed the boundary error. A date on a record dates the device only once the record is shown to have been created on it.

cs.SE · cs.OS

版本更新 · v2arXiv:2609.05808

Physical policy gradient theorem for in situ stochastic-adjoint training

William Tuxbury, Zin Lin

原文摘要

In situ adjoint training extracts parameter gradients directly from measurement, but has so far been limited to reciprocal or restricted systems. We introduce the physical counterpart of the policy gradient theorem: a stochastic-adjoint gradient estimator that lifts these constraints by trading reciprocity for nondegenerate diffusion. As validation, we train a nonlinear resonator network, whose own dynamics supply the policy, against antagonistic temporal modulations with gradients from measured stochastic trajectories alone, without finite differences or a separate adjoint experiment.

physics.optics · cond-mat.dis-nn · cs.LG

版本更新 · v2arXiv:2605.22897

From Residuals to Reasons: LLM-Guided Mechanism Inference from Tabular Data

Mohammad R. Rezaei, Rahul G. Krishnan

原文摘要

When software fails, we read the error, form a hypothesis, write a patch, and test it. LLMs now do this for neural networks by editing weights; when a tabular model fails, we usually retune it. Most interpretability methods report which features matter rather than how they combine. Rather than asking an LLM to predict the target over the whole output space, we anchor the prediction with a base model and ask the LLM to debug it. We introduce Multi-Agent Residual In-Context Learning (MARICL), in which LLM agents read high-residual examples, hypothesize the missing structure, and write executable correction terms that are then refined by multi-turn textual gradient optimization. The resulting corrections are readable, executable hypotheses about what the base model misses, rather than validated mechanisms. Across nine benchmarks covering scientific, biomedical, socioeconomic, and synthetic data, MARICL reliably repairs its base model's structured residuals, improving it on every dataset, and on synthetic data absent from pretraining it recovers the hidden structure (two seeds). Against the strongest competing baseline it leads on five of the eight real benchmarks and trails TabPFN on the other three, while adding an inspectable correction that black-box baselines do not provide. Code is available at https://github.com/MrRezaeiUofT/Multi_Agent_Residual_In_Context_Learning.

cs.LG

新论文 · v1arXiv:2611.10309

Retention Horizons of Volatile Stores in iOS and Android Extractions

Daniel Kwaku Ntiamoah Addai, Sanders Larweh Tetteh, Selorm Adjabeng, Kingsley Albert Egyir

原文摘要

Whether an extraction can answer a question about a given day depends on how far back each store reaches, yet public statements rest on single test devices. We measured the retention horizon, the time from a store's oldest retained record to acquisition, for eight iOS and seven Android stores on 48 full file system extractions and seven bug reports, keeping devices whose clock agreed with the acquisition time (26 Apple devices, 13 Android phones). Horizons ranged from minutes to years and followed the mechanism that bounds each store. The unified log Persist stream reached a median of 2.5 days; interactionC reached 166 to 170 days on 18 of 25 devices. Android stores stayed within their source-code limits (usage statistics 10.2 days, DropBox 3.1, notifications 1.5); bug-report logs reached 3.1 hours at most. The oldest record misled three times: one knowledgeC stream reached back two years, the others a median of 29 days; interactionC read without its write-ahead log showed older records on 18 of 25 devices; and four of seven bug reports began with stray lines up to 16.6 days old above a body of 3.1 hours or less. A horizon belongs to a store, a release and a device.

cs.SE · cs.OS

版本更新 · v2arXiv:2605.06189

Predictive-Generative Drift Decomposition for Speech Enhancement and Separation

Julius Richter, Yoshiki Masuyama, Christoph Boeddeker, Takahiro Edo, Gordon Wichern, Jonathan Le Roux

原文摘要

We propose Stochastic Interpolant Prior for Speech (SIPS), a plug-and-play framework for speech enhancement and separation that augments pretrained predictors with a generative clean speech prior. Building on stochastic interpolants, we decompose the sampling dynamics into a predictor-induced drift and a score-based denoising component. The predictor guides sampling toward a task-consistent estimate, while a score model trained exclusively on clean speech promotes perceptual naturalness. Unlike prior hybrid approaches, which typically rely on architecture-specific conditioning and are tied to particular predictors or degradation settings, SIPS employs a degradation-agnostic prior that can be reused across predictors and additive degradation tasks without retraining. We evaluate SIPS on speech enhancement and separation using recent predictors such as SEMamba and FlexIO. Across both tasks, SIPS consistently improves non-intrusive speech quality metrics while maintaining competitive performance on reference-based distortion measures and word error rate. For speech enhancement, these improvements are further supported by a subjective listening test.

eess.AS · cs.LG

版本更新 · v3arXiv:2602.07738

Learnable Chernoff Baselines for Inference-Time Alignment

Sunil Madhow, Yuchen Liang, Ness Shroff, Yingbin Liang, Yu-Xiang Wang

原文摘要

We study inference-time reward-guided alignment for generative models. Existing methods often rely on either architecture-specific adaptations or computationally costly inference procedures. We introduce Learnable Chernoff Baselines (LCBs) as a method for efficiently and approximately sampling from the exponentially tilted kernels that arise from KL-regularized reward alignment. Using only black-box sampling access to the pretrained model, LCBs implement a form of rejection sampling with adaptively selected acceptance probabilities, which allows fine-grained control over inference-compute scaling. We establish total-variation guarantees to the ideal aligned model, and demonstrate in both continuous and discrete diffusion settings that LCB sampling closely matches ideal rejection sampling while using substantially fewer queries to the pretrained model.

cs.LG · cs.AI