跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+672新增论文
+517其中 AI 相关
+80已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

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

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

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

找到 24,106 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
新论文 · v1arXiv:2611.08811

I Think, Therefore I Attack: Evaluating Thought Injection Attacks on Reasoning Agents

Parth Illendula, Garik Livingston, Zain Shamsi, Ravi Srinivasan, Alex Liu

原文摘要

Large Reasoning Models (LRMs) are one of the key components of current agentic systems. LRMs augment their output with an explicit chain-of-thought reasoning stage, introducing a new attack surface for thought injection, in which untrusted text resembling the model's own deliberation is fed back to the model. We present a two-part study of this attack, performed against the prevailing large, production class open-weight models (e.g., GLM-5.3, MiniMax-M2.5, Qwen3.8-Flash-Next). We first evaluate the effectiveness of static thought-injection prompts under different styles as well as tagged and untagged conditions and find that the effects of thinking tags and payload styles are all properties of the specific target model. In the second study, we exploit this model-specificity in a containerized agentic cyber range, using indirect injection prompts styled in the form of the target model's own reasoning traces to achieve attack success rates (ASR) up to 50% on operational objectives such as reverse-shell exfiltration and repository backdooring. We also find that the same malicious objective in standard prompt injection user voice never succeeds, and thinking tags suppress the agent's tendency to disclose the injection. Our results show that imitating a reasoning model's own thought style is effective for this style of attack, and that tag stripping is an unreliable defense.

cs.AI · cs.CR

版本更新 · v3arXiv:2609.19150

Sampling Reveals Style: Unsupervised, Training-Free Discovery of Prompt-Conditional Stylistic Axes in LLM Activations

Ajit Mallavarapu, Ziwei Gu

原文摘要

Large language models (LLMs) encode rich stylistic structure in their hidden activations, but discovering which stylistic dimensions are salient for a given prompt typically requires supervised contrastive data. We present a training-free, prompt-conditional alternative: we repeatedly sample completions of a single prompt at elevated temperature, apply Principal Component Analysis (PCA) to the pooled hidden activations, and label the resulting axes automatically from the pole generations. We validate the discovered axes against 245 human-elicited stylistic annotations in a two-phase study. On our strongest model (Qwen-3.5-4B-Instruct), the top two axes match spontaneously requested human dimensions with 72.8% precision and 43.6% macro-recall, and 75.6% of validity ratings judge the axes' polar generations accurate to their labels, with 90.9% adjacent inter-annotator agreement. Discoverability is strongly model-dependent: both Qwen models and Llama-3.2-3B expose human-salient axes, while DeepSeek-7B-Chat drops to 35.3% precision, its leading components dominated by structural rather than stylistic variance. Simple PCA over a model's own decoding variance is thus an effective, low-cost probe of stylistic structure in LLM representations, one that also exposes sharp cross-model differences in how that structure is organized.

cs.CL · cs.LG

新论文 · v1arXiv:2611.08809

Sensing-Based Communication: A Non-Orthogonal Passive Reflection Framework for ISAC

Xin Xiong, Mathew Salas, Sihua Shao, Chen Chen, Mostafa Hassanalian, Rafael Fierro

原文摘要

While integrating uplink without disrupting the primary downlink remains a critical challenge for existing reflective communication systems, this paper proposes a non-orthogonal passive integrated sensing and communication (ISAC) mechanism termed Sensing-based Communication. Originating from and validated within an optical retro-reflective system, this mechanism possesses an underlying wave-agnostic architecture with the potential to be generalized across other physical modalities. It leverages incident downlink signals for parasitic modulation via passive tags. By relying solely on fundamental on-off keying (OOK) reflection, the tag unifies the reflective sensing channel and the uplink communication channel, and simultaneously achieves both sensing and duplex communication. Consequently, our approach introduces uplink capability without sacrificing the downlink data rate or consuming additional spectrum resources. At the receiver, we design a joint decoding architecture combining cross-correlation computation and successive interference cancelation (SIC) to fully exploit the degrees of freedom in broadband signals for multi-user interference suppression. We derive closed-form expressions for the interference and bit error rate (BER) assuming zero-mean Gaussian signals. Using an experimental testbed, we validate the pivotal theoretical finding, the scaling relationship of SINR with signal bandwidth and cross-correlation time--where linear regression yields a strong goodness-of-fit with $R^2 = 0.9688$. Furthermore, evaluations under noise-like orthogonal frequency division multiplexing (OFDM) waveforms exhibit high consistency between theoretical derivations and simulation data ($R^2 = 0.9372$, mean absolute percentage error, $\text{MAPE} = 14\%$), confirming the model's accuracy and waveform generalizability.

cs.IT · eess.SP · eess.SY

新论文 · v1arXiv:2611.08808

Impact of color in computer and human-based object recognition under occlusion

Courtney M. King, Elissa Aminoff, Daniel D. Leeds

原文摘要

