跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

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

全站更新概况

+788新增论文
+627其中 AI 相关
+81已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-09 11:20 · 全站最近入库:2026-11-09 11:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-09 11:20最近发现新增版本:2026-11-09 11:19库内论文最新更新时间:2026-11-06 21:58

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

17,888 已收录论文15,288 AI 相关4,419 有修订112 HF 社区发现

浏览论文库

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

找到 17,888 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-09 11:19(北京时间)
新论文 · v1arXiv:2610.38000

Self-Labeled Preference Transfer for Steerable Robot Manipulation

Kaiwen Hong, Shaoting Peng, Xiangyu Zeng, Pengcheng Wang, Boyuan Tian, Haonan Chen, Yifan Zhu, Yixiao Wang 等 9 位作者

原文摘要

Vision-language-action (VLA) policies can learn to follow execution preferences, such as where to grasp an object or how to move around an obstacle, from demonstrations annotated with preference labels. Providing these annotations for every new task, however, is costly. We study whether learned preference control can transfer to new tasks whose demonstrations contain the desired behaviors but lack preference annotations. We find that a policy trained with preference annotations can follow preferences on a new task before adaptation but achieves limited task success. Fine-tuning on target demonstrations without these annotations improves task success while weakening preference control. Motivated by this finding, we introduce Self-Labeled Preference Transfer (SPT). SPT jointly trains a shared vision-language backbone for preference-conditioned action prediction and preference recognition on annotated source demonstrations. It then freezes the recognizer to preserve its cross-task preference recognition capability and uses it to self-label target demonstrations for policy fine-tuning. Across five types of execution preferences in simulation, the recognizer achieves 96.4% accuracy, and SPT reaches 84.8% preference following and 89.2% task success, compared with 59.4% and 88.0% for naive finetuning. We further extend to multiple preferences, achieving 93.8% preference following compared with 42.5% of baselines. In real-world experiments, SPT increases preference following from 52.5% to 92.5% relative to naive finetuning across two task transfers. These results show that SPT can support preference adaptation across tasks and objects while maintaining success, without additional manual preference annotations.

cs.RO

版本更新 · v5arXiv:2601.16407

Jacobian Scopes: A Unified Geometric Framework for Token-Level LLM Attribution

Toni J. B. Liu, Baran Zadeoğlu, Gurbir Arora, Raphaël Sarfati, Nicolas Boullé, Christopher J. Earls

原文摘要

Large language models (LLMs) make next-token predictions based on clues present in their context, such as semantic descriptions and in-context examples. Yet, elucidating which prior tokens most strongly influence a given prediction remains challenging due to the proliferation of layers and attention heads in modern architectures. We propose Jacobian Scopes, a suite of gradient-based, token level causal attribution methods for interpreting LLM predictions. Grounded in perturbation theory and information geometry, Jacobian Scopes quantify how input tokens influence various aspects of a model's prediction, such as specific logits, the full predictive distribution, and model uncertainty (effective temperature). Through case studies spanning instruction understanding, translation, and in-context learning (ICL), we demonstrate how Jacobian Scopes reveal implicit political biases, uncover word- and phrase-level translation strategies, and shed light on recently debated mechanisms underlying in-context time-series forecasting. On token-ablation faithfulness benchmarks (LAMBADA and IWSLT2017) across six LLMs, the distribution-level Fisher and Temperature Scopes significantly outperform established gradient-based attribution methods in 10 of 12 model-dataset settings. To facilitate exploration of Jacobian Scopes on custom text, we open-source our implementations and provide a cloud-hosted interactive demo at https://huggingface.co/spaces/Typony/JacobianScopes.

cs.CL · cs.AI

版本更新 · v2arXiv:2512.23304

MedGemma vs GPT-4: Open-Source and Proprietary Zero-shot Medical Disease Classification from Images

Md. Sazzadul Islam Prottasha, Nabil Walid Rafi

原文摘要

Multimodal Large Language Models (LLMs) introduce an emerging paradigm for medical imaging by interpreting scans through the lens of extensive clinical knowledge, offering a transformative approach to disease classification. This study presents a critical comparison between two fundamentally different AI architectures: the specialized open-source agent MedGemma and the proprietary large multimodal model GPT-4 for diagnosing six different diseases. The MedGemma-4b-it model, fine-tuned using Low-Rank Adaptation (LoRA), demonstrated superior diagnostic capability by achieving a mean test accuracy of 80.37% compared to 69.56% for the untuned GPT-4. Furthermore, MedGemma exhibited notably higher sensitivity in high-stakes clinical tasks, such as cancer and pneumonia detection. Quantitative analysis via confusion matrices and classification reports provides comprehensive insights into model performance across all categories. These results emphasize that domain-specific fine-tuning is essential for minimizing hallucinations in clinical implementation, positioning MedGemma as a sophisticated tool for complex, evidence-based medical reasoning.

cs.CV · cs.AI

新论文 · v1arXiv:2610.37995

QMUL_AK at AISA-ArabicFC: Schema-Constrained Function Calling with ALLaM

Ali Khairallah, Arkaitz Zubiaga

原文摘要

