跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-15 23:43 — 2026-11-16 23:43(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

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

A Transferable Pretrained 3D Model for Impedance Inversion with Sparse-Well Prior Conditioning

Gen Li, Zhaoyun Zong, Diqiong Jiang, Man Tang

原文摘要

Deep-learning-based seismic impedance inversion commonly requires retraining for each target survey, which may generalize poorly beyond the conditioning locations when well control is extremely sparse. We propose a transferable three-dimensional inversion framework that separates offline learning from target-survey deployment. A masked autoencoder first learns seismic structural representations from unlabeled multi-survey data, after which the frozen encoder is incorporated into an inversion network trained on synthetic geological models with sparse-well-derived low-frequency priors. During deployment, the complete inversion network remains fixed; the available conditioning well is used only to construct the low-frequency prior and align the global impedance range. Experiments on the Overthrust model show that the proposed method achieves the lowest full-volume NRMSE and reduces the P95 trace-wise NRMSE from 0.1310 to 0.1074 relative to the best target-trained baseline, indicating fewer localized large errors under different well locations. In a field survey with one conditioning well and three blind wells, it reduces the mean blind-well NRMSE by 20.95% relative to the target-trained U-Net while maintaining the highest correlation. These results demonstrate that the proposed framework transfers useful impedance information beyond the conditioning location with low deployment cost and without retraining the inversion network.

cs.LG · physics.geo-ph

新论文 · v1arXiv:2611.14920

Janus: One Agent, Two Roles for Digital Twin Construction and Network Orchestration

Peijun Hou, Yue Zhang, Yi Wei, Nan Cen

原文摘要

Next-generation wireless networks are increasingly large-scale, heterogeneous, and dynamic, posing significant challenges to network modeling and control. Digital twins offer a promising solution, but existing approaches typically rely on static models and decouple twin construction from network orchestration, limiting adaptability. Meanwhile, large language models (LLMs) provide strong reasoning capabilities but struggle with graph-structured data and are highly sensitive to prompt design, making inference unreliable. In this paper, we propose Janus, an agentic LLM-based framework that unifies digital twin construction and network orchestration within a closed-loop system. At the core of Janus is a novel NetTwin agent, which introduces a new one-agent, two-role paradigm, enabling a single agent to simultaneously construct the digital twin from partial observations while performing task-driven network decision-making. To realize this, we design a modular architecture with three functional roles, including planner, modeler, and coder, along with a newly designed unified prompt module that further enhances graph reasoning robustness. Extensive evaluations on wireless networks with up to 200 nodes and two representative tasks, including user association and SAGIN routing, show that Janus achieves over 90% digital twin accuracy and near-optimal performance with gaps within 10.53%, while maintaining moderate computational overhead. These results demonstrate the effectiveness, scalability, and generalizability of Janus, paving the way for AI-native autonomous wireless network orchestration.

cs.NI

新论文 · v1arXiv:2611.14918

DIVAL: Diffeomorphic Vector-Field Alignment for Nonholonomic Motion Planning

Yike Qiao, Xiaodong He, An Zhuo, Zhiyong Sun, Weimin Bao, Zhongkui Li

原文摘要

Conventional vector-field-based motion planners for nonholonomic robots consist of two steps: first designing a nominal vector field and then controlling the robot to follow it to approach the target. However, a nonholonomic robot cannot follow the vector field instantaneously and may collide with obstacles, due to the inevitable mismatch between the robot's initial heading and the vector field's direction. This paper proposes a diffeomorphic vector-field alignment (DIVAL) method, which aligns the vector field's direction with the robot's initial heading so the robot can follow the vector field from the start. Specifically, the nominal vector field is locally reshaped by applying a diffeomorphic deformation to the workspace, such that the reshaped vector field has the same direction as the robot's heading at the initial position and coincides with the nominal vector field outside the deformed region. Since DIVAL eliminates the initial heading mismatch, the nonholonomic robot can maintain heading alignment with the reshaped vector field throughout the motion. This heading alignment further ensures that the robot preserves the nominal vector field's properties, including obstacle avoidance, convergence to the target, and smooth control signals. Numerical simulations provide vector-field-tracking baselines where the nominal vector fields are reshaped with DIVAL. Compared to the original baselines, the proposed method achieves collision-free convergence in all trials and avoids control discontinuities. Hardware experiments on a ground vehicle further demonstrate collision-free convergence across different targets and initial conditions under real-world disturbances.

cs.RO · eess.SY

版本更新 · v2arXiv:2611.10375

CHARM: Certified Homology-Aware Reverse-scale Mapping via Diffusion-Guided Quotient Towers

Zhe Li

原文摘要

Conventional dimensionality-reduction methods optimize geometric fidelity but do not return auditable homology certificates or identify the input observations associated with nontrivial classes. Direct high-dimensional persistent-homology computation is costly, and its representatives are rarely linked to a shared planar view. We introduce Certified Homology-Aware Reverse-scale Mapping (CHARM), which augments two-dimensional coordinates with algebraically certified, sample-traceable structural records. Diffusion-guided cover proposals and homotopy-safe contractions compress the input neighborhood flag complex. A Cover Quotient Tower supports cross-scale representative tracking and exact $H_k$ certification when algebraic tests complete. Reverse-scale layout connects quotient-chain preimages to the same coordinates used for geometric exploration. Contraction preserves the input neighborhood flag-complex homotopy type; the quotient tower inherits a multiplicative 3-interleaving with coarse-hop Rips, and conditional distortion bounds connect it to original Euclidean Rips. In a fixed-seed benchmark of 22 datasets (41,637 samples), CHARM achieves the highest share of first- or second-place scores across 15 metrics. On nonsynthetic data, it ranks first or second on every metric and first on all four $H_0/H_1$ persistence-diagram metrics. CHARM couples strong nonsynthetic geometric performance with an auditable structural layer.

cs.LG

版本更新 · v3arXiv:2610.14671

SPARE: Shared Perception and Adaptive Retrieval of Evidence for Streaming Video Understanding

Senbin Xu, Zijun Zhang, Xinhua Wu, Li He, Jubo Feng, Li Qiao, Zhen Gao, Yan Zhang 等 10 位作者

原文摘要

Streaming video understanding requires answering questions from the observed video, with evidence drawn from recent observations or earlier events. Historical context can improve recall but may interfere with judgments based on recent frames. Its usefulness depends on both when it is introduced and which clips are selected, while relevance alone does not guarantee sufficient evidence for an answer. We propose SPARE, a framework that combines adaptive historical retrieval with visual encoder sharing. A lightweight gate predicts whether recent observations provide sufficient evidence to answer the question. When additional evidence is predicted to be necessary, a multimodal embedding model retrieves relevant historical clips to supplement the current context. LoRA instruction tuning trains the understanding model to use recent observations and retrieved history jointly and abstain when the evidence remains insufficient. To reduce redundant visual parameters, the understanding and retrieval branches share a visual encoder while retaining separate language backbones. Four linear adapters align the shared features with the retrieval model through distillation at the visual token and final retrieval embedding levels. With visual-only inputs, SPARE achieves 77.78% on the evaluated Real-time and Backward task groups of OVO-Bench and 73.31% on StreamingBench. Compared with Qwen3-VL-8B-Instruct evaluated at 2 fps, SPARE improves accuracy by 20.68 percentage points on OVO-Bench and 14.15 percentage points on StreamingBench.

cs.CV

版本更新 · v3arXiv:2608.13233

Fabrication of Complex Soft Robotics: Challenges, Solutions, and Optimization

Mohammed Abboodi

原文摘要

Manufacturing complex soft pneumatic actuators remains challenging because geometric fidelity, compliance, structural integrity, and airtightness must be achieved simultaneously. This study presents a manufacturing-focused evaluation of several fabrication routes for complex pneumatic structures, including heat-shrink forming, silicone casting, powder- and liquid-based additive manufacturing, and fused deposition modeling (FDM). The processes were assessed through process screening, baseline fabrication, failure analysis, and process improvement to distinguish inherent process limitations from correctable manufacturing defects. Heat-shrink forming was limited by geometric conformity, casting by mold accessibility and bonded interfaces, powder-based methods by residual material trapped within enclosed passages, and digital light processing by the material properties and post-processing requirements of the investigated system. FDM provided the most adaptable route because its dominant defects could be progressively reduced through process optimization. The results further showed that airtightness depends not only on nominal wall thickness but also on extrusion-path architecture, while support-free geometry is important when access for internal post-processing is limited. These findings establish a practical design-for-manufacturing approach in which process selection is guided by the compatibility between actuator architecture and manufacturing constraints. The proposed approach provides practical guidance for developing complex, flexible, and airtight soft pneumatic actuators for soft robotic applications

cs.RO

新论文 · v1arXiv:2611.14916

CuEVM: Scaling Smart Contract Execution on GPUs

Nhut-Minh Ho, Tien Tuan Anh Dinh, Quang Trung Ta, Fredrik Svantes, Xiaokui Xiao, Beng Chin Ooi

原文摘要

Smart contracts on Ethereum blockchain process transactions worth billions of US dollars daily. They run on top of Ethereum Virtual Machine (EVM) which executes transactions sequentially. This execution model creates a performance bottleneck, especially for new blockchain workloads with large numbers of transactions, such as security testing. We present CuEVM, a GPU-native and semantically complete EVM execution engine that treats transaction execution as a massively parallel data processing problem. It employs novel data structures and GPU-aware scheduling to accelerate execution. Unlike prior works that transpile the contract and rely on a host CPU for many operations, CuEVM supports complete EVM semantics natively on the GPU. It passes 100% of the Ethereum VMTests and 96.2% of the full execution-test suite. On a single commodity GPU, CuEVM executes over 8 million ERC-20 transfers per second, outperforming existing baselines by up to two orders of magnitude. We build a smart contract fuzzer, called CuEVM-fuzz, on top of CuEVM. The fuzzer achieves over a million end-to-end executions per second, up to 23x and 4.8x higher than the state-of-the-art CPU-based and GPU-based baselines, respectively.

cs.DC · cs.CR · cs.DB

版本更新 · v3arXiv:2610.09505

Bias-Aware Adjoint Calibration and Optimal Control of Stochastic Multiscale Bioprocess Digital Twins

Keilung Choy, Wei Xie

原文摘要

We develop a bias-aware digital-twin calibration and control framework for multiscale bioprocess models within a biological systems-of-systems (Bio-SoS) paradigm. The digital twin is represented by a stochastic differential equation (SDE) model and calibrated from sparse observations using quasi-likelihood estimation and adjoint sensitivity analysis. SDE generator-based moment expansions characterize truncation-induced parameter bias, while forward-backward adjoints quantify how calibration uncertainty propagates to value functions and policy performance. The resulting parameter-error distribution supports both policy-directed data acquisition and uncertainty-aware policy optimization through a second-order Gaussian-averaged objective. We characterize the asymptotic behavior of the resulting exploration criterion and derive a physical-system performance under the optimized policy. To implement these ideas, we develop an Actor-Simulator algorithm that jointly updates model parameters, selects informative experiments, and optimizes control policies. Numerical studies demonstrate improved calibration accuracy, sample efficiency, and control performance relative to state-of-the-art baselines.

stat.ML · cs.LG

新论文 · v1arXiv:2611.14910

MuEdit: An efficient multi-task editing method towards inter-domain knowledge conflicts

Songshi Liang, Ting-En Lin, Zixuan Huang, Yuchuan Wu, Yongbin Li, Zihe Wang, Rui Yan

原文摘要

Large language models (LLMs) require frequent knowledge updates across heterogeneous domains, but existing editing methods fail when applied sequentially to multi-task settings. We trace this collapse to inter-domain null-space misalignment: heterogeneous tasks induce distinct Jacobian geometries, causing their common null space to shrink dramatically and leaving insufficient admissible directions for conflict-free updates. We propose the Conflict Index to quantify this geometric interference, and introduce Mu-Edit, which mitigates multi-task conflicts via (1) conflict-aware ordering to minimize cumulative interference, and (2) dynamic low-rank approximation to expand the null space when ordering alone is insufficient. Experiments across five functional domains and three backbones show that Mu-Edit significantly outperforms existing baselines in multi-task editing performance while preserving general capabilities, and remains effective under incremental task arrival.

cs.AI · cs.CL

版本更新 · v15arXiv:2203.05022

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)

