跳到正文
研踪PaperTrail

版本更新

查看已发布论文的最新修订,在详情页对照实际观测到的版本。

部分采集异常

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+94新增 AI 导读

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

统计口径与数据新鲜度

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

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 06:59库内论文最新更新时间:2026-11-18 08:00

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

26,871 已收录论文22,375 AI 相关8,156 有修订112 HF 社区发现

论文修订列表

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

找到 8,156 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
版本更新 · v4arXiv:2412.10338

XYScanNet: A State Space Model for Single Image Deblurring

Hanzhou Liu, Chengkai Liu, Jiacong Xu, Peng Jiang, Mi Lu

原文摘要

Deep state-space models (SSMs), like recent Mamba architectures, are emerging as a promising alternative to CNN and Transformer networks. Existing Mamba-based restoration methods process visual data by leveraging a flatten-and-scan strategy that converts image patches into a 1D sequence before scanning. However, this scanning paradigm ignores local pixel dependencies and introduces spatial misalignment by positioning distant pixels incorrectly adjacent, which reduces local noise-awareness and degrades image sharpness in low-level vision tasks. To overcome these issues, we propose a novel slice-and-scan strategy that alternates scanning along intra- and inter-slices. We further design a new Vision State Space Module (VSSM) for image deblurring, and tackle the inefficiency challenges of the current Mamba-based vision module. Building upon this, we develop XYScanNet, an SSM architecture integrated with a lightweight feature fusion module for enhanced image deblurring. XYScanNet, maintains competitive distortion metrics and significantly improves perceptual performance. Experimental results show that XYScanNet enhances KID by $17\%$ compared to the nearest competitor.

cs.CV

版本更新 · v2arXiv:2507.17892

DiNAT-IR: Exploring Dilated Neighborhood Attention for High-Quality Image Restoration

Hanzhou Liu, Binghan Li, Chengkai Liu, Mi Lu

原文摘要

Transformers, with their self-attention mechanisms for modeling long-range dependencies, have become a dominant paradigm in image restoration tasks. However, the high computational cost of self-attention limits scalability to high-resolution images, making efficiency-quality trade-offs a key research focus. To address this, Restormer employs channel-wise self-attention, which computes attention across channels instead of spatial dimensions. While effective, this approach may overlook localized artifacts that are crucial for high-quality image restoration. To bridge this gap, we explore Dilated Neighborhood Attention (DiNA) as a promising alternative, inspired by its success in high-level vision tasks. DiNA balances global context and local precision by integrating sliding-window attention with mixed dilation factors, effectively expanding the receptive field without excessive overhead. However, our preliminary experiments indicate that directly applying this global-local design to the classic deblurring task hinders accurate visual restoration, primarily due to the constrained global context understanding within local attention. To address this, we introduce a channel-aware module that complements local attention, effectively integrating global context without sacrificing pixel-level precision. The proposed DiNAT-IR, a Transformer-based architecture specifically designed for image restoration, achieves competitive results across multiple benchmarks, offering a high-quality solution for diverse low-level computer vision problems.

cs.CV

版本更新 · v2arXiv:2605.30983

Can BEV Perception Gracefully Degrade under Sensor Failures?

Haifa Zhang, Yijing Wang, Zhiqiang Zuo

原文摘要

Despite the remarkable success of multi-modal bird's-eye view (BEV) perception in autonomous driving, standard fusion models can be highly brittle to sensor corruptions, causing catastrophic performance degradation. This vulnerability arises when corrupted features contaminate the shared BEV representation and the detector fails to preserve a usable visual fallback. To this end, we present Grace-BEV, a lightweight framework for robust fusion in Lift-Splat-Shoot (LSS)-based detectors. Operating in the aligned BEV space, Grace-BEV complements a LiDAR-guided image-BEV expert with a LiDAR-independent visual expert. A TrustGate Router learns a sample-level mixture of their outputs, while the FailSafe Fusion Block recalibrates the routed image representation together with raw LiDAR features. Furthermore, we devise a Three-Phase Training strategy with Modality Dropout to establish the visual fallback before learning routing and fusion, followed by joint fine-tuning. Extensive experiments on nuScenes-R and nuScenes-C across three LSS-based detectors show that Grace-BEV maintains robust performance across diverse corruption settings. Under complete LiDAR loss, where the corresponding baseline models exhibit a collapse to 0.0 mAP, Grace-BEV restores performance to as high as 34.7 mAP. It also improves clean accuracy by up to 1.4 mAP points with 1.2M additional parameters per detector. Component and training ablations support the complementary roles of visual initialization, expert routing, and adaptive fusion.

cs.CV

版本更新 · v2arXiv:2607.23379

When Activation Oracles Learn Not to Read: Concept-Specific Blind Spots in Fine-Tuned Oracles

Tobias Bersia, Tatiana Gaintseva

原文摘要