We describe the QMUL_AK submission to AISA-ArabicFC 2026. The system adapts the Arabic-English ALLaM-7B-Instruct model to function calling with low-rank adaptation (LoRA). It combines an Arabic schema-aware prompt, dialect and no-call resampling, a token-weighted training objective, and deterministic validation of generated calls against the candidate tool schema. The same output supports Track A function calling and Track B reasoning-augmented calling. Training uses only the official task data. On the development set, the system achieves 0.9982 function accuracy and 0.8920 argument exact match, corresponding to overall A and B scores of 0.9345 and 0.9454. On the blind test set, the system reaches overall A and B scores of 0.9253 and 0.9380, ranking 3rd on both submission tracks and 1st of 21 teams on the Track C dialect-robustness diagnostic with a macro-averaged score of 0.9075 and the smallest dialect gap in the shared task (0.077). The results show that function selection is nearly saturated, while argument extraction remains the main source of error.

cs.CL

新论文 · v1arXiv:2610.37994

Towards Generalizing Pretrained All-Atom Representations to Unified Binder Design

Maojiang Su, Jiale Chen, Qijie Zhu, Shang Wu, Jiayi Wang, Jihai Zhao, Guo Ye, Yibo Wen 等 9 位作者

原文摘要

PairFormer-based all-atom models demonstrate strong capabilities in biomolecular binder design. However, existing methods often use all-atom representations for modality-specific binder design, such as protein and peptide design. In contrast, recent geometric latent diffusion models pursue unified binder design by representing molecular blocks from different modalities in a shared latent space. These complementary strengths motivate us to investigate how to generalize the use of pretrained all-atom representations to unified binder design. We introduce PairFuse, a parameter-efficient method that enables this generalization through representation fusion. Specifically, we use lightweight layerwise adapters to integrate pretrained all-atom representations into an independently pretrained geometric latent diffusion model. Our adapters integrate pretrained all-atom representations through two mechanisms: enriching the diffusion model's molecular block features and incorporating pairwise structural information into the geometric diffusion model's denoiser. Theoretically, we prove that the augmented denoiser preserves geometry and pairwise attention fusion provides additional attention expressivity beyond feature-only fusion. Experimentally, across antibody, peptide, and small molecule binder-design benchmarks, PairFuse achieves stronger performance than the pretrained diffusion model and existing representation-fusion baselines.

cs.LG · cs.AI

新论文 · v1arXiv:2610.37993

Deep learning for non-transvenous ICD screening: tailored neural network architectures, extended experiments, and explainability

Bartosz Morawski, Samuel J. Ward, Alex Touze, Lin-Thiri Toon, Paul R. Roberts, John Paisey, Alain B. Zemkoho

原文摘要

This paper studies two non-transvenous implantable cardioverter-defibrillators (ICDs), namely the Subcutaneous ICD (S-ICD) and the Extravascular ICD (EV-ICD). Both avoid the complications of transvenous leads but are prone to oversensing, which can trigger inappropriate shocks associated with increased mortality. Oversensing risk is predicted by the ratio of T- or P-wave amplitude to R-wave amplitude (T:R, P:R), and these ratios vary over a 24-hour period. Yet S-ICD screening uses a single 10-second electrocardiogram (ECG) segment, and the EV-ICD has no formal screening protocol whatsoever. We present a 24-hour ambulatory screening framework for both devices which includes the first T:R analysis in an EV-ICD cohort and the first full evaluation of P:R prediction. We introduce AmpRatioNet, a family of 1D convolutional neural network architectures operating directly on the ECG signal, and benchmark it against the best existing approach - based on 2D phase space reconstruction images. Evaluation uses 4,605 clinician-annotated 10-second segments from 89 patients, with patient-level 10-fold cross-validation and bootstrap confidence intervals. AmpRatioNet-SE demonstrates superior performance on every metric in each setting with no device- or ratio-specific redesign. An explainability analysis against interpretable classical peak labelling algorithms shows that AmpRatioNet-SE's increase in error on oversensing-prone segments is up to 14 times smaller than theirs. Segment-level predictions are aggregated into a 24-hour timeline, extending S-ICD screening beyond 10 seconds and offering a plausible EV-ICD screening pathway pending device-level validation.

cs.LG

版本更新 · v2arXiv:2610.04715

GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport

Yifan Xu, Shiqian Ma

原文摘要

We present GPU-accelerated Bregman Douglas--Rachford splitting algorithm (BDRS) for discrete optimal transport problem in three input formats: an explicit cost matrix, a point cloud with a ground cost between them, and a separable cost on a regular grid. For each input format, we propose hardware-aware designs of mathematically equivalent representations for the BDRS iterations to enhance numerical stability and empirical runtime. We benchmark the three proposed implementations against eight GPU baseline solvers from the literature on the same device. We demonstrate that our implementations of BDRS achieve state-of-the-art performance on their respective input formats. To the best of our knowledge, this is the first cross-solver study of GPU DOT solvers with a unified measure of optimality.

math.OC · cs.LG

版本更新 · v2arXiv:2609.06570

The list size of random linear and LDPC codes at capacity

Shashwat Silas

原文摘要

