MoG-VLM attacks the prohibitive cost of zero-shot video anomaly detection with Vision-Language Models by treating motion not as a feature but as a lightweight gate that decides when to run expensive VLM inference. It introduces Temporal Gradient Magnitude (TGM) for content-aware frame sampling, anchor-triggered hierarchical lookback windows for temporal refinement, and a tier-aware fusion rule that balances frame-level and video-level语义 signals without any learned parameters. The work reports state-of-the-art zero-shot training-free AUC-ROC on XD-Violence (91.91%), UCF-Crime (84.30%), and MSAD (87.88%), alongside a claimed 1.31× speedup over the prior best method.

Trace2World tackles the bottleneck of building faithful GUI training environments from sparse real-app traces. It separates global semantic reconstruction—resolving page identities, state fields, and conditional effects across traces—from browser implementation, then validates by independently replaying every source workflow. On 200 workflows across ten apps, this contract reaches 91.1% end-to-end fidelity versus 59.8% for the strongest task-local baseline and retains 94.0% of simulated training gains when transferred to real devices.

Many clinical decisions are rapid multiple-choice tasks that require uncertainty estimates for safe deployment. This paper evaluates four System 1 models, zero-shot non-generative classifiers that return answer probabilities in a single forward pass, on 86 clinical tasks across six capability tiers spanning text and imaging. The authors find that these models excel at medical knowledge questions and report extraction, operating in under half a second and for a few joules per decision, but they fall sharply on clinical judgement and volumetric imaging tasks. The results map a clear capability gradient and make a pragmatic case for where fast, cheap decision models can fit into clinical workflows.

Global AUC can hide regions where a classifier discriminates poorly, which is dangerous in high-stakes clinical risk stratification. This paper introduces LOCATOR, a method that computes a localized AUC ($\mathrm{LAUC}$) for each participant by weighting all event–non-event pairs by Gower-distance similarity, then trains an XGBoost regressor on $\logit(\mathrm{LAUC})$ from baseline covariates to flag high- and low-competence regions without subsetting the data. The authors derive asymptotic properties of the $\mathrm{LAUC}$ estimator and apply the framework to the guideline-endorsed PREVENT model in NHANES, with external validation in UK Biobank.

Classical analyses of the Unadjusted Langevin Algorithm (ULA) in Wasserstein-2 distance predict a dimension-dependent mixing time and bias, yet empirically ULA often estimates low-dimensional statistical functionals accurately without scaling the step size with dimension. This paper proposes using the subspace robust Wasserstein (SRW) distance to analyze ULA on ridge-separable Bayesian posteriors, proving that iteration complexity can be dimension-free in both the overparameterized regime ($N \lesssim d$) and the large-sample regime ($N \gtrsim d^2$), while showing such guarantees are impossible near the proportional regime $N \asymp d$. The results explain a bell-shaped bias profile and provide a rotationally invariant alternative to prior $\ell^\infty$-based dimension-free analyses that fail under isotropy.

This paper attacks a foundational weakness in RL evaluation: standard benchmarks rank algorithms by relative return without knowing the optimal policy, so they cannot measure true distance to optimality. The authors propose converse optimality, a construction that generates control tasks together with certified optimal value functions and policies, enabling absolute metrics like optimality gap and regret. The framework separates continuous-time sensitivity studies from native discrete-time oracle-referenced comparisons, and extends the certificate logic to non-smooth values, non-affine action interfaces, and partially observed settings. By turning benchmarks into known-answer instruments, the work promises to expose failure modes and regime dependencies that relative rankings completely hide.

Coding agents typically retrieve skills before execution but rarely choose at runtime whether to invoke coarse macro skills or fine-grained primitives. This paper reframes skill use as a runtime control problem, introducing Adaptive Skill Granularity: a decision-tree router selects micro, macro, or hybrid execution, and a finite-state executor downgrades from macro to micro after observable failures. The framework matters because it shifts skill libraries from static documents into controllable, verifiable execution abstractions that can trade off efficiency against robustness.

Gandalf tackles SSD wear-out in LLM serving systems that offload ever-growing KV caches beyond GPU and host memory. The core idea is that hybrid attention architectures (full plus linear/sparse) generate KV states with predictably different reuse lifetimes, so preferring SSD placement for long-lived full-attention KV while keeping short-lived linear states in DRAM can slash write volume without sacrificing cache hits. The paper claims average 7.3x lifetime extensions on trace-driven simulation, which matters because production agentic workloads can exhaust enterprise SSDs in months.

Machine learning for atomistic materials discovery is often bottlenecked by the cost of generating density functional theory (DFT) training data for new chemical systems. PYTHIA attacks this by freezing a pretrained MACE foundation model, adapting its atomic features through a lightweight Transformer, and feeding the result into a Gaussian Process that both predicts adsorption energies and quantifies uncertainty for Bayesian Optimization. The framework is designed to make complex architectures usable on small DFT datasets, enabling simultaneous optimization of adsorbate placement and substrate defects in understudied materials.

DLoss tackles objective misalignment in radiology report generation: standard cross-entropy treats diagnostic and narrative tokens identically, so models can sound fluent while omitting critical findings or inserting false ones. The core idea is to pool decoder probabilities across sequence positions with different operators—noisy-OR for supported diagnoses and tempered log-sum-exp for unsupported ones—and add this as an auxiliary loss without changing architecture or inference. Evaluated across six 3D MedVLMs on ~50,000 abdominal CT scans, DLoss improves clinical metrics on most benchmarks, though gains vary widely by backbone.