Partial occlusions challenge object recognition in both human and computer vision (CV), but the impact is largely dependent on the occlusion and model design. Properties relating to color are particularly important in biological recognition and frequently leveraged for camouflage, however there are still open questions about what makes them effective and how they translate to CV. This work studies partial occlusions that create camouflage, including those that blend in with target objects or with scenes, which alter object representations in distinct ways. Experiments evaluate recognition performance on both human participants and models ranging from convolutional neural networks (CNNs) to transformers, and additional analysis is performed on models to uncover trends in processing and object representations under multiple occlusion types. Novel metrics offer explainability of model behavior under occlusion: non-occlusion precision (NOP) and non-occlusion recall (NOR) measure alignment of model activations with and without occlusion, and activation in occlusion (AIO) measures the percentage of activations that occur in occluded regions. Findings show that human recognition, and most transformers, are negatively impacted by generated camouflaging occluders, with scene-based camouflage performing worse than object-based. Classical CNNs show a strong opposite trend, performing the worst on neutral-colored occlusions, suggesting that contextually-related colors, particularly scene-based, benefit object recognition rather than disrupting shape or boundary cues. Additionally, generated camouflaging occluders for training augmentation improves robustness to unseen camouflage for selected CNN model, and occlusion metrics suggest trends about learned mechanisms. Findings have interesting implications for alignment in human and computer vision, model vulnerabilities, and explainability.

cs.CV

版本更新 · v2arXiv:2609.20797

The Strong Secretary Conjecture is True for Linear Matroids

Kristóf Bérczi, Shaddin Dughmi, Vasilis Livanos, José A. Soto, Victor Verdugo

原文摘要

We prove a $1/e$ guarantee for Matroid Secretary on linear matroids: each element of a fixed optimal basis is selected with probability at least $1/e$. This settles the strong secretary conjecture for this class of matroids. Our result holds both when the matroid is known in advance and when a linear representation is given online. In the known-matroid model, the result extends to fully modular extendable matroids. We also obtain $1/e$ guarantees for a more general model on linear matroids, both when the matroid is known and when its representation is revealed online. In XOS Matroid Secretary, agents with XOS valuations over the elements arrive in uniformly random order, and the algorithm must assign each arriving agent a bundle of elements. The bundles must be pairwise disjoint, and their union must be an independent set of the matroid. We obtain an expected total value of at least $1/e$ times the offline optimum. This model contains Group Matroid Secretary, in which the elements are adversarially partitioned into groups that arrive in uniformly random order, and the algorithm selects a subset of each arriving group. For this special case, we select each element of a fixed optimal basis with probability at least $1/e$

cs.DS

版本更新 · v2arXiv:2610.34855

DecoyCount: Evaluating Visual-Reasoning Misalignment in Counting

Qiuyi, Zhang, Zhen Xu, Jing Gu, Seojin Bang, Arnav Mohanty Das, Yaning Hu, Gautam Kumar 等 17 位作者

原文摘要

Visual counting benchmarks report whether vision-language models produce the correct number, but not whether errors arise from perception or reasoning. We introduce DecoyCount, a benchmark built from 1,586 real-world images with designed decoys across seven mechanisms, along with paired prompts: a neutral question, a matched alignment cue, and a novel multi-hop, multi-image question that situates the same counting problem in a realistic scenario. Using this design, we find that counting failures are induced partly by visual misalignment: models can execute the intended counting process when cue-guided but fail to select it unaided, and we term this difference in accuracy the reasoning-alignment gap. Despite being highly capable on general reasoning, frontier models remain below 50% accuracy on our benchmark, while alignment gaps range from 12.1-22.1 percentage points; strikingly, we observe that more capable models, greater thinking budgets, and agentic processes often induce larger gaps. Because humans may bring context that models lack, we test whether textual underspecification contributes to misalignment using a scenario-based multi-hop condition without explicit hinting, but this added context does not improve aggregate performance. Our analysis concludes that stronger general reasoning does not by itself generalize to aligned visual reasoning, leaving misalignment with human visual expectations as a substantial component of the remaining deficit. DecoyCount and the evaluation code are released at https://github.com/elorian-ai/decoycount.

cs.AI · cs.CV

新论文 · v1arXiv:2611.08804

Generative Search and Recommendation at Shopify

Juhana Kangaspunta, Khalil Hajji, Darshan Fofadiya, Kyumin Park, Michael Garner, Anthony Maltsev, Ryan Synk, Jose Sepulveda 等 11 位作者

原文摘要

Search and recommendation at Shopify require retrieving relevant products from a changing catalog of billions of products under strict latency constraints. We present SID-LLM, which casts both tasks as generating semantic IDs: short sequences of content-derived tokens representing products. We jointly pre-train SID-LLM on catalog and behavioral data, giving search and recommendation a shared representation and training objective. We show that reinforcement learning further improves judged search relevance. Furthermore, distillation from task-specific experts improves recommendation quality over joint supervised fine-tuning without a statistically detected loss in search quality. Finally, for efficient serving, we pair multi-token prediction with a lightweight ranker, improving retrieval quality over our autoregressive baseline while reducing latency. We evaluate SID-LLM both as a standalone retriever and as a component of Shopify's production search and recommendation systems. As a standalone search system, SID-LLM achieves quality comparable to Shopify's existing multi-model search stack while meeting production latency requirements. Integrating SID-LLM into the search and recommendation stacks provides significant gains in both offline evaluations and online A/B tests. Together, these results demonstrate the practical value of semantic-ID generation as a unified approach to product discovery at scale.

cs.IR

版本更新 · v3arXiv:2512.02458

Vision to Geometry: 3D Spatial Memory for Sequential Embodied MLLM Reasoning and Exploration

Zhongyi Cai, Yi Du, Chen Wang, Yu Kong