We show that for every prime power $q$ and $ρ\in(0,1-\frac1q)$ there exists $\varepsilon_0(q, ρ) > 0$ such that for all positive $\varepsilon < \varepsilon_0(q, ρ)$, a random linear code over $\mathbb{F}_q$ of rate $1-h_q(ρ)-\varepsilon$ has list size $\lfloor h_q(ρ)/\varepsilon\rfloor$ or $\lfloor h_q(ρ)/\varepsilon\rfloor+1$ with probability $1-o(1)$. Before this work, the list size was known only up to a constant factor for $q\ge3$, and for $q=2$ it was known to be either $\lfloor h_2(ρ)/\varepsilon\rfloor-1$, $\lfloor h_2(ρ)/\varepsilon\rfloor$ or $\lfloor h_2(ρ)/\varepsilon\rfloor+1$. We also show that the same two-point concentration holds for the list size of random LDPC codes. This follows from a general theorem establishing that random LDPC codes and random linear codes have the same threshold rate for distance, list decoding, list recovery from errors and any other \emph{convex} property, which answers a question of Mosheiff, Resch, Ron-Zewi, Silas and Wootters.

cs.IT · cs.DM · math.CO

新论文 · v1arXiv:2610.37989

GAUSS: A Workload-Aware Analytical and Monte-Carlo Simulator for LLM Inference Serving

Srikant Bharadwaj, Ankur Mallick, Spyridon Mastorakis, Anjaly Parayil, Dhruv Deshmukh, Victor Ruehle

原文摘要

Large language model (LLM) inference has become an operational workload that fleets must provision, monitor, and bill against latency service-level objectives (SLOs). A single throughput number cannot answer the questions operators actually face, because generative serving couples two phases with very different service characteristics, continuous batching reshapes the effective service process, and user-visible tail latency can degrade long before aggregate throughput saturates. We present GAUSS, a workload-aware analytical and Monte-Carlo simulator that predicts the full distributions of time-to-first-token (TTFT) and time-between-tokens (TBT), together with the sustainable request rate, for a given workload, engine, and accelerator. GAUSS pairs calibrated, phase-specific latency surfaces for prefill and decode with a Lindley-recurrence model of queueing under stochastic arrivals and estimates performance by ensemble Monte-Carlo sampling rather than by replaying a single trace. This lets GAUSS reason about workloads, routing policies, and hardware that have never been deployed, and to capture the latency tails that trace-driven simulators systematically under-sample. We describe the model and show how it supports operating-point selection, traffic segmentation, and shortest-remaining-processing-time scheduling capacity questions that trace-driven simulators cannot address.

cs.AI

版本更新 · v4arXiv:2609.06427

The LQ Digital Mode Family: Protocol Architecture and Reference Specification for Weak-Signal Communications

Luis Quesada

原文摘要

This paper introduces LQ8, an open-source weak-signal digital mode for amateur radio that completes structured two-way contacts in 4 transmissions (60 s), achieving a 1.50x speedup over canonical 6-transmission exchanges (90 s) and 1.25x over 5-transmission RR73 exchanges (75 s) while preserving complete bidirectional exchange of Maidenhead grid locators, signal reports, and mutual acknowledgments. By replacing fixed-width message-type headers with variable-length prefix codes matched to physical-layer bit budgets, LQ8 packs the answering station's grid locator and measured signal report into a single 77-bit reply. In multi-station pileup operations, LQ8 confirms up to two answering stations simultaneously within a single-carrier 50.0 Hz transmission with a 0.0 dB RF power-splitting penalty, achieving a peak rate of 240 QSOs/h in continuous pileup (4x over single-carrier FT8; 480 QSOs/h dual-carrier) while retaining -21.0 dB SNR sensitivity. The protocol family also defines three extended profiles (LQ16, LQ4, and LQ2) tailored for extreme sensitivity, VHF/UHF contesting, and fast-burst channels.

cs.NI · cs.IT · eess.SP

版本更新 · v3arXiv:2607.12121

FlashDiff: Efficient Regional Execution and Scheduling for Diffusion Model Serving

Yaqi Qiao, Ping He, Songrun Xie, Ayush Barik, Chensong Zhang, Zhengzhong Tu, Fan Lai

原文摘要

Diffusion models have become the central backbone for modern image, video, and audio generation, but their efficient service remains a challenge. Unlike autoregressive decoding, diffusion inference repeatedly updates high-dimensional spatial or temporal latents over many denoising steps. This all-region execution pattern makes generation latency high and limits serving throughput. Existing multi-GPU parallelization methods can reduce per-step computation, but often introduce substantial activation exchange overhead, causing communication to offset or even outweigh the benefits of parallel execution. This paper presents FlashDiff, a diffusion serving system that improves inference efficiency through adaptive regional execution and scheduling. FlashDiff is based on the observation that diffusion refinement is not uniform across latent regions or denoising steps: different regions often stabilize at different rates, while neighboring steps exhibit strong temporal correlation. FlashDiff leverages these properties to selectively execute only regions that require further refinement and to reallocate the resulting compute slack across concurrent serving requests. FlashDiff consists of three mechanisms. First, it decomposes the latent representation into coherent execution regions using early-stage attention signals, preserving semantic structure while exposing fine-grained parallelism. Second, it uses a lightweight runtime controller to estimate region activity and bypass low-impact updates when further refinement is unlikely to affect output quality. Third, it applies an affinity-aware online scheduler that co-locates dependent regions, balances residual load across GPUs, and reuses reclaimed compute capacity to improve serving efficiency. Across real-world image, video, and audio workloads, FlashDiff reduces end-to-end serving latency by 30-97% and improves throughput by 1.2-2.2x.