Gao Ming

原文摘要

P vs NP problem is the most important unresolved problem in the field of computational complexity. Its impact has penetrated into all aspects of algorithm design, especially in the field of cryptography. The security of cryptographic algorithms based on short keys depends on whether P is equal to NP. In fact, the security requirements for cryptographic keys are much stricter than those for P$\neq$NP, the security of the key must ensure not only a sufficiently high computational complexity to crack it, but also consider the security of each bit of the key, while fully avoiding the effectiveness of various attack methods. In this paper, we innovatively propose a new encoding mechanism and develop a novel block symmetric encryption algorithm, whose encryption and decryption can be completed in linear time. The key consists of 12 variables, for the attacker, in the case when only the plaintext-ciphertext correspondence is known, the problem of cracking the key is equivalent to solving a system of equations about 12 unknown variables $(w_{1}, w_{2}, ..., w_{11}, w_{12})$ together with some implicit variables which are generated by the encryption process. In this paper, we will prove that there is no universal algorithm without brute-force searching at least one variable during the process of verifying five variables $(w_{1}$, $w_{2}$, $w_{3}$, $w_{4}$, $w_{9})$ whose computational complexity is not greater than solving the 12 variables......

cs.CC · cs.IT

新论文 · v1arXiv:2611.14908

Hy ASR 3.0 Technical Report

