AI Research & Papers
整理大Models、智能体、多模态、机器学习与生成式 AI 的Research、基准和研究进展。
Category articles2148
当前页17 / 54
UpdatesPermanent archive
Category articles
按发布Time从新到旧 · 每页 40 stories
ResearchOrdinary
LongZero: Enhancing Long-Context Reasoning in LLMs from Zero Data
Reinforcement learning (RL) is an effective way to strengthen the long-context reasoning of large language models (LLMs), but it needs training data that are long, diverse, challenging, and verifiable. Human annotation of such data is expe…
Source: arXiv
ResearchOrdinary
Think Harder Where It Matters: Item-Level Adaptive Recursion for Sequential Recommendation
Existing sequential recommenders usually allocate a fixed computational budget to every item in a user's interaction history, regardless of the item's contribution to the final prediction. We challenge this de facto design with two diagnos…
Source: arXiv
ResearchOrdinary
PhysiCalWorld: In-Context Physics Calibration for World Models
Existing world models typically perceive a scene through current visual frame or a narrow history window. However, these observations may not reveal the physics properties that determine transition dynamics, such as an object's mass distri…
Source: arXiv
ResearchOrdinary
A Quasipolynomial Algorithm for $\ell_\infty$ Contractions
We give an algorithm for computing an $\eps$-approximate fixed point of any $d$-dimensional nonexpansion with respect to the $\ell_\infty$ norm in time $\log(1/\eps)^{O(\log^2 d)}$. At its core, our method uses a boosting argument to geome…
Source: arXiv
ResearchOrdinary
Self-normalized Bernstein Inequalities for Regenerative Processes and Applications to Learning Without Independence
We prove a self-normalized Bernstein inequality for bounded functions of a regenerative process with independent, identically distributed marked cycles of finite mean length. The bound uses observed cycle lengths and retains explicit terms…
Source: arXiv
ResearchOrdinary
The role of locality and weight sharing in convolutional neural networks
The success of convolutional neural networks is often attributed to locality and weight sharing. However, how these two properties separately shape learning, and how their effects depend on the spatial correlations of natural images, remai…
Source: arXiv
ResearchOrdinary
Environment Duels: A Microcosm of LLM Co-Evolution
Through a tangle of real-world interactions, from synthetic training pipelines to data shared on the open web, frontier LLMs absorb what their predecessors and competitors create. How well does each model play its role in this ecosystem, a…
Source: arXiv · Qwen
ResearchOrdinary
The End of Consensus Research?
Consensus is a fundamental problem in distributed computing and at the core of state machine replication (SMR). Despite decades of active human research, discovering practical low-latency solutions to the problem is still open, as it requi…
Source: arXiv
ResearchOrdinary
Quant-Arena: Benchmarking LLM Agents for Quantitative Trading Research
Quantitative research is an iterative loop: a researcher proposes a market hypothesis, implements it as an executable signal, tests it on historical data, and decides what to keep. Existing benchmarks score formulas, code, or individual tr…
Source: arXiv · GPT
ResearchOrdinary
Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance
We analyze the problem of estimating univariate Gaussian mixture densities using the nonparametric maximum likelihood estimator (NPMLE) based on $n$ independent and identically distributed samples. We show that the unconstrained NPMLE achi…
Source: arXiv
ResearchOrdinary
Multimodal Embodied Agents: A Unified Capability-centric Perspective from Computer-Use to Robot-Use
Multimodal agents (MMAs) sustain interaction through reasoning, memory, tools, and feedback, most visibly as computer-use agents, while robotic systems (RSs) couple sensing and actuation under physical dynamics. We define multimodal embodi…
Source: arXiv
ResearchOrdinary
Velocity Ambiguity Profiles: Time-Resolved Bayes-Risk Diagnostics for Flow Matching
Flow matching trains a continuum of velocity regression problems but usually reports a loss averaged over interpolation time, obscuring which regions are limited by intrinsic ambiguity and which remain data-limited. We introduce the Veloci…
Source: arXiv
ResearchOrdinary
Asymmetric On-Policy Distillation Learns In-Context Exploration
Sequential decision-making under partial observability is difficult because agents must explore to infer hidden, task-relevant information before acting effectively. Learning such information-gathering behaviors tabula rasa via online rein…
Source: arXiv
ResearchOrdinary
BatchBench: Benchmarking AI Robustness to Batch Effects and Domain Shift in Biomedical Images - A JUMP Cell Painting Leaderboard
Despite recent advances, current AI systems remain highly susceptible to domain shifts, particularly in biomedical imaging, where images are usually acquired under substantially different experimental conditions. Although recent domain ada…
Source: arXiv
ResearchOrdinary
Did the Problem Actually Get Harder? Testing LLMs on Paired P and NP-Complete Problems Hardened by Adversarial Multi-Agent Rewriting
Many NP-complete (NPC) problems have a polynomial-time (P) twin that differs in a single structural detail, such as 3- versus 2-colouring a graph. A model that reasons rather than recalls should notice which side of this boundary a problem…
Source: arXiv
ResearchOrdinary
Differentially Private Sparse Reward Estimation with Preference Feedback
Reinforcement Learning with Human Feedback (RLHF) has become a central paradigm for aligning Large Language Models with human values. However, the reliance on sensitive preference data necessitates rigorous differential privacy (DP) guaran…
Source: arXiv
ResearchOrdinary
AtomicRL: Atomic Reinforcement Learning for Long-Horizon Robotic Manipulation
Vision-language-action (VLA) models have shown promise in robotic manipulation, but imitation learning (IL) alone often struggles to master complex long-horizon skills. Reinforcement learning (RL) offers an effective avenue for further imp…
Source: arXiv
ResearchOrdinary
VX-One: Typed, Calibrated Decision Heads for Real-Time Perimeter Triage - An empirical study of unknown-attack honesty, cascade gray zones, and calibration under drift
Perimeter triage faces a latency/semantics trade-off: signature engines are fast and format-safe but blind to unseen attacks, while generative models are semantic but slow and produce unparseable output. In late 2026 a class of commercial …
Source: arXiv
ResearchOrdinary
Orbitol: Crystal Generation on Wyckoff Orbits
Generative models propose crystalline materials by learning composition and geometry, but unconditional sampling gives no direct control over the space group, which constrains whether responses such as piezoelectricity are symmetry-allowed…
Source: arXiv
ResearchOrdinary
Circuits of LLM Classifiers
Language models make it easy to build classifiers by simply prompting a model with the sample to classify. However, their predictions are neither deterministic nor uniformly reliable across samples. How can we combine predictions from diff…
Source: arXiv
ResearchOrdinary
Near Minimax Rate for Quantile Distributional Reinforcement Learning
In this paper, we study quantile distributional policy evaluation, where the return distribution under a given policy is approximated by the quantile Bellman fixed point $\bmη_m$. We investigate the statistical accuracy of estimating $\bmη…
Source: arXiv
ResearchOrdinary
A Transfer Learning-Driven Methodology for Efficient and Sustainable Indoor Localization Using VLC
The rapid expansion of the Internet of Things enables seamless collaboration among connected devices, making indoor localization a critical component of industrial automation. However, conventional localization techniques struggle in dynam…
Source: arXiv
ResearchOrdinary
Fragment-Level Graph Encoding for Interpretable Molecular Property Prediction
Graph neural networks (GNNs) are among the standard tools for molecular property prediction, but the atom-level explanations of their predictions are hard for medicinal chemists to act on. We propose a change of input representation rather…
Source: arXiv
ResearchOrdinary
Unlocking Spatial Grounding in Flow-Matching Models via SNR Tuning
Despite the success of foundation models in image synthesis, achieving fine-grained spatial control remains a significant challenge, typically requiring auxiliary structural adapters or complex inference-time steering. While modern vision-…
Source: arXiv
ResearchOrdinary
Fast Bayesian Optimization Through Linear Models
Bayesian optimization (BO) is typically used only for problems where the underlying function is deemed "expensive" (e.g. in time or money), with the speed of the BO algorithm being of little importance. In the real world, however, problems…
Source: arXiv
ResearchOrdinary
What Prediction-Market Contracts Reveal at Launch: Trading Volume and Dispute Risk
Using a near-census of 802,863 resolved markets listed on Polymarket between January 2023 and May 2026, and only information available at listing (the market's title and description, named resolution source, and contract metadata), we pred…
Source: arXiv
ResearchOrdinary
The Reflexivity Threshold: A Phase Transition for Multi-Agent Performative Prediction
Many learning systems are performative: once deployed, their predictions change the data distribution on which future models are trained. In multi-agent settings, this feedback is routed through a network of interacting learners, so stabil…
Source: arXiv
ResearchOrdinary
Private Online Prediction from Experts with Small Losses
We consider online prediction from experts, a fundamental problem in machine learning, under differential privacy constraints. Existing private algorithms achieve near-optimal regret $\tilde{O}(\sqrt{T})$, where $T$ is the time horizon. Ho…
Source: arXiv
ResearchOrdinary
Implicit Feature Reweighting for Label-Free Graph Generalization
Graph-level out-of-distribution (OOD) generalization is critical for deploying graph neural networks in real-world applications where distribution shifts are inevitable. Existing approaches typically require class labels during representat…
Source: arXiv
ResearchOrdinary
Certified Neural Approximation of Robust Nonlinear Model Predictive Control
Model predictive control is a high-performance control method, but it incurs comparatively high online computational costs across many control tasks and is challenging to realize in low-level hardware settings. To address this, we present …
Source: arXiv
ResearchOrdinary
SOAR: Social and Opinion-Aware Recommendations
One of the enduring challenges in online platforms is recommendation. Both communities and advertisers face difficulties in analyzing complex user behavior, identifying habits and evolving preferences, and providing timely recommendations …
Source: arXiv
ResearchOrdinary
WRDO: Weighted Refusal Direction Optimization in Aligned Language Models
Aligned large language models are trained to comply with benign requests while refusing harmful ones. However, recent work shows that this refusal behavior is fragile and can often be disrupted by simple activation- or weight-space interve…
Source: arXiv
ResearchOrdinary
Hyperspherical Simplex Representations for Backward-Compatible Retrieval
Training modern AI models has become increasingly expensive, and updating deployed models can alter their internal feature representations, affecting applications built upon them. In retrieval systems, such updates often require complete g…
Source: arXiv
ResearchOrdinary
PACE: Periodic and Channel-Aligned Encoding of Four-Bit Recurrent States
Linear-attention language models keep their context in a recurrent state of fixed size, where an inference system stores one copy of this state for every sequence it decodes at the same time. Storing the state at lower precision therefore …
Source: arXiv
ResearchOrdinary
Stochastic Pruning of the DPO Computation Graph: 1.4x Faster Training and Lower Peak Memory
Direct preference optimization (DPO) incurs training costs in output scoring, sequence execution, and backpropagation, so reducing supervision alone does not necessarily save computation. We introduce a unified framework for stochastic pru…
Source: arXiv
ResearchOrdinary
Block Diffusion for Longitudinal EHR: Accuracy, Efficiency, and Representation Trade-offs
Autoregressive (AR) models have proved effective for zero-shot prediction from longitudinal electronic health records, but impose strictly sequential generation on trajectories containing temporally clustered and interdependent clinical ev…
Source: arXiv
ResearchOrdinary
Phase Transitions in Learning Driven by Extremal Data
We study an extremal regression problem, an example of multiple instance learning (MIL), where the predictors are given as multisets, called bags. The bag elements (called instances) possess hidden labels which are pooled to produce an obs…
Source: arXiv
ResearchOrdinary
Residual-Based Causal Discovery via Pretrained In-Context Quantile Regression
Residual-based causal discovery assumes that each variable is generated from its parents and an independent noise source. It estimates this noise and tests its independence from candidate causes. For identifiable functions such as additive…
Source: arXiv
ResearchOrdinary
Are Joint-Embedding Predictive Objectives Effective for Longitudinal EHRs?
Masked language modelling (MLM) is the dominant pretraining objective for transformer encoders applied to longitudinal electronic health records (EHRs). However, reconstructing individual events may overemphasise noisy or weakly informativ…
Source: arXiv
ResearchOrdinary
RCSD: Reinforcement and Continual Learning for Domain-Specific Speculative Decoding
Speculative decoding accelerates large language model inference by employing a compact draft model to propose candidate tokens that are verified in parallel by a target model. Conventional training relies on soft-label distillation, which …
Source: arXiv