跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

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

找到 23,827 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v3arXiv:2608.03031

CastFSR: Fast--Slow--Reflect Agentic Reasoning for Context-Aware Time Series Forecasting

Xiaoyu Tao, Mingyue Cheng, Bokai Pan, Hao Xue

原文摘要

Time series forecasting is fundamental to temporal data mining, yet numerical models often struggle to account for changing contextual factors. A key challenge is determining when contextual evidence should guide forecast revisions while maintaining consistency with temporal patterns and domain knowledge. To address this, we propose CastFSR, a fast--slow--reflect agentic framework for context-aware time series forecasting. Fast-thinking forecasting analyzes numerical patterns, selects a suitable forecaster, and constructs a data-driven forecast prior. Slow deliberative reasoning incorporates relevant contextual evidence to selectively refine this prior, while reflective evaluation checks the revised forecast against temporal patterns, contextual evidence, and domain constraints. A shared state maintains forecasting priors, contextual evidence, intermediate forecasts, and feedback across stages. CastFSR supports both training-free LLM coordination and two-stage post-training for compact LLM coordinators. Workflow-aware trajectory distillation (WATD) learns state-conditioned tool use and forecasting decisions from teacher trajectories, while trajectory-level policy optimization (TLPO) further improves the coordinator through reinforcement learning guided by forecasting accuracy and workflow feedback. Experiments on multiple real-world datasets under an offline evaluation protocol using historical context demonstrate competitive performance against representative baselines. Our code is available at https://github.com/Xiaoyu-Tao/CastFSR.

cs.AI

版本更新 · v2arXiv:2608.08809

Tevatron-Elastic: A Unified Abstraction for Training Elastic Retrievers and Rerankers

Yu Wang, Shengyao Zhuang, Xueguang Ma, Zongyu Wu, Jimmy Lin, Vivek Srikumar, Zhichao Xu

原文摘要

A single model scale challenges the flexibility of a production retrieval system: some settings need it faster, others need a smaller index, and the right trade-off changes with the workload. In the context of information retrieval (IR), a transformer-based model can be made smaller in three ways --- using fewer layers, passing fewer tokens through the upper layers, or producing a shorter embedding --- and each way saves a different resource. These options have been studied in isolation, each as its own method with its own code and training setup, which makes them hard to combine or adapt to a new model. In this work, we present Tevatron-Elastic to bring all three under one unified abstraction: a single object names any size the model can run at, and a short schedule lists the sizes to train. Training then produces one checkpoint that serves all of those sizes, and at deployment the user has the liberty to pick any of them. The same abstraction covers both retrievers and rerankers and both encoder and decoder models, as it works through interfaces that Hugging Face transformers already expose; adding a new backbone can be a configuration change rather than a model rewrite. Prior methods --- Matryoshka embeddings, early exit, 2D Matryoshka (Starbucks), and layerwise token compression (LTC) --- become special cases of our unified abstraction. With Tevatron-Elastic, we also propose a new elastic algorithm Matryoshka~LTC (MLTC) to jointly train several token-compression ratios in one retriever checkpoint. To validate our framework, we train 20 checkpoints across three backbones and two tasks: the quality curves are smooth, full-point quality remains close to that of models trained for a single size, and a controlled study confirms the wall-clock speedups. We release the framework and all checkpoints to support elastic retrieval research.

cs.CL

版本更新 · v4arXiv:2406.13216

CombAlign: Enhancing Model Expressiveness in Unsupervised Graph Alignment

Songyang Chen, Yu Liu, Lei Zou, Zexuan Wang, Youfang Lin

原文摘要

Unsupervised graph alignment finds the node correspondence between a pair of attributed graphs by only exploiting graph structure and node features. One category of recent studies first computes the node representation and then matches nodes with the largest embedding-based similarity, while the other category reduces the problem to optimal transport (OT) via Gromov-Wasserstein learning. However, it remains largely unexplored in the model expressiveness, as well as how theoretical expressivity impacts prediction accuracy. We investigate the model expressiveness from two aspects. First, we characterize the model's discriminative power in distinguishing matched and unmatched node pairs across two graphs. Second, we study the model's capability of guaranteeing node matching properties such as one-to-one matching and mutual alignment. Motivated by our theoretical analysis, we put forward a hybrid approach named CombAlign with stronger expressive power. Specifically, we enable cross-dimensional feature interaction for OT-based learning and propose an embedding-based method inspired by the Weisfeiler-Lehman test. We also apply non-uniform marginals obtained from the embedding-based modules to OT as priors for more expressiveness. Based on that, we propose a traditional algorithm-based refinement, which combines our OT and embedding-based predictions using the ensemble learning strategy and reduces the problem to maximum weight matching. With carefully designed edge weights, we ensure these matching properties and further enhance prediction accuracy. By extensive experiments, we demonstrate a significant improvement of 14.5% in alignment accuracy compared to state-of-the-art approaches and confirm the soundness of our theoretical analysis.

cs.LG · cs.AI

新论文 · v1arXiv:2611.11093

Does Pose Encoding Matter? Analyzing Geometric Representations for Discrete Motion Vocabulary Learning

Amir Kimiyaie, Nahal Mafi, Hamed Tabkhi

原文摘要