Aoxiong Yin, Auden Li, Chao Huang, Chuanyang Hu, Eitan Wang, Ethan Zou, Fangming Feng, Guangyu Chen 等 63 位作者

原文摘要

We present Hy ASR 3.0, a large language model (LLM)-based automatic speech recognition (ASR) system that delivers strong recognition accuracy, supports flexible contextual conditioning, and maintains robust recognition performance across diverse speech conditions. Hy ASR 3.0 supports Mandarin Chinese, English and 13 Chinese dialect groups, including Cantonese. Among the evaluated systems, it achieves the lowest aggregate error rates on public Mandarin Chinese, English, and Cantonese benchmarks and the lowest error rates on the corresponding internal test sets, alongside first-tier dialect recognition performance. Beyond audio-only transcription, Hy ASR 3.0 supports multiple forms of external context, including hotword lists, question--answer dialogues, and summaries, enabling the use of task-relevant information during recognition. The model also leverages intra-utterance context to disambiguate homophonic and phonetically similar keywords using information from other parts of the same utterance, without requiring a separate contextual input. Evaluations demonstrate strong contextual recognition in both external-context and intra-utterance settings, as well as robust recognition of long-form speech, children's and older adults' speech, low-volume speech, and speech in noisy environments. This report describes the model architecture and training methodology and presents evaluations across recognition accuracy, context utilization, and robustness.

cs.CL · eess.AS

新论文 · v1arXiv:2611.14907

Lines Are Ideas: Visual Creativity Assessment in Hyperbolic Space

Baoliang Chen, Zihao Lin, Hao Liu, Xiangjie Sui

原文摘要

Assessing human creativity from drawings provides a scalable way to evaluate human creative ability. However, existing approaches either rely on costly expert annotation or treat creativity as a single regression target, overlooking its underlying structure. Psychological theories have long emphasized that creativity emerges from balancing novelty and appropriateness. Motivated by this principle, we recast creativity as structured semantic deviation between paired drawings, where novelty measures the extent of departure from the original base sketch, and appropriateness determines whether such departures remain meaningful. This formulation naturally leads to a hyperbolic representation, in which novelty is quantified by geodesic distance and appropriateness is evaluated conditionally via a learned decision boundary, further regulated by an abstraction-conditioned adaptive constraint. Experiments on AuDrA-Drawings demonstrate state-of-the-art alignment with expert judgments and strong robustness under rater and task shifts. Beyond performance gains, our framework reveals an interpretable radial organization of creative variation, offering a principled geometric foundation for automatic creativity assessment.

