The paper introduces a Physics Informed Recurrent Neural Network (PIRNN) that simultaneously predicts target time series and unobservable intermediate physical variables, enhancing robustness and interpretability. It adapts to any physical model with multiple equations and variables, demonstrated on groundwater level predictions using the Gardenia model. Experiments on twelve real‑world datasets show PIRNN outperforming several neural network baselines and the Gardenia model, with an ablation study confirming the value of physical knowledge.
By Etienne Lehembre (CA, LIFO), Pascal Audigane (BRGM), Vincent Nguyen (LIFO), Christel Vrain (LIFO, CA), Thi-Bich-Hanh Dao (LIFO, CA)
The paper introduces FCA‑Guided Counterfactual (FCA‑CF) explanations for multi‑modal breast cancer diagnosis, leveraging a Formal Concept Analysis lattice as a hard structural constraint to search for counterfactuals. On the TCGA‑BRCA dataset, FCA‑CF achieves perfect validity (100% prediction flips), the lowest average feature changes (2.37), and competitive proximity (0.900) compared to four other methods. Ablation studies show the lattice constraint drives sparsity, while a greedy refinement phase further improves results.
By Abdullahi Isa, Souley Boukari, Muhammad Aliyu
The paper introduces the Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling (MSABL/MSCABL) problems, which fix a minimum (cyclic) distance between adjacent vertex labels and aim to minimize the overall label span. A unified Boolean Satisfiability (SAT) framework is developed, formulating the problems as a sequence of decision problems and exploiting monotonicity to accelerate search. Two SAT solving strategies—parallel and incremental—are evaluated on benchmark instances from the Harwell‑Boeing Sparse Matrix Collection and compared with commercial solvers, showing that SAT-based approaches are highly competitive, with the parallel method best for MSCABL and the incremental method best for MSABL.
By Hieu Truong Xuan, Khanh To Van
JEPA-WAM enhances World Action Models (WAMs) by pairing text instructions with stochastically generated visual cues, using a text-to-image generator and a frozen V‑JEPA encoder to create dense goal representations. These representations are compressed into goal tokens that condition both video and action experts via cross‑attention, enabling the model to better ground instructions. On a new real‑robot benchmark, JEPA‑WAM attains 87.3%, 74.5%, and 80.9% success rates across in‑distribution, out‑of‑distribution scenes, and out‑of‑distribution instructions, outperforming prior methods by significant margins.
By Tianbin Liu, Jian Zhu, Taiyi Su, Jianjun Zhang, Chong Ma, Zitai Huang, Yi Xu
NeuSOGA3D is a hybrid neuro‑symbolic framework that reconstructs 3D geometry from unorganized point clouds by combining learned perceptual priors with explicit symbolic geometric reasoning. It projects point clouds onto orthographic planes, builds symbolic implicit spline representations, and fuses them via shape‑preserving constructive solid geometry to produce a coarse visual hull. Additional detail is added through cross‑sectional decomposition and volumetric reconstruction with Partial Shape‑Preserving Splines, yielding CAD‑compatible, structurally meaningful models across all 40 ModelNet40 categories.
By Qingde Li, Qingqi Hong, Zihan Li, Jie Tian
The paper proposes a two‑stage learning framework for multi‑organ segmentation that handles partially annotated datasets and domain shifts. First, the model learns accurate segmentations from available annotations to build robust feature representations. Second, it introduces learnable organ prototypes and a Sinkhorn‑triplet loss to enforce organ‑wise feature consistency across datasets, keeping embeddings of the same organ close while separating different organs, even when annotations are missing.
By Dakini Mallam Garba, Salim Abdou Daoura
The paper proposes a layer-wise curriculum learning strategy for compressing large language models (LLMs). By partitioning the model into layer segments and starting training with easier tasks before progressing to harder ones, the method accelerates convergence and stabilizes knowledge transfer from teacher to student models. Additional techniques such as feature caching with multi-threading improve GPU utilization, leading to state‑of‑the‑art compression results and over 50% reductions in memory usage and training time on BERT and GPT‑2, while outperforming other pruning methods on LLaMA‑family and Qwen models.
By Donggeon Lee, Dooyeon Na, Seungmin Oh, Jongbin Ryu
The paper investigates whether open‑source Vision‑Language Models (VLMs) can perform zero‑shot action quality assessment (AQA) on Olympic diving videos. Using the AQA‑7 benchmark, the authors propose a regression framework that combines VLM‑generated semantic reasoning, phase‑level sub‑scores, TF‑IDF vectorization, dimensionality reduction, and ensemble learning to predict final competition scores. While individual VLMs achieve moderate Spearman correlations (<0.32), the ensemble approach boosts performance to 0.67, demonstrating that VLM‑derived textual reasoning features are more informative than raw numerical sub‑scores for AQA.
whyItMatters":"The study shows that VLMs can serve as explainable, semi‑automated tools for evaluating sports performance, potentially aiding expert judging in complex, subjective Olympic events."
By Henry O. Velesaca, David Freire-Obregon, Luigi Miranda, Abel Reyes-Angulo
The paper introduces probe guidance, a technique that leverages frozen internal states of a diffusion model to generate a guidance signal without requiring an extra forward pass during inference. This method improves continuous diffusion language models, achieving state‑of‑the‑art results on unconditional generation and enhancing performance on multiple‑choice question answering for a 1.7B model. The authors also use probes to analyze autoguidance, revealing that the weak model must originate from a low‑entropy training region to align dynamics with the strong model.
By Rohit Dilip, Tianrong Chen, Yuyang Wang, David Van Valen, Joshua Susskind, Miguel Angel Bautista
DeltaSelect is an open‑source method that selects a small, cost‑effective set of tasks for A/B testing coding agents, using Pearson correlation to identify tasks whose single‑run results reliably reflect full‑benchmark performance. It maps fractional verifier outputs to a common score via linear regression and operates within a specified dollar budget, making it suitable for repeated baseline‑versus‑candidate comparisons during development rather than for model ranking. In a case study with gpt‑5.6‑luna, DeltaSelect reduced costs by 58.1% and improved calibrated scores across 13 evaluations.
By Nicholas J. Conn
This reproducibility study confirms that incorporating generated natural‑language user profiles into recommender systems enhances transparency and allows users to directly intervene by correcting preferences or addressing cold‑start issues. The authors replicated the original findings and extended the evaluation with context ablation, multi‑seed stability tests, and mechanistic interpretability analysis using nnsight. Their results show that while perturbing profiles shifts predicted ratings uniformly across genres, the overall rankings remain unchanged, attributing this to the rating‑regression objective rather than the profile interface.
By Noah Mami\'e, Laurin van den Bergh
Zarya is a hybrid language model that jointly trains an autoregressive objective and a masked-diffusion objective within a single architecture. It structures training data into variable-size slots and uses a curriculum that gradually increases slot granularity, allowing a smooth transition from fine-grained AR learning to coarse-grained diffusion learning. At inference, Zarya offers two decoding modes—MDM sampling with first-hitting denoising and slotted speculative decoding that interleaves diffusion-based selection with autoregressive infilling—while fully decoupling training and inference regimes and supporting extensive configurability.
By Leonid Sinev, Ilya Koziev, Vladislav Leshchuk
AVTrace is a diagnostic suite designed to evaluate audio‑visual temporal reasoning in omni models. It covers tasks such as onset and span grounding, synchronization, next‑step prediction, cross‑modal localization, chain parsing, and event‑conditioned comprehension, providing 34,114 training examples and balanced development and test splits. Five open omni models were tested, all scoring below the majority‑label baseline on synchronization verification and showing low performance on chain parsing and event‑conditioned tasks, while parameter‑efficient temporal post‑training improved some metrics.
By Longyin Zhang, Parth Sakhare Mahendra, Chengwei Wei, Ning Zhang, Lim Ming Chong, Sirui He, Ai Ti Aw
The paper introduces Governance-as-Code (GaC), a framework that translates the EU AI Act’s technical requirements into 43 machine‑checkable acceptance criteria across six compliance modules. GaC runs within a CI/CD pipeline, producing Article‑indexed audit evidence and providing actual Rego policy code. The authors validate GaC on two enterprise deployments, showing it reproduces manual audit findings—including three penalty‑triggering violations—while reducing audit labor by about 75%.
By Rudrendu Kumar Paul, Sourav Nandy
QUALS is a large‑scale time‑series corpus equilibrium framework designed to improve data efficiency for zero‑shot forecasting. It uses pattern quantization to decode heterogeneous patterns from mixed corpora and a learnability synchronization mechanism to calibrate sampling weights, bridging the optimization gap between simple and complex motifs. Benchmarks show that pre‑training on QUALS yields superior zero‑shot performance even with reduced training budgets.
By Yujie Li, Zezhi Shao, Chengqing Yu, Yisong Fu, Weijie Zhu, Yifan Du, Jilin Hu, Bin Yang, Yongjun Xu, Fei Wang
The paper investigates whether training classical machine learning models remains worthwhile when large language models (LLMs) can label tabular data without training. By defining a labeled‑data crossover point (N*) where a trained classical model surpasses a frozen LLM’s flat error, the authors analyze 126 student evaluations of GPT models across 18 datasets and compare them to power‑law learning curves of six classical model families. Results show that in 86% of cases a classical model outperforms the LLM with no more labeled data than already available, and the crossover occurs at a median of about 6% of the training set, suggesting that collecting a few hundred labels and training a gradient‑boosted model is typically advantageous.
By Kaihua Ding
The paper introduces prediction‑powered smoothing (PP‑S) and its taxonomy‑aware extension (PP‑TS) to improve point and interval estimates of domain‑specific AI performance when only a limited sample of labeled units is available. It also proposes a new design‑based cross‑validation score that is approximately unbiased for selecting between direct and smoothed estimators. Experiments on a curated benchmark and real‑world agent traffic show that the proposed methods outperform direct estimators in both accuracy and coverage, and that the new score matches the performance of an independent validation sample while providing more precise error estimates.
By Sho Kawano, Zehang Richard Li, Paul A. Parker
TripScore is a benchmark and evaluation framework for large language models (LLMs) in travel planning, built from real user logs and calibrated with 1,468 pairwise judgments from 203 travel experts. It uses a hierarchical feasibility gate for format and commonsense checks, and a unified point-wise reward that combines soft quality and preference fulfillment. Experiments show that reinforcement learning fine‑tuning, such as GRPO, consistently outperforms other methods when evaluated with TripScore.
By Yincen Qu, Huan Xiao, Feng Li, Gregory Li, Hui Zhou, Xiangying Dai, Xiaoru Dai, Xuan Huang
The paper introduces SafeHarness, an obstacle‑aware framework that improves the safety of coding agents for robot manipulation. By decomposing tasks into route planning and contact execution, the harness enables the agent to prioritize collision avoidance, achieving 71.9% task success and 87.5% collision avoidance—significantly better than prior methods. The study demonstrates that safety constraints can be effectively integrated into language‑model‑driven robot controllers.
By Bingxin Xu, Yuzhang Shang, Zhen Dong, Emilio Ferrara
The paper introduces a method for selecting the best vision‑language model for a downstream task by analyzing the internal dynamics of the visual encoder. It represents each task with layer‑wise conductance and uses an entropy‑regularized alignment to derive a target‑conditioned block importance distribution. The proposed Directional Conductance Divergence (DCD) metric captures asymmetric transferability, enabling accurate prediction of model rankings without direct inference, and achieves a 14.7% NDCG@5 improvement over SWAB on 48 VLMs across 21 datasets.
By Wei Yang, Hong Xie, Tao Tan, Xin Li, Defu Lian, Enhong Chen