cs.DC · cs.LG

新论文 · v1arXiv:2610.37986

Predicting Sparse Observables in Parameterized Unsteady Flows Using Coarse-Mesh Graph Neural Networks

Brener Ramos, William R. Wolf, Tarcísio C. D. Oliveira, Scott T. M. Dawson

原文摘要

Full-order surrogates for high-dimensional nonlinear flows are often unnecessary when applications require only selected degrees of freedom. We propose reduced-order models that bypass full-state reconstruction by deploying graph neural networks (GNNs) directly on coarse meshes. Applied to parameterized 2D/3D confined cylinder flows and an unevenly heated cavity over Reynolds/Rayleigh-number ranges, the models generalize to unseen conditions and accurately predict sparse probe locations and integrated quantities. Coarse-mesh GNNs match or outperform finer-mesh surrogates while reducing training time and memory, even for 3D chaotic dynamics. A dynamics-informed adaptive sampling strategy guided by frequency-spectrum variations reduces maximum errors by an order of magnitude versus uniform sampling at negligible cost. Coarse-mesh training also makes noise-augmented multi-step unrolling practical, improving long-horizon autoregressive predictions. The approach outperforms parametric DMD, sparse MLPs, U-Nets, and Fourier neural operators at lower cost, and enables system identification and state estimation from sparse observations. These results show that coarse-mesh representations, adaptive sampling, and noise-augmented unrolled training form an efficient framework for reduced-order modeling of parameterized unsteady flows without solver-resolution reconstruction.

cs.LG · physics.flu-dyn

新论文 · v1arXiv:2610.37984

Who Else Is In? Multi-Agent Collusion Initation Via Strategic Vagueness

Pramod Kaushik, Sarath Sivaprasad, Laura Ferrarotti, Mario Fritz, Samuel F. Brown, Bruno Lepri, Sahar Abdelnabi

原文摘要

Multi agent LLM systems raise the risk of collusion among agents pursuing objectives hidden from their overseers. When potential partners identities are unknown, collusion first requires initiation: agents must discover one another, often through a public channel observed by ordinary agents and monitors. Strategic vagueness offers a way to navigate this mixed audience, conveying intent to a prospective partner while preserving a plausible ordinary interpretation. We introduce a mutual identification game in which two schemers must identify each other through public interaction, while jointly solving an ordinary task. We find that some models discover successful handshake strategies without explicit signalling guidance, using task compatible exchanges that monitors often fail to flag at low false positive rates. To characterize the communicative capabilities underlying these exchanges, we study a controlled coordination setting. We find an asymmetric response to message explicitness: as messages become more indirect, monitor punishment can fall faster than partner coordination, creating a profitable intermediate regime of strategic vagueness. Together, these findings illustrate a Blackstone style evidential asymmetry: communication sufficient for coordination between agents may remain insufficient for confident detection by monitor, opening a new surface of collusion.

cs.MA

版本更新 · v2arXiv:2608.12593

DiG-bench: Discovery in Games

Ruairidh M. Battleday, Kai Sandbrink, Jimi Cullen-Drohan, Zihan Yan, Timothy Muller, Clare Maguire, Ales Kubicek, Fraser Greenlee-Scott 等 16 位作者

原文摘要

Discovery---formulating novel generalizations---is a central part of the scientific process. Despite its importance, there is a gap in the current AI benchmark landscape, with few benchmarks directly probing the capacity for discovering new knowledge with experimentation in controlled environments where the objective is unknown. To address this gap, we release a new benchmark: DiG-bench (Discovery in Games). DiG-bench consists of a set of 70 independent games. Each game is encoded as a short string and has unique transformation rules that must be discovered through interaction and experimentation. The levels of the game present a series of challenges to test whether the rules have been discovered, where the win conditions for each level are also unknown. We provide games at seven tiers of difficulty for AI agents. The lowest tier is routinely solvable by multiple models, while the highest tier challenges the best models in agentic harnesses. All 70 games were solved by at least one human on first attempt. A subset of 21 games is released publicly, and the remainder is held private for secure evaluation.

cs.AI · cs.LG

新论文 · v1arXiv:2610.37983

Hierarchical Diffusion for Camera-controlled Autoregressive Video Generation

Kaihua Chen, Yiming Gong, Deva Ramanan, Tarasha Khurana

原文摘要