cs.CV

新论文 · v1arXiv:2611.14904

SubGPU Pipelining: Intra-GPU Fine-Grained Spatial Parallelism for LLM Inference

Muralidhar Andoorveedu, Marius Juston, Tingkai Liu, Sanjay Patel

原文摘要

Large language model (LLM) decode is dominated by short, predominantly memory-bound kernels that make bursty use of on-chip execution resources and memory bandwidth. This paper introduces SubGPU Pipelining, a fine-grained, intra-GPU spatial execution model that cuts an operator graph into ordered contiguous segments, binds those segments to spatial stages backed by disjoint streaming-multiprocessor (SM) pools, and streams microbatches through the resulting schedule. Selecting the graph cuts, segment-to-stage binding, per-stage SM allocation, and microbatch size is a coupled optimization problem: each choice changes the overlap pattern, shared-resource contention, cache state, and execution times of the others. We evaluate SubGPU Pipelining through both simulation and silicon experiment using the GPT-OSS 120B workload with 32-GPU B200 deployment settings. The analytical shared-resource simulator searches across SubGPU pipeline structures and batch sizes to map the per-user/per-GPU throughput Pareto frontier. At matched per-GPU throughput, the modeled SubGPU frontier provides up to 2.2x higher per-user throughput than temporal execution, and at matched per-user throughput it provides up to 1.9x higher per-GPU throughput. To test physical feasibility and further validate the simulation results, silicon experiments are performed, using one B200 GPU to emulate a 32-GPU B200 deployment. The experiment evaluates one selected two-stage pipeline configuration at global batch 2,048 using CUDA Green Contexts and TensorRT-LLM kernels. Results show that SubGPU Pipelining improves mean DRAM read-plus-write throughput from 71.8% to 83.6% of peak, and reduces the 36-layer decoder iteration time by 10.33%.

cs.DC

版本更新 · v4arXiv:2610.33857

TrackTok: Semantically Persistent Tokens for Latent Video Generation

Nhi Pham, Christopher Wewer, Bernt Schiele, Jonas Fischer, Jan Eric Lenssen

原文摘要

We introduce TrackTok, an efficient video tokenization framework that produces object-aligned tokens, i.e., tokens that consistently encode the same semantic object across time, even as it moves, deforms, or undergoes partial occlusion. Conventional patch-based or existing holistic tokenizers produce token identities often tied to fixed image locations. In contrast, our approach learns temporally persistent object-aligned representations that bind visual features across frames into stable semantic units. This enables substantially more compact, continuous latent video representations, reducing the number of tokens required for downstream generative modeling with state-of-the-art flow models, while preserving the semantic structure needed for high-quality synthesis. Our tokenizer offers a favorable quality-efficiency trade-off. TrackTok achieves comparable class-conditional generative FVD on UCF-101 dataset at 8 times fewer latent tokens and better latency, and outperforms existing 1D tokenization baselines on frame prediction task on Kinetics-600 across low token budgets. These results suggest that object-aligned and temporally persistent tokenization is a promising direction for scalable video generation, where reducing latent token counts is critical for efficient modeling. Our code for this work is available at github.com/phamleyennhi/tracktok.

cs.CV

新论文 · v1arXiv:2611.14903

Epigraph Form Reinforcement Learning-based Safe Trajectory Tracking Control for Connected and Autonomous Vehicles

Xiaoke Yang, Jin Chen, Yafei Wang, Qi Zhang, Ming Li, Haiwen Wu, Chengliang Yin, Yong Zhang

原文摘要

Safe trajectory tracking (STT) aims to enable autonomous vehicles to follow a reference trajectory accurately while avoiding collisions. This problem is particularly challenging for Connected and Autonomous Vehicles (CAVs) in highly dynamic environments. Existing non-learning-based STT methods often use simplified vehicle and interaction models to meet real-time requirements, which may result in suboptimal tracking accuracy. Although Deep Reinforcement Learning (DRL) can help address this limitation, widely used Lagrangian DRL methods often suffer from unstable training because increasing Lagrange multipliers amplify policy-gradient magnitudes. To address these issues, we propose a novel reinforcement learning framework for STT, called STT Control Epigraph Form RL (STTC-EFRL). In this framework, the STT problem is formulated as an epigraph-form min-max optimization problem. Based on this formulation, we develop a learning mechanism that uses a decreasing scalar related to the epigraph to adjust the policy gradient descent direction without increasing the gradient magnitude, thereby improving training stability. We also develop a computationally efficient ray-casting method to compute a polyhedron scaling factor for safety quantification. Experimental results, including Vehicle-in-the-Loop tests, show that STTC-EFRL achieves higher tracking accuracy than the considered non-learning-based baseline and more stable training than widely used Lagrangian DRL methods, while satisfying safety requirements in connected environments.

cs.LG

版本更新 · v2arXiv:2611.11342

