AI Research & Papers
整理大Models、智能体、多模态、机器学习与生成式 AI 的Research、基准和研究进展。
Category articles1528
当前页19 / 39
UpdatesPermanent archive
Category articles
按发布Time从新到旧 · 每页 40 stories
ResearchOrdinary
SR4-Fit: A Unified Interpretable Rule-Based Machine Learning Framework for Informative and Trustworthy Decision-Making
In many high-stakes applications, machine learning is dominated by black-box models that require post hoc explanations to justify their predictions. These explanations are often unreliable because they do not reflect the model's actual com…
Source: arXiv
ResearchOrdinary
Estimate, Don't Imitate: Reusing Differentiable State-Based Policies for Visuomotor Control
Simulation-trained manipulation policies can exploit privileged state information to learn effective contact-rich behaviours, but deployment requires acting from partial observations such as noisy camera images. A common solution is teache…
Source: arXiv
ResearchOrdinary
Maat: Independent Deterministic Contract-Based Governance for Multi-Agent LLM Workflows
Large-language-model multi-agent systems (LLM-MAS) introduce a characteristic reliability problem: an error produced by one agent can be accepted as context by downstream agents and propagate across the workflow. Many proposed safeguards r…
Source: arXiv
ResearchOrdinary
Transfer Learning for Edge Classification on Dynamic Text-Attributed Graphs
Learning transferable representations for dynamic text-attributed graphs (DyTAGs) requires models to capture underlying interaction dynamics that persist across domains. However, existing methods tend to overfit to domain-specific structur…
Source: arXiv
ResearchOrdinary
Sliced Orlicz-Wasserstein
We propose sliced Orlicz-Wasserstein (SOW) distance which is a generalization of sliced Wasserstein (SW) distance. SOW replaces the $L^p$ norm in SW with a Luxemburg norm cost induced by an Orlicz function $φ$. First, we prove that SOW dis…
Source: arXiv
ResearchOrdinary
SynCo: Learning Cross-Modal Synergy by Contrasting Interaction Residuals
Multimodal contrastive learning is a dominant paradigm for learning transferable representations from unlabeled data, but standard objectives primarily capture information that is redundant between modalities. Partial Information Decomposi…
Source: arXiv
ResearchOrdinary
VCRE-Fib: View-Conditioned Regional Evidence for Fine-Grained Ultrasound Grading of Schistosoma japonicum-Associated Liver Fibrosis
Accurate assessment of Schistosoma japonicum-associated liver fibrosis is essential for disease management and long-term follow-up in endemic regions. Ultrasound provides non-invasive imaging, but complex local echogenic patterns and anato…
Source: arXiv
ResearchOrdinary
Mend the Measurement Gap: Latent User Preference Modeling for Short-Form Video Recommendation
Recommender systems rely heavily on heterogeneous behavioral feedback to infer user preference. Although abundant, these signals are imperfect measurements: the same observed behavior can arise from different underlying states, such as gen…
Source: arXiv
ResearchOrdinary
HamiFormer: Dual-Expert Diffusion Fields with Affine Symplectic Maps
Predicting smooth dynamics and collisions requires modeling continuous evolution and abrupt state changes. We introduce HamiFormer, a dual-expert diffusion field combining whole-window denoising with residual-corrected Hamiltonian propagat…
Source: arXiv
ResearchOrdinary
Scanning While Imagining: A Scene-Graph World Model for Robotic Ultrasound Navigation
Ultrasound (US) acquisition depends on the operator's ability to interpret anatomy and anticipate how the view will change with probe motion. Many robotic US navigation methods select actions without explicitly predicting these anatomical …
Source: arXiv
ResearchOrdinary
Radiomap Blind Prediction under Incomplete Observation: Error Characterization and Correctable Propagation-Prior Learning
Radiomap blind prediction aims to infer radiomaps from observable representations of the propagation environment and base station configuration without field measurements. In practice, the observable representations are inherently incomple…
Source: arXiv
ResearchOrdinary
FinancialAuditBench: Benchmark Construction under Differential Privacy Using Real-World Priors
As AI agents are becoming widely adopted in the financial services industry, careful measurement is essential to understand where they can be reliably deployed and where oversight and professional review remain necessary. Such measurement,…
Source: arXiv
ResearchOrdinary
Permutation-Equivariant Flow Matching for Alignment-Free Neural Weight Generation
A trained neural network can be represented by a parameter vector in high dimensions. Learning distributions over these vectors enables the generation of new models across various tasks and architectures. A central challenge is permutation…
Source: arXiv
ResearchOrdinary
Over-the-Air Federated Learning in Heterogeneous Mobile Wireless Networks
Over-the-air computation has emerged as a scalable and efficient solution for deploying federated learning algorithms in wireless networks by exploiting waveform superposition for simultaneous model aggregation. Most existing work struggle…
Source: arXiv
ResearchOrdinary
UniCache: Task- and Type-Aware KV Cache Compression for Unified Multimodal Models
Unified multimodal models combine understanding, generation, and editing within a single network, offering a promising foundation for versatile multimodal applications. However, growing multimodal contexts make KV cache storage and access …
Source: arXiv
ResearchOrdinary
Retimed Bellman Flows: Escaping the Impossible Triangle of Velocity Bootstrapping
Flow critics learn return distributions by transporting Gaussian noise to Bellman endpoints via continuous velocity fields. While velocity bootstrapping stabilizes training by querying a successor teacher, existing methods face a structura…
Source: arXiv
ResearchOrdinary
Improving LLM Collaboration via Multi-Agent Preference Learning
Several works have explored multi-agent reinforcement learning (MARL) in LLM collaboration. However, constructing reliable rewards is difficult in practice, as complete and accurate metrics are often unavailable and hard to aggregate. Pref…
Source: arXiv
ResearchOrdinary
The Decomposition Tax: LLM Pipelines Lose Up to 40 Accuracy Points at Their Own Interfaces
A four-stage LLM pipeline gives up as much as 40.5 accuracy points at its own interfaces (gemma-3-12B on MATH-500, Holm-corrected p = 1.66e-19; the largest tax in the primary family). We hold model, problem, stages, stage prompts and compl…
Source: arXiv
ResearchOrdinary
Routing Drift Alone Does Not Diagnose Failure in Merged MoE LLMs
Model merging efficiently combines specialized large language models (LLMs) without joint retraining, but can substantially alter expert routing in Mixture-of-Experts (MoE) models. Such \emph{routing drift} is often interpreted as routing …
Source: arXiv · Qwen
ResearchOrdinary
Learning Shuffle Ideals with Membership Queries and Contrastive Examples
This paper studies learning of shuffle ideals with membership queries as well as with contrastive queries---a form of membership query that reveals not only whether a selected word $w$ is in the target language or not, but also provides a …
Source: arXiv
ResearchOrdinary
Rank Collapse Is Recoverable, Growing $|Q|$ Is Not: Out-of-Sample Early Warning for Value Divergence in High-UTD Soft Actor-Critic
Raising the update-to-data (UTD) ratio breaks off-policy critics in two ways grouped as "plasticity loss": collapsing representations and growing value magnitude $|Q|$. We separate them in Soft Actor-Critic (SAC) with scaled critics (width…
Source: arXiv
ResearchOrdinary
When Can First-Order Models of Fine-Tuning Bound Forgetting?
Fine-tuning a language model on new data can make it forget facts that it should keep. We ask whether measurements taken at the start of a fine-tuning run can bound, for each protected fact, the probability that the run makes the model for…
Source: arXiv
ResearchOrdinary
Right Answer, Wrong Reason: Accuracy, Consistency, and Consensus Are Misleading Indicators of LLM Faithfulness in Clinical Decision Support
Clinical Large Language Models (LLMs) achieve strong medical-exam accuracy; however, a correct answer does not guarantee that the explanation names the concepts that actually drove the decision. We introduce three lightweight, directly int…
Source: arXiv
ResearchOrdinary
Learning to Stop without Learning to Stop: Self-Supervised Confidence Training Improves Reasoning Efficiency
Reasoning models often generate very long reasoning traces, making inference computationally expensive. Existing approaches typically improve efficiency either through inference-time early-stopping mechanisms or by explicitly encouraging s…
Source: arXiv · GPT / Qwen
ResearchOrdinary
Gap-free Differentially Private PCA for Gaussian Data
We give a gap-free differentially private algorithm for the principal component analysis (PCA) problem with Gaussian data.
Source: arXiv
ResearchOrdinary
First-Order Stationarity of Reverse Diffusions
Recent literature has shown a strong connection between optimization and sampling. We develop the corresponding first-order theory for diffusion models. First, the SDE-based reverse-time flows of overdamped and underdamped Langevin diffusi…
Source: arXiv
ResearchOrdinary
Statistical attribute alignment for black-box generative AI via output post-processing
Generative AI systems are increasingly used, but aligning their outputs with user requirements poses a continuing challenge. Here, we aim to ensure that the distribution of an attribute of an AI-generated output aligns with a user-specifie…
Source: arXiv
ResearchOrdinary
User Model Extraction via Belief Self-Distillation
Large language models (LLMs) implicitly infer attributes of their users and adapt their behavior accordingly, yet these beliefs remain difficult to inspect and causally manipulate. We introduce Belief Self-Distillation (BSD), a unified rea…
Source: arXiv
ResearchOrdinary
New LoRA Skills Should Read but Never Write
Low-rank adapters (LoRA) make it cheap to fine-tune a large language model once per task, but combining several independently trained adapters into one model remains difficult: merging the updates in weight space causes interference, retra…
Source: arXiv
ResearchOrdinary
Common-Mode Collapse and Recovery in Direct Feedback Alignment
Direct feedback alignment (DFA) trains hidden layers through fixed random projections of output error. With tanh hidden units and independent sigmoid outputs, plain stochastic gradient descent can stall near the loss of a constant predicto…
Source: arXiv
ResearchOrdinary
Compact Documentation for Coding Agents: A Benchmark, an Optimizer, and Why It Does Not Transfer
We investigate whether natural-language documentation helps coding agents resolve software issues, and we build the tools to construct and evaluate it. We introduce a roundtrip benchmark that scores code descriptions by whether code regene…
Source: arXiv
ResearchOrdinary
Trust Guided Decision Transformer
Decision Transformer performance degrades on long rollouts because the conditioning context drifts out of the training distribution. We show that this drift is visible through the model's own next state prediction error, which rises during…
Source: arXiv
ResearchOrdinary
OC-GS: Gaussian Splatting for Irregular Turntable Capture
Uneven rotation and dropped frames make equal-angle assumptions unreliable for turntable reconstruction. We present OC-GS, an object-centric Gaussian splatting that refines each image's angle while maintaining a shared camera, rotation axi…
Source: arXiv
ResearchOrdinary
Strategically Diverse Sampling for Self-Training
Many LLM training and inference methods, including RL and test-time scaling, depend on repeated sampling, but benefit only when the responses meaningfully differ. Self-training faces the same challenge: training data is typically construct…
Source: arXiv · Qwen
ResearchOrdinary
Uncertainty and Explainability in Deep Rough Volatility: A Neural Information-Theoretic Posterior Approach
Deep learning has substantially accelerated the calibration of complex stochastic-volatility models, but neural point calibration alone does not capture the uncertainty remaining after an implied-volatility (IV) surface has been observed. …
Source: arXiv · Grok
ResearchOrdinary
Adapting for AI: How elementary teachers adjust their practices for an AI-integrated curriculum
Conversational AI tools are entering children's everyday experiences, and schools are interested in adopting them. However, successful classroom integration depends not only on the technology but also on the work teachers do to make it usa…
Source: arXiv
ResearchOrdinary
DeepEdu-v1: Efficient and Scalable Agentic LLMs for Vietnamese Education
AI tutoring could markedly improve learning outcomes for students in developing regions such as Vietnam, yet the two obvious paths both fall short. Cloud assistants such as ChatGPT route sensitive student data to foreign servers---violatin…
Source: arXiv · ChatGPT
ResearchOrdinary
Weight Pair Encoding: Inducing a Smaller Grammar in Neural Network Weights
We show that neural network weights can be explicilty fintuned to admit a smaller grammar. Weight Pair Encoding (WeightPE) does so by placing a lossy Re-Pair compressor inside a straight-through estimator. The int8 weights of the network a…
Source: arXiv
ResearchOrdinary
Multi-agent Scaling Across Disjunctive and Compensatory Tasks
Multi-agent LLM systems are often expected to improve as team size increases, yet the scaling behavior may depend on task structure. Our central contribution is to introduce Steiner's taxonomy of group tasks as a framework for analyzing mu…
Source: arXiv
ResearchOrdinary
Generalization behavior of OPTQ and the role of regularization
Large neural networks can be compressed by rounding or "quantizing" their weights to numbers that admit representations with fewer bits. One algorithm for quantization, OPTQ, progressively quantizes the weights of a neural network so that …
Source: arXiv