We address the task of long-video, camera-controlled generation from a single image. The dominant autoregressive paradigm suffers from two key limitations: (1) error accumulation over time, as distant frames are conditioned on previously generated outputs rather than ground truth, leading to drift; and (2) ambiguity in how to incorporate camera control. Standard solutions to both--such as self-forcing and conditioning on explicit 6-DOF poses--either incur significant computational overhead or produce drifting scene geometries over time. We propose a simple and lightweight framework that combines autoregressive generation (WanAR) with hierarchical long-context denoising (FixAR). To enforce scene geometry remains consistent with input cameras, we draw from feed-forward novel-view synthesis and reformulate video generation as a warping-and-inpainting problem. To mitigate drift, we introduce a hierarchical denoising strategy in which different stages condition on different temporal histories. Specifically, we first generate frames conditioned on the immediate past, and then refine them using a second denoiser conditioned on a temporally subsampled long-range history to enforce global consistency. This fine-to-coarse scheme enables each generated frame to effectively condition on the full temporal context without incurring a prohibitive cost. Experiments on RealEstate10k and DL3DV demonstrate that WanAR+FixAR outperforms prior methods for camera-controlled long-video generation, producing results that are both temporally stable and consistent with input camera trajectories.

cs.CV

新论文 · v1arXiv:2610.37982

Revision-Bound Evidence Cuts: Authenticated Queries and Contextual Witness Capacity

Faruk Alpay, Taylan Alpay

原文摘要

Authentic records can support unauthorized narratives when their qualifications, query scope, or counterevidence are silently dropped. We present revision-bound evidence cuts, a framework for authenticating both supporting and opposing inference obligations across changing source versions. Signed complete-update frontiers permit transport of unaffected certificates, alternative-cut recovery, and an exact certified-reuse radius given by a frontier-hypergraph transversal number. Their source obligations induce an integral model of context-bound authorization. To secure database-derived claims, we introduce an authenticated relational query contract that binds original source records, complete selected bags, counting units, parameters, and aggregates independently of execution strategy. A full-source verifier checks 16,824 Chogha Mish records across SQLite scans, indexes, and materialized views; three valid strategies agree and eight contract/view mutations are rejected. A separate 340-row NISP cohort shows that changing the admitted weighting rule can reverse a comparison while preserving every source record. A frozen English text-to-frame compiler produces qualified evidence receipts, with linguistic accuracy evaluated separately from cryptographic integrity. We also separate logical-source from transport commitments so lossless re-encoding need not invalidate unchanged scientific evidence. The SCENE prototype evaluates signed revisions, authenticated queries, scoped disclosures, and adversarial mutations at scales reaching one million source records. These guarantees rely on declared policies and independently pinned trust roots; they authenticate specified computations and obligations, not historical truth, complete counterevidence, or institutional endorsement.

cs.CR · cs.DB

版本更新 · v2arXiv:2602.18721

ReHear: Iterative Pseudo-Label Refinement for Semi-Supervised Speech Recognition via Audio Large Language Models

Zefang Liu, Chenyang Zhu, Sangwoo Cho, Shi-Xiong Zhang

原文摘要

Semi-supervised learning in automatic speech recognition (ASR) typically relies on pseudo-labeling, which often suffers from confirmation bias and error accumulation due to noisy supervision. To address this limitation, we propose ReHear, a framework for iterative pseudo-label refinement that integrates an instruction-tuned, audio-aware large language model (LLM) into the self-training loop. Unlike conventional text-based correctors, our approach conditions the LLM on both the ASR hypothesis and the source audio, allowing it to recover phonetically accurate transcripts even from severe recognition errors. These refined pseudo-labels serve as high-fidelity targets for fine-tuning the ASR model in an iterative cycle. Experimental results across diverse benchmarks demonstrate that ReHear effectively mitigates error propagation and improves over both supervised and pseudo-labeling baselines.

cs.CL · eess.AS

新论文 · v1arXiv:2610.37981

Active Constraints for Simultaneous Guidance and Safety in Handheld Micromanipulation

Roger Ho, Robert A. MacLachlan, Cameron N. Riviere

原文摘要

In micromanipulation, erroneous hand motion limits unaided manipulation accuracy, which can affect task performance and safety in critical applications like microsurgery. Handheld robots (micromanipulators) enable motion accuracy beyond human limits by providing robotic assistance in a low-cost, compact, intuitive form factor. Particularly, active constraints are an effective form of robotic assistance, which aids the operator by restricting the robot's permissible motion based on task-specific requirements or objectives, thereby providing task guidance and enforcing safety. However, existing formulations of active constraints for handheld systems are limited, most notably because of the inability to provide guidance and enforce safety simultaneously. Implementing active constraints with optimization-based methods can address these limitations, but existing implementations are designed for free-standing robots, and neglect that handheld robots actuate relative to the operator's hand with a limited workspace. In this work, we propose an optimization-based active constraint framework for handheld micromanipulation that enables simultaneous guidance and safety enforcement. The formulation was implemented in a handheld robot and demonstrated on a medically relevant artificial task. Results show that the proposed formulation reduced safety violation rate by more than two orders of magnitude relative to baselines, while recovering the threefold accuracy loss from enforcing safety alone.

cs.RO

新论文 · v1arXiv:2610.37979

Separability Is Not Alignability: Representations for Spectrum-to-Molecule Retrieval

Karol Musielinski, Fanurs C. E. Teh, Takahiko Koyama, Artur Dubrawski

原文摘要