Agent Self-Improvement with Frozen Weights: The Added Value and Limits of Failure Traces

Arkid Mitra, Snehil Saluja

原文摘要

We evaluate whether an AI agent's harness, the notes around its model, can learn from the agent's failure traces beyond a matched search that never sees them. It can, but less than it looks. We tested an open 9-billion-parameter model with fixed weights; a larger teacher model wrote its notes. On generated customer-service decisions, where both note writers were told the target rules, notes based on the agent's mistakes improved accuracy by 4.0 percentage points over notes from the same process with the mistakes withheld. That process alone, trying and keeping better-scoring notes, reached about 60% of the total improvement. In full customer-service conversations the same notes showed no demonstrated improvement. Separately, a strict screen of single lessons admitted two customer-service lessons, still awaiting tests on new data, and one tool-use lesson, written without seeing the agent's mistakes, which showed no demonstrated gain on new tool-use tasks. A neutral note with no procedure scored higher than the learned lessons (exploratory). A blind audit judged 146 of 240 tool-use test items defective.

cs.LG · cs.AI · cs.CL

版本更新 · v2arXiv:2611.10508

Imperfectly Imperfect: Evaluating Graded Cognitive Diversity in LLM Persona Simulations

Sion Weatherhead, Ben Newell, Aaron Belbasis, Flora Salim

原文摘要

Large language model (LLM) agents are increasingly used as synthetic participants in social, behavioural, and decision-making research, yet it remains unclear whether they can express graded cognitive diversity as assigned when engaging in simulated behaviour. We introduce a cognition-suite evaluation that tests whether simulated populations reproduce human variation in reasoning, self-reported traits, their associations, and downstream behaviour. Agents conditioned on synthetic or human-derived profiles of cognitive reflection, Need for Cognition, and Big Five personality answer the same suite as a cohort of 473 adults: two newly assembled tests, a Cognitive Reflection Test (CRT) and a Behavioural Reflection Test (BRT) whose decision scenarios measure reflection in behaviour, alongside an established CRT and the two trait questionnaires. Across seven full-battery simulation runs of four models, agents recover Need for Cognition and Big Five trait distributions on self-report questionnaires, but fall short on simulating diversity of cognitive task performance and downstream behaviours. In the four Claude Sonnet 4.6 runs, every agent scores full marks on both CRTs, whatever reflection level its persona was assigned. In the other three runs agents make intuitive-lure errors (the tempting wrong answers CRT items invite), but 49 to 85% score full marks, against under 10% in the human sample. Claude Sonnet 5 comes closest to people's item-by-item pattern of lures; the other two runs give fewer lures and vary less between items. In the BRT scenarios, every run over-produces 8 to 11 of 15 coded behaviours by at least 20 percentage points, and people's links between reflection and behaviour carry over only in part. Useful synthetic populations must preserve not only trait descriptors but the structured variation in reasoning, error type, and behaviour those descriptors are meant to organise.

cs.CL · cs.AI · cs.CY

新论文 · v1arXiv:2611.14900

Nested Ensemble Learning with Topological Data Analysis for Graph Classification and Regression

Innocent Abaa, Umar Islambekov

原文摘要

We propose a nested ensemble learning framework that utilizes Topological Data Analysis (TDA) to extract and integrate topological features from graph data, with the goal of improving performance on classification and regression tasks. Our approach computes persistence diagrams (PDs) using lower-star filtrations induced by three filter functions: closeness, betweenness, and degree2 centrality. To overcome the limitation of relying on a single filter, these PDs are integrated through a data-driven, three-level architecture. At Level-0, diverse base models are independently trained on the topological features extracted for each filter function. At Level-1, a meta-learner combines the predictions of these base models for each filter to form filter-specific ensembles. Finally, at Level-2, a meta-learner integrates the outputs of these filter-specific ensembles to produce the final prediction. We evaluate our method on both simulated and real-world graph datasets. Experimental results demonstrate that our framework consistently outperforms base models and standard stacking methods, achieving higher classification accuracy and lower regression error. It also surpasses existing state-of-the-art approaches, ranking among the top three models across all benchmarks.

stat.ML · cs.LG · stat.AP

新论文 · v1arXiv:2611.14898

From Pixels to Prompts: Physics-Guided Language Enhancement for AI-Generated Image Detection

Mei Qiu

原文摘要

AI-generated content (AIGC) has substantially narrowed the visual gap between natural and synthetic images, while existing detectors often rely on generator-specific artifacts and exhibit limited generalization to unseen models. This motivates a fundamental question: which intrinsic physical image characteristics provide stable, discriminative cues for distinguishing natural from AI-generated images? We investigate this by systematically identifying robust physical features and incorporating them into a vision-language representation without external textual prompts at inference. We first analyze 15 handcrafted physical descriptors across images from over 20 generative models. Based on cross-generator stability and real-fake discriminability, we propose a Feature Stability-Discriminability Validation Assessment (FSDVA) to select a compact set of reliable features. Five core features, including Laplacian variance, Sobel statistics, and residual-noise variance, are then used to construct structured textual descriptions encoding physical evidence for CLIP-based learning. We integrate these physics-enriched descriptions with image representations via a native physics-guided multimodal framework, adapting CLIP ViT-L 14 with LoRA. At inference, the model requires only the input image, with no external captions or manual prompts. On GenImage, our method achieves 99.0 percent accuracy on SDv1.4 and 96.7 percent on Wukong, with a mean of 97.23 percent across eight generative models versus 95.8 percent for C2pCLIP under the same setting. On UniversalFakeDetect, it maintains strong, stable generalization across diverse and unseen generation settings. These results show that carefully selected physical image statistics provide complementary forensic evidence to pretrained vision-language representations, enabling interpretable, more generator-agnostic AIGC detection.

