AI Research & Papers
整理大Models、智能体、多模态、机器学习与生成式 AI 的Research、基准和研究进展。
Category articles2148
当前页7 / 54
UpdatesPermanent archive
Category articles
按发布Time从新到旧 · 每页 40 stories
ResearchOrdinary
A Framework for Context Enrichment and Selective Robustness in LLM Social Agents
Researchers use large language models as agents in social simulations, where agents are prompted with observations and background information intended to shape their actions. Yet LLM agents have been shown to substantially change their beh…
Source: arXiv
ResearchOrdinary
FlowReconBench: Accuracy, calibration and cost of learned and classical flow reconstruction from sparse sensors
Reconstructing full flow fields from sparse sensors requires prior assumptions about unmeasured regions and physical variables. Yet it remains unclear when learned models outperform classical estimators and which aspects of their predictio…
Source: arXiv
ResearchOrdinary
BEAKER: An Expert-Curated Benchmark for Embodied Brains in Self-Driving Chemical Laboratories
Self-Driving Chemical Laboratories (SDCLs) are moving chemical experimentation toward embodied automation, where machines must perceive laboratory scenes, reason about experimental states, and act under physical, procedural, and safety con…
Source: arXiv
ResearchOrdinary
FrontierPhysics: Evaluating Agents for End-to-End Physics Research
AI agents are playing an increasingly important role in physics research. However, existing physics benchmarks only evaluate fixed questions, isolated sub-tasks, or paper reproduction with given solutions, and rarely check research quality…
Source: arXiv
ResearchOrdinary
Perceptive Humanoid Motion from Simulation
Humanoid robots have the potential to automate a wide range of physical tasks. Progress toward generalist humanoid autonomy, however, remains constrained by a data bottleneck: mapping pixels and free-form language to low-level joint comman…
Source: arXiv
ResearchOrdinary
Reinforcement Learning Enables Scaling Generalist Robot Policy Improvement
The introduction of generalist robot policies has enabled a single, large model to learn to perform a variety of tasks from a vast pre-training corpus. While these models often exhibit powerful zero-shot generalization capabilities, they t…
Source: arXiv
ResearchOrdinary
Occlusion for Free: Detecting Occlusion from the Disagreement Between Two Monocular Distance Cues
Knowing that a pedestrian is occluded is useful to a robot even when the detector cannot recover the hidden pixels, but occlusion estimators are normally trained on occlusion annotations that deployment settings rarely have. We show that o…
Source: arXiv
ResearchOrdinary
Dull, Dirty, Dangerous? Working Conditions and the Limits of Occupational AI Exposure
Automation is often justified as relief from dull, dirty, and dangerous work. I examine how these conditions relate to occupational AI exposure using 21 O*NET items across 754 US occupations. Higher exposure is associated with lower condit…
Source: arXiv
ResearchOrdinary
Adaptive Multi Mode: Budget-Aware Routing of Optimizers By Online Landscape Probes
The best classical optimizer for a continuous black-box problem depends on its budget and landscape. Existing routers decide from the dimension and budget, past improvement or features fitted to one benchmark, and few test an optimizer's i…
Source: arXiv
ResearchOrdinary
SpecCompact: Accelerating LLM Agent Context Compaction with Slot-Parallel Semantic Speculative Verification
LLM agents use context compaction to manage growing interaction histories, but summarizing long histories with large models can introduce substantial delays. Compaction therefore requires balancing information retention against latency. We…
Source: arXiv
ResearchOrdinary
Learning to Decode Linear Codes with Generalized Belief Propagation Network
Error correcting codes are a fundamental component of communication systems, enabling reliable data transmission over noisy channels. Recently, neural decoders have demonstrated notable performance gains over classical iterative algorithms…
Source: arXiv
ResearchOrdinary
On Turn-Level Best-of-N Sampling for Scaling LLM Agents
In this work, we evaluate a simple inference-time scaling approach based on \textit{turn-level best-of-N sampling} (\method) for large language model (LLM) agents on complex, long-horizon tasks. We instantiate this using a \textit{generato…
Source: arXiv
ResearchOrdinary
CounterFactual Retrieval for Evidence-Aware Individual Animal Identification
Automated identification of individual animals is moving from small curated studies toward shared benchmarks and reusable foundation models. This progress is useful, but current evaluation leaves the evidence behind a match unresolved, i.e…
Source: arXiv
ResearchOrdinary
Balancing hierarchical representation and quantization: A performance trade-off in text embeddings
Hierarchical text embedding models offer variable-length representations, while quantization reduces numerical precision; both aim to improve computational efficiency. This work is an empirical benchmark study of how these two orthogonal, …
Source: arXiv
ResearchOrdinary
CompressionBench: How can your coding agents compress LLMs?
Recursive self-improvement requires AI systems to improve the models and infrastructure used by subsequent systems. LLM compression offers a concrete efficiency objective: retain a pretrained model's behavior within a smaller model storage…
Source: arXiv
ResearchOrdinary
LongBanana: An Expert-Verified Benchmark for Long-Context Multi-Reference Image Synthesis
We introduce LongBanana, to our knowledge the first expert-designed and expert-verified benchmark for long-context multi-reference image synthesis in the age of agent-driven image generation. The task requires retrieving dispersed visual e…
Source: arXiv
ResearchOrdinary
Visual Token Routing: Learning to keep tokens that matter
Computer-use agents (CUAs) have recently achieved superhuman performance on several long-horizon benchmarks. However, their computational cost limits their use in long-horizon tasks and real-time domains such as video games. A key bottlene…
Source: arXiv
ResearchOrdinary
Persona Perspectives: Adopting Viewpoints Reorganizes Representations in LLMs
Common methods for monitoring features in large language models (LLMs) such as linear probes and sparse autoencoders (SAEs) assume that features maintain a consistent representation across contexts. LLMs, however, can flexibly adopt differ…
Source: arXiv
ResearchOrdinary
Navigating Disagreement Among Criteria for Evaluating Explanation Faithfulness
Faithfulness requires that algorithmic explanations accurately reflect the model's behavior. Yet existing operationalizations of faithfulness can disagree about whether the same explanation is faithful, leaving developers and auditors to c…
Source: arXiv
ResearchOrdinary
Thermally Conditioned Time-Series Forecasting of Grain Growth in Polycrystalline Materials
Grain growth during heat treatment strongly affects the microstructure of polycrystalline materials and, consequently, their mechanical properties. Although numerical methods such as front-tracking or front-capturing simulations can accura…
Source: arXiv
ResearchOrdinary
FPTR: Feasibility-Preserving Transactional Refinement for Deadline-Constrained Joint Beam and Resource Allocation
Short-interval wireless schedulers must return a complete, feasible beam-and-resource allocation before each execution deadline, and a late or invalid output gives no utility in the current control cycle. Searching longer can increase tran…
Source: arXiv
ResearchOrdinary
Risk-Sensitive Non-Parametric and Kernel Bandits
We study non-parametric bandits in which arms are evaluated using Cumulative Prospect Theory (CPT) rather than expected reward. We consider continuous action spaces with arm-dependent noise and propose Non-Parametric CPT Bandits ($\mathtt{…
Source: arXiv
ResearchOrdinary
Model Merging Does Not Require Uniform LoRA Ranks
Model merging combines separately fine-tuned experts into a single model without retraining. Standard practice trains every expert at the same LoRA rank, which couples the rank choice across experts even though each domain has its own best…
Source: arXiv
ResearchOrdinary
What Does Multi-Turn Reinforcement Learning Really Improve in LLM Agents?
While multi-turn agentic reinforcement learning (RL) excels on long-horizon tasks, its performance gains remain highly sensitive to interaction constraints. Evaluating across sampling breadth $K$ and interaction depth $T$ via $Pass@(K,T)$,…
Source: arXiv
ResearchOrdinary
ArcRAG: Agentic Compositional Retrieval over Knowledge Graphs
Graph-based retrieval-augmented generation (GraphRAG) answers questions by retrieving over a knowledge graph built from a corpus. Yet retrieval strategies are designed around the structure their own construction pipeline produces, and whet…
Source: arXiv
ResearchOrdinary
The Alignment Tax Is Graded: Task-Selective Capability Loss Under Length-Normalized DPO with SFT Retention
Setting. This is an empirical characterization study; we propose no new method and run no comparisons against alternative objectives. We fine-tune Qwen3.5-4B with sparse LoRA and length-normalized DPO plus an SFT retention term (the RPO ob…
Source: arXiv · Qwen
ResearchOrdinary
How many sorted projections determine n points in k dimensions?
Let $d_1,\dots,d_m$ be directions in $\mathbb{R}^k$, where $k\ge 2$. A multiset $X$ of $n$ points of $\mathbb{R}^k$ projects to the $m$ multisets of numbers $\{\{x\cdot d_j : x\in X\}\}$, or equivalently to the $m$ sorted lists of these nu…
Source: arXiv
ResearchOrdinary
Microdroplet Generator Surrogate Enhancement and Inverse Design Through an Uncertainty-Guided Framework
Microfluidic droplet generation is critical for many applications, yet efficient device design in high-dimensional parameter spaces remains computationally prohibitive due to complex multiphase flow dynamics. This work presents a unified m…
Source: arXiv
ResearchOrdinary
Within-Family EfficientNet Scaling under Fixed-Resolution Transfer Learning for Spectral-Domain Optical Coherence Tomography Retinal Disease Classification
Background/Objectives: CNNs perform well in retinal disease classification from spectral-domain optical coherence tomography (SD-OCT), but whether EfficientNet's natural-image scaling hierarchy transfers to medical-image transfer learning …
Source: arXiv
ResearchOrdinary
AmbiHTMLBench: A Benchmark for HTML-based Visually Rich Document parsing
Traditional document parsing systems use Markdown as their output representation, which is effective for linear text but does not fully preserve fine-grained spatial structure, table geometry, visual hierarchy, or rendering semantics. We s…
Source: arXiv
ResearchOrdinary
SUMONE: A Simple and Efficient Summarizer for Plug-and-Play Agent Memory
Long-horizon language-model agents accumulate increasingly large interaction histories, making context compaction essential for efficient execution. Existing learned compaction methods often rely on downstream task outcomes or solver behav…
Source: arXiv
ResearchOrdinary
EvoGuard: Mitigating Degradation in Online Skill Evolution
Skills let language agents reuse experience across tasks as natural-language documents. Recent work evolves skills from interaction, but existing methods have limitations when skills evolve online. Prior methods update a skill offline from…
Source: arXiv
ResearchOrdinary
Graph Foundation Models Can Become Effective Multivariate Time Series Anomaly Detectors
Multivariate time series anomaly detection (MTSAD) relies on modeling both temporal dynamics and inter-sensor dependencies to identify complex system faults. Although graph-based detectors explicitly model sensor topologies, they train tas…
Source: arXiv
ResearchOrdinary
Understanding the Out-of-Distribution Generalization of Chain-of-Thought Reasoning in LLMs
Chain-of-Thought (CoT) reasoning substantially improves Large Language Models (LLMs), yet its out-of-distribution (OOD) generalization mechanism remains theoretically underexplored. We study CoT as compositional OOD generalization: the tar…
Source: arXiv
ResearchOrdinary
Hardwired Distributed Processing Units for Inference: Neural Decisions at the Sensor that Free the Host
We show that a hardwired distributed processing unit (HDPU) can take a neural decision at the sensor and so remove the inference from the host. Built for zebra-crossing detection on a low-cost Artix-7 FPGA, the unit decides on every camera…
Source: arXiv
ResearchOrdinary
EviSeek: An Evidence-Centric Agentic Framework for Embodied Active Information Seeking
Active embodied question answering requires agents to acquire evidence through viewpoint changes and physical interaction. The central challenge is to avoid undirected interaction: taking plausible actions without specifying what evidence …
Source: arXiv · Qwen / Gemini
ResearchOrdinary
PARGAR: Pilot-Aware Graph Attention for Sparse-Pilot Neural OFDM Receivers
Reliable channel estimation and symbol detection in 5G New Radio (NR), as well as emerging 6G radio systems, rely on demodulation reference signals (DMRS). The density and placement of these pilots on the orthogonal frequency-division mult…
Source: arXiv
ResearchOrdinary
Partially Interpretable Decision Trees
Partially interpretable models extend simple interpretable models with the option to defer complicated inputs to an accurate but uninterpretable black-box model. By deferring more inputs, the model gets more accurate; by deferring fewer, i…
Source: arXiv
ResearchOrdinary
D3D: Decoupled Diffusion Drafting for Asynchronous Speculative Decoding
Target-conditioned diffusion drafters predict candidate tokens in parallel, yet each new block must wait for updated target-model hidden states. This forces drafting and verification to run sequentially, limiting speedup even though each b…
Source: arXiv · Qwen
ResearchOrdinary
Mind Control of LLMs via Closed-Loop Stimulation: Out-of-Distribution Robustness
Brains and large language models need not be considered equivalent systems to reveal an interpretable commonality: both exhibit high-dimensional, nonlinear dynamics whose behavior can only be modeled imperfectly. This creates a shared chal…
Source: arXiv