原文摘要

Embodied agents are expected to assist humans by actively exploring unknown environments and reasoning about spatial contexts. When deployed in real life, agents often face sequential tasks where each new task follows the completion of the previous one and may include infeasible objectives, such as searching for non-existent objects. However, most existing research focuses on isolated goals, overlooking the core challenge of sequential tasks: the ability to reuse spatial knowledge accumulated from previous explorations to guide subsequent reasoning and exploration. In this work, we investigate this underexplored yet practically significant embodied AI challenge. Specifically, we propose 3DSPMR, a 3D SPatial Memory Reasoning framework that utilizes Field-of-View (FoV) coverage as an explicit geometric prior. By integrating FoV-based constraints, 3DSPMR significantly enhances an agent's memory, reasoning, and exploration capabilities across sequential tasks. To facilitate research in this area, we further introduce SEER-Bench, a novel Sequential Embodied Exploration and Reasoning Benchmark that spans two foundational tasks: Embodied Question Answering (EQA) and Embodied Multi-modal Navigation (EMN). SEER-Bench uniquely incorporates both feasible and infeasible tasks to provide a rigorous and comprehensive evaluation of agent performance. Extensive experiments verify that 3DSPMR achieves substantial performance gains on both sequential EQA and EMN tasks.

cs.CV

新论文 · v1arXiv:2611.08802

Scale as a Modality: Multi-Scale Pixel-Space Diffusion Transformers

Ruibo Chen, Kaishen Wang, Tianyi Xiong, Chenxi Liu, Yanshuo Chen, Heng Huang, Jian Du

原文摘要

Latent diffusion models rely on pretrained autoencoders that introduce lossy compression and constrain spatial granularity. Pixel-space diffusion avoids this bottleneck and enables flexible tokenization at multiple spatial scales, yet existing approaches largely adopt two-level coarse-to-fine architectures with limited cross-scale interaction. We introduce MS-pDiT, a multi-scale pixel-space diffusion transformer that treats spatial scale as a modality. MS-pDiT tokenizes the same noisy image at multiple patch sizes, processes each scale in a dedicated transformer stream, and enables bidirectional information exchange through compacted MM-DiT-style joint attention, with attention cost independent of the finest patch size. This design establishes the number of scales as a new architectural scaling dimension. On ImageNet $256\times256$, increasing the number of scales from two to five consistently improves FID from 4.39 to 2.31, 2.26, and 2.19, while adding an intermediate scale substantially outperforms increasing depth under comparable parameter budgets. Further analysis highlights the importance of bidirectional cross-scale interaction and late introduction of fine-grained streams. MS-pDiT achieves FID scores of 1.43 and 1.44 on ImageNet $256\times256$ and $512\times512$, respectively, and naturally extends to text-to-image generation, achieving 0.86 on GenEval and 83.9 on DPG-Bench.

cs.CV

新论文 · v1arXiv:2611.10055

HeteroTask: Multi-Variant Task Scheduling and Execution on Distributed Heterogeneous Clusters

Hongzheng Tian, Alok Mishra, Haocheng Xu, Dejan Milojicic, Sitao Huang

原文摘要

Heterogeneous systems that combine CPUs and GPUs across multiple servers offer substantial compute capability but complicate scheduling. For DAG-based applications with multiple task implementations, effective execution requires coordinating variant selection, device placement, and data movement. Offline planning can exploit global dependency information, yet plans derived from isolated kernel profiles may diverge from execution because of runtime overheads. We introduce HeteroTask, a framework integrating kernel-wise profiling, PEFT-based multi-variant planning, host-buffer lifetime modeling, and schedule-driven MPI execution. A Bayesian-optimization loop calibrates empirical overhead corrections for repeated, fixed-DAG workflows on exclusively allocated nodes. We evaluate five benchmark and workflow-derived applications on up to six 8-GPU nodes. On two 8-GPU nodes, HeteroTask reduces application-level completion time by 19.7-72.1% relative to the compared StarPU implementations. For Canny Edge Detection, calibration reduces task-window makespan by 25.0% relative to planning without overhead corrections. Combined with CPU/GPU variant selection, calibration reduces it by 58.9% relative to an uncalibrated GPU-only execution.

cs.DC

新论文 · v1arXiv:2611.08800

On the Few-Shot Adaptation of Vision-Language Models: A Few Gradient Signs Are All You Need

Nairouz Mrabah, Ismail Ben Ayed, Mahdi S. Hosseini, Eric Granger

原文摘要

The limited supervision available for the few-shot adaptation of vision-language models makes gradient estimation particularly noisy. We find that the gradient magnitudes are severely miscalibrated, while the signs of a small top-magnitude subset remain informative. This motivates SignSparseSGD and DynSignSparseSGD, two state-free optimizers that use gradient magnitudes only to select where to update and fixed-magnitude signs to decide how to update. The static variant fixes the support after the first minibatch. The dynamic variant refreshes it at every step. Across 11 datasets, three CLIP backbones, and five shot levels, the proposed methods are competitive with or outperform parameter-efficient and optimization-based baselines on average, while exhibiting markedly lower sensitivity to long training schedules. They introduce no task-specific modules, maintain no first- or second-moment optimizer states, and use one shared configuration across datasets, backbones, and shot levels. Our code is included in the supplementary materials and will be released upon publication.

