AI Research & Papers
整理大Models、智能体、多模态、机器学习与生成式 AI 的Research、基准和研究进展。
Category articles2148
当前页49 / 54
UpdatesPermanent archive
Category articles
按发布Time从新到旧 · 每页 40 stories
ResearchOrdinary
Does Your Agent's Memory Survive a Model Upgrade? A Controlled Study of Memory Portability
Model upgrades are routine; memory migrations are not. An agent can keep the same memory store and still forget: a new model may interpret old notes differently, mixed embedding versions may break retrieval, and repair may fail without the…
Source: arXiv
ResearchOrdinary
Variational Continuation for Double Pendulum Periodic Orbits
We present a Hessian-based approach to numerically continue periodic orbits in dynamical systems. A loop (periodic orbit candidate) is parametrized as a Fourier series; a loss function is defined based on the deviation of the loop from the…
Source: arXiv
ResearchOrdinary
The History Is the Detector: Executing CVE Patch History, End-to-End
Public vulnerability databases collect rich information about known software flaws, including their weakness types, affected components, and related patches. Fixing commits provide the exact code changes that removed these flaws. While the…
Source: arXiv
ResearchOrdinary
Lightweight Vision Transformer Compression for On-Device Plant Disease Detection in Resource-Constrained Agricultural Field Conditions
Chilli (Capsicum annuum) is one of India's most economically significant crops, yet its productivity is persistently threatened by diseases that are difficult to identify without expert intervention. While Vision Transformers (ViTs) have a…
Source: arXiv
ResearchOrdinary
RoboSPA: Can VLA Models Go Beyond Simple Scenes and Short-Horizon Tasks?
Vision-Language-Action (VLA) models have shown promising progress in language-conditioned robotic manipulation. However, existing datasets and benchmarks mainly evaluate task completion under predefined settings, offering limited insight i…
Source: arXiv
ResearchOrdinary
Adaptive Gated Deepfake Detection for Low-Resolution and Resource-Constrained Environments
Deepfake detection models often rely on high-quality inputs, fixed inference paths, and computationally expensive architectures, limiting their use in low-resolution and resource-constrained settings. This paper proposes AdaGate-DF, an ada…
Source: arXiv
ResearchOrdinary
Optimal Rates for Agentic Networked Information Aggregation
Building on the pioneering paper of Kearns, Roth, and Ryu (SODA'26), we study information aggregation in a networked learning model. The model captures a central pattern in agentic AI: each agent sees only part of the data and passes on on…
Source: arXiv
ResearchOrdinary
Large Language Models for HVAC Operations in Building Energy Systems: A Critical Review of Methods, Applications, and Deployment Readiness
Building automation systems generate rich sensor data yet remain insight-poor because heterogeneous point naming, missing metadata, and fragmented documentation obstruct their operational use. This systematic review analyses and codes 66 p…
Source: arXiv
ResearchOrdinary
How Does mHC Use Its Residual Streams? Selective Routing and Near-Identity Mixing
Hyper-Connections and their manifold-constrained variant mHC widen a residual pathway from one stream to n, yet how trained models use this capacity remains unclear: how broadly blocks read and write, how strongly the residual pathway mixe…
Source: arXiv · DeepSeek
ResearchOrdinary
Online Change-point Detection for Cooperative Multi-Agent Reinforcement Learning
Cooperative multi-agent reinforcement learning (MARL) systems rely on past experience for learning coordinated behaviour, but this experience may become unreliable if the environment or task objective changes during training. In such cases…
Source: arXiv
ResearchOrdinary
LexFlip: A Dissociation Diagnostic for Legal Meaning Preservation Metrics
Does a simplified legal clause still say what the original said? The checks in current use cannot establish that it does: requiring an identical pair to score highest and an unrelated pair lowest moves lexical overlap and legal force toget…
Source: arXiv
ResearchOrdinary
RISE: Recursive Improvement via Self-Extrapolating Policy Distillation
On-policy distillation (OPD) provides dense, per-token supervision for language model post-training, but its effectiveness is bottlenecked by teacher quality: external teachers suffer from distribution mismatch, while self-distillation wit…
Source: arXiv
ResearchOrdinary
Learning from VAE Errors to support ECG-based Differential Diagnosis of Myocardial Scar
Late Gadolinium Enhancement (LGE) on cardiac magnetic resonance is a key marker of myocardial scar, but its limited accessibility motivates routine ECG-based screening. We evaluated whether $β$-variational autoencoder (VAE)-derived ECG rep…
Source: arXiv
ResearchOrdinary
Beyond Aggregate Scores: Behavioral Correctness Assumptions for Assessing Reference-Based Automatic Evaluation Methods
Automated reference-based evaluation methods play a critical role in assessing natural language generation systems. Existing meta-evaluation primarily measures agreement with human judgments or benchmark labels, providing limited insight i…
Source: arXiv
ResearchOrdinary
GUT: Quantifying and Optimizing the Reasoning Uncertainty of LLMs via Graph Complexity
Recent years have witnessed great advances in the reasoning ability of Large Language Models (LLMs). However, the reasoning processes of LLMs often exhibit uncertainty, where LLMs often produce a proliferation of divergent branches at each…
Source: arXiv
ResearchOrdinary
Testing Interchangeability in LLM Agent Teams
Production multi-agent systems replace agents constantly, on the assumption that an agent filling a role is interchangeable with any other agent that can do the job. We test that assumption. Eight teams per setting are formed independently…
Source: arXiv
ResearchOrdinary
Don't Drop Dropout: Optimizing Layer Sparsity for Efficient LLM Training and Inference
Layer dropout (a.k.a. stochastic depth) has been shown to enable faster training, higher accuracy, and robustness to zero-shot layer pruning in both language and vision transformers. However, as models and datasets have scaled, dropout - p…
Source: arXiv
ResearchOrdinary
How to Speculate about Uncertainty in Agentic Coding? A Draft-Model Gate Method
LLM agents deployed for software engineering fail expensively: they act confidently wrong, and bad actions are recognized only after costly execution and retry. We present Speculative Uncertainty (SU), a method that recovers a predictive f…
Source: arXiv · Qwen / Claude
ResearchOrdinary
AI for Computational Design Science: A Responsible Human-AI Framework and Case Study on Short-Form Video Safety Surveillance
Artificial intelligence (AI) is transforming not only what information systems researchers design, but also how design research is conducted. Yet existing literature offers limited guidance for computational design science (CDS) when AI ac…
Source: arXiv
ResearchOrdinary
CONTINUITY: Security-Context Contracts for Composable LLM Agent Controls
LLM agent systems increasingly combine provenance tracking, authorization, policy enforcement, protocol adapters, and execution controls. However, individually correct security mechanisms do not necessarily compose into an end-to-end secur…
Source: arXiv
ResearchOrdinary
Shallow neural network approximation in mixed Sobolev spaces
We investigate the best $L_2$ approximation of mixed Sobolev spaces by shallow neural networks with $n$ neurons and general activation functions. We first establish an activation-independent Fourier-block principle: if an activation has un…
Source: arXiv
ResearchOrdinary
Self-Supervised Lexical Representation Learning for Fast, Large-Scale Phylogenetic Inference
Computational phylogenetics has become an essential tool in historical linguistics, yet its application at a global scale remains constrained by two factors: the labor-intensive manual annotation of cognacy judgments required for character…
Source: arXiv
ResearchOrdinary
Trace2Tower: Transition-Aware EigenTrace Induction of Multi-Level Skills for LLM Agents
Large language model agents increasingly rely on execution traces to master complex interactive tasks. However, current paradigms are bottlenecked by shallow trajectory retrieval and flat skill summarization, fundamentally ignoring the tem…
Source: arXiv
ResearchOrdinary
Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization
Large language models (LLMs) are increasingly used to formulate optimization models from natural-language problem descriptions, yet realistic operations research (OR) requests are often incomplete: missing objectives, constraints, or busin…
Source: arXiv
ResearchOrdinary
Compile by Training: Turning Natural-Language Specifications into Local Neural Functions
Many recurring text functions are easy to describe but difficult to implement with rules, while calling a large remote model for every input introduces repeated cost, latency, and dependency on a provider. We present compile by training, w…
Source: arXiv
ResearchOrdinary
Clean Engineering, Unstable Measurement: A Preregistered Reliability Failure of Black-Box LLM Observers on Shared Endpoints
Language-model judges now gate training data, score generations, and drive leaderboards. The judge is then a measurement instrument, resting on one rarely stated assumption: the same request, sent to the same model name, reads the same tom…
Source: arXiv
ResearchOrdinary
ESPO: Error-Structured Prompt Optimization via Diagnose, Diversify, and Stabilize
Evolutionary prompt optimizers such as GEPA suffer from prompt bloat: each iteration appends rules and caveats, producing prompts up to 3$\times$ longer yet no more accurate. We trace this to three deficiencies - incomplete error observati…
Source: arXiv · Qwen / Claude / Mistral
ResearchOrdinary
Legibility is Not Interpretability: Comparing Judged and Actual Importance in Chain-Of-Thought Reasoning
Reasoning traces from chain-of-thought models appear to offer a legible window into how a model arrives at its answer. A growing body of work treats them as such, using LLM judges to diagnose errors, evaluate faithfulness, and provide step…
Source: arXiv
ResearchOrdinary
One Editor, Many Edits: A Unified Training-Free Framework for Diverse Video Editing
Video editing spans diverse editing paradigms, yet achieving high-quality instruction-guided and subject-guided editing within a single unified framework remains challenging. We introduce EditVid, a training-free framework combining sparse…
Source: arXiv
ResearchOrdinary
Robust PAC Learning of Concurrent Stochastic Games
We introduce the first Probably Approximately Correct (PAC) learning framework for general-sum concurrent stochastic games (CSGs) with transition uncertainty, while addressing the challenge of Nash equilibrium (NE) existence. Our algorithm…
Source: arXiv
ResearchOrdinary
Seeing Before Synthesizing: VLM-Guided Transition Event Discovery for Weakly-Supervised Dense Video Captioning
Weakly-Supervised Dense Video Captioning aims to localize and describe multiple events in untrimmed videos given only an ordered set of event-level captions per video. Recent work synthesizes auxiliary transition captions via LLM to provid…
Source: arXiv
ResearchOrdinary
Knowledge Acquisition During Pre-training? Large Language Models Learn Better With Auxiliary Views
Gaps remain in our understanding of how large language models (LLMs) acquire knowledge during pre-training. We posit that auxiliary views, reformulations of knowledge, are causally helpful for learning. We design controlled experiments to …
Source: arXiv
ResearchOrdinary
A Computationally Feasible Framework for Causal Probabilistic Explanation
Explaining why a specific outcome occurred, and which inputs deserve the blame or credit, is central to philosophical, scientific, and policy analysis. Existing tools split into two camps. The theory of actual causality (AC) gives principl…
Source: arXiv
ResearchOrdinary
Last Translation Benchmark
For scientific progress, we need benchmarks that test the limits of state-of-the-art models, and evaluation methods that inform us about failure cases. As models get stronger, standard benchmarks for machine translation are approaching sat…
Source: arXiv
ResearchOrdinary
Rethinking On-Policy Distillation of Large Language Models II: One Training Example
On-policy distillation (OPD) combines student-generated rollouts with dense token-level supervision from a teacher. Existing work has mainly studied its algorithmic behavior, leaving the role of training data unclear. We examine this role …
Source: arXiv
ResearchOrdinary
A Case Study on Emergent Cheating and Whistleblowing in Autonomous Research Swarms
Multi-agent AI science ecosystems rely on agents possessing tools that allow them to communicate, coordinate, and build on each other's work. Yet this shared infrastructure can also introduce vulnerabilities by creating a substrate for the…
Source: arXiv
ResearchOrdinary
Para-Pipe: Exploiting Hierarchical Operator Parallelism of ML Computational Graphs on SoCs
As edge-based deep learning applications become more complex, optimizing performance on heterogeneous System-on-Chips (SoCs) presents unique challenges. Traditional pipelining techniques distributing the computation across different on-chi…
Source: arXiv
ResearchOrdinary
SWE-Gate: Passing Functional Tests Is Not Enough for Software Engineering Agents
Repository-level software engineering benchmarks have significantly advanced the evaluation of coding agents, but existing benchmarks primarily measure whether generated patches pass functional tests and overlook review-derived acceptance …
Source: arXiv
ResearchOrdinary
From Deceptive Outputs to Deceptive Mechanisms: A Causal Framework for Language-Model Deception Research
Research and news coverage of language-model deception increasingly attributes human-like mental-state concepts to language models. Such claims can blur the distinction between behavior that looks deceptive and a mechanism that is actually…
Source: arXiv
ResearchOrdinary
Parameterised graph theory for tensor networks: entanglement rerouting, structural simplification, and agnostic tomography
Parameterised graph theory studies how the complexity of graph-theoretic problems depends on structural parameters of the input graph. This perspective has proved useful in analysing tensor-network simulation (Markov and Shi, 2008). Its im…
Source: arXiv