Identifying a small molecule from its tandem mass spectrum is limited by paired data. Foundation models offer a way around this scarcity: pretrain a spectrum encoder on unlabeled spectra and a molecule encoder on a large corpus of structures, then align the two frozen representations, as in vision-language and as the Platonic Representation Hypothesis suggests. We audit this route on MassSpecGym with spectrum encoders retrained free of test-fold contamination. Alignment needs a metric relating distinct molecules, but the objectives that produce spectrum encoders never see molecular structure: we prove that some predictive objectives fix molecular identity without fixing that metric. Moreover, we find that a candidate-based objective rewards a spectrum-independent prior over the benchmark's decoys, which we isolate. What ultimately addresses data scarcity is not architectural: simulated spectra surpass frozen geometry.

cs.LG

版本更新 · v3arXiv:2607.25130

How Do Developers Edit AI-Generated Code, and How Well Do LLMs Infer Their Edits? Insights from 53.6K Developer Edits

Jenny T. Liang, Mihika Bairathi, Wayne Chi, Ameet Talwalkar, Nishant Subramani, Valerie Chen

原文摘要

Imperfections in AI-generated code require that software developers modify generations through manual code edits. However, little is known about how developers edit AI-generated code, and to what extent LLMs can infer implicit developer intent from this data, given the lack of high-quality, realistic code editing data. This information is essential for designing and building usable AI-developer interactions. To address this gap, we introduce DECODE (Developer Edits of Code Dataset), a dataset of 53.6K real-world in-IDE code edits of AI-generated code sourced from 1K+ developers. First, we use DECODE to analyze when, why, and how AI-generated code is edited. Developers invest little effort in editing code and abandon AI-generated code quickly, thereby motivating the need for LLMs to understand developer intents through their edits. Therefore, we next use DECODE to understand to what extent LLMs could infer developer edits. Predicting code edits is a challenging task for both frontier and fine-tuned models. Frontier models generate edits that best reflect developer intents, but are prone to over-editing and reverting developer-written edits. Fine-tuning LLMs can improve their ability to predict edits that are more similar to developers' as well as better reflect developer intent, but do not fully bridge the gap to frontier models. Together, our results demonstrate the unique insights on developer and LLM behavior that can be obtained through studying realistic code edit data to promote more better developer-AI interactions.

cs.SE · cs.AI · cs.HC · cs.LG

版本更新 · v4arXiv:2512.13399

Dual-Evolving Reinforcement Learning for Automated Reward Design

Sitao Cheng, Tianle Li, Xuhan Huang, Xunjian Yin, Difan Zou

原文摘要

Crafting effective reward signals remains a central challenge in reinforcement learning (RL) for complex reasoning. Existing methods for automated reward optimization search with a fixed proposer which never learns from its costly trials. We present Dual-Evolving Reinforcement Learning (DERL), a dual-training framework for autonomous discovery of reward structures. An outer-loop proposer composes a reward from task primitives, and an inner policy trains with this reward. The proposer itself learns by policy gradient from the validation performance of the inner policy. Thus, DERL utilizes past-trial feedback to shape its reward-proposal distribution, an empirical meta-gradient of task success. We validate DERL on embodied (ALFWorld), scientific (ScienceWorld), and mathematical (GSM8K, MATH) reasoning. On multi-turn agent benchmarks, DERL outperforms strong baselines, significantly on out-of-distribution tasks. In mathematics, DERL improves on the outcome reward where directly added primitives hurt. Further analyses under matched compute show that our proposer effectively captures the meta-gradient to discover useful reward signals.

cs.AI · cs.CL

新论文 · v1arXiv:2610.37978

Solitary movement style predicts collective foraging while whom to follow emerges only in company

Hiroshi Higashi

原文摘要

How far can behaviour inside a group, and the group's performance, be predicted from members measured while alone? We tested this on three public datasets of human collective foraging (621, 128 and 1,133 participants). A low-dimensional individual representation estimated from private-phase movement was mapped onto behaviour inside the group through a mapping learned on other participants. Private information processing was stable between the two halves of a session (split-half reliability, the correlation between the halves, 0.60--0.83) and predicted behaviour inside the group with correlations of 0.30--0.66. Selective social learning, following those who have succeeded or stopped, showed stable individual differences inside the group (reliability 0.45--0.59) yet was not predicted at all from the same person's private behaviour. Group performance was predicted with a correlation of 0.55 in all three datasets by simulations never fitted to group outcomes or by the mean of individually measured performance, a prediction carried by mobility and individual performance rather than by social weights. We found no credible evidence for an effect of how members were combined (equivalence bound 0.06). Whom to follow thus emerges only in company, which delimits what solitary measurements can predict and compose.

physics.soc-ph · cs.MA · q-bio.NC

新论文 · v1arXiv:2610.37977

A Simple Optimistic B-Skiplist Algorithm

Jianting Guo, Yicong Luo, Helen Xu

原文摘要

