AI Research & Papers
整理大Models、智能体、多模态、机器学习与生成式 AI 的Research、基准和研究进展。
Category articles2148
当前页24 / 54
UpdatesPermanent archive
Category articles
按发布Time从新到旧 · 每页 40 stories
ResearchOrdinary
Can Language Models Play the Wikipedia Game?
Language models increasingly support or automate information retrieval from document collections too large to index. This task is difficult when it requires specialist linguistic or scientific knowledge. We used the Wikipedia Game to test …
Source: arXiv · GPT / DeepSeek
ResearchOrdinary
Hide and Seek: HIDE Concepts to SEEK explanations for black box models
Interpreting machine learning model predictions is a central challenge, particularly for black-box vision models. Concept-based attribution methods interpret models using human-understandable concepts. Existing concept-based methods can on…
Source: arXiv
ResearchOrdinary
Constructive Bounds for the Topological Expressivity of Neural Networks
The expressivity of a neural network $Φ$ describes the class of functions that a network can express. The term topological expressivity refers to a family of measures particularly suited to understand binary classification and is often for…
Source: arXiv
ResearchOrdinary
AI Models Can Provably Hide Arbitrary Capabilities
Capability evaluations aim to surface dangerous model behaviors before deployment, but their reliability depends on the assumption that hidden capabilities can be elicited. We show this assumption does not hold under adversarial conditions…
Source: arXiv
ResearchOrdinary
KL Before and After Mixing: A Round-Complexity Separation in Parallel Sampling
A parallel sampler can choose at random which coordinates to generate together. For a target $p$ and the output law $q_U$ of a schedule $U$ drawn afresh for each output, we compare the schedule-averaged divergence $\mathbb{E}_U D_{\mathrm{…
Source: arXiv
ResearchOrdinary
Goal-Oriented Bundle Management and Flow Control for Deep-Space Communications via Reinforcement Learning
Deep-space communications operate under intermittent connectivity, long propagation delays, and relay storage constraints. In such networks, the Bundle Protocol enables store-carry-forward communication, requiring relay nodes to manage lim…
Source: arXiv
ResearchOrdinary
DyssomniaNN: Multi-Scale Spiking Neural Modeling of Human Sleep Disorders and Perceived Restedness
Clinical sleep medicine repeatedly documents profound divergences between objective sleep duration and subjective daytime impairment, notably exemplified by sleep state misperception in paradoxical insomnia and boundary instability in narc…
Source: arXiv
ResearchOrdinary
Designing Protein Structures from Natural Language
A central challenge in de novo protein design is generating proteins with desired structural and functional properties. Existing design models typically require a dedicated input representation for each property, limiting the design object…
Source: arXiv
ResearchOrdinary
RSI-Anything: Unlocking Recursive Self-Improvement with World Models
Recursive self-improvement (RSI) aims to transform interaction experience into persistent improvements, yet external feedback is costly and world-model predictions may become unreliable as policies evolve. We introduce RSI-Anything, a doma…
Source: arXiv
ResearchOrdinary
When VLMs Destroy What They Know: Spatial Representations Fall Below Lexical Priors
Vision-Language Models (VLMs) increasingly analyze and reason about images, yet it remains unclear whether their internal representations faithfully encode the structured relations required for such reasoning. We introduce EICS (Evaluation…
Source: arXiv
ResearchOrdinary
Revisiting Tabular Deep Regression: Objectives and the Limits of Global Early Stopping
While deep learning models for tabular data have recently received significant research attention, the choice of objective functions for regression tasks remains an understudied degree of freedom. Several lines of research offer alternativ…
Source: arXiv
ResearchOrdinary
Hitting-Time Bounds for Asynchronous Q-Learning
We study the last iterate of standard asynchronous Q-learning from a single trajectory of a finite Markov decision process. The trajectory follows a fixed behavior policy whose state--action chain is irreducible and may be periodic. For di…
Source: arXiv
ResearchOrdinary
Structural Automata for Neural Semantic Parsing
Neural semantic parsers generate meaning representations token by token, yet well-formedness depends on references, scope, and graph relations that unfold during generation. Constrained decoding prevents locally invalid tokens but does not…
Source: arXiv
ResearchOrdinary
Task Context Shapes Component Roles in Language Models
Large language models reuse the same attention heads across tasks, but identifying these shared heads does not explain what they do differently in each task. A natural source of inspiration is task-dependent interactions among shared brain…
Source: arXiv · Qwen
ResearchOrdinary
RATED: Reliability-Aware AI Agent Tool Retrieval via Execution Dynamics
As AI agents increasingly rely on external tools, accurate retrieval is essential for reliable behavior. Existing methods optimize semantic relevance but largely ignore tool availability during execution. To address this gap, we propose RA…
Source: arXiv
ResearchOrdinary
X-AgentRed: Red-Teaming Personal Agents in Evolving Multi-Service Ecosystems
Personal agents increasingly connect to services across the web and applications by using tools. As the effects of their actions accumulate and interact across services, unintended or harmful outcomes can arise when agents fulfill benign u…
Source: arXiv
ResearchOrdinary
Prediction Is Not a Sufficient Memory State
A memory that reproduces every current prediction may still have forgotten how to learn from the next observation. We characterize this distinction for exact cumulative learning and attention. For smooth convex residual losses with unrestr…
Source: arXiv
ResearchOrdinary
Partially Informed Stochastic Optimization via Zeroth-Order Residual Tracking
Many optimization problems provide direct access to only part of the gradient, while the remaining component must be inferred from function evaluations. This structure arises in performative prediction, performative reinforcement learning,…
Source: arXiv
ResearchOrdinary
Finite-Sample Guarantees for Fully Discrete Conditional Diffusion Models
We establish finite-sample guarantees for conditional diffusion models learned from data and implemented with finitely many denoising steps. Our approach aligns the score-training objective with the sampling grid, allowing statistical esti…
Source: arXiv
ResearchOrdinary
Inference-Time Steering Across Scaffolds and Epitopes for Sample-Efficient De Novo Nanobody Design
Generative molecular design typically relies on over-generation and post-hoc filtering. Inference-time steering methods like Feynman-Kac (FK) steering improve efficiency by biasing trajectories toward high-reward candidates, yet they optim…
Source: arXiv
ResearchOrdinary
RESCUE: Is This Alarm Worth Acting On? Counterfactual Evaluation of VLA Runtime Monitors
Runtime failure monitors for robot policies are typically evaluated by how accurately they distinguish failed from successful executions. Yet an accurate alarm may arrive too late for recovery, while an unnecessary intervention may disrupt…
Source: arXiv
ResearchOrdinary
Retrieval-Augmented Multimodal Language Model with Heterogeneous Evidence Integration for Clinical Prognosis
Clinical prognosis requires integrating structured measurements, physiological waveforms, longitudinal history, and population context. We introduce PRISM (Population-Retrieved Inference for Structured Multimodal Prognosis), a multimodal l…
Source: arXiv
ResearchOrdinary
FedPCD: Priority-Constrained Federated Aggregation
Federated learning (FL) seeks to optimize a shared global model from decentralized client data. While effective for average performance, this process can produce unfair performance across clients, particularly under statistically heterogen…
Source: arXiv
ResearchOrdinary
Beyond Temporal Proximity: Explanatory World Models for Credit Assignment in Reinforcement Learning
Generative Recommenders increasingly use Reinforcement Learning (RL) to optimize outcomes that may appear hundreds or thousands of interactions after a decision. Standard RL propagates reward according to temporal proximity rather than exp…
Source: arXiv
ResearchOrdinary
Humanize MLE Agents: Multi-Agent Session Alternation Beyond Single-Agent Limits
Existing LLM-based agent approaches for long-horizon machine learning engineering (MLE) often use context engineering, implemented through custom harnesses that manage tools, skills, and accumulated experience. However, we find that as sin…
Source: arXiv
ResearchOrdinary
Proactive Agentic Orchestration
Agentic orchestration delegates tasks to sub-agents with independent contexts, providing a key path to extending the effective execution horizon of large language model agents. However, existing orchestration methods face two limitations: …
Source: arXiv
ResearchOrdinary
Branching On-Policy Distillation
On-policy distillation (OPD) provides teacher supervision on student-generated trajectories, but a single trajectory realizes only one continuation at each decision, limiting supervision coverage under a finite sampling budget. We propose …
Source: arXiv
ResearchOrdinary
A Scalable Learned Iterative Solver for Nonlinear MPC via Temporal Decomposition
Nonlinear model predictive control (NMPC) can be applied to large nonlinear systems with complex objectives while enforcing constraints, but the cost of solving the underlying optimization problems limits real-time application for systems …
Source: arXiv
ResearchOrdinary
A Local Agentic AI Framework to Generate Edge Case Scenarios for Safety Assurance
Generating edge case scenarios is crucial for training, testing and safety assuring autonomous systems. This identifies hazardous failures to increase system reliability and robustness, ensures the system can still function safely on the b…
Source: arXiv
ResearchOrdinary
Harmonic analysis and circuit approximation of Sobolev functions on quantum input spaces
We derive approximation rates for Sobolev functions defined on the complex unit sphere and complex projective space, representing quantum states, and on the special and projective unitary groups, representing quantum unitary operations. By…
Source: arXiv
ResearchOrdinary
A Better Metric Will Not Save You: What You Compare Beats How You Compare It
Representational similarity measures (RSA, CKA, Procrustes) are chosen for the transformations they treat as irrelevant, and all of them take the set of conditions as given. That set is fixed by two decisions, which inputs are admitted and…
Source: arXiv
ResearchOrdinary
When MLLMs miss what humans read: diagnosing and learning to read squint text
Multimodal LLMs can fail to read text embedded in an image's coarse structure (text a human recovers by squinting) and report that no text is present. We name this class Squint Text and study it as a recognition deficiency, motivated by ca…
Source: arXiv
ResearchOrdinary
SqueezeBench: Saturation-Resilient Evaluation of Mathematical Capability
AI systems are making rapid progress in mathematics, but this progress is hard to measure. Benchmarks of solved problems saturate, and in benchmarks of open problems each problem can be resolved for the first time only once. We present Squ…
Source: arXiv
ResearchOrdinary
Towards Enriching Design-Time Models with Evidence from Simulation and Operational Activities
Cyber-Physical Systems are developed through multiple model based activities, comprising several stages of development. As the development progresses through simulation, experimentation, and operation, observations of system execution may …
Source: arXiv
ResearchOrdinary
Agentic Large Language Models
Large language models (LLMs) have taken the world by storm. Their ability to communicate with us in our own language, and to reason about our world, has made them a favorite tool for writing, answering questions, and much more. Their answe…
Source: arXiv
ResearchOrdinary
Oído: Open-Vocabulary Speech Recognition on a $5 Microcontroller without a Neural Accelerator
Speech recognition on low-cost microcontrollers is, in practice, limited to keyword spotting or a fixed list of commands. We present Oído, an inference engine that runs open-vocabulary English speech recognition entirely on an ESP32-S3 (24…
Source: arXiv
ResearchOrdinary
Learning by Compression: Risk Estimates Attain the Law-of-Large-Numbers Rate
Compression schemes provide a general framework for deriving data-dependent risk bounds for learning algorithms. For learning rules based on preferent compression, existing results upper-bound the risk in terms of a sample-dependent comple…
Source: arXiv
ResearchOrdinary
Revisiting Accent Classification with DistilHuBERT: Speaker-Disjoint Evaluation and Cross-Corpus Generalization
Recent accent classification systems can achieve high accuracy in standard in-corpus evaluations. However, when speakers overlap between the training and test sets, such results may overestimate model robustness compared with real-world de…
Source: arXiv
ResearchOrdinary
Collective Autonomous Vehicle Routing Needs Social Awareness for Coexistence with Human Drivers
Collective Autonomous Vehicle (AV) route choices in real-world traffic networks can create externalities for Human-Driven Vehicles (HDVs), as routes that benefit AVs may increase travel times for other road users. To address this, we intro…
Source: arXiv
ResearchOrdinary
Rollout-Time Intervention: Unlocking Agentic Reinforcement Learning Beyond Policy Limits
Reinforcement learning (RL) has emerged as a key paradigm for improving large language model (LLM) agents, enabling stronger reasoning, planning, and tool-use in interactive environments. However, existing agent RL methods remain fundament…
Source: arXiv