AI Research & Papers
整理大Models、智能体、多模态、机器学习与生成式 AI 的Research、基准和研究进展。
Category articles1528
当前页3 / 39
UpdatesPermanent archive
Category articles
按发布Time从新到旧 · 每页 40 stories
ResearchOrdinary
Text-to-Image Generative Modeling Without Language Pretraining
Modern text-to-image (T2I) systems use internet-scale language pretraining for text-conditioned image generation. We ask whether language pretraining is necessary for strong T2I generation. We introduce Halcyon, a family of early-fusion mu…
Source: arXiv
ResearchOrdinary
OpenVLHarness: Real World Visual Agentic Tool-Use with Multimodal Memory
Multimodal large language models (MLLMs) have made rapid progress on visual reasoning, yet many tasks require evidence that is difficult to obtain through internal reasoning alone: our controlled study on 22 benchmarks shows that simply in…
Source: arXiv · GPT / Qwen / Kimi
ResearchOrdinary
Can It Actually Work? Synthesizing Functional CAD Mechanisms
While LLM agents can generate visually plausible CAD assemblies, these designs often fail to fulfill their intended physical functions. We study functional CAD design, a setting where agents interpret underspecified requests to construct a…
Source: arXiv
ResearchOrdinary
Reinforcement Learning with Visually Attributable On-Policy Self-Distillation
Multimodal reinforcement learning with verifiable rewards (RLVR) provides reliable task-level supervision, yet offers limited guidance for localizing errors in visual reasoning. On-policy self-distillation (OPSD) complements this supervisi…
Source: arXiv
ResearchOrdinary
CoopUQ: Robust Multi-Robot Social Navigation via Uncertainty-Aware Cooperative Forecasting
Reinforcement learning enables mobile robots to make fast and scalable navigation decisions in constrained human-shared environments. However, directly extending single-robot approaches to multi-robot settings often fails to ensure safety …
Source: arXiv
ResearchOrdinary
Where is Physical RSI capability from? An Observational Scaling Law of LLM-as-policy
In this paper, we systematically investigate the mechanisms, scaling behavior, and generalization of physical Recursive self-improvement. We introduce PhysRSI-eval to quantify physical RSI through a five-axis metric: First-Attempt Performa…
Source: arXiv
ResearchOrdinary
WeAct: Dynamic Weight Switching as Agent Actions
Long-horizon agents must learn heterogeneous capabilities from interleaved trajectories. Updating shared parameters to learn new capabilities can degrade previously acquired ones, resulting in catastrophic forgetting. As a trajectory unfol…
Source: arXiv · Qwen
ResearchOrdinary
Train An Imaginative Agent
A seemingly reasonable push in Sokoban can make the puzzle unsolvable. To avoid such mistakes, an agent has to anticipate the consequences of its actions before execution, especially when feedback from the real environment is sparse or act…
Source: arXiv
ResearchOrdinary
AnyGoal: On World Model Generalization Beyond Expert Rollouts
The goal of a world model is to capture the dynamics of an environment. This has the great appeal that it allows agents to plan and simulate a course of actions with the help of a world model. For these uses to be reliable, however, the le…
Source: arXiv
ResearchOrdinary
LatComm: Reusable Context Compression for Latent Communication between Large Language Models
Systems that combine several large language models (LLMs) often use one context for many questions. When the context is passed between models as text, the receiving model processes all of its tokens again for every question. Avoiding this …
Source: arXiv
ResearchOrdinary
Newton-Based Methods for Bilevel Optimization Beyond Lower-Level Strong Convexity
Bilevel optimization provides a framework for machine learning tasks such as hyperparameter optimization, data reweighting, and meta-learning. Existing Newton-based bilevel methods typically rely on the classical hypergradient formula, whi…
Source: arXiv · GPT
ResearchOrdinary
Same Simulation, Different Evidence: Where Retrieved Tool Output Costs LLM Agents Accuracy
LLM agents that compute the right answer can still answer wrongly. Agent harnesses increasingly keep long tool outputs out of the context window, saving them to files that the agent searches or reads on demand. We ask where this costs accu…
Source: arXiv · GPT / Claude
ResearchOrdinary
Kronecker Delta Rule for Long Context Linear Attention
We propose KronLSTM, a linear attention architecture based on the Kronecker Delta Rule, a novel update rule for associative matrix memories. KronLSTM extends the xLSTM family with a memory-revision mechanism that corrects targeted associat…
Source: arXiv · Hugging Face
ResearchOrdinary
Supervised Learning with Quantum Hamiltonian Embeddings
Machine learning is widely regarded as a promising application in which quantum computing could offer a computational advantage. However, general quantum machine learning models with provable guarantees on performance, trainability, and ef…
Source: arXiv
ResearchOrdinary
Competing Learning in Hybrid Architectures
Many modern language models have adopted hybrid architectures that incorporate both linear-time recurrence and softmax attention. Modern recurrence layers provide a highly expressive mixing mechanism while ensuring high throughput by compr…
Source: arXiv
ResearchOrdinary
ProteinGeoBench: Frontier Structural-Biology Agents Are Fluent at Lookup but Lost in Geometry
Frontier agents retrieve structural metadata well and compute geometry from coordinates less reliably. We ask how much of a benchmark score reflects that gap and how much reflects the evaluation configuration around the model. We study Pro…
Source: arXiv
ResearchOrdinary
Agent World Model in the Wild: Computer-Use Agent Environment Synthesis
Agent learning is shifting from learning from human data toward learning through interaction with the world. However, scaling such learning directly in real-world computer systems is challenging and can introduce substantial security risks…
Source: arXiv · GPT / Qwen
ResearchOrdinary
KEEP-Bench: Evaluating Evidence Preservation in Context Compression
Context compression improves long-context efficiency but may introduce faithfulness issues through an information bottleneck. Existing evaluations rely on QA metrics, but a reader can still answer correctly from an unfaithful compression, …
Source: arXiv
ResearchOrdinary
RefCraft: Benchmarking Visual-Reference-Conditioned Agentic Generation through Web Development
Beyond basic tool use and coding skills, effectively incorporating visual references into agentic generation is equally essential for applying AI agents to real-world productivity tasks. We study this crucial capability through webpage dev…
Source: arXiv
ResearchOrdinary
MemT-1.0: Towards Memory-Native Evolution
Memory-native evolution requires making memory an intrinsic capability of foundation models, enabling them to continuously accumulate and utilize information. To this end, we introduce MemT-1.0, a new architecture of memory foundation mode…
Source: arXiv
ResearchOrdinary
Scalable and Adaptive Distribution Regression via Random Features
Distribution regression seeks to learn mappings from probability distributions to response variables and has emerged as a unifying framework for kernel methods, multi-instance learning, and set-valued learning. Despite its success, kernel-…
Source: arXiv
ResearchOrdinary
Query-Dependent Reading for Quantized Inner-Product Estimation: A Minimax Separation
We study quantization for inner-product estimation when storage and reading have separate budgets. In the static bit-probe model [Yao, 1981], an encoder stores $w$ bits about $x$ before seeing a query $y$, and a reader probes at most $r<w$…
Source: arXiv
ResearchOrdinary
Measuring Data Diversity with Embeddings: A Taxonomy and Benchmark for Diversity Measures
Diversity is a critical property of text corpora, with direct implications for training data curation, test set design, and model generalization. However, its measurement remains fragmented and poorly understood. Existing embedding-based d…
Source: arXiv
ResearchOrdinary
Sample-Efficient Reinforcement Learning with General Utilities via Neural Dual Critics
Reinforcement learning with general utilities optimizes nonlinear functionals of policy-induced occupancy measures. We develop a natural actor-critic method for concave RLGU objectives admitting an exact variational dual representation, wi…
Source: arXiv
ResearchOrdinary
RAFT: Redundancy-Aware Input Filtering for Temporal Graph Neural Network Training
Temporal graph neural networks (TGNNs) have shown strong performance on dynamic graph learning tasks by continuously updating node memories from evolving interactions (i.e., events) and leveraging these memories for downstream predictions.…
Source: arXiv
ResearchOrdinary
The One-Pixel of Reasoning: One Truthful Relation Is Enough to Mislead LLM Agents
Can one sentence manipulate an agent's belief by targeting a single implicit warrant linking evidence to a conclusion? In this paper, we introduce the one-relation attack (ORA), a novel cognitive attack on this inferential relation. ORA lo…
Source: arXiv
ResearchOrdinary
The Missing Compliance Class: LLM Graders That Collapse Jailbreak Success, and a Free Check
Jailbreak papers report an attack success rate, the share of responses that deliver the harmful request, and read it as a property of the target model. We hold the target model, the prompts and the responses fixed and change only the grade…
Source: arXiv
ResearchOrdinary
Bellman Language Models: Solving the Recurring Decisions of LLM Agents
A general observation in agentic workflows, especially bounded ones, is that the decision space of the LLM, when we separate a decision from generation, starts approaching saturation: the agent meets the same states again and again, and af…
Source: arXiv · Qwen / Claude
ResearchOrdinary
Dual Task Vector Merging: Leveraging Emotion and ASR Knowledge for Low-Resource Alzheimer's Disease Detection
Alzheimer's Disease (AD) detection from speech benefits from both paralinguistic and linguistic cues, yet model training is frequently constrained by limited data. Fine-tuning a large pretrained speech encoder can easily overfit, while a f…
Source: arXiv
ResearchOrdinary
SpriteStage: Long Horizon Animation Generation via Progressive Scene Programming and Replay
Video generation models synthesize visual sequences from text and image inputs. Extending video generation to long animations requires actions, dialogue, camera coverage, and narrative developments to remain coordinated across scenes. Exec…
Source: arXiv
ResearchOrdinary
FlowMaker: From Tasks to Cost-Efficient Generative AI Workflow Deployments
Generative AI workflows execute user tasks by composing sequences of LLM calls, where each call performs a sub-task (e.g., summarization or translation), forming a workflow. Executing such workflows requires decisions over workflow structu…
Source: arXiv
ResearchOrdinary
LLM-Based Evaluation Planning for Heterogeneous Optimization
Heterogeneous optimization problems require an optimizer to decide not only which candidate solutions to evaluate, but also which objectives and constraints should be evaluated under different costs and fidelities. Existing SOTA methods su…
Source: arXiv · DeepSeek
ResearchOrdinary
Learning to Program Retrievals: Composing Search Primitives via Reinforcement Learning
Retrieval-augmented language models increasingly use multi-step search to solve knowledge-intensive tasks, yet existing systems typically expose retrieval through fixed pipelines or collections of atomic tools. We introduce Retrieval Progr…
Source: arXiv
ResearchOrdinary
MisleadQA: Diagnosing LLM Failures under Misleading Context
Large language models (LLMs) are widely used to answer questions from retrieved or user-provided context. However, provided context can be factually true yet out-of-scope, describing a different entity, time, or location from the one the q…
Source: arXiv
ResearchOrdinary
An Impossibility Result for ETF Target Geometry, and an Equinorm Remedy for Imbalanced Analytic Continual Learning
Analytic continual learning (ACL) methods such as ACIL and GACL fit a ridge-regression classifier head on frozen features via the Sherman-Morrison-Woodbury identity, achieving exemplar-free, exact updates. A separate line of work, Progress…
Source: arXiv
ResearchOrdinary
A Statistical Viewpoint on Adam, Shampoo and Muon
We provide new statistical insights into designing stochastic optimization methods. By modeling the gradient via a normal distribution, we argue that the stochastic gradient should be whitened using its covariance. We give an online method…
Source: arXiv · GPT
ResearchOrdinary
Pattern-Driven Evaluation of LLM Code Optimization: Isolating Compiler-Transcendent Semantic Reasoning
Existing evaluations of LLM-based code optimization primarily measure end-to-end speedup, obscuring whether a model actually performs the intended optimization. For compiled languages, this is especially problematic: observed gains may ref…
Source: arXiv
ResearchOrdinary
Recurrent Temporal Restricted Boltzmann Machines as Unsupervised Encoders for Biomechanical Movement Sequences
Biomechanical movement recordings are continuous, high-dimensional time series, and analyzing them without manually labeling them requires representations that capture how movements evolve over time. Most unsupervised representation-learni…
Source: arXiv
ResearchOrdinary
Compose the Horizon: Parameter-Shared Blockwise Forecasting under a Sequential-Compute Trade-off
Most long-horizon forecasters emit the complete future in one pass. We ask whether a compact operator can instead be reused to emit contiguous future blocks, trading stored parameters for sequential computation. Recursive Functional Decomp…
Source: arXiv
ResearchOrdinary
Teaching Code Agents to Ask Without Leaking Private Code
Local coding agents can extend their reach by consulting a stronger cloud model. Such consultations, however, often expose the repository's private identifiers, file paths, and source code. Host-side masking hides recognized identifiers bu…
Source: arXiv