We present the first optimistic concurrent B-skiplist, built on optimistic lock coupling (OLC). OLC replaces the multi-cache-line RW lock with a compact, single-cache-line lock: readers validate a version number without writing to shared memory, avoiding cache invalidations and retrying only on a detected conflict. Although OLC was thought poorly suited to skiplists, where a single per-element lock may span structurally unrelated levels, the B-skiplist's blocked layout places each level (and associated lock) in its own node. We exploit the B-skiplist's upfront knowledge of promotion height with a hybrid top-down scheme that traverses upper levels optimistically and locks only from the promotion level down, so most inserts never dirty a cache line. On 128 threads, the proposed optimistic B-skiplist achieves $1.2-10\times$ higher throughput over state-of-the-art concurrent skiplist implementations. Furthermore, the optimistic B-skiplist achieves $0.8-4.3\times$ the throughput compared to high-performance optimistic B+-tree implementations based on RW locks and OLC. Finally, the optimistic B-skiplist achieves up to $13\times$ lower latency than concurrent skiplists and tree-based indices, and is within $1.6\times$ of the latency of the OLC-based B+-tree.

cs.DS

版本更新 · v4arXiv:2508.13255

FISH Omics Format: a standard enabling FAIR chromatin tracing data sharing across repositories

Rahi Navelkar, Andrea Cosolo, Iago Maceda Porto, Bogdan Bintu, Yubao Cheng, Vincent Gardeux, Silvia Gutnik, Taihei Fujimori 等 40 位作者

原文摘要

In recent years, multiplexed Fluorescence In Situ Hybridization (FISH) or FISH-omics methods have rapidly expanded, enabling the quantification of chromatin organization in single cells, often in conjunction with measurements of RNAs and proteins. These approaches have deepened our understanding of how 3D chromosome architecture relates to transcriptional activity and cell states in health and disease. Despite these advances, results from Chromatin Tracing FISH-omics experiments remain challenging to share, reuse, and analyze due to the absence of standardized data exchange specifications. Building on the release of microscopy metadata standards, we introduce the FISH Omics Format-Chromatin Tracing (FOF-CT), a community-developed standard for processed results from diverse imaging modalities. We describe the FOF-CT file format and present a curated collection of datasets deposited in the 4D Nucleome Data Portal and the OME Image Data Resource (IDR). We also highlight their potential for reuse, integration, and modeling by outlining example analysis pipelines and illustrating biological insights enabled by standardized, FAIR-compliant Chromatin Tracing datasets. FOF-CT natively represents both ball-and-stick and volumetric Chromatin Tracing data, unifying the two modalities within a single, modular table-based architecture (FOF-bas-CT and FOF-vol-CT, respectively).

q-bio.OT · cs.DL

版本更新 · v2arXiv:2606.23042

The Model as One Rater Among Several: Measuring Political Positions in Data-Sparse Regions with a Language-Model Panel

Tarek Gara

原文摘要

Most instruments for measuring political positions, such as manifesto coding, expert surveys and text-scaling models, were built and validated on Western party systems, and they break down worst where many consequential actors never publish a manifesto, never contest a competitive election, or commit one position to a charter and act on another in office. This paper proposes a method for such settings. I treat a large language model as a single fallible rater in a panel, the way an expert survey treats one expert, and describe the panel, its synthesis, an applicability rule that keeps a blank distinct from a zero, and a lens that separates what an actor declares from what it does. Three results follow. First, a built-in experiment isolates the rubric: with a definition-free round held fixed, written axis definitions move scores by a mean of 1.8 points on a 21-point scale and tighten agreement between raters (mean absolute gap 2.81 to 2.50; r 0.81 to 0.89). Second, across nine models from eight laboratories in two countries, Krippendorff's alpha is 0.86 on an interval and 0.87 on an ordinal metric, and it held as the panel grew from five raters to nine. This is reliability and says nothing yet about validity, since models trained on overlapping data can share a bias no statistic computed from the models can detect. Third, the panel's sharpest split, a bimodal divergence on an actor's stance toward the state's foundational order, comes from a referent problem: the models agree on the facts and differ on which order counts as the regime. A blind triple-coding traces about two-thirds of such disagreement to interpretation. The worked example is the Middle East and North Africa, and the rubric, prompt and data are released in full.

cs.CY · cs.AI · cs.CL · stat.AP

新论文 · v1arXiv:2610.37976

Sometimes less is more: Investigating inductive biases of MLPs and Transformers on noisy k-parity features

Alasdair Paren

原文摘要

We empirically investigate how MLPs and Transformers differ when trained on data sets containing one or more features encoded by noisy k-parity. Noisy k-parity gives us hard synthetic data sets in which we can control the predictivity and availability of every feature. Across a range of data distributions, data scales and model sizes, we find large differences in the training dynamics and inductive biases of the two architectures: Transformers are more robust to noisy features but struggle to learn complex, low-availability features, whereas MLPs show the opposite trend and improve steadily with more data. We also find that, under a fixed training budget, increasing the number of unique training examples can slow Transformer optimisation enough to reduce final accuracy, so that a smaller data set performs better. Training-accuracy results show this is an optimisation-speed effect; it shrinks, but does not vanish, when the budget is scaled with the data set size. By giving precise control over feature predictivity and availability, this testbed offers a clear starting point for understanding when and why Transformers and MLPs learn differently, and for designing data and training budgets that exploit those differences.