Activation Oracles (AOs) are language models trained to answer natural-language questions about another model's internal activations. They offer a flexible interface for reading hidden information from model states, especially when relevant information is internally represented but absent or incomplete in visible behavior. However, AOs are themselves learned systems: their answers are shaped by training data, objectives, and learned reporting behavior, rather than being neutral readouts of represented information. We study this in a controlled Taboo Word Guessing setting, where subject models are fine-tuned to internally use a hidden concept while avoiding direct disclosure. Contrary to the expectation that an AO trained on such a subject becomes a specialist reader, we find that fine-tuned AOs can become concept-specific anti-readers: they selectively fail to recover the concept persistently present during their own training. This failure is not simply explained by absence of the concept from the subject or oracle representations: the target remains decodable inside the oracle, while LogitLens and layer-ablation analyses indicate that the failure arises in the AO readout pathway. Our results show that behavioral leakage, representation-level decodability, and AO-verbalizability can come apart, raising a reliability concern for learned interpretability interfaces.

cs.CL · cs.AI

版本更新 · v2arXiv:2603.10342

AgentServe: Algorithm-System Co-Design for Efficient Agentic AI Serving on a Consumer-Grade GPU

Yuning Zhang, Yan Yan, Nan Yang, Dong Yuan

原文摘要

Large language models (LLMs) are increasingly deployed as AI agents that operate in short reasoning-action loops, interleaving model computation with external calls. Unlike traditional chat applications, these agentic workloads require inference serving systems to balance low latency, stable token emission, and throughput under multiple request arrivals from different AI agents. Recent deployments highlight a shift toward running small language models (SLMs) locally on consumer-grade GPUs, driven by privacy, compliance, and cost constraints. When heterogeneous requests overlap on a single GPU, long prefills and short decodes contend for resources, creating head-of-line blocking that destabilizes interactive performance. By analyzing agent workloads, we observe that their execution naturally separates into cold prefills, which process long system prompts, resume prefills, which append tool outputs to cached contexts, and short decodes, which are latency-critical. This mix intensifies contention compared to conventional chatbot serving. We present AgentServe, a single-GPU serving system that ensures stable multi-agent execution under such conditions by isolating prefills from decodes, applying dynamic budgeting to resume prefills, and allocating GPU resources through pre-established CUDA Green Context slots with adaptive control. Evaluation results show that AgentServe significantly improves latency stability while sustaining competitive throughput, achieving up to 2.8x TTFT improvement and 2.7x TPOT improvement over state-of-the-art baselines across different settings.

cs.DC

版本更新 · v2arXiv:2610.36345

Bayesian Replicator Dynamics and the Inversion of Strict Dominance in Bimatrix Games

Jaime Ruiz-Serra, Nihat Ay, Michael Harré

原文摘要

Replicator dynamics, the central model of evolutionary game theory, describe populations evolving under selection and agents learning by trial and error. They also admit a third use: continuous-time Bayesian inference, in which an agent planning against an opponent accumulates evidence for each candidate strategy. Here we show that this use divides all two-player games into two classes. With the standard expected-utility payoff, the dynamics can be expressed as Bayesian updating only in games (with any number of actions) where no player has a dominant strategy. The logarithmic payoff of Ay and Erb (2005) admits the Bayesian representation in every game. Coordination, anti-coordination, and cyclic games share qualitative dynamics under both payoff definitions, with equilibria displaced and selection thresholds shifted. In contrast, the flows of every game with a dominant strategy are reversed between the payoff definitions, with the strictly dominant strategy eliminated under logarithmic payoffs. Cooperation therefore emerges in the Prisoner's Dilemma, and games of common interest converge to mutual defection. For two-action games the classification is complete and rests on an exact Hamiltonian structure shared by both payoff definitions. The structure gives a behavioural test: cycles in the classic Matching Pennies game have amplitude-independent period (isochronous) under logarithmic payoffs, but not under expected utility. Logarithmic evidence integration thus determines which strategic outcomes dynamical selection can reach, wherever learning approximates Bayesian updating.

cs.GT · cs.MA

版本更新 · v3arXiv:2610.09173

RDGSplat: Render-Dedicated Geometry for Novel View Synthesis

Zhijie Zheng, Xinhao Xiang, Jiawei Zhang

原文摘要

Recent 3D foundation models extend to novel view synthesis by carrying a Gaussian head on the representation they already use for reconstruction. However, their rendering quality lags far behind their reconstruction accuracy, because the renderer reads a geometry and a representation that are both optimized for metric reconstruction. Prior methods alleviate this by updating the backbone weights, but they thereby sacrifice the metric predictions the model was built for. To this end, we propose RDGSplat, which decodes a geometry dedicated to rendering from a frozen 3D foundation model while keeping its metric predictions exact. In particular, we devise Render-Dedicated Geometry Decoding, which duplicates the pretrained decoders and optimizes the duplicates under photometric supervision alone. Then, a Target-Pose Conditioned Adapter is introduced to adapt the representation those decoders read towards rendering, conditioned on the predicted target pose. Extensive experiments show that RDGSplat improves novel view synthesis for three feed-forward models of two architectures on four benchmarks, with every pretrained weight frozen. On RE10K, it raises WM2.0 from 20.918 to 25.149dB by training 205.5M added parameters against a frozen 1.4B backbone, and leaves its predicted depth and pose unchanged.