cs.CV

新论文 · v1arXiv:2611.14897

Social Engineering Attack Detection in Corporate Communications

Hanzla Hamid, Pappu Jha, Nick Rahimi

原文摘要

Social Engineering attacks continue to pose a significant risk to the corporate world with a growing level of sophistication. It is difficult to distinguish between authentic and phishing communication via email, chat, and phone. They pose a risk of exposing trade secrets and confidential communications and can create a chain of attack from lower-level employees up to executives. Therefore, we study this growing threat using real-world datasets to build baseline machine-learning models. Our TF-IDF models classify emails as phishing or safe, achieving accuracy above 90%. We build on this by exploring whether psychological manipulation and persuasion indicators can be measured to play a significant role in detecting phishing. Instead of relying solely on surface-level lexical features, we derive interpretable lexicon-based indicators of urgency, trust, greed, and other persuasion cues from the combined email dataset. By evaluating these manipulation-oriented features on their own, we measure how much signal they carry (ROC-AUC of 0.74 on a held-out test split) and test whether they transfer to held-out email sources.

cs.LG · cs.CR

新论文 · v1arXiv:2611.14895

HeadIO: Body-Frame Heading Decomposition for Neural Inertial Odometry on Head-Mounted Devices

Taeyoung Yeon, Yiquan Li, Chenfeng Gao, Vasco Xu, Karan Ahuja

原文摘要

Inertial odometry (IO) using only Inertial Measurement Units (IMUs) enables camera-free head tracking in head-mounted devices such as VR headsets, AR glasses, and earbuds. Prior IO methods operate in a gravity-aligned world frame, which is not yaw-equivariant. Yaw augmentation improves robustness but does not guarantee equivariance; learned equivariant layers achieve it, but EqNIO's full pipeline costs nearly 3$\times$ the FLOPs of ours. While raw body-frame IMU inputs are inherently yaw-invariant, head tilt redistributes both gravity and motion signals across device axes, making the representation tilt-variant. We propose HeadIO, which combines a body-frame heading decomposition with a bidirectional Mamba backbone for head-mounted inertial odometry. Our decomposition achieves tilt invariance by separating gravity-aligned and horizontal components using only the tilt component of device orientation. We evaluate on four head-mounted datasets and find that HeadIO improves RTE-5s by 8.1% (0.260 m $\to$ 0.239 m) over world-frame methods with learned equivariant layers on Nymeria, the largest benchmark dataset, at nearly 3$\times$ lower FLOPs and 8$\times$ fewer parameters. HeadIO achieves state-of-the-art performance on our primary metric, RTE-5s, on all Aria-glasses datasets, which natively provide body-frame semantics for our decomposition method. We further evaluate the IMU-only deployment scenario on Nymeria, where HeadIO remains state-of-the-art. We show that our method relies mainly on tilt accuracy, which can be obtained from the gravity signal; for yaw, a single-coefficient gyroscope correction removes 11.6% of the yaw error and improves RTE-5s by 2.5%, and sparse external yaw corrections (for example, one every 30 s) can improve RTE-5s by 12.0%. Our decomposition is lightweight, composes with any backbone, and is suitable for real-time deployment on head-mounted devices.

cs.CV · cs.RO

新论文 · v1arXiv:2611.14894

Machine Learning Moment Closure for the Boltzmann Transport Equation: Enforcing Hyperbolicity

Bongseok Kim, Jiahao Zhang, Guang Lin

原文摘要

The Boltzmann transport equation describes particle transport across collisional regimes, but resolving its velocity dependence is expensive. Moment methods reduce this cost by evolving finitely many velocity moments, requiring a closure for unresolved higher-order moments. Data-driven closures can represent these moments accurately, yet without structural constraints they may produce complex characteristic speeds and unstable simulations. Learned Boltzmann closures with guaranteed hyperbolicity have so far been formulated in one spatial dimension; in multiple dimensions, hyperbolicity must hold in every direction simultaneously. We develop, to the best of our knowledge, the first data-driven closure for multidimensional Hermite moment systems of the linear Boltzmann equation that is hyperbolic by construction. The network learns a symmetric positive-definite symmetrizer shared by all spatial directions and restricted to a subspace that preserves the known lower-order transport equations; the unresolved rows follow from a symmetric completion. Every directional Jacobian thus has real eigenvalues and a complete set of eigenvectors for every network output and at any truncation order. The closure is trained only on spatial derivatives of unresolved moments from kinetic reference solutions, with no solver in the training loop, and evolved by a partially conservative discontinuous Galerkin method. In two-dimensional experiments in the transition and scattering-dominated regimes, a single learned third-order system with ten moments remains stable in all cases. Averaged over time, it is more accurate than the classical P7 and P15 truncations with 36 and 136 moments in every experiment, and its density error is about two orders of magnitude smaller than that of the P3 truncation with the same moments.

cs.LG · math.NA