cs.LG · cs.CV

新论文 · v1arXiv:2611.08799

The Matthews Correlation Coefficient: Fifty years

Jesus S. Aguilar-Ruiz

原文摘要

Fifty years after its introduction, the Matthews Correlation Coefficient (MCC) remains central -and debated- in binary classification. This survey offers a comprehensive retrospective and an in-depth analysis of MCC, covering its historical development, mathematical foundations, and implications for practice. We clarify long-standing misconceptions, formalize its equivalences (to Pearson's correlation and to Chi2 in 2x2 tables), and examine its behavior under class imbalance. Beyond MCC, we develop analytical (derivatives) and graphical (contour plots) frameworks that generalize to any confusion-matrix-based metric. These frameworks expose structural properties -bias, robustness, sensitivity- that scalar summaries conceal, and they provide actionable guidance for selecting and interpreting performance measures in applications where reliability and fairness matter. Together, our results position MCC within a broader toolkit while clarifying when it is informative -and when alternatives may be preferable.

cs.AI

新论文 · v1arXiv:2611.08798

Driver Takeovers and Longitudinal Responses Analysis from Naturalistic Driving

Yuhang Wang, Hao Zhou

原文摘要

As Level 2 advanced driver-assistance systems (ADAS) become more widely used, understanding driver-system interaction is increasingly important for traffic safety. However, limited real-world data make these interactions difficult to study. We present ADAS-TO, a naturalistic dataset of 16,446 takeover clips from 364 drivers across 2,585 different drives. It combines road video, vehicle kinematics, driver inputs, and ADAS status. To analyze takeover behavior, we retained 6,206 manually reviewed takeover events during continued lane keeping or car following. We excluded events in which the driver intentionally changed lanes, turned, or made a stop beyond the ADAS's capabilities (e.g., at a red light or stop sign) shortly after takeover. Drivers began intervening before ADAS disengaged in 65.6% of takeovers involving braking or steering. When the ego vehicle was still closing on a lead vehicle at disengagement, longitudinal safety margins often narrowed further after the transfer to manual control. Among 2,031 such events, 78.5% had a lower minimum time-to-collision (TTC) in the five seconds after disengagement than in the five seconds before it. For events involving braking, the mean TTC trajectory reached its minimum about 1.2 s after disengagement. We model the subsequent braking response using a Gazis-Herman-Rothery (GHR) car-following law. Its median five-second spacing root-mean-square error is 1.34 m with observed lead motion and 1.84 m with predicted lead motion. The fitted model expresses braking as a response to looming, with stronger responses at higher speeds and shorter gaps. Applied before takeover, it shows that greater looming than predicted by the human-response reference is associated with disengagement. These findings support continued assessment of longitudinal safety after ADAS disengagement, while the driver's braking response develops.

cs.HC

版本更新 · v3arXiv:2604.23853

ClawTrace: Cost-Aware Tracing for LLM Agent Skill Distillation

Boqin Yuan, Yue Su, Renchu Song, Sen Yang, Jing Qin

原文摘要

Skill-distillation pipelines learn reusable rules from LLM agent trajectories, but they lack a key signal: how much each step costs. Without per-step cost, a pipeline cannot distinguish adding a missing step to fix a bug from removing an expensive step that never affected the outcome. We use the cost-attribution gap to ask whether the rule types inside a distilled skill transfer the same way to new tasks. ClawTrace records cost-attributed agent traces and compiles each session into a TraceCard; CostCraft reads TraceCards and writes three kinds of skill patches: preserve, prune, and repair. We find a pattern aggregate metrics hide. On 30 held-out SpreadsheetBench tasks across two seeds, removing prune patches roughly tripled the quality-regression count without lowering median cost. Across the full 84-task SkillsBench transfer, CostCraft saves no aggregate cost. All three quality regressions trace to the preserve lane, and both quality wins trace to the prune lane: prune patches act as quality guardrails while preserve patches drive regressions. We argue that reusable agent skills should be evaluated at the rule-type level, not as monolithic instruction packages. To support this, we release ClawTrace, the TraceCard schema, and the full set of typed skills.

cs.AI

新论文 · v1arXiv:2611.10054

AYO: A Safe and Privacy-Preserving Platform for Studying Children's Interaction with LLMs

Huiwen Alex Yang, Rachel Skwersky, Bill D. Thompson, Celeste Kidd

原文摘要

Children and adolescents are increasingly interacting with generative AI and large language models (LLMs), yet little is known about how these interactions may influence their development, beliefs, and behavior. Existing research has relied heavily on surveys, while direct study of children's interactions with LLMs presents substantial challenges related to safety, privacy, consent, and experimental control. We introduce AYO (AI Youth Open Science), an open-source platform designed for safe and systematic research on children's interactions with conversational AI. AYO provides a child-friendly interface, configurable age-based safety guardrails, researcher monitoring, and privacy-preserving data practices. These capabilities enable cross-sectional, longitudinal, and experimental research on how children use and respond to LLMs and how AI design may shape trust, epistemic judgment, curiosity, and other aspects of development. AYO provides the infrastructure to generate evidence that guides safer AI systems, educational practices, and policies for children growing up with AI.

cs.AI

版本更新 · v3arXiv:2608.26515

Sharp Minimax Regret for Infinite-Memory Logistic Prediction

Vaneet Aggarwal

原文摘要

We study sequential prediction of binary marks whose log-odds are a linear function of all past inputs. The inputs are independent uniform signs. The coefficient of the input observed $j$ steps earlier is unknown, but its absolute value is at most a known number $r_j$, and $\sum_j r_j\le B$. A learner is judged by its expected cumulative log loss in excess of the loss of the true conditional probabilities. We show that for every such sequence $r$ and every horizon $T$, the minimax value of this regret lies between $c\,Γ_T(r)/\max\{1,B^2\}$ and $\frac12Γ_T(r)$, where $Γ_T(r)=\sum_{j\le T}\log(1+(T-j+1)r_j^2)$ and $c$ is an absolute constant. The term for lag $j$ combines the size bound $r_j$ with the number $T-j+1$ of rounds in which that lag influences a prediction, and no monotonicity or other regularity of $r$ is needed. The upper bound is attained by a Bayesian mixture with independent Gaussian priors. For the lower bound, we apply the van Trees inequality at each prediction step and then bound the expected log-determinant of the random matrix whose rows are the lagged input vectors. We also characterize when $\frac12$ is the exact leading constant: for envelopes with a common bound $B$, possibly changing with $T$, the regret is asymptotic to $\frac12Γ_T(r)$ if and only if $\sum_{j\le T}\min\{1,(T-j+1)r_j^2\}=o(Γ_T(r))$. This gives, for example, $\log^2(A^2T)/(8α)$ for $r_j=Ae^{-αj}$, whereas for $r_j=Aj^{-s}$ with $s>1$ the regret is of order $T^{1/(2s)}$ and its ratio to $Γ_T(r)$ stays below $\frac12$. Finally, for a known horizon, an online Newton predictor with features scaled by $r_j$ attains regret of order $Γ_T(r)$ with polynomial computation per round.

cs.IT · cs.LG

新论文 · v1arXiv:2611.08797

MotionBench-XAI: Benchmarking What Shapes Shapley Explanations in Spatiotemporal Machine Learning

Mathilde Papillon, Louisa Cornelis, Nina Miolane

原文摘要

Predicting outcomes from spatiotemporal data, such as assessing Parkinson's severity from human motion, often requires explainability in addition to accuracy. Practitioners need to know what drove the prediction, whether it be spatial (a body joint), temporal (a specific window), or both. Shapley values are attributions computed by treating input features as players in a cooperative game and measuring how the model output changes as coalitions of players are removed. Computing them involves choosing what counts as players, how absent players are imputed, and how the game is evaluated. How these choices affect explanation quality is poorly understood for spatiotemporal data, and real data carries no ground-truth attributions to check against. We present MotionBench-XAI, a benchmark built on i) five synthetic spatiotemporal datasets with exact ground-truth Shapley values, ii) three real datasets across clinical gait, electrocardiogram, and audio, iii) ten attribution methods across three player sets, and iv) three trained architectures. We show that grouping features into players, across time, space, or both, matters more than the choice of imputer. Generative imputers improve explanations only when their conditional models are accurate. On real data, the standard proxy metrics select contradictory best methods. We distill these findings into practical insights and provide an open-source pipeline.

cs.LG

版本更新 · v4arXiv:2509.22738

Enabling Approximate Joint Sampling in Diffusion LMs

Parikshit Bansal, Sujay Sanghavi

原文摘要

In autoregressive language models, each token is sampled by conditioning on all the past tokens; the overall string has thus been sampled from the correct underlying joint distribution represented by the model. In contrast, masked diffusion language models generate text by unmasking tokens out of order and potentially in parallel. Generating an overall string sampled from the correct underlying joint distribution would (again) require exactly one token unmasking in every full-model forward pass. The more tokens unmasked in parallel, the further away the string is from the true joint; this can be seen in the resulting drop in accuracy (but, increase in speed). In this paper we devise a way to {\em approximately} sample multiple tokens from the joint distribution in a single full-model forward pass; we do so by developing a new lightweight single-layer ``sampler" on top of an existing large diffusion LM. One forward pass of the full model can now be followed by multiple forward passes of only this sampler layer, to yield multiple unmasked tokens. Our sampler is trained to mimic exact joint sampling from the (frozen) full model. We show the effectiveness of our approximate joint sampling for both pretrained-only (Dream-7B-Base, Llada-7B-Base) and instruction-tuned (Dream-7B-Instruct, Dream-7B-Coder) models on language modeling and math \& coding tasks. When four tokens are unmasked for each full-model denoising step, our sampling algorithm achieves a MAUVE score of 0.87 (vs marginal baseline of 0.31) with respect to the true joint distribution.

cs.CL · cs.LG

版本更新 · v2arXiv:2609.16222

How I learned to stop worrying and love StopGrads: Stationarity, Convergence, and a case study on Flow Map Learning

Max W. Shen, Mark Goldstein, Zichu Wang, Aahlad Puli, Rajesh Ranganath

原文摘要

Stopgrads are widely used in training machine learning models, but stopgrads can alter the gradient, stationary points and convergence guarantees of the original objective, which can make stopgrad training theoretically ungrounded. We introduce a stopgrad regression principle, which identifies a general template for stopgrad objectives with a closed-form characterization of stationary points and their uniqueness, unifying stopgrad objectives for flow maps, reinforcement learning, and diffusion samplers. We provide theoretical grounding for optimizing stopgrad flow map objectives by showing their unique stationary point is the true flow map, and showing positive convergence results for Eulerian and Lagrangian objectives, including MeanFlow and improved MeanFlow. Remarkably, we show that under functional semi-gradient flow, the learned flow map has a closed-form expression composing the initial flow map and the true flow map. We additionally use our stopgrad regression principle to propose modified stopgrad placements for flow map objectives which reduce training memory by 2x.

cs.LG

新论文 · v1arXiv:2611.08795

MotionDecipher: LLM-Assisted Clinical Interpretation of Human Motion Signals for Efficient Gait Analysis

Mingrui Ma, Tian Tan, Jinsi Guo, Jessica Rose, Yiwen Dong

原文摘要

Clinical gait and motion analysis is widely used to guide targeted interventions for patients with neurological disorders, the outcome of which is typically a report with descriptions of joint movements and forces. Current practices rely on experts' manual effort, which is labor-intensive and time-consuming. Recent advancements in Large Language Models (LLMs) provide opportunities to address this problem, but translating human motion into clinical gait descriptions remains challenging because the quality of the context directly affects LLMs' reasoning capability over continuous motion signals. To tackle this, we introduce MotionDecipher, a novel framework bridging the semantic gap between motion data and clinical interpretations. Specifically, we made 3 key advancements: 1) a Human Motion Tokenizer that converts motion signals into domain-specific tokens for time- and frequency-informed gait interpretation; 2) a Meta Feature Selector that transforms tokens into Structured Representations; and 3) a Hybrid Context Constructor to determine the optimal demonstration-based prompt for In-Context Learning. We evaluated MotionDecipher on data collected at an accredited gait lab from 122 patients and 46 controls. Results show that MotionDecipher achieves 0.91 BERTScore (13% over GPT-5), while expert evaluation ranks MotionDecipher highest in Correctness, Completeness, and Conciseness compared to baselines, highlighting its promise for efficient gait analysis.