Compressing continuous human motion into a finite vocabulary of discrete tokens is now the first stage of many motion understanding and generation pipelines. Vector quantization partitions a latent space into Voronoi cells around a finite codebook, but the geometry of that latent space is inherited from the input pose encoding, and it is unclear which encoding admits an efficient discretization. We study four encodings that place skeletal motion in different geometric spaces: Gaussian joint heatmaps on the pixel lattice, which we show to be a morphological dilation of the joint point set by a quadratic structuring function; root-relative joint positions in Euclidean space; local joint rotations on $\SO$ through a continuous 6D embedding; and a redundant full kinematic encoding. For each, we train VQ-VAE tokenizers whose codebooks lie on the unit hypersphere, varying codebook size, temporal stride, and code dimension. Beyond reconstruction, we measure codebook utilization and the effective vocabulary size, i.e., the number of equiprobable spherical Voronoi cells with the same entropy as the observed token distribution. Rotation and position encodings keep converting additional codewords into effective vocabulary, whereas the full kinematic encoding saturates at a few hundred effective cells and heatmaps at fewer than sixty. The smallest code dimension gives the highest utilization for three of the four encodings, and the effect of temporal stride depends on the encoding. Encodings of the same pose family can thus yield effective vocabularies differing by an order of magnitude, a difference that reconstruction loss alone does not reveal, which points to input geometry as a first-order design choice in motion tokenization.

cs.CV · cs.AI · cs.DM

新论文 · v1arXiv:2611.11091

Uncertainty-Guided Reward Labeling for Reinforcement Learning under Limited Feedback

Renhao Zhang, Shreyas Chaudhari, Bruno Castro da Silva

原文摘要

In reinforcement learning from limited feedback (RLLF), only a small fraction of an offline dataset can be labeled with rewards, and the central question is which samples should be labeled to learn a high-performing policy from the resulting partially labeled dataset. Prior work formalized this as a reward-selection problem by focusing on the selection stage while treating downstream policy learning as a black box, in a regime where queried rewards are not retained for reward-model training. We instead study the retained-label setting, where queried rewards can be stored and used to fit a reward model before policy learning. We bound the suboptimality of the learned policy in terms of two sources of error: one arising from offline RL on a fixed, offline dataset, and the other from uncertainty in the reward model. Since reward selection cannot change the offline dataset, the limited labeling budget must be used to strategically reduce reward uncertainty. Motivated by RLLF's observation that useful rewards tend to keep the agent on high-return trajectories, we introduce Successor-Guided Uncertainty REduction (SURE), a novel method that uses successor features to select rewards that are both uncertain and associated with states from which high-valued states are reachable. We formally derive SURE from a bound-induced design objective and characterize its exact one-step marginal gain. Empirically, SURE reaches near full-feedback performance with few reward labels across a variety of domains and offline-RL backbones, yielding an effective method for feedback-efficient reinforcement learning.

cs.LG

新论文 · v1arXiv:2611.11090

Large-Scale Hierarchical Decision-Making in Robot Control via ADMM

Kai Pfeiffer, Jia Wang, Gordon Owusu Boateng, Yuquan Wang, Vincent Bonnet, Abderrahmane Kheddar

原文摘要

Sparse hierarchical nonlinear programming (SH-NLP) based on the $\ell_0$-norm provides a powerful framework for integrated, efficient hierarchical decision-making in robot kinematic control, for example in the presence of a large set of possible end-effector candidate locations. While Sequential Sparse Hierarchical Quadratic Programming (S-SHQP) with interior-point method based SHQP sub-problem solvers exploit the hierarchical, sparse structure of such problems, they are less amenable to effective warm-starting between subsequent, coherent control steps. In this work, we formulate an Alternating Direction Method of Multipliers (ADMM) to efficiently solve related SHQP sub-problems. We introduce efficient substitutions for auxiliary variables representing $\ell_0$-norm surrogates. The solver efficiently handles separable decision functions by evaluating linear algebra expressions in the appropriate order. Results in large-scale kinematic and dynamic control show reduced computation times of up to 23.5% compared with a structure-exploiting interior-point method in low- to moderate-accuracy regimes. Furthermore, hierarchical decision-making is extended to whole-body dynamic control for humanoid walking, where the need for high-accuracy solutions is highlighted.

cs.RO · math.OC

版本更新 · v8arXiv:2603.26783

Can We Change "Stroke Size" to Improve Flow Matching?

Yunwei Bai, Ying Kiat Tan, Tsuhan Chen

原文摘要

Deep-learning-based image generation models are useful but difficult to train. Inspired by the varying stroke sizes used in human painting, we hypothesize that applying ``rough strokes'' can attenuate prediction biases and improve flow-matching image generation. We develop MultiStroke, which progressively varies the spatial granularity of the clean-signal component in the velocity regression target. A lightweight corrector aligns adjacent roughness levels during sampling. On ImageNet-1K, MultiStroke reduces FID by $22.5\%$ relative to a matched flow-matching baseline, despite the limited corrector capacity. Code is available at https://github.com/DaChengRuoQue/MultiStroke-Code. A quick video explanation is available at https://dachengruoque.github.io/MultiStroke-Web/.

cs.CV · cs.AI

版本更新 · v3arXiv:2610.01984

Universal Byte-Level Encoding: UTF-8/UTF-16 Routing to Reduce Cross-Script Token-Budget Disparities

Hyunsik Kim, Youngmoon Jung

原文摘要

Byte-level byte-pair encoding (BBPE) tokenizers are attractive for multilingual large language models because they cover all Unicode text. In UTF-8-based BBPE, however, many scripts start from a higher fallback cost than English: when no learned merges apply, a multibyte character requires multiple byte-derived symbols. We call this worst-case pre-merge cost the encoding floor. A higher floor can increase token counts and per-request cost while shrinking usable context. Changing the whole text encoding can reduce this gap but make already-efficient English spans more expensive in mixed-script text. Thus, we propose Universal Byte-Level Encoding (UBE), a dual-alphabet tokenizer that keeps 1-2-byte UTF-8 characters in UTF-8 and routes 3-4-byte characters through UTF-16. This lowers the encoding floor for 3-byte Basic Multilingual Plane characters, used by many scripts that need more tokens than English, without raising it for any character. UBE changes only the symbols presented to byte-pair encoding, and a Unicode 17 audit confirms exact round trips for every scalar value and every input in three official test suites. UBE also composes with other boundary policies and morphology-based encodings. Across intrinsic evaluations, UBE lowers dispersion in English-normalized token-count ratios (Gini 6-14% lower on FLORES-200 at 16K-64K), reducing cross-lingual token-budget disparity. In multilingual language models, UBE matches BBPE's quality. In the main multilingual settings, UBE reduces token counts most where they are highest and also lowers English counts, yielding more usable context and faster prompt processing in content-matched benchmarks. Byte-level models benefit directly: UBE shortens their inputs by 29-33% in all 39 of the FLORES-200 languages written mostly in 3-byte characters (1.4-1.5 times as much text per context window), lowers byte-level Gini by 28%, and lengthens no input.

cs.CL · cs.LG

版本更新 · v2arXiv:2608.00916

Tevatron Meets Megatron: Expert-Parallel LLM Reranker Training on an Academic Budget

Zhichao Xu, Xueguang Ma, Shengyao Zhuang, Luyu Gao, Wenqian Ye, Yu Wang, Jamie Callan, Jimmy Lin

原文摘要

Training large dense and mixture-of-experts (MoE) rerankers is constrained by GPU memory and distributed-execution efficiency, which has kept academic reranker research largely on dense models. Tevatron trains rerankers through the Hugging Face Trainer with DeepSpeed and PyTorch FSDP1, a stack that stalls on three fronts: DeepSpeed ZeRO-2 has a known gradient-gathering failure on this path, FSDP1 full sharding is memory-safe but throughput-bound, and neither offers the expert parallelism (EP) that MoE training needs. We present Tevatron 3.0, which integrates Megatron-Core as a reranker training backend while preserving Tevatron's data processing, evaluation pipeline, and Hugging Face checkpoint format. For full-parameter dense 8B training, Megatron matches FSDP1 on BEIR-15 NDCG@10 with approximately 4% lower epoch time and twice the peak GPU memory under matched data-parallel and recomputation settings, and approximately 22% lower epoch time in its recommended configuration; it supports both LoRA and full-parameter fine-tuning. Expert parallelism makes it possible to train a 30B-parameter MoE reranker (Qwen3-30B-A3B) on two nodes. A controlled study of architecture, LoRA, and distillation on BEIR-15, with three first-stage retrievers and Hugging Face and vLLM serving, shows that the MoE reranker matches dense-8B quality at less than half the activated parameters and at higher inference throughput. We open-source the framework and trained checkpoints.

cs.IR · cs.LG

版本更新 · v3arXiv:2606.09777

AetheRock: An Arm-Worn Robot Teaching System for Force-Guided Vision-Tactile Learning

Hong Li, Yue Xu, Yihan Tang, Yankang Dong, Chenyuan Liu, Chenyang Yu, Xuyang Li, Siyuan Huang 等 11 位作者

原文摘要

Force and tactile sensing are essential for contact-rich manipulation, but their integration into handheld or wearable devices is constrained by cost, size, and mechanical compatibility. Tactile signals are also sensitive to manufacturing variations and wear during use, posing further challenges to policy learning. To address these hardware and learning challenges, we introduce AetheRock, an arm-worn device for collecting gripper-force, visual, and tactile data. AetheRock incorporates GelSlim-Mini, our improved version of GelSlim 4.0 designed for low-cost, easy manufacturing, at the gripper fingertip, together with a resistive pressure sensor at the human finger contact area. To learn robust representations from the collected data, we propose ForceVT, a framework that aligns multimodal representations and uses force and vision to guide tactile learning, mitigating the effects of manufacturing variations and sensor degradation. Real-world experiments demonstrate efficient data collection with AetheRock. ForceVT improves average performance by 13% over the vision-tactile baseline and maintains an average task progress of 55.0% under reduced tactile fidelity, compared with 58.0% at full fidelity. Project page: https://lihongcs.github.io/aetherock.

cs.RO

版本更新 · v2arXiv:2609.16262

Compute-Optimal Pretrain--Fine-tune in Ridge Gradient Descent

Alex Buna, Fanghui Liu, Patrick Rebeschini

原文摘要

Pretraining followed by fine-tuning introduces a compute-allocation problem: under a fixed training budget, compute spent improving the upstream objective reduces the compute available for downstream adaptation. Despite its practical importance, this trade-off is not yet well understood theoretically, even in simple models. In this paper, we cast this allocation as a compute-split problem under a two-stage pretrain--fine-tune procedure with fixed total optimisation budget, using regularised least squares trained by gradient descent as a tractable setting. We characterise the optimal split under data-dependent evaluation geometries induced by the fine-tuning problem. Our results show that the allocation depends on how pretraining directions affect fine-tuning predictions and how fine-tuning shifts are seen through downstream data geometry. In particular, the relevant quantities are determined by prediction-relevant spectral components of the pretraining and fine-tuning empirical covariances. Technically, the analysis relies on a basis-invariant, eigenspace-level spectral decomposition, together with perturbative control of the non-commuting pretraining and fine-tuning dynamics.

stat.ML · cs.LG

版本更新 · v2arXiv:2605.30916

Welfare, Improvability, and Variance: A Principal-Agent Approach to Optimal Benchmark Item Aggregation

Andreas Haupt, Justin Hartenstein, Anka Reuel, Mykel Kochenderfer, Sanmi Koyejo

原文摘要

AI benchmarks have well-documented limitations, with prior work examining contamination, saturation, and construct underspecification. Aggregation has received far less attention: benchmarks are typically summarized by uniformly averaging item-level scores, implicitly treating every test item as equally valuable. We model benchmarking as a multitask principal-agent game and show that the welfare loss from a benchmark is determined jointly by three item-level primitives: alignment with normative welfare priorities, marginal improvability, and performance variance. We translate the theory into an audit framework that ranks items along each of these three axes, and apply it to OLMES items using WORKBank for welfare, the EvoLM 4B suite for improvability, and the PolyPythias 410M panel for variance. The framework surfaces items that are Pareto-inferior within OLMES subject to a pro-worker welfare operationalization. All code is available at https://github.com/stair-lab/principal-agent-benchmarks.

cs.LG · cs.GT · econ.TH

版本更新 · v2arXiv:2611.05877

When Does Better Confidence Improve a Knowledge-Graph Audit?

Zehao Lin, Kai Chen, Xixuan Hao, Erenkai Zhu, Chunyu Li, Helan Hu, Feiyu Xiong

原文摘要

Confidence estimates guide human review in LLM-built knowledge graphs, but an erroneous shared entity need not be the only reason an incident fact is wrong. We study how this distinction affects budgeted audits, alongside selection headroom and label validity. Modelling non-adaptive auditing as budgeted covering, we characterise the minimal decision-relevant error statistics and bound the regret of scalar-preserving first-order planning by a structural mass $Δ^{\mathrm{cl}}$. We simulate ideal repair against benchmark-aligned labels for five extraction configurations and two cross-document graphs on Re-DocRED, followed by frozen confirmation on test and replication on 500 hash-selected training documents. An error-rate $\times$ fan-out baseline leaves 3.98-4.74 percentage points more errors than joint planning with the same actions. Independent-block planning also avoids this disadvantage: its held-out point estimates improve on a fact-only scalar baseline by 1.22-1.79 points and are slightly better than the joint model, although the frozen equivalence criterion remains inconclusive. On 300 DWIE training documents, independent and joint plans also outperform fan-out in point estimates, with extractor-dependent gains over fact-only review. For verification, a generic support check improves three of four model-budget configurations on each held-out set. These comparisons motivate evaluating complete-repair probabilities and retaining both fact-only and factorised baselines when choosing an audit model.

cs.CL

新论文 · v1arXiv:2611.11087

SoftPAT3D: Physics-Augmented Text-to-3D Scene Generation with Deformables

Lei Shu, Alberta Longhini, Leonidas Guibas, Gordon Wetzstein, Jeannette Bohg

原文摘要

We present SoftPAT3D, a physics-augmented framework for text-to-3D scene generation in which deformable objects, such as cloth, stuffed toys and ropes, are generated as physically valid, simulation-ready bodies and placed in intersection-free contact with the furniture that supports them, with one another and with themselves. Existing physics-augmented pipelines simulate rigid bodies only and cannot accommodate a generated deformable object, which text-to-3D generation returns as a geometrically invalid mesh, sometimes self-intersecting, that has no rest shape, no material model and no admissible initial state. These are the inputs a deformable simulation requires, and we construct each from information already in the pipeline. The rest shape comes from how the object is manufactured rather than from the generated physically inconsistent deformed configuration, and a material library assigns each deformable object its initial elastic parameters, which can then be optimized. The occluded support is regenerated and converted into a watertight collision mesh, each object is released from an optimizable placement above the supporting part that the prompt specifies, and the complete scene is driven to static equilibrium under one unified contact model, with completion verified by geometric checks and a vision-language model. When a scene fails the prompt, a grid search over placements corrects it, and the adjoint of a differentiable simulation of the same contact energy reaches the targets the grid does not, places several bodies jointly and recovers and optimizes material parameters. Multi-body scenes equilibrate in a single simulation, and the pipeline also runs from the text prompt alone. On all sixty-five prompts, SoftPAT3D produces no undesired interpenetration of any kind, whereas every other system does, and its scenes directly support scene editing and robotic manipulation.

cs.CV · cs.GR · cs.RO

新论文 · v1arXiv:2611.11085

ObjectWorld: Scaling Object-Centric World Models with A Large-Scale 3D Full-Object Flow Dataset

Haonan Chen, Sicheng Isabella Lu, Haitian Li, Jiajin Wu, Hexiang Wei, Jiawei Zhang, Xin Fei, Yiwen Hou 等 12 位作者

原文摘要

Generative world modeling from large-scale visual data offers a promising path toward scalable robot manipulation. This calls for an intermediate representation that can be supervised at scale and remains actionable for downstream control. We propose 3D full-object flow, an object-centric motion representation that assigns dense 3D trajectories to points across the complete surface of a target object, including its occluded regions. By extending visible-surface object flow to the full object geometry, this representation makes complete object motion explicit and applies uniformly to both rigid and deformable objects. To realize the potential of this representation at scale, we introduce a 1210-hour full-object flow dataset that addresses the scarcity of large-scale supervision for complete 3D object motion. The dataset integrates diverse real-world videos and physical simulations, with a scalable annotation pipeline for recovering full-object motion from real-world observations and quality metrics for systematically assessing annotation quality. We then train a world model that takes an image and a task description as input and predicts dense full-object flow over the reconstructed object geometry. Experiments show reliable annotation quality, data-scalable flow prediction, and effective downstream manipulation across novel scenes and robot embodiments. Project website with additional results and videos: https://nus-lins-lab.github.io/ObjectWorld/.

cs.RO

新论文 · v1arXiv:2611.11081

A Hierarchical Tokenization Framework for Voxel-Level fMRI Representation Learning

Karanpartap Singh, Yue Zhao, Mohammad H. Abbasi, Ehsan Adeli

原文摘要

We introduce HBAR (Hierarchical Brain Activity Representation), a hierarchical tokenization framework for learning compact, multi-scale representations of neuroimaging data. HBAR organizes voxel-level resting-state fMRI into a hierarchy spanning sub-parcel voxel groups, parcels, and large-scale functional networks, enabling up to 415x compression while preserving fine-grained spatial information beyond conventional parcellation. The framework supports fixed atlas-based, fully learned, and softly prior-guided hierarchies, allowing us to systematically study the role of structured priors in brain representation learning. On HCP-YA, at approximately 415x compression, HBAR achieves higher parcel and network correlations than rate-matched flat tokenizers, while at a lower 52x compression rate, shuffling the anatomical grouping reduces parcel correlation from 0.920 to 0.886. Demographic readouts with autoregressive training also reveal potential gains from the hierarchical structure. By combining sub-parcel inputs, compact discrete tokens, and multiscale brain structure, HBAR offers a practical framework for representation learning in high-dimensional neuroimaging data.

cs.LG

版本更新 · v2arXiv:2611.05407

PEEK: One-Step-Look-Ahead Exposure Bias Correction for Diffusion Sampling

Yunwei Bai, Ying Kiat Tan, Tsuhan Chen

原文摘要

Diffusion image generators owe much of their practical success to accurate denoising networks and strong numerical samplers. However, during sampling, the denoiser predicts the next step from flawed inputs that differ substantially from real data. This train-test gap, or exposure bias, caps image generation quality (i.e., blurry images, missing details, or distorted shapes). To mitigate the problem, we propose PEEK, a training-free deterministic sampler plugin. At each eligible denoising step, PEEK first performs a provisional one-step update, evaluates the denoiser once at the look-ahead state, and interpolates the current clean prediction with this one-step-later prediction to form the next noisy state. By taking the additional step, we obtain a generally more image like prediction from the higher-signal noisy state, mitigating exposure bias. To optimize the interpolation positions, PEEK searches for an interpolation schedule with a greedy metric-driven search made efficient by the PEEK prefix and baseline noise-schedule-rebasing caches. Across pixel-space and latent-space diffusion models with unconditional, label-guided, and text-guided settings on CIFAR-10, LSUNBedroom,I mageNet, and MS-COCO,the look-ahead correction consistently improves over baselines matched by number of function evaluations (NFE), with Fréchet Inception Distance (FID) reductions up to 49.3%. The one-time per-model calibration, the only extra cost, takes at most 2.2 minutes in our experiments. Project website is available at https://dachengruoque.github.io/PEEK-Video/.

cs.CV · cs.AI

新论文 · v1arXiv:2611.11080

Two barriers for minimal time firing squads, with applications to four and five states

Kia Keng Giam

原文摘要

A minimal-time solution of the firing squad synchronization problem synchronizes every line of n cells at time 2n minus 2. Six states suffice; whether five do has been open since 1987. Every line agrees with the half line until its right ends echo returns. For minimal time solutions with any number of states, we prove that cells at distance j behind the half lines front become time-periodic only after time (1.5 minus epsilon)j, for every epsilon greater than 0 and infinitely many j, and that the half line is never periodic in time and space on a wedge at its left border, hence not eventually regular in our sense. With certified satisfiability checks, we exclude four states using the lines of lengths 2 to 5 and parts of the next five, and show that every five state minimal time solution uses at least 15 non quiescent neighbourhoods on its half lines first 78 anti-diagonals. We give five state rules synchronizing exactly the lengths 2 to 14.

cs.FL · nlin.CG

新论文 · v1arXiv:2611.11079

When Calibration Data Matter in Sub-4-Bit Language Model Quantization

Yehong Jiang, Yen-Kuang Chen, Xinmin Tian

原文摘要

Low-bit post-training quantization reduces language-model memory but can sharply degrade downstream task accuracy. Calibration usually relies on generic text, but when task-informed data recover accuracy and which quantizers benefit remain poorly understood. We introduce FragCal-DC, which supplements generic text with training documents from task families with low retention of full-precision accuracy in a two-bit scan. We use a two- to four-bit sweep to locate functional regimes and four-seed calibration comparisons to evaluate six data-dependent methods across six dense models (1.7B-8B) and ten tasks. At their lowest tested functional bit widths, iterative SignRound V2 and OmniQuant improve at two bits, whereas single-pass GPTQ and AWQ show small mean responses at three bits. At two bits, SignRound V2 gains 1.83 percentage points in mean ten-task accuracy over generic-text calibration across six models. At 70 billion parameters, GPTQ and SignRound V2 both improve at two bits, with functional generic-calibration baselines. For two-bit SignRound V2, task-level controls show that recovery concentrates on families included in calibration, while incorrect answer designations retain about 90% of the mean accuracy gain. Changes in reconstruction error do not consistently track accuracy gains. These findings support task-informed calibration as a design principle for preserving downstream accuracy in low-bit quantization.

cs.LG · cs.CL

新论文 · v1arXiv:2611.11076

ADC-RANet: Improving Resolution Adaptive Neural Networks with Attention, Distillation and Calibration

Jeferson Severino de Araujo, Lilian Hollard, Eric Granger, Marco Pedersoli

原文摘要

Dynamic neural networks are a class of adaptive models in which the computation assigned to each input sample is determined dynamically, potentially reducing computational cost while maintaining similar performance. For image classification, the Resolution Adaptive Network (RANet) is a strong approach that progressively allocates computational resources across input scales based on sample difficulty. In this work, we introduce RANet with Attention, Distillation and Calibration (ADC-RANet), an enhanced version of RANet that improves performance across all computational budgets. Our approach combines three tightly connected components: bottom-up channel attention, top-down cascaded knowledge distillation, and overconfidence correction using MixUp, in a synergistic design that coordinates both pathways. Experiments on CIFAR-100 and ImageNet datasets show consistent gains while preserving the efficiency of RANet. Our code is available: https://github.com/jefersonseverino/ADC-RANet

cs.CV

版本更新 · v2arXiv:2610.36558

Holomorphic Cauchy Networks for Efficient Stationary Tail Computation in High-Dimensional Reflected Brownian Motions

Kehan Wang

原文摘要

Stationary tail computation for high-dimensional reflected Brownian motions (RBMs) remains computationally challenging. Building on NN4MGF's shared-coordinate basic-adjoint-relationship (BAR) framework, we develop Holomorphic Cauchy Networks (HCNs). Native complex-valued rational Cauchy subnetworks enforce holomorphicity on pole-free domains, removing sampled Cauchy-Riemann penalties and their input-derivative graphs. Exact origin anchoring and boundary-coordinate exclusion enforce structural identities, while anchored interactions represent dependent transforms. Under holomorphic-log assumptions, we establish simultaneous value and first-derivative approximation for the constrained architectures and a mixed-derivative lower bound for coordinate-only representations under nonzero cross-covariance. Closed-form real-axis derivatives and sequential backpropagation further control memory. On the same NVIDIA H100 NVL, the tested 30D HCN configuration uses approximately tenfold less peak allocated memory and has 9.7-fold lower mean update time than NN4MGF; extrapolation to the respective scheduled update counts gives a projected full-schedule update-time ratio of 58.2. With 64 million sampled base inputs per high-dimensional run, HCN reaches 50 dimensions on a laptop GPU with 6.367% mean relative error over thresholds 1 through 8. Degree-matched comparisons yield lower reported mean relative errors over the primary evaluation ranges, including 1.422% versus 6.684% on the 2D Harrison non-product benchmark. On a 10D correlated RBM benchmark, HCN achieves 3.829% mean relative error over thresholds 1 through 8 against a simulation reference, compared with 19.386% for an independent-marginal baseline.

cs.LG · math.NA · math.PR

新论文 · v1arXiv:2611.11074

System Prompts Affect Response Bias More Than Discriminability in LLM Safety

Mohan W. Gupta, Sandy Tanwisuth

原文摘要

Large language model safety evaluations often focus on a compliance-refusal tradeoff: models should refuse unsafe requests without refusing safe ones. We argue that this misses a broader form of prompt-conditioned task selection, where the same request can elicit different behaviors depending on the system prompt. We investigate this using a controlled evaluation crossing eight safety-task prompt families with three clarity levels across HarmBench, XSTest, and IHEval. Holding benchmark items fixed, we evaluate 13 models and use signal detection theory to distinguish two possibilities: whether models become better at telling safe from unsafe requests (discriminability), or simply more willing to refuse (response criterion). We find substantial differences in discriminability across models, but system prompts primarily shift the willingness to refuse, with smaller and less consistent effects on discriminability. Increasing prompt clarity makes models more willing to refuse without reliably improving their ability to distinguish safe from unsafe requests. Beyond refusal, prompt families also shift responses among six distinct behavioral policies, including clarification and safe help. Together, these findings show that system prompts primarily change how models respond to safety-relevant requests rather than consistently improving their ability to distinguish safe from unsafe ones.

cs.LG · cs.AI · cs.CL · cs.SE

版本更新 · v3arXiv:2509.23219

WirelessMathBench-XL: An Auditable Benchmark for Wireless Mathematical Reasoning

Xin Li, Mengbing Liu, Yiyang Zhu, Wenhe Zhang, Li Wei, Jiancheng An, Chau Yuen

原文摘要

Benchmarks built from arXiv papers can overlap the arXiv text used in LLM pretraining, yet technical-domain releases rarely ship the per-item evidence needed to check this. We introduce a reverse-probe n-gram audit that indexes the benchmark side and streams the corpus past it, so memory scales with the benchmark rather than the corpus and flags on the distributed problems can be inspected and recomputed. We instantiate it in WirelessMathBench-XL, a 4,027-problem benchmark for wireless mathematical reasoning built from 836 arXiv papers across 20 subfields, with multiple-choice, progressive fill-in, and full-equation-completion formats. Streaming 12.9 B RedPajama-arXiv 13-grams yields a strict zero-hit view $\mathcal{S}_0$ covering 95.7% of the problems, and shows that the Dolma and ProofPile-2 arXiv slices repackage the same RedPajama dump. Filtering to $\mathcal{S}_0$ moves every evaluated model by less than 1 pp. With 30/800 flagged test items, this comparison bounds detected-overlap inflation at 0.31-0.51 pp for frontier models rather than testing for contamination, and it does not cover paraphrase, target-answer, alternate-version, post-training, or closed-corpus exposure. Frontier models reach 86.5-91.3%, and GRPO on the released training split lifts a 7B model 25.1 pp above a size-matched general-math control. We release source-paper identifiers, per-problem audit and threshold metadata, license-aware data files, audit and bootstrap scripts, Croissant metadata, and a Datasheet.

cs.LG

版本更新 · v2arXiv:2609.35279

Measuring Collapse and Correction in Homogeneous-Panel LLM Debate

Xin Li, Mengbing Liu, Chau Yuen

原文摘要

Multi-agent large language model (LLM) debate is often evaluated by whether final answers improve, but a changed answer is not necessarily a better one: the same discussion can correct an initially wrong majority or collapse an initially correct one. Standard final-accuracy evaluations conflate these opposing transitions. We introduce an auditable protocol for homogeneous debate on multiple-choice questions (MCQs) that records each run as a transition ledger over collapse, correction, onset, and signed intervention utility. On 6,925 MMLU-Pro debates, the protocol records 253 collapses together with the corrections that offset them, and the correction side changes how interventions should be judged. Replay experiments reveal the central tradeoff: freezing every debate prevents 251 collapses but loses 804 corrections under equal weights, and a leave-one-model-out probe-gated freeze that is tuned for net utility never fires, so collapse prevention alone can recommend the wrong policy. A compact pre-debate 8-probe screen is a triage signal: its unadjusted family-level association with conditional-collapse risk is high (G=7, Spearman $ρ$ = 0.893, exact two-sided p = 0.0123), but initial-majority accuracy is a close comparator ($ρ$ = -0.821; family partial $ρ$ = 0.767, p = 0.0877), so we do not treat it as calibrated or capability-adjusted prediction. Round-level traces localize many collapses to the first debate round, where early disagreement can precede both collapses and corrections. Reasoning-mode models, including one model at two reasoning-effort levels, also show both collapses and corrections. We release replayable schemas, coders, audits, cost cards, and zero-API rebuild scripts so future model rows can be compared under the same denominators and signed utility ledger.

cs.CL

版本更新 · v2arXiv:2607.18516

Signed Rectified Flow: Negativity-Controlled Generation

Runlong Liao, Baiyu Su, Lizhang Chen, Qiang Liu

原文摘要

We introduce Signed Rectified Flow (Signed RF), a generalization of Rectified Flow that targets the signed measure $π^{sign} = (1+α)π^+ - απ^-$, where $α>0$, $π^+$ is the distribution to promote, and $π^-$ is the distribution to suppress. Although direct sampling from a signed measure is not well-defined, Signed RF induces a valid generative process that concentrates probability in regions where the signed measure is positive while provably excluding regions dominated by its negative component. It therefore provides a principled framework for incorporating negative information and exclusion constraints into generative modeling. We analyze the signed continuity equation underlying Signed RF and use a charged-particle interpretation to explain how negative mass forms exclusion barriers. This theory further motivates practical adaptive guidance algorithms. Across several applications, Signed RF improves the fidelity-diversity trade-off on ImageNet, reduces nearest-neighbor similarity in anti-memorization experiments, and reduces nudity induced by adversarial prompts in Stable Diffusion 3.5 while preserving CLIP and aesthetic scores.

cs.LG · cs.CV

版本更新 · v2arXiv:2606.12069

Tac-DINO: Learning Tactile Features with Patch Alignment

Hong Li, Yankang Dong, Yue Xu, Yihan Tang, Jiamin Qiu, Qihang Yao, Xing Zhu, Yujun Shen 等 10 位作者

原文摘要

Multisensory perception is essential for robotic manipulation, with tactile sensing providing critical information for fine-grained, contact-rich interactions. Although prior work integrates tactile and spatial signals to improve perception, vision-tactile learning commonly relies on object-level alignment. Addressing this limitation requires systematically aligned 3D vision-tactile data. We develop a data collection system and introduce Touch3D, a dataset comprising 505 real-world objects and 20,025 tactile contacts. Building on this dataset, we establish the Contact-Centric Multimodal Tactile Representation Benchmark (CoMT-Bench), which expands evaluation from object-level retrieval and tactile properties to include patch-level contact evaluation. We further propose Geometry-Relation Distilled Tactile-Centric Cross-Modal Learning (GeoTAC), which explores tactile learning across all multisensory data. In experiments on the Touch3D test set, patch-level alignment improves the average score by 5.32 over object-level alignment, with GeoTAC's geometric supervision improving it by a further 4.48. In robotic manipulation, GeoTAC improves TP by 19.14 and 11.34 over DINOv2 (Vision-only) and DINOv2 (Vision-Tactile), respectively. Project page: https://lihongcs.github.io/tacdino.

cs.CV

新论文 · v1arXiv:2611.11072

Wording Matters: Understanding How GenAI Policy Rules Shape Teachers' and Students' Workflows and Perceptions

Sabiha Mehreen, Xiangzhe Yuan, Rishab Nithyanand, Naimul Hoque

原文摘要

The growing use of generative AI (GenAI) in higher education has led institutions to develop policies governing its applications. However, we have little knowledge about how teachers and students adapt and adhere to the policies. In this paper, we analyzed GenAI policies from 101 U.S. universities, identifying nine recurring rules for GenAI use, and interviewed 20 students and 20 faculty members about the rules. We find that the wording of the rules can change how students perceive and act on the rules while introducing different challenges that teachers face in enforcing them in practice. For example, rules such as "Passing off AI-generated content as your own constitutes academic dishonesty" and "Students are accountable for any inaccurate, biased, or unethical content" both outline the acceptable use of AI, but the former can make students hide their use of AI out of fear of unwanted scrutiny, whereas the latter can encourage students to take responsibility and ownership of their use of AI and be more transparent. Students described uncertainty about acceptable use, fear of penalties and unfair treatment, and stigma that discouraged acknowledging AI use. Teachers took on approval workload, had to interpret acceptable use, and lacked reliable ways to verify compliance. We summarize these impacts in a policy-impact matrix linking each rule to its effects on teacher and student workflows and perception.

cs.HC

新论文 · v1arXiv:2611.11071

NanoNet: Ultra-Lightweight Network for MRI Brain Tumor Classification toward Edge AI

Tran Nguyen-Le, Huu-Thuan Huynh, Minh-Triet Tran, Trung-Nghia Le

原文摘要

Automated brain tumor classification from magnetic resonance imaging (MRI) can support accessible medical image analysis, but conventional deep learning models often exceed the resource budgets of highly constrained edge-AI platforms. We present NanoNet, an ultra-lightweight convolutional neural network designed for resourceconstrained MRI classification and motivated by future edge-AI applications. Inspired by MobileNetV2, NanoNet substantially reduces network depth, channel capacity, expansion ratios, and final feature dimensionality, resulting in only five inverted residual blocks and 8,132 parameters. We further investigate dependency-aware structured pruning, knowledge distillation, and INT8 quantization-aware training for additional compression. Experiments on the BRISC 2025 benchmark show that NanoNet achieves 92.80% accuracy and 92.97% macro F1 with 8,132 parameters and 10.498 MFLOPs. Across three compression seeds, it exceeds the mean accuracy of 70%-pruned MobileNetV2 by 5.20 percentage points while using 60.2% fewer parameters and 9.8% less computation. Converted INT8 NanoNet achieves 89.70% accuracy and 90.22% macro F1 across three QAT seeds. Earlier TensorFlow Lite measurements indicate 27.7 KB of baseline model storage, motivating future edge-AI deployment.

cs.CV

新论文 · v1arXiv:2611.11068

Discrete Diffusion Playground: A 2D Benchmark for Discrete Generative Models

Justin Shao, Sihyun Park, David Ryan Koes, Maria Chikina

原文摘要

Discrete diffusion is a promising framework for categorical generative modeling, but current evaluation protocols often fail to reveal whether models have actually learned the target distribution. We introduce the Discrete Diffusion Playground, a diagnostic benchmark that converts known 2D continuous distributions into binary token sequences through an exact discretized bijection. This creates a rare setting in which models are trained on discrete sequences, but generated samples can be decoded back into 2D and compared directly against a known ground-truth distribution. The benchmark spans smooth Gaussian mixtures and tilted checkerboards with sharp boundaries, disconnected support, and coordinate-dependent structure, allowing it to expose failures that are invisible in standard proxy metrics. It supports exact grid divergences, Wasserstein distances, density visualizations, and nonparametric two-sample tests, providing both quantitative evaluation and interpretable failure diagnosis. Using this testbed, we show that masked diffusion models can learn meaningful adaptive reveal orders but remain less stable than autoregressive baselines on smooth targets and largely fail on tilted checkerboards, where autoregressive models preserve the target geometry. Control experiments with reversed and interleaved token orderings show that autoregressive performance is not explained by favorable bit order alone. The Playground provides a simple but stringent benchmark for stress-testing discrete generative models and for developing evaluation metrics that detect real distributional mismatch rather than proxy performance. Our code is available at https://github.com/shaojus/DiscreteDiffusionPlayground .

cs.LG

新论文 · v1arXiv:2611.11067

Beyond AUROC: Deployment-Aware Evaluation of Model-Internal Jailbreak Detectors

Mohammad Tehabsim, Basil Al-Housani, Nour Alhussien, Phung Lai

原文摘要

Large language models (LLMs) are increasingly deployed in user-facing systems, where jailbreak attacks can bypass safety controls and induce harmful and policy-violating outputs. Recent model-internal detectors use hidden representations, gradients, or internal signals to identify such prompts, but their practical security value depends critically on behavior at low false-positive operating points rather than on area under the receiver operating characteristic curve (AUROC) alone. We study two data dependencies that shape this behavior: calibration data, which determine the detection threshold, and reference data, which can influence detector scores. Across four model-internal detectors, four LLMs, and twelve jailbreak families, thresholds calibrated on curated benign prompts frequently fail to preserve their false-positive rate (FPR) budgets on real-user traffic. Recalibration improves false-positive control but reveals substantial family-level coverage gaps, including cases with high AUROC but low true-positive rate (TPR). Causal reference-set interventions show that changing reference composition can substantially alter family-level detection and that improving coverage of one attack family can reduce coverage of others. These findings show that calibration and reference data are part of a detector's security behavior. We therefore recommend evaluating model-internal jailbreak defenses using realized FPR on deployment-like traffic and per-family TPR at explicit low-FPR operating points, with AUROC used as a complementary ranking metric rather than the primary security measure.

cs.CR · cs.CL