cs.LG

新论文 · v1arXiv:2610.37974

FORGE: Feasible Online Reduced-Order Reference Generation and Whole-Body Execution for Agile Humanoid Locomotion

Adrian B. Ghansah, Yujin An, Jeeseop Kim, Soon-Jo Chung

原文摘要

This paper presents a two-stage learning framework for versatile and agile humanoid locomotion that couples online reduced-order model (ROM) reference generation with whole-body tracking control. In the first stage, we train a command-conditioned whole-body reference generator using single rigid body dynamics combined with full humanoid kinematics. In the second stage, the frozen ROM policy is rolled out online to generate references for training a whole-body tracking policy on the full-order dynamics model. Learning a kino-dynamically consistent reference generator in the simplified ROM space enables us to generate references over a broad command space and over multiple locomotion strategies using a single unified framework. We demonstrate the approach on a Unitree G1 humanoid robot, achieving longitudinal velocities from -2.0 m/s to 2.8 m/s, lateral velocities up to +-1.0 m/s, angular velocities up to +-3.0 rad/s, one-legged hopping, and continuous transitions across the commands, all using one unified reference policy and one whole-body tracking policy.

cs.RO · cs.LG

版本更新 · v2arXiv:2610.31922

Deterministic Constructions of Reed-Solomon Codes Beyond the Johnson Bound

Abhranil Chatterjee, Sumanta Ghosh, Zeyu Guo, Rohit Gurjar, Roshan Raj, Zihan Zhang

原文摘要

We give a deterministic quasipolynomial-time construction of Reed-Solomon codes that are list-decodable beyond the Johnson radius. Specifically, for every $ε\in(0,1]$ and all sufficiently large $n$, we construct an $[n,k]$ Reed-Solomon code of rate $R=Ω(ε/(1+\log(1/ε)))$ over a field of size $(nk)^{quasi-poly(nk)}$ that is $(1-ε,O(1/ε))$ list-decodable. The construction runs in quasi-poly(nk) time. We also give a deterministic construction of $[n,k]$-MDS$(3)$ Reed-Solomon codes for all integers $1\leq k<n$, with the same asymptotic bounds on field size and construction time. In the constant-rate regime, our field-size bound substantially improves the bound of $O(n^{k^{2k}})$ achieved by Roth's construction (Roth, IEEE TIT 2022). Our constructions exploit a connection to polynomial identity testing for read-once determinants, together with the quasipolynomial isolating-weight construction of Gurjar and Thierauf for linear matroid intersection (Gurjar and Thierauf, STOC 2017 and Computational Complexity 2020).

cs.CC

版本更新 · v2arXiv:2608.25217

LLM-Driven, Datasheet-Aware Automated Hardware Compatibility Verification for Early-Stage, Pre-Schematic Embedded System Design

Haotian Qiao, Robert P. Dick

原文摘要

We present an LLM-driven, datasheet-aware framework for early-stage hardware compatibility verification that identifies documentation-level interface incompatibilities based on hardware datasheets and high-level component connectivity descriptions. It does not require, and can therefore be used, before detailed schematic simulation and implementation. We view trustworthy LLM-assisted design automation not as directly generating answers from documents, but as transforming engineering information through traceable verification stages. Given hardware datasheets and high-level component connectivity descriptions, the framework constructs a design graph that captures device connectivity and shared interaction domains, retrieves only the engineering properties required by explicit, domain-oriented verification criteria , and generates deterministic scripts for compatibility evaluation. By decomposing compatibility analysis into modular stages and preserving intermediate results, the framework reduces context overhead, improves transparency and tractability, enables scaling, and avoids reliance on LLMs for numerical computation. Evaluated on seven embedded-system designs comprising 34 datasheets, our framework achieves 97.5% compatibility-verification accuracy and an 8.6 times reduction in input context size compared with ``upload-and-query'' workflows. These results demonstrate the feasibility of LLM-assisted, specification-based hardware compatibility verification at an early design stage, as well as the need for, and substantial benefits of, modular task decomposition, formalized verification criteria, and task-aware compact context construction.

cs.AI · eess.SY

新论文 · v1arXiv:2610.37972

Application of PDE emulators for a multi-material, multi-physics simulation problem

Diane Oyen, Morgan Jones, Adithan Kathirgamaraju, Abu Bucker Siddik, Alexander Most, David Schodt, Christine Sweeney, Kyle Hickmann 等 22 位作者

原文摘要

Machine learning (ML) architectures are being developed for fast emulation of numerical simulators to accelerate both scientific discovery and engineering design. While these approaches are well-tested on popular PDE (partial differential equation) benchmarks, it is necessary to evaluate their performance on datasets that more accurately reflect industrial and engineering applications. We evaluate several computer vision-based architectures trained as surrogate models on a challenging computational physics task involving multiple materials, revealing significant implementation challenges for adapting certain pre-trained models, including transformer-based architectures. For such multi-physics multi-material datasets, our results underscore the importance of learning algorithms designed for sparse and imbalanced data, techniques for adapting spatial encodings and physical consistency metrics, in addition to methods for reducing the cost of generating sufficient training data.

cs.LG