cs.HC · cs.AI

新论文 · v1arXiv:2611.08794

High-Dimensional Off-Policy Evaluation without Sample Splitting using an Onsager Correction

Saksham Jain, Guillaume Braun, Masaaki Imaizumi

原文摘要

Reward models used for off-policy evaluation (OPE) are commonly selected using held-out data. When sample size and context dimension grow proportionally, the difference in test risk between models fitted on the full sample and on a fixed fraction of it need not vanish. Held-out evaluation can therefore consistently estimate the test risk of the model trained on the smaller sample, but because the relative ranking of candidate reward models can change after full-data refitting, held-out selection can be suboptimal. We develop an Onsager-corrected, target-policy-weighted criterion that estimates the full-data reward model's out-of-sample risk under the target policy using only its training observations. This enables early stopping along the full-data gradient-descent trajectory without sample splitting. For neural networks with fixed depth and hidden width under Gaussian contexts, single-index rewards, context-dependent multi-index target policies, and known context-independent logging, we prove uniform consistency of our criterion over a fixed finite set of gradient-descent iterates and a near-oracle guarantee for the selected reward model. The same correction yields a doubly robust estimator that consistently estimates the true policy value without sample splitting, even when reward-model prediction error does not vanish. Experiments show decreasing risk-estimation error as dimension grows at a fixed sample-to-dimension ratio, and improved reward-model selection relative to held-out baselines. Empirically, our correction also reduces the root mean squared error of doubly robust value estimates computed from the same data used to fit and select the reward models.