新论文 · v1arXiv:2611.14883

Random feature policy iteration for inverse mean field games with complex geometry and high dimensions

Xiangjian Zhang, Shanyin Tong, Xiaofeng Xu

原文摘要

We propose a random feature policy iteration method for reconstructing the obstacle function in a mean-field game (MFG) from observations of its value function, leveraging the method's mesh-free nature and flexibility to handle complex geometries and high-dimensional problems. The method builds on a policy iteration framework for inverse MFGs, which decouples the coupled nonlinear forward-backward PDE system into a sequence of linear PDE and inverse problem solves. The fixed random feature representations preserve this linear structure, allowing the resulting subproblems to be solved by minimizing residuals at sampled collocation points through linear least-squares problems. The mesh-free nature of the method further extends the applicability of the policy iteration framework to inverse MFGs with complex geometry and in high dimensions. Another key advantage is its flexibility in using different spatial approximations for different variables: the obstacle function, value function, and population density can be represented in separate feature spaces, accommodating obstacles that are substantially less regular than the corresponding PDE solutions. Moreover, boundary conditions can be enforced through collocation on irregular domains without constructing boundary-fitted meshes. Numerical experiments involving smooth and discontinuous obstacles, a domain with holes, and higher-dimensional problems demonstrate the accuracy and flexibility of the proposed method.

math.NA · cs.GT · math.OC

新论文 · v1arXiv:2611.14881

MLIRBench - A Benchmark and Dataset for Compiler and Hardware-Aware Reasoning

Pranava Sai Maganti, Meghasyam Peddireddy, Muzakker Hossain, Kaining Gao, Farhan Ahmed, Ali Jannesari

原文摘要

In recent years, large language models (LLMs) have become increasingly popular in software engineering and have performed well on different programming tasks. However, it is still difficult to know whether these models truly understand program behavior or whether they mainly rely on patterns learned from their training data. This distinction is particularly important for intermediate representations (IRs), where operations, dataflow, and execution semantics are explicitly represented. In this paper, we introduce MLIRBench, a benchmark for evaluating how LLMs reason about MLIR programs. MLIRBench uses a multi-agent pipeline to generate program mutations, validate their behavior through execution, and construct reasoning tasks from torch and linalg program pairs. The dataset contains 1,768 validated pairs, including 888 linalg pairs and 880 torch pairs, labeled as EQUIV, DIVERGE, or ERROR. We evaluated nine models, including five open-weight and four proprietary models. Gemini 3.1 Pro achieved the highest hard-label accuracy of 92.65% across all 1,768 pairs, counting unsuccessful predictions as incorrect. Across its 1,768 scored predictions, it achieved an aggregate score of 74.18 and a judge-assigned result-behavior score of 5.04/10. These results show that strong semantic classification does not necessarily imply accurate prediction of detailed execution behavior, highlighting a gap in current LLM reasoning over compiler IRs. By exposing this gap through execution-validated program pairs, MLIRBench provides a reproducible foundation for studying semantic reasoning over compiler IRs and related tasks such as program repair and semantic classification.

cs.PL · cs.AI · cs.LG

新论文 · v1arXiv:2611.14880

FOE-Dreamer: Deployment-Efficient Learning of Cyber Defense Policies in Operational Networks

Yinuo Du, Christopher Kiekintveld

原文摘要

Autonomous cyber defense is widely studied with deep reinforcement learning, but most work trains policies inside simulators because learning requires many trial-and-error interactions. Simulator-based training carries a fidelity gap: trained policies face authentication delays, partial action failures, service dependencies, and user traffic patterns that the simulator did not represent, and degrade on transfer. Training directly in the network being defended removes the gap but makes every interaction slow and costly, so sample efficiency becomes the binding constraint. Model-based reinforcement learning has reduced sample requirements on games and physical robots by orders of magnitude by planning inside a learned world model, but it has not been applied to defenders trained in operational networks. We present FOE-Dreamer (Factored Opponent-Enhanced Dreamer), a model-based reinforcement learning framework that trains a defender online and directly in a network on cloud infrastructure, without a simulator stage. FOE-Dreamer separates three sources of variation in the latent state: a controllable component driven by defender actions, an exogenous component driven by benign user activity, and an opponent embedding inferred from defender-observable signals alone. Separating the components reduces the variance in policy gradients during planning in imagination. Against two scripted attacker profiles with user activity emulated by the GHOSTS framework on an 8-host OpenStack testbed, FOE-Dreamer trains within a 3-day budget on a single GPU and achieves about 2$\times$ better episode loss than Rainbow and IQN baselines under matched compute. Both the factoring and the opponent model contribute to the gain, and the learned latents are consistent with the intended separation.

cs.LG · cs.CR

版本更新 · v3arXiv:2208.04433

Peer Prediction for Learning Agents

Shi Feng, Fang-Yi Yu, Yiling Chen

原文摘要

