AI Research & Papers
整理大Models、智能体、多模态、机器学习与生成式 AI 的Research、基准和研究进展。
Category articles2148
当前页12 / 54
UpdatesPermanent archive
Category articles
按发布Time从新到旧 · 每页 40 stories
ResearchOrdinary
Latent Reasoning in Continuous Space for Unified Multimodal Models
Unified Multimodal Models (UMMs) achieve remarkable success on diverse multimodal understanding and generation tasks, yet they still struggle to effectively leverage language-based chain-of-thought reasoning for image generation. As a resu…
Source: arXiv
ResearchOrdinary
Flide: Accelerating Decision Inference with Exact State Forking
Decision models such as Jev have emerged as a highly promising paradigm for LLM agent systems, providing lightweight and reliable categorical reasoning for rapid System One execution. However, existing generation-oriented inference engines…
Source: arXiv
ResearchOrdinary
Latent Sparse Attention: Towards Subquadratic Ultra-Long Context Attention
Agentic workflows are increasingly shifting towards long-horizon tasks, such as open-ended scientific work, where models benefit from long context windows. However, at ultra-long context (above 1M tokens), full attention is prohibitively e…
Source: arXiv · Qwen / GLM
ResearchOrdinary
Hierarchical World Models with Implicit Dynamics
Planning with world models enables test-time adaptation for embodied agents, offering superior generalization over direct policy learning. However, long-horizon tasks remain hindered by cumulative errors and search complexity. Existing hie…
Source: arXiv
ResearchOrdinary
RoboArchitect: Automating the Design of Robotic Agents with Persistent Memory
Recent work shows that a frozen robot policy performs far better inside an agent harness, where control code decides when to query the policy, consult vision tools, or command the arm directly. Yet today these harnesses are built by hand a…
Source: arXiv
ResearchOrdinary
Counting on Dummies: Privacy Amplification with Observable Counts and Truncated Batches
In many practical deployments of Differentially Private Stochastic Gradient Descent (DP-SGD), the server processes data in batches. Randomly sampling these batches allows for better privacy bounds via privacy amplification results. Most sa…
Source: arXiv
ResearchOrdinary
A Better Critic Matters for Distribution Matching Distillation
Distribution Matching Distillation (DMD) trains a few-step student using the difference between a teacher's score and an online critic's estimate of the student distribution's score. We investigate what the critic needs, in capacity and in…
Source: arXiv
ResearchOrdinary
Instance-dependent sequential limits as an exact information ledger
Instance-dependent limits for bandit regret, sequential tests, best-arm identification and Markov decision processes are proved by one chain. It runs from a divergence decomposition through data processing to a statistic, a testing step th…
Source: arXiv
ResearchOrdinary
DecisionRank: On-Policy Distillation for Decision-Model Rerankers
Decision models target structured tasks by directly predicting choices or scores, avoiding autoregressive decoding latency. However, transferring a generative LLM's ranking knowledge to a decision model remains challenging: the teacher exp…
Source: arXiv
ResearchOrdinary
Physiological Trajectories and Observation Patterns in ICU Mortality Prediction: Transportability Under Changing Measurement Conditions
Objective: To distinguish the transferable predictive value of physiological trajectories from that of observation patterns in ICU mortality prediction, and to assess whether measurement timing affects performance independently of observat…
Source: arXiv
ResearchOrdinary
Gradient Descent on Two ReLU Neurons: Global Landscape and Bifurcation Dynamics
Understanding how gradient descent learns features remains a central challenge in neural network theory. We study this question in a minimal multi-index setting that already exhibits rich multi-phase gradient dynamics: a well-specified two…
Source: arXiv
ResearchOrdinary
Fast Privacy Loss Accounting for Random Allocation via Multiscale FFT
In the random allocation sampling scheme each user's data is used in $k$ steps chosen randomly and uniformly from a sequence of $t$ steps. This scheme is known to improve on Poisson sampling in private optimization and in communication-eff…
Source: arXiv
ResearchOrdinary
ACCT: Asymmetric Cross-LLM Context Transfer
In real-world deployments, large language model (LLM) systems are increasingly evolving from single-model invocation toward heterogeneous deployments in which different models are dynamically invoked for inference. When the same context is…
Source: arXiv
ResearchOrdinary
Subquadratic Attention with a Hierarchical Tree-Structured Indexer
The quadratic scaling of attention is a fundamental bottleneck limiting the long-context capabilities of large language models (LLMs). A variety of approaches have attempted to circumvent this, but they either fail to match attention's exp…
Source: arXiv
ResearchOrdinary
SATFRONT: Detecting Atmospheric Fronts with Satellite Data using Machine Learning
Atmospheric fronts are associated with much of the high-impact weather in the mid-latitudes, yet their identification and classification remain largely manual and subjective. Existing deep learning approaches rely primarily on gridded rean…
Source: arXiv
ResearchOrdinary
Regret-Optimal Wasserstein-Robust Linear Regression
Distributionally robust optimization (DRO) minimizes worst-case risk under distributional uncertainty, but its decisions can be suboptimal in terms of their excess risk, or regret. We study this gap for multivariate least-squares regressio…
Source: arXiv
ResearchOrdinary
Hard Constraint Projection in a Physics Informed Neural Network (Burgers)
Physics informed machine learning provides a framework to study and simulate fluid dynamics, potentially at a fraction of the computational cost of traditional numerical methods, with the goal of improving the explainability, accuracy and …
Source: arXiv
ResearchOrdinary
Hyperbolic Inverse Reinforcement Learning
Inverse reinforcement learning (IRL) seeks to infer the reward function underlying observed behavior, but its predictive accuracy and interpretability depend on how that reward is computed from the underlying features. While prior IRL rewa…
Source: arXiv
ResearchOrdinary
Towards Understanding the Impact of Plasticity Loss on Reinforcement Learning in Stochastic Environments
Deep reinforcement learning (RL) is a powerful framework for sequential decision-making. Despite many high-profile successes in recent years, deep RL is known to be brittle. An emerging line of research attributes this brittleness to a los…
Source: arXiv
ResearchOrdinary
CausalWAM: Learning the Causes of Actions in World Action Models
World action models (WAMs) learn latent variables from observations and use these to both predict the evolution of the scene and to generate actions. The prediction has to be of the whole scene, whereas only a portion of the scene causes a…
Source: arXiv
ResearchOrdinary
From 1D Benchmarks to Complex 3D Geometries: Can Agents Reliably Specify Problems for Automated PDE Simulation?
Turning an engineering request into a simulation requires consistent geometry, physics, boundary conditions, and numerical settings. Recent agent-assisted systems automate simulation setup, but successful execution alone does not establish…
Source: arXiv
ResearchOrdinary
Rome Wasn't Built in One Turn: Replay-Grounded Reward Signals for Long-Horizon Freeciv Agents
Training language-model agents to play long-horizon strategy games is hard because deterministic feedback is sparse and often arrives only at the end of a game. In-game scores can offer dense signals, but they do not reliably predict futur…
Source: arXiv
ResearchOrdinary
MEMIG: Self-evolving Memory Construction for Antibody Optimization
Memory has become central to self-evolving LLM agents, which store and retrieve experience from past rollouts to guide future decisions. Existing systems represent this experience as free-form natural language and maintain it by rewriting,…
Source: arXiv
ResearchOrdinary
A Unified Framework for Probability Estimation of Data-Dependent Events
We study the general problem of estimating $D(\dde(S))$, the probability that an unknown distribution $D$ assigns to an event determined by a sample $S$ of $n$ i.i.d.\ draws from $D$ through a known mapping $\dde$. The estimation algorithm…
Source: arXiv
ResearchOrdinary
Generative SDEs with Trainable Diffusion and Density-Based Losses
We develop a divergence-kernel method for jointly optimizing neural SDE drift and diffusion fields and the initial Gaussian distribution, using losses that depend directly on the terminal density. In two- and eight-dimensional Gaussian-mix…
Source: arXiv
ResearchOrdinary
Experts Exhibit Structured Redundancy: Structure-Preserving Expert Pruning for Mixture-of-Experts Large Language Models
Sparse MoE mechanism significantly improves the trade-off between model capacity and inference efficiency. However, practical deployment still requires storing all experts, resulting in substantial memory overhead. We show that expert outp…
Source: arXiv · DeepSeek / Qwen
ResearchOrdinary
TRIDENT and SHAKTI: A Framework and Benchmark for Hindi AI-Text Detection
As Large Language Models (LLMs) become increasingly multilingual, distinguishing human-written from AI-generated text is essential for maintaining information integrity. However, research remains English-centric, with limited benchmarks fo…
Source: arXiv
ResearchOrdinary
Coarse3D: Controllable and Faithful Sparse Structure Generation for Image-to-3D
Coarse-to-fine 3D-native generation relies heavily on the first-stage sparse structure, which determines the global orientation and overall geometry for subsequent refinement. However, existing coarse generators suffer from two key limitat…
Source: arXiv
ResearchOrdinary
RTL-Interact: Training EDA-Interactive Models for Multi-Task RTL Design
Large language models offer a promising route to register-transfer-level (RTL) design, but reliable implementations require checking and revision based on electronic design automation (EDA) tools' feedback. Existing RTL-specialized models …
Source: arXiv · DeepSeek
ResearchOrdinary
Corroborative Learning: Mutual Enhancement through Task-Response Reconstruction
In pattern analysis, models trained independently for the same task often develop complementary capabilities through differences in architecture, data, and optimization. Exploiting complementarity while retaining independent deployment is …
Source: arXiv
ResearchOrdinary
A Positional Realizability Theory of Length Generalization in Single-Head Attention
Why does length generalization (LG) depend so sharply on the positional encoding (PE)? Relative schemes extrapolate fixed offsets, absolute schemes fix positions, and neither handles growing offsets. We give a realizability theory for a de…
Source: arXiv
ResearchOrdinary
Beyond Response Scoring: An AI-aware Cognitive Supervision Framework for Automated Mathematical Short Answer Grading
Transformer-based language models have achieved remarkable success in automated short answer grading (ASAG). However, current methods in ASAG struggle to comprehend, reason about and evaluate complex mathematical answers involving symbols …
Source: arXiv
ResearchOrdinary
Beyond Scarcity: When Encoder Adaptation Is Worthwhile
Long-tailed recognition often learns a shared representation before correcting the classifier for class imbalance. Once the classifier has been rebalanced, however, final accuracy does not reveal whether further encoder adaptation remains …
Source: arXiv
ResearchOrdinary
From Evaluation to Evolution: Benchmarking Image Editing and Evolving Image Models
Real-world image editing requires coordinating multiple visual transformations with content preservation and reference constraints, yet aggregate scores can readily obscure unmet local requirements. Effective evaluation must therefore iden…
Source: arXiv · GPT / Qwen
ResearchOrdinary
Shifting Focus by Reliability: Geometric Fusion Modulation for Robust RGB-T Detection
RGB-thermal (RGB-T) object detectors combine visible and thermal imagery for robust detection, but signal corruption in either stream can substantially degrade accuracy. Restoration-based methods incur significant latency and do not consis…
Source: arXiv
ResearchOrdinary
Beyond CLIP: Calibrated (Few-Shot) Defect Detection With System One Decision Models
Cameras and vision sensors are widely used for product and process inspection in manufacturing environments. Traditionally, this process required thousands of images of both nominal and defective products to train such models. Recent resea…
Source: arXiv
ResearchOrdinary
Role-Aware Server Optimization for Multimodal Federated Learning with Missing Modalities
Multimodal federated learning (MFL) trains a shared model by aggregating client updates without exchanging raw data. Under missing modalities, clients adapt active modality encoders and a shared prediction block (fusion and classifier) to …
Source: arXiv
ResearchOrdinary
When AI Investigators Cannot Trust Their Tools: Conflict-Aware Evidence Verification for Cyber Threat Investigation
LLM agents increasingly triage security alerts by combining the outputs of several detection tools, implicitly treating those tools as trustworthy. Unlike prior work on conflicts between a model's knowledge and its context, we study confli…
Source: arXiv
ResearchOrdinary
Mechanistic Interpretability for End-to-End Self-Driving
End-to-end (E2E) autonomous driving models achieve strong planning performance but remain largely opaque, limiting observability and trust. We apply mechanistic interpretability to E2E driving by training Sparse Autoencoders (SAEs) on the …
Source: arXiv
ResearchOrdinary
Researcher-in-the-Loop Evolutionary Discovery of Entanglement-Assisted Quantum Code Families
LLM-guided program evolution can produce mathematical constructions, but validity, generality, and reproducibility require distinct evidence. We develop a researcher-in-the-loop discovery pipeline that combines program evolution, exact eva…
Source: arXiv