stat.ML · cs.LG · math.ST

新论文 · v1arXiv:2611.08792

Online Bin Packing with Dispatch Deadlines

Pei-Lin Chiang, Wing-Kai Hon, Kazuo Iwama, Li-Tzu Yang

原文摘要

We study a generalization of online bin packing by introducing dispatch deadlines. Items arrive over time in an online fashion. Each item has an arrival time, a size in $(0,1]$, and a deadline, all of which are revealed only when the item arrives. The algorithm must immediately and irrevocably assign the item to a unit-capacity bin that has not yet been dispatched. Each bin must be dispatched no later than the earliest deadline of the items assigned to it, and once it is dispatched, it cannot be used for future items. The goal is to minimize the number of bins used. Applications arise naturally in logistics. Additionally, the offline version of this problem has appeared under several names, including the clique partition problem in weighted interval graphs and the BinSchedule problem. This problem is also a special case of online bin packing with conflicts and is closely related to online bin packing models with delay costs. We study the competitive ratios of several classical online bin packing algorithms when applied to this problem, and show that a similar hierarchy of competitive ratios carries over. Our main technical results are that the competitive ratio of First-Fit is exactly $16/7 \approx 2.28571$, and that no deterministic online algorithm has a competitive ratio less than $11/5 = 2.2$, showing that First-Fit is quite close to best possible. In addition, Next-Fit and Worst-Fit have competitive ratio exactly $3$, and every algorithm in the Any-Fit class has competitive ratio between $16/7$ and $3$.

cs.DS

版本更新 · v3arXiv:2605.30778

Closed-Loop Object-Informed Control for Non-Prehensile Robot Manipulation

Nikola Raicevic, Hyomuk Kim, Shahid Mulla, Hyungjun Doh, Bharath Raam Radhakrishnan, Chenbin Yu, Ki Myung Brian Lee, Nikolay Atanasov