Continuous-time linear SDEs provide a natural model for interacting dynamical systems, but recovering causal drift coefficients from equilibrium data is difficult when reciprocal interactions (directed 2-cycles) or latent variables are present. This paper establishes new graphical sufficient conditions for generic identifiability of the drift matrix from stationary covariance in non-simple graphs, and develops an instrumental-variable framework to identify target direct effects under latent confounding. Both contributions extend the rank-based algebraic approach of Dettling et al. (2023) to settings previously unexplored for stationary linear SDEs.

Next-event prediction in sequential data is usually handled by opaque neural networks, while existing symbolic rule methods lack a principled way to form a unified predictive model. This paper introduces Rules, a neuro-symbolic network that learns Temporal Conjunctive Prediction Rules via differentiable temperature annealing, and Runes, which adds a residual transformer to correct rule-based logit predictions. It matters because it offers an explicit accuracy-interpretability trade-off, producing compact, inspectable symbolic rules for safety-sensitive domains while remaining competitive with black-box transformers.

Random projections (RP) offer a powerful way to reduce the $O(n^3)$ cost of kernel spectral algorithms, but existing theory has largely been confined to well-specified settings or narrow mis-specified regimes under restrictive boundedness assumptions. This paper establishes high-probability minimax optimal learning rates in Sobolev norms for RP-based spectral algorithms under general source conditions and a Bernstein noise condition, without assuming uniform boundedness of the regression function $f_\rho$. By exploiting the RKHS embedding property and a refined operator similarity analysis, the authors enlarge the optimal source range from $s \geq 1 - 1/\beta$ to $s > \alpha_0 - 1/\beta$, showing that projection dimensions proportional to the effective dimension preserve statistical efficiency while yielding substantial computational savings.

Federated clustering under non-IID data must minimize communication rounds while preventing leakage of local data properties. This paper proposes Evolving Federated Density Peak Clustering (eFDPC), where each client incrementally learns diagonal-covariance Gaussian micro-clusters from private mini-batches, selects local density peaks, and transmits masked peaks through a shuffler-based anonymization layer. A server-side second density-peak step reconstructs unlinkable global centers from additive shares, aiming for accurate one-shot clustering without centralizing raw samples.

Training-free generalist graph anomaly detection must identify heterogeneous anomalies on unseen graphs without target-domain labels. Jev-GAD addresses this by extracting structural, attribute, and neighborhood evidence, converting it into graph-relative percentiles $e_j(v)=\mathcal{R}_G(\delta_j(v))$, and packaging selected evidence into semantically labeled decision states for a frozen pretrained language model. The model returns anomaly scores via non-generative option-logit readout $s_{\mathrm{dec}}(v)=\sigma(\ell_v^a-\ell_v^n)$, which are then fused with four complementary statistical scorers through equal-weight rank normalization. While the multi-view evidence design is principled, the paper hinges on a costly, manually engineered LLM interface and reports gains that sit atop an unstable baseline landscape.

PAIR tackles a fundamental mismatch in professional network retrieval: relevance is complementary rather than symmetric. LinkedIn proposes a triple-tower retrieval framework that learns from exposure-conditioned preference signals via a multi-negative contrastive objective, combines static profile embeddings with lightweight dynamic history updates in embedding space, and supports multiple serving budgets through Matryoshka training. The work matters because demonstrated retrieval gains translated into real business impact at billion-user scale.

This paper introduces a continuous-time linear-quadratic model of open-loop target pursuit to study how agents learn interception strategies. It derives exact closed-form solutions for optimal control trajectories, REINFORCE policy learning dynamics, and temporal-difference value learning dynamics. The central finding is that the eigenvalue spectrum of the learning dynamics matrix generically displays a gap, meaning agents learn to reach the target before optimizing their movement path. The results offer a rigorous theoretical benchmark for pursuit behavior and its learning dynamics.

Inside-JEPA tackles the opacity of latent world models by embedding relational channels for ordered entity pairs directly into the JEPA latent state. The core idea is that an inverse-dynamics loss—recovering actions from changes in these channels—can ground them to geometric relations without any relation labels during training. This matters because it could let world-model states be read and given goals in relational terms, the natural vocabulary for planning and manipulation.

Test-time scaling generates many candidate reasoning traces, but completing all of them is prohibitively expensive. This paper proposes PKTP, a pruning framework that selects a subset of partial rollouts to maximize the probability that at least one of them ultimately succeeds—i.e., $\text{pass}@k$. It models joint correctness with a latent Gaussian threshold model, derives a closed-form submodular surrogate, and greedily selects the kept set with a $(1-1/e)$ approximation guarantee. The work matters because it directly exposes and optimizes the quality–diversity trade-off that existing pruning methods handle only indirectly.

Masked diffusion language models generate tokens in parallel, but their efficiency depends critically on which predictions are committed at each step. This paper disentangles the design space of learned unmasking policies by treating them as distilled teachers and independently varying supervision targets, training states, and policy inputs. The authors find that trajectory-contraction labels and a confidence-plus-hidden-state input yield a lightweight policy that improves the accuracy–NFE frontier and end-to-end throughput once NFE drops by about 10%.