Peer prediction refers to a collection of mechanisms for eliciting information from human agents when direct verification of the obtained information is unavailable. They are designed to have a game-theoretic equilibrium where everyone reveals their private information truthfully. This result holds under the assumption that agents are Bayesian and they each adopt a fixed strategy across all tasks. Human agents however are observed in many domains to exhibit learning behavior in sequential settings. In this paper, we explore the dynamics of sequential peer prediction mechanisms when participants are learning agents. We first show that the notion of no regret alone for the agents' learning algorithms cannot guarantee convergence to the truthful strategy. We then focus on a family of learning algorithms where strategy updates only depend on agents' cumulative rewards and prove that agents' strategies in the popular Correlated Agreement (CA) mechanism converge to truthful reporting when they use algorithms from this family satisfying an additional condition on full exploitation. This family of algorithms is not necessarily no-regret, but includes fixed-parameter versions of familiar online learning algorithms (e.g multiplicative weight update and Follow the Perturbed Leader) as special cases. Simulation of several algorithms in this family as well as the $ε$-greedy algorithm, which is outside of this family, illustrates their finite-horizon behavior in the CA mechanism.

cs.GT

新论文 · v1arXiv:2611.14879

Typify: A Tool for Usage-driven Type Inference in Python

Hassan Aman, Ali Aman, Muhammad Asaduzzaman, Shaowei Wang, Jessica Chen

原文摘要

Python's dynamic type system, while expressive and flexible, creates significant challenges for static analysis tools in unannotated or partially annotated codebases. Existing approaches either require pre-existing type annotations, or depend on deep learning models that demand large training corpora and significant computational resources. We present Typify, a lightweight, usage-driven static type inference engine that infers precise type information across entire Python projects without annotations or training data. Typify integrates symbolic execution, fixpoint analysis, and context-matching retrieval to propagate types across modules, functions, and recursive call structures. The tool is available as both a command-line interface (CLI) for batch inference, evaluation and downstream integration with other tools, and a Visual Studio Code (VS Code) extension for interactive type assistance. Evaluation on the ManyTypes4Py and Typilus datasets shows that Typify outperforms all static baselines and closely matches state-of-the-art hybrid deep learning approaches, while running approximately 10x faster.

cs.SE

新论文 · v1arXiv:2611.14878

Hear What You Eat: In-Ear Passive Acoustic Sensing for Multi-task Dietary Monitoring

Feiyu Han, Mingtian Zhu, Dawei Yan, Weiwei Jiang, Yuanhao Feng, Yanfei Zhang, Panlong Yang

原文摘要

The increasing obesity health concerns are driving the advancement of continuous dietary monitoring. Yet, existing single-sensor solutions still face challenges of coarse-grained sensing resolution, while multi-sensor fusion strategies encounter significant engineering complexity or hardware requirements. In our work, we present a single modality-based multi-dimensional dietary monitoring and logging solution, named EARDIET, which leverages inward-facing microphones on earables to capture in-ear chewing sounds for fine-grained diet analysis. With the texture audio profiles derivation, the pipeline consisting of signal processing and lightweight deep learning, is carefully designed to achieve eating episode detection, food texture sensing, and food type recognition simultaneously. Comprehensive experiments involving 32 participants with diverse BMI profiles are conducted to validate the effectiveness of multi-dimensional dietary monitoring. Compared with the state-of-the-art solutions, EARDIET can derive multi-dimensional dietary information with only a single modality, outperforming by about 10% in terms of eating episode detection. Furthermore, through real-world clinical validation, our solution can achieve masticatory disorder identification with an averaged F1-score of 85.97%, demonstrating potential for healthcare in the future.

cs.HC

新论文 · v1arXiv:2611.14877

Message-Passing-Based Bayesian Joint Channel Estimation and Data Detection for Pilot-Guard-Free AFDM

Yuan Zhengdao, Guo Qinghua, Jin Ming, Liu Zilong, Xiao Pei

原文摘要

Existing channel estimation methods for affine frequency division multiplexing (AFDM) over doubly dispersive channels commonly isolate pilots and data with pilot guard symbols, resulting in substantial transmission overhead, while fractional Doppler introduces off-grid mismatch and complicates accurate channel estimation. This paper develops a pilot-guard-free AFDM transmission and reception scheme with a Bayesian receiver for joint channel estimation and data symbol detection. Uniformly interleaved pilots are embedded among data symbols without dedicated guard symbols, and the resulting pilot-data coupling is explicitly incorporated into the joint inference problem rather than suppressed through guard-based isolation.

cs.IT

版本更新 · v2arXiv:2409.02810

A hybrid FEM-PINN method for time-dependent partial differential equations

Xiaodong Feng, Haojiong Shangguan, Tao Tang, Xiaoliang Wan

原文摘要

In this work, we present a hybrid numerical method for solving evolution partial differential equations (PDEs) by merging the time finite element method with deep neural networks. In contrast to the conventional deep learning-based formulation where the neural network is defined on a spatiotemporal domain, our methodology utilizes finite element basis functions in the time direction where the space-dependent coefficients are defined as the output of a neural network. We then apply the Galerkin or collocation projection in the time direction to obtain a system of PDEs for the space-dependent coefficients which is approximated in the framework of PINN. The advantages of such a hybrid formulation are twofold: statistical errors are avoided for the integral in the time direction, and the neural network's output can be regarded as a set of reduced spatial basis functions. To further alleviate the difficulties from high dimensionality and low regularity, we have developed an adaptive sampling strategy that refines the training set. More specifically, we use an explicit density model to approximate the distribution induced by the PDE residual and then augment the training set with new time-dependent random samples given by the learned density model. The effectiveness and efficiency of our proposed method have been demonstrated through a series of numerical experiments.

math.NA · cs.AI