原文摘要

Non-prehensile robot manipulation is challenging due to discontinuous, long-horizon interactions between the robot and the objects it manipulates. Sampling-based model predictive control methods are effective with discontinuous contact but face challenges with finding promising trajectories in long-horizon planning. We propose a closed-loop object-informed (CLOI) method that splits the problem into object-level planning to find long-horizon object poses that lead the object to its goal, and robot-level planning to select robot actions that follow those poses. We use model predictive path integral (MPPI) control to solve the subproblems and couple their solutions through consensus on the object poses using the alternating direction method of multipliers (ADMM). The object plan is revised toward robot-realizable object trajectories, while the robot plan is aligned with the object poses the task requires. In planar pushing tasks with obstacles using an xArm6 manipulator, CLOI increases the success rate by 35% in simulation and 43% on hardware, compared to standard MPPI given the same computational budget.

cs.RO

新论文 · v1arXiv:2611.08791

AircraftWitness: How Often Aircraft Can Locate Recordings

Kris Atallah

原文摘要

Aircraft overhead can reveal where an outdoor recording was made. Propellers and rotors leave Doppler curves in audio, and public ADS-B archives log equipped aircraft. We measure how often, blind and against chance. Our main test was registered and timestamped before any audio, and its two amendments came before any answer was read. It covers 24 new places, with the recorders' own clocks, a 300 s slack and a 20 km square. The best of three locators places clear-pass clips within 1 km at 4 places, where a uniform guess predicts 0.57 (p = 0.0065 after correcting for the pick). With the wrong time or swapped audio it places none. The other two hit 1 and 2. On 360 clips from 7 places of a GPS-timed network, two locators place 6% and 8% within 1 km. By place, a unit chosen after that run, they hit 4 and 5 of 7 where a uniform guess predicts 2.3. On 1,600 random public recordings, picked and cut without the truth in a time-bounded run, the three locators answer at most 20 times and place at most 2. We release AircraftWitness, a benchmark, and pass labels for 11.7 million recordings.

cs.SD · eess.AS

版本更新 · v2arXiv:2605.29059

SCDBench: A Benchmark for LLM-Based Smart Contract Decompilers

Kaihua Qin, Dawn Song, Arthur Gervais

原文摘要

Smart contract decompilation aims to recover high-level source code from bytecode, but evaluating decompilers remains difficult because existing studies use narrow datasets, inconsistent metrics, and limited semantic consistency checks. This gap is increasingly important as large language models (LLMs) begin to generate source-like Solidity that may compile and appear plausible, even when its semantics diverge from the original contract. We introduce SCDBench, a dataset and benchmark methodology for LLM-based smart contract decompilation. The dataset contains 600 real-world Solidity contracts with paired bytecode inputs, ground-truth source code, and replayable semantic checkpoints. SCDBench evaluates decompiler outputs through four cumulative stages: format completeness, compilability, Application Binary Interface (ABI) recovery, and semantic consistency via differential replay. We evaluate Claude Opus 4.7, GPT-5.3-Codex, and GLM-5 in a zero-shot decompilation setting, including GLM-5 variants with and without extended reasoning and a zero-shot compilation-repair setting. The results show that frontier LLMs can often produce structured and compilable Solidity, but achieving semantic consistency remains far from solved: the best-performing frontier model perfectly decompiles only 42/600 contracts. We further show that introducing same-model compilation repair substantially improves performance at modest additional cost. SCDBench establishes a common ground for rigorous, reproducible evaluation and aims to accelerate the development of reliable smart contract decompilers for blockchain security and transparency.

cs.SE · cs.AI · cs.CR

新论文 · v1arXiv:2611.08790

SteerGR: Steering Generative Recommendation via Sparse Autoencoders for Controllable Game Discovery

Sunkyung Lee, Xiaokai Wei, Da Long, Hyunsik Jeon, Jiajun Wu, Rithwik Seth, Jongwuk Lee, Michelle Gong 等 9 位作者

原文摘要

Generative recommendation aims to predict item identifiers from user interaction histories, but explicit control over the properties of recommended items remains underexplored. A key challenge is to connect human-readable concepts to internal features whose interventions effectively change the recommended items. To address this, we propose Steerable Generative Recommender (SteerGR), a framework that uses sparse autoencoders for concept-level control in game discovery. SteerGR proceeds through three stages: (i) Concept Definition and Grounding for defining play concepts with an LLM; (ii) Feature Discovery and Selection for discovering candidate features by their concept associations and selecting one by its steering effect; and (iii) Sparse Feature Intervention for amplifying or suppressing selected features to steer recommendations without retraining the recommender. Extensive experiments with two industrial generative recommendation models on a real-world game dataset show that the selected features successfully steer recommendations toward or away from target concepts. We believe this work takes a first step to extend SAE-based steering from LLMs to industrial generative recommendation.

cs.IR · cs.AI · cs.CL

版本更新 · v3arXiv:2609.04748

Same Request, Different Answer: Quantization Amplifies Cache-Induced Divergence in LLM Serving

Aditi Patodiya

原文摘要