cs.CV

版本更新 · v2arXiv:2511.17783

Variational Estimators for Node Popularity Models

Jony Karki, Dongzhou Huang, Yunpeng Zhao

原文摘要

Node popularity is recognized as a key factor in modeling real-world networks, capturing heterogeneity in connectivity across communities. This concept is equally important in bipartite networks, where nodes in different partitions may exhibit varying popularity patterns, motivating models such as the Two-Way Node Popularity Model (TNPM). Existing methods, such as the Two-Stage Divided Cosine (TSDC) algorithm, provide a scalable estimation approach but may have limitations in terms of accuracy or applicability across different types of networks. In this paper, we develop a computationally efficient and theoretically justified variational expectation-maximization (VEM) framework for the TNPM. We establish label consistency for the estimated community assignments produced by the proposed variational estimator in bipartite networks. Through extensive simulation studies, we show that our method achieves superior estimation accuracy across a range of bipartite as well as undirected networks compared to existing algorithms. Finally, we evaluate our method on real-world bipartite and undirected networks, further demonstrating its practical effectiveness and robustness.

stat.ML · cs.LG

版本更新 · v2arXiv:2605.16797

EgoKit: Towards Unified Low-Cost Egocentric Data Collection with Heterogeneous Devices

Liuchuan Yu, Erdem Murat, Beichen Wang, Yan Zeng, Tingting Luo, Huizhen Zhou, Shanghao Li, Huining Feng 等 13 位作者

原文摘要

Egocentric video is increasingly used as a data source for robot learning, activity understanding, and embodied AI research, but collecting it at scale remains fragmented in practice: each candidate host device, such as an Android phone, iPhone, iPad, smart glasses, or extended reality (XR) headset, exposes a different SDK, a different policy on raw camera access, and different limitations on external USB cameras and on-device tracking. Synchronized ego-view and wrist-view capture is therefore typically obtained by either committing to a single proprietary platform or building one-off rigs that do not transfer across devices. To address this gap, we present EgoKit, a toolkit that exposes the same egocentric recording workflow across six heterogeneous host devices. Across all supported devices, EgoKit presents the same recording interaction and produces locally stored video with a uniform log format; on XR headsets, it additionally logs head pose and OpenXR-standard 26-joint hand tracking aligned to the video streams. The companion accessories, including two wrist cameras with mounts, a head strap, and a USB-C hub, add wrist-view capture to any supported host without custom hardware fabrication. To validate that EgoKit data can train robot policies, we replicated HumanEgo with 41 demonstrations recorded by EgoKit-PICO: in simulation, policies trained on 20 or 40 of them placed a cube on a tray in 60-74% of 100 unseen layouts, about as often as policies trained on Project Aria recordings of the same layouts. EgoKit is available at https://egokit.chuange.org/.

cs.CV · cs.RO

版本更新 · v5arXiv:2504.21323

How to Backdoor Image Knowledge Distillation

Qian Ma, Chen Wu, Prasenjit Mitra, Sencun Zhu

原文摘要

Knowledge distillation is widely used to transfer behavior from a large teacher model to a smaller student. It is often assumed to be safe when the teacher is clean, because classic backdoor attacks rely on poisoned labels and triggers in supervised training, whereas distillation trains the student to match a teacher's outputs. We show that this assumption can fail when the distillation dataset itself is poisoned. Our attack injects triggered and manipulated images that a clean teacher already predicts as an attacker chosen target label, which causes the student to learn a backdoor even though the teacher remains unaffected. We evaluate this threat across multiple manipulation strategies, including targeted adversarial perturbations and targeted GAN based class transitions, and study how distillation settings influence both accuracy and attack success. We show that the attack remains effective even at a 10% poisoning rates. The results demonstrate that a clean teacher alone is not a sufficient safeguard: poisoned distillation data can produce a strongly backdoored student while maintaining competitive performance on clean images. These findings show that the integrity and provenance of distillation data are part of the security boundary of data intensive KD pipelines, even when the teacher itself is trusted.

cs.CR · cs.AI · cs.LG

版本更新 · v2arXiv:2610.37407

Constraining the Commit Boundary: A DIO/ODI-Informed Authorization Guardrail for Agentic Entity Resolution

Daniel Beranek

原文摘要

Agentic Entity Resolution (ER) systems iteratively plan actions, retrieve evidence, revise hypotheses, and propose graph mutations. An erroneous identity hypothesis may condition later retrieval and produce apparent confirmation. This paper proposes a Digital Identity Optimization (DIO) and Ontology of Digital Identity (ODI)-informed authorization boundary between evidence available for reasoning and evidence eligible to authorize persistent identity-changing mutations. A domain-governed constraint-binding function maps selected reconstruction-failure distinctions to identity-preserving constraints. An abstract two-phase supervisor permits commitment only when claim-specific authorization-eligible evidence supports every required proposition, relevant conflicts are resolved, scope is valid, and bound state and policy versions remain current. Admission as UNVERIFIED does not confer authorization eligibility; separate claim-specific promotion is required, and insufficient support or unresolved material conflict defers the mutation. The guarantee is conditional on adequate domain policy, sound claim-specific evidence promotion, and faithful enforcement; the specification does not independently establish promotion correctness or semantic truth. The proposed contribution is a DIO/ODI-informed diagnostic-to-constraint organization integrated with an explicit authorization contract for claim-specific evidence promotion and mutation-specific proposition requirements. Scope binding, conflict handling, and commit-time version checks are treated as necessary contract elements, not as novel mechanisms in isolation. This is a conceptual architecture without implementation or empirical validation. It does not prevent erroneous hypotheses or hypothesis-conditioned retrieval; dependency-aware evidence flow remains future research.

cs.AI · cs.CR · cs.DB

版本更新 · v2arXiv:2610.18639

Subgaussian Vector Balancing by an Ising Model

Heng Guo, Daniel A. Spielman, Xinyuan Zhang

原文摘要

We show that the guaranties of the Gram-Schmidt Walk Algorithm of Bansal, Dadush, Garg, and Lovett can be achieved by an Ising model. Given vectors $v_1, \ldots, v_n$ of norm less than 1, we give a closed form for a centrally symmetric distribution on a vector $σ\in \{\pm 1 \}^n$ so that the signed sum $\sum_j σ(j) v_j$ is $1$-subgaussian. We show that the Glauber dynamics for this model mix rapidly provided that the norms of the input vectors are bounded below 1 by an inverse-polynomial. The proofs employ the theory of Lorentzian polynomials, and we use these techniques to show fast mixing bounds for other spin systems.

cs.DS · math.PR

版本更新 · v3arXiv:2605.10938

ELF: Embedded Language Flows

Keya Hu, Linlu Qiu, Yiyang Lu, Hanhong Zhao, Tianhong Li, Yoon Kim, Jacob Andreas, Kaiming He

原文摘要

Diffusion and flow-based models have become the de facto approaches for generating continuous data, e.g., in domains such as images and videos. Their success has attracted growing interest in applying them to language modeling. Unlike their image-domain counterparts, today's leading diffusion language models (DLMs) primarily operate over discrete tokens. In this paper, we show that continuous DLMs can be made effective with minimal adaptation to the discrete domain. We propose Embedded Language Flows (ELF), a class of diffusion models in continuous embedding space based on continuous-time Flow Matching. Unlike existing DLMs, ELF predominantly stays within the continuous embedding space until the final time step, where it maps to discrete tokens using a shared-weight network. This formulation makes it straightforward to adapt established techniques from image-domain diffusion models, e.g., classifier-free guidance (CFG). Experiments show that ELF substantially outperforms leading discrete and continuous DLMs, achieving better generation quality with fewer sampling steps. These results suggest that ELF offers a promising path toward effective continuous DLMs.

cs.CL · cs.AI · cs.LG

版本更新 · v3arXiv:2510.01335

HomID : Benchmarking Intrinsic Dimension Estimators on Homogenous Manifolds with Anisotropic Embeddings

Aritra Das, Joseph T. Iosue, Victor V. Albert

原文摘要

The manifold hypothesis suggests that data lies on manifolds with smaller intrinsic dimension (ID) than their ambient dimension. However there is no empirical agreement on the estimates for ID from different estimators for realistic datasets. Thus it is important to test ID estimators (IDEs) with targeted stressors. In this work, we consider the role of anisotropy. To this end, we propose HomID, a collection of homogeneous spaces with anisotropic embedding, for benchmarking ID estimators. We observe that methods that perform well on standard benchmarks systematically degrade on HomID under identical resource allocation. We further observe that anisotropic distortion of such benchmarks also results in performance degradation. Finally, we demonstrate that controlled anisotropic distortions induce systematic shifts in the distributions on which these methods rely, providing a concrete mechanism for the resulting estimation errors in two particular IDEs. The code for the project is available at https://github.com/a-writes-code/homid

cs.LG · cond-mat.dis-nn · math.MG · physics.data-an · quant-ph

版本更新 · v2arXiv:2606.18071

Volterra Generative Models via Markovian Lifting

Bingyan Han

原文摘要

Diffusion-based generative models usually perturb data through Markov processes driven by Brownian motion. Volterra processes allow more flexible temporal dependence, but their non-Markovian structure complicates score learning and reverse-time simulation. We develop Volterra generative models and provide Markovian approximations. Gaussian conditioning then reduces the denoising problem to the original data dimension. We present the connections with variance-exploding and variance-preserving representations. Our framework also permits reuse of pretrained denoisers such as EDM2 networks. With one auxiliary factor, our models trained from scratch achieve FIDs of $0.547$ on MNIST and $1.860$ on conditional CIFAR-10. With autoguidance, ImageNet64 FID reaches $1.912$ after fine-tuning, while ImageNet512 FID reaches $1.903$ using frozen pretrained networks.

cs.LG · cs.AI

版本更新 · v2arXiv:2609.27110

Undertone: Personalizing Frozen VLM Aesthetic Judges from Few Ratings

Amit Jadhav, Shaurya Beriwala, Beomjin Kim

原文摘要

Image quality assessment predicts a mean opinion score (MOS), but for image aesthetics the mean hides the individual, so personalized assessment must start from the few images a new user rates. Fitting each person from scratch fails with ten ratings; networks fine-tuned per person carry over poorly to new kinds of images. We present Undertone-P, which learns from other raters a Gaussian prior over per-person regression weights on read-outs of frozen vision-language model (VLM) judges: the probability-weighted rating and the hidden state at the score token. Since people differ from the crowd in ways other raters reveal, a few ratings need only choose among those ways: a new user costs one closed-form solve, and no network is trained. On Ryu and Yanaka's PARA benchmark, the prior alone reaches a Spearman correlation of .640, above the best published 10- and 100-rating results (.581 and .620); 10 and 100 of a person's ratings raise it to .648 and .676. These ratings add most where tastes depart from the crowd: with 100 ratings, +.067 for the raters who agree least with it and +.206 on LAPIS artworks, against +.037 overall. Without labels, the judges' expected scores predict PARA's MOS at .835 (best published model we ran: .694). PARA-trained networks still lead under PARA's original protocol, likely through a stronger end-to-end MOS model.

cs.CV · cs.CL · cs.LG

版本更新 · v2arXiv:2610.01739

Fixed-point neural samplers on discrete spaces

Jiajun He, Denis Blessing, Mouyang Cheng, Yuanqi Du, Carles Domingo-Enrich

原文摘要

Sampling from discrete, unnormalized distributions without access to data is a challenging problem. Neural samplers offer a promising approach by training generative models from density evaluations directly. However, existing discrete neural samplers are prone to mode collapse, come without convergence guarantees when trained via fixed-point iterations, and are often tied to a specific reference process such as masked or uniform diffusion. In this work, we introduce Discrete Gibbs Iterative Neural Sampler, a fixed-point neural sampler that addresses these limitations, enabling efficient, scalable learning, substantially reducing mode collapse in practice. Besides masked diffusion, the framework also extends to transport between arbitrary distributions. DIG-IN mitigates mode collapse on Ising and Potts models and scales to amortized sampling with up to 2,500 sites, recovers alloy phase diagrams, and learns to sample biomolecular Boltzmann distributions from energy alone. Its transport formulation accurately estimates solvation and conformational free energies. As a maximum-entropy RL policy, DIG-IN outperforms the Gaussian, diffusion, and flow policies we compare against across 20 continuous-control tasks.

cs.LG

版本更新 · v2arXiv:2505.22252

B-XAIC Dataset: Benchmarking Explainable AI for Graph Neural Networks Using Chemical Data

Magdalena Proszewska, Tomasz Danel, Antoni Antoszek, Dawid Rymarczyk

原文摘要

Understanding the reasoning behind deep learning model predictions is crucial in cheminformatics and drug discovery, where molecular design determines their properties. However, current evaluation frameworks for Explainable AI (XAI) in this domain often rely on artificial datasets or simplified tasks, employing data-derived metrics that fail to capture the complexity of real-world scenarios and lack a direct link to explanation faithfulness. To address this, we introduce B-XAIC, a novel benchmark constructed from real-world molecular data and diverse tasks with known ground-truth rationales for assigned labels. Through a comprehensive evaluation using B-XAIC, we reveal limitations of existing XAI methods for Graph Neural Networks (GNNs) in the molecular domain. This benchmark provides a valuable resource for gaining deeper insights into the faithfulness of XAI, facilitating the development of more reliable and interpretable models.

cs.LG · cs.CE

版本更新 · v2arXiv:2606.26466

Soft Token Alignment for Cross-Lingual Reasoning

Jiayi He, Jungsoo Park, Wei Xu, Alan Ritter

原文摘要

Multilingual large language models often produce inconsistent reasoning and answers for semantically equivalent prompts in different languages. Prior work suggests that intermediate representations can be relatively language-agnostic, but generation becomes increasingly language-specific as models commit to discrete output tokens. This is problematic because language-specific lexical choices can cause semantically equivalent reasoning paths to diverge across languages. These divergences motivate searching for a cross-lingual alignment signal that is less tied to any single vocabulary item or script. We propose SOLAR, an auxiliary objective for supervised fine-tuning that aligns soft-token representations across languages, using English as a pivot. Soft tokens are probability-weighted mixtures over the vocabulary embeddings, yielding continuous representations that can aggregate information from semantically related tokens across languages. We then align each non-English soft-token summary to its English counterpart in the shared embedding space. Across four multilingual reasoning benchmarks, SOLAR improves accuracy by up to +17.7 points over the base model and +3.8 over standard supervised fine-tuning, with the largest gains on low-resource languages. SOLAR also strengthens final-layer cross-lingual similarity and substantially reduces language-cluster separability, suggesting that aligning soft-token representations helps preserve shared semantic structure during multilingual reasoning.

cs.CL

版本更新 · v2arXiv:2607.22944

Invariant Discovery for Networked Systems

Hongyu Hè, Alexander Krentsel, Sylvia Ratnasamy, Maria Apostolaki

原文摘要

Invariants, the relations expected to hold among measured signals of a network, underpin applications from verification to traffic generation, telemetry imputation, and input validation. Yet, writing them by hand demands rare expertise in both formal logic and networking. Testing all possible combinations of telemetry variables statistically is intractable at network scale, while existing automatic tools still require a human-authored grammar of admissible invariants and learn only exact, "hard" rules that break under real-world noise. Our key idea is to use an LLM to inspect variable metadata, classify counter data types, and predict candidate syntactic relationships that form a compact grammar, followed by a deterministic statistical search within that grammar. If the initial grammar fails to recover trusted known invariants on held-out telemetry, Autogram instructs the LLM to iteratively widen the grammar until recovery succeeds. By confining the LLM to grammar induction and re-induction while delegating candidate verification to logical and statistical checks, Autogram turns non-deterministic AI proposals into auditable invariants with formal guarantees within the induced grammar. We design and prototype Autogram and evaluate it on both public and production WAN telemetry, recovering expert-derived invariants with full recall and low false positives. We close with a discussion of open problems on the path toward fully open-ended invariant discovery.

cs.NI · cs.AI · cs.LG · cs.SC

版本更新 · v2arXiv:2604.10675

HiddenObjects: Scalable Spatial Prior Extraction for Object Placement from Diffusion Models

Marco Schouten, Ioannis Siglidis, Serge Belongie, Dim P. Papadopoulos

原文摘要

We learn explicit, class-conditioned spatial priors for object placement in natural scenes by distilling placement knowledge from text-conditioned diffusion models. Prior methods rely on sparse manual annotations or on inpainting object-removal pipelines, whose artifacts promote shortcut learning. To address these limitations, we propose a scalable pipeline that evaluates dense candidate placements by inserting objects into clean backgrounds. This produces HiddenObjects, a dataset of 27M bounding-box annotations (2M positives) across 27K diverse scenes and object categories. Human evaluation prefers our image editing composites over those guided by sparse annotations in 65.6% of comparisons. We distill the priors into a lightweight placement model that achieves the best accuracy among dedicated baselines and zero-shot vision-language models.

cs.CV

版本更新 · v2arXiv:2605.04373

Worst-Case Discovery and Runtime Protection for RL-Based Network Controllers

Hongyu Hè, Minhao Jin, Maria Apostolaki

原文摘要

RL-based controllers achieve strong average-case performance in networking tasks such as congestion control and adaptive bitrate streaming. Yet their performance can degrade severely under network conditions where strong performance is still achievable. Identifying such conditions and quantifying the resulting performance gap is intractable by enumeration, while the sequential and closed-loop nature of RL controllers makes formal verification methods impractical. We present ReGuard, a framework that discovers worst-case scenarios for a given RL controller and protects it against them at inference time without retraining. ReGuard formulates scenario discovery as a bilevel regret-maximization problem, certifying a lower bound on the controller's worst-case performance gap. ReGuard then analyzes the discovered counterfactual trajectories and compiles them into lightweight logic rules that intervene only when a risky state is detected, leaving the controller's behavior unchanged otherwise. We evaluate ReGuard across three RL-based network controllers: Pensieve, Sage, and Park. ReGuard discovers scenarios in which each controller suffers a 43-64% performance loss relative to what is achievable under the same conditions. ReGuard exposes performance gaps 57% to 6 times larger than those found by the strongest baselines and shrinks those gaps by 79-85% in its first iteration via lightweight rule-based protection, iteratively driving the remaining gap toward nominal levels. ReGuard's protection extends beyond the scenarios it discovers, improving performance across a wide range of network conditions.

cs.NI · cs.AI · eess.SY

版本更新 · v2arXiv:2407.21665

A State-of-the-Art Review of Computational Models for Analyzing Longitudinal Wearable Sensor Data in Healthcare

Paula Lago

原文摘要

Wearable devices are increasingly used as tools for biomedical research, as the continuous stream of behavioral and physiological data they collect can provide insights about our health in everyday contexts. Long-term tracking, defined in the timescale of months of year, can provide insights of patterns and changes as indicators of health changes. These insights can make medicine and healthcare more predictive, preventive, personalized, and participative (The 4P's). However, the challenges in modeling, understanding and processing longitudinal data are a significant barrier to their adoption in research studies and clinical settings. In this paper, we review and discuss three models used to make sense of longitudinal data: routines, rhythms and stability metrics. We present the challenges associated with the processing and analysis of longitudinal wearable sensor data, with a special focus on how to handle the different temporal dynamics at various granularities. We then discuss current limitations and identify directions for future work. This review is essential to the advancement of computational modeling and analysis of longitudinal sensor data for pervasive healthcare.

cs.HC · cs.LG

版本更新 · v2arXiv:2609.19394

Strategyproof Aggregation in Euclidean Spaces: Rigidity and Median Optimality

Jianhao Jia

原文摘要

We study deterministic strategyproof mechanisms for facility location in finite-dimensional Euclidean spaces. For every population of at least three agents and every finite dimension, the coordinate-wise median minimizes the worst-case approximation ratio among anonymous mechanisms. Agent identities can improve the ratio at a fixed population size, and we give an explicit four-agent separation. Nevertheless, for every fixed dimension, the optimal ratio over all deterministic strategyproof mechanisms converges, as the population grows, to the supremum of the median's ratios over finite populations. Combined with the sharp bound for the median, this gives the optimal guarantee $\sqrt{6\sqrt3-8}$ uniform over populations and dimensions. The main structural ingredient is a rigidity theorem for strategyproof aggregation. We characterize unanimous, anonymous, translation-equivariant strategyproof mechanisms with bounded individual influence as fixed coordinate-wise order-statistic rules in a single orthonormal frame. We also prove that, for strategyproof mechanisms, continuity is equivalent to convexity of the full range in every finite dimension. An approximation-preserving normalization and a reflection argument yield the fixed-population anonymous comparison. To remove anonymity in the large-population limit, we develop an extraction theorem that converts a common guarantee on arbitrarily large populations into an anonymous deterministic mechanism on any prescribed finite population.

cs.GT

版本更新 · v3arXiv:2605.07104

Almost Sure Convergence Rates of Stochastic Approximation and Reinforcement Learning via a Poisson-Moreau Drift

Xinyu Liu, Zixuan Xie, Shangtong Zhang

原文摘要

Establishing almost sure convergence rates for stochastic approximation and reinforcement learning under Markovian noise is a fundamental theoretical challenge. We make progress towards this challenge for a class of stochastic approximation algorithms whose expected updates are contractive, a setting that arises in many reinforcement learning algorithms such as $Q$-learning and linear temporal difference learning. Specifically, for a power-law learning rate $O(n^{-η})$ with $η\in (1/2, 1)$, we obtain an almost sure convergence rate arbitrarily close to $o(n^{1 - 2η})$. For the harmonic learning rate $α_n=α/(n+1)$, the almost sure squared-error rate is $o(n^{-ζ})$ for every $ζ<\min\{1,2(1-κ)α\}$, where $κ$ is the contraction factor. Thus exponents arbitrarily close to one are available when $2(1-κ)α\geq1$. This approaches the $n^{-1}$ polynomial exponent of classical law-of-the-iterated-logarithm benchmarks. Key to our analysis is a novel Lyapunov drift construction that applies a Poisson-equation based correction for Markovian noise to the well-established Moreau-envelope smoothing for the contractive mapping.

cs.LG · math.OC · stat.ML

版本更新 · v2arXiv:2609.24720

Colour me shocked: Exact Molecular Hessians from local MLIPs in O(N) time using sparse differentiation!

Luca Thiede, Andreas Burger, Alán Aspuru-Guzik

原文摘要

The Hessian of the energy with respect to the nuclear positions is indispensable in atomistic modelling. However, constructing this matrix requires $O(N)$ Hessian vector products, traditionally limiting high-accuracy Hessians to small systems. Machine learning interatomic potentials (MLIPs) have accelerated atomistic modelling by providing highly accurate energies and forces at $O(N)$ cost, yet the resulting $O(N^2)$ cost of Hessians remains a practical bottleneck for large systems. Based on the insight that we can derive the sparsity pattern for an MLIP's Hessians in closed form, we show in this paper how to use techniques from sparse automatic differentiation to reduce the cost of a local MLIP's Hessians to a system-size-independent number of Hessian-vector products, yielding overall $O(N)$ total cost without any approximations. We benchmark our approach on a variety of systems ranging from alkane chains to water clusters to $A\beta40$ conformers. Depending on the MLIP configuration, we achieve the linear scaling regime already on relatively small systems, resulting in large runtime reductions between 2$\times$-15$\times$ for these systems. This opens up the possibility of scaling high-accuracy MLIP Hessians to very large systems, such as proteins that were previously inaccessible.

cs.CE

版本更新 · v2arXiv:2605.16922

Motion Cues from Image-based Point Tracking for LiDAR Scene Flow Estimation

Youngdong Jang, Gyeongrok Oh, Jong Wook Kim, Hyunju Ryu, Hyung-gun Chi, SeungHyeon Kim, Seungryong Kim, Jonghyun Choi 等 9 位作者

原文摘要

Self-supervised LiDAR scene flow approaches rely on pseudo-labels that distinguish static and dynamic points, providing targeted supervision. These labels are typically derived from LiDAR geometry, making them unreliable in sparse or occluded regions. The resulting noise misguides motion supervision and degrades scene flow learning, yet existing methods remain largely dependent on the same geometric evidence. To address this, we introduce TrackCue, a tracking-guided framework that transfers dense image trajectories into reliable static-dynamic supervision. TrackCue anchors tracking queries to projected LiDAR points, yielding image-space trajectories that provide motion evidence beyond sparse LiDAR geometry. Since image-space displacement also reflects ego-vehicle motion, we present a visually consistent motion compensation strategy that compares each tracked trajectory with the rigid trajectory induced by ego-motion alone. It admits motion evidence only where both trajectories are valid and the deviation persists across frames, isolating true object motion while suppressing transient tracking errors. Finally, we perform visual motion cue lifting, which associates image-space object motion cues with LiDAR points for label refinement. As a result, TrackCue substantially improves the precision of dynamic pseudo-labels, providing more reliable supervision and leading to better self-supervised scene flow estimation.

cs.CV

版本更新 · v2arXiv:2605.22535

TerminalWorld: Benchmarking Agents on Real-World Terminal Tasks

Zhaoyang Chu, Jiarui Hu, Xingyu Jiang, Pengyu Zou, Han Li, Chao Peng, Peter O'Hearn, Earl T. Barr 等 11 位作者

原文摘要

We introduce TerminalWorld, a scalable data engine that automatically reverse-engineers high-fidelity evaluation tasks from "in-the-wild" terminal recordings. Processing 80,870 terminal recordings, the engine yields a full benchmark of 1,530 validated tasks, spanning 18 real-world categories, ranging from short everyday operations to workflows exceeding 50 steps, and covering 1,280 unique commands. From these, we curate a Verified subset of 200 diverse, manually reviewed tasks. Comprehensive benchmarking on TerminalWorld-Verified across eight frontier models and six agents reveals that current systems still struggle with authentic terminal workflows, achieving a maximum pass rate of only 62.5%. Moreover, TerminalWorld captures real-world terminal capabilities distinct from existing expert-curated benchmarks (e.g., Terminal-Bench), with only a weak correlation to their scores (Pearson r=0.20). The automated engine makes TerminalWorld authentic and scalable by construction, enabling it to evaluate agents in real-world terminal environments as developer practices evolve.

cs.AI

版本更新 · v2arXiv:2605.01640

Prescriptive Scaling Laws for Data Constrained Training

Justin Lovelace, Christian Belardi, Srivatsa Kundurthy, Shriya Sudhakar, Kilian Q. Weinberger

原文摘要

Training compute is increasingly outpacing the availability of high-quality data. This shifts the central challenge from optimal compute allocation to extracting maximum value from limited data. The widely adopted Chinchilla scaling law assumes every training token is unique. This limits its ability to guide pretraining decisions in data-constrained regimes. We model the excess loss under repetition with a simple additive overfitting penalty and find that it accurately describes model behavior. Our scaling law yields qualitatively new compute-optimal allocation advice. Beyond a point, further repetition is counterproductive and compute is better spent on model capacity. We show that following our law's recommended configuration improves performance in data-constrained regimes. Finally, because our one-parameter form isolates overfitting in a single coefficient, it enables direct comparison across training configurations. As a case study, we show that strong weight decay ($λ=1.0$) reduces this coefficient by approximately 70\%, providing a scaling-law explanation for recent findings that optimal weight decay in data-constrained regimes is an order of magnitude larger than standard practice.

cs.LG · cs.CL

版本更新 · v5arXiv:2505.12006

SOCIA-$\nabla$: Textual Gradient Meets Multi-Agent Orchestration for Automated Simulator Generation

Yuncheng Hua, Sion Weatherhead, Mehdi Jafari, Hao Xue, Flora D. Salim

原文摘要

In this paper, we present SOCIA-$\nabla$, a diagnosis-driven multi-agent framework for automated simulator-code construction. SOCIA-$\nabla$ iteratively refines executable simulator code within a textual computation graph, where LLM-driven agents synthesize, execute, evaluate, diagnose, and repair simulators. A grounded simulator blueprint attributes behavioral residuals to candidate mechanisms and their spatial or interaction contexts, which are then converted into localized textual repair signals with history-aware memory and constraint projection. We evaluate SOCIA-$\nabla$ on the real-world LLMob personal-mobility benchmark and a controlled semi-synthetic geo-social mask-adoption benchmark. Across in-distribution simulation, out-of-distribution what-if generation, and geo-social diffusion, SOCIA-$\nabla$ achieves the strongest overall simulator fidelity. SOCIA-$\nabla$'s code and data are publicly available at https://github.com/cruiseresearchgroup/SOCIA-Nabla.

cs.AI