Major open-source serving stacks reuse the key-value tensors of a shared prefix by default. We measure what this prefix reuse costs in reproducibility. Holding model, decoding, seed and request order fixed at batch size one, we ran an eighty-episode multi-turn agentic tool-use workload with prefix reuse on and off across two engines and four weight formats. Without prefix reuse, repeated runs reproduced every token and log-probability in all ten configurations. With it, cache-hit and recompute paths diverged on both engines. On llama.cpp with GGUF weights this path divergence rises with quantization: for Qwen2.5-7B over ten independent server histories, it reached 37.4 percent of episodes at 16-bit and 82.5 percent at four-bit. Near-tie decisions became only about 1.2 times as common, while the cache-path change in top-two margins grew 4.9-fold from 16-bit to three-bit. Serving four-bit weights through 16-bit kernels left divergence not detectably different from 16-bit, placing the amplification mainly in the quantized execution path. At Q4_K_M, run-to-run divergence came mainly from llama.cpp's server-level prompt cache: under the canonical episode order it moved divergence by 37.5 points, and at its default, divergence spanned 20.0 to 28.7 percent under five random orders. With cache state restored, each path reproduced exactly while the two still differed. In the tested stacks, cached serving is irreproducible because the cache state is absent from the request and not reset by default. A single-turn bridge shows path divergence reaching task outcomes with no detectable net change in accuracy. We release the harness, logs, and analysis pipeline.

cs.SE · cs.DC · cs.LG

新论文 · v1arXiv:2611.08789

TopoSHAP: Shapley for Explainable and Efficient Topological Deep Learning

Mathilde Papillon, Nina Miolane

原文摘要

Topological deep learning (TDL) extends learning on graphs, such as molecules or social networks, to higher-order structures, such as rings in a molecule or groups in a social network. Explaining which of these structures drive a model's predictions, and which architectural components matter most for its performance, remains challenging. We introduce TopoSHAP, an efficient and general explanation framework that addresses both questions across topological domains and model architectures. TopoSHAP-cell assigns Shapley values to topological data cells and extracts compact explanations. These explanations match or outperform graph-based counterparts on GraphXAI benchmark data while running up to 112$\times$ faster. They also reveal advantageous topological feature design, leading to measured improvements in explanation recovery and predictive accuracy. On the architecture side, TopoSHAP-neighbor explains how neighborhoods contribute to model performance, and turns these evaluations into a backward-elimination search that identifies smaller, competitive architectures early in training. This is up to $11.3\times$ cheaper than traditional TDL training sweeps.

cs.LG

版本更新 · v8arXiv:2509.24102

Pragmatic Inference for Improving Social Reasoning Generalization in Large Language Models

Guangliang Liu, Xi Chen, Bocheng Chen, Han Zi, Xitong Zhang, Yuda Chen, Kristen Johnson

原文摘要

Achieving social reasoning, including moral reasoning, cultural awareness, and politeness, is critical for the socially reliable deployment of large language models (LLMs). A key bottleneck is limited generalization: social situations that convey similar social implicatures can be expressed through highly diverse linguistic forms, creating an enormous space of possible situations and posing a substantial computational challenge even for LLMs. From a linguistic perspective, this challenge arises because social reasoning operates at the pragmatic level, requiring a pragmatic inference process to infer social implicatures from a given situation and its underlying social context. Although moral values such as moral foundations are generally considered as the representations of the social context, how to construct the corresponding pragmatic inference steps remains underexplored. Taking moral reasoning as an instance of social reasoning, this paper develops a pragmatic inference approach that enables LLMs to infer moral implicatures by (1) specifying the inferential steps through which LLMs derive moral implicatures from language, and (2) explicitly modeling the metapragmatic links among these inferential steps to bridge the pragmatic gaps between them and make such inferences learnable for LLMs. Experimental results demonstrate that our approach substantially improves LLMs' generalization in moral reasoning, highlighting the potential of pragmatic inference for future social reasoning research.

cs.CL

新论文 · v1arXiv:2611.08788

Not All Latents Are Equal: Importance-Weighted Latent Graph Generation

Biraaj Rout, Jay Revolinsky, Han Liu, Harry Shomer

原文摘要

Graph generation has shown tremendous effectiveness in modeling complex scientific tasks ranging from molecule generation to optimized circuit design. Most recent advancements have developed models that learn to denoise noisy graphs using either discrete diffusion or flow matching. However, discrete graph diffusion scales quadratically with the number of nodes, making it difficult to use such models on larger graphs. On the other hand, latent graph generation instead seeks to denoise noisy graph latents, which scale better to more nodes due to their lower dimension. However, in practice, latent graph generation models lag behind their discrete counterparts in performance. We study this problem, finding that it is caused by the unequal distribution of that different latent dimensions have on graph reconstruction. the impact. We observe that the vast majority of impact is contained in only a smaller number of latent dimensions. Since equal emphasis is placed on reconstructing the entire latent in the loss function, existing models are optimized to reconstruct information irrelevant to the downstream task. To tackle this problem, we propose Latent Importance Reweighting ({\bf LIR)} which weights each latent dimensions via it's importance to final graph reconstruction. Importance is calculated as the relative influence of a single latent unit on graph reconstruction, which is represented via the Jacobian of the decoder relative to the latent. Our method is model-agnostic and requires no additional model parameters or hyperparameters. Experiments show that LIR can boost performance and lead to faster training convergence when applied to two different autoencoders on various benchmark datasets. Code: https://github.com/biraaj/GraphGenLatentReweight

cs.LG · cs.AI