This study evaluates the classification accuracy of six modern deep‑learning architectures—VGG19, ResNet50, GoogleNet, ConvNeXt, EfficientNet, and Vision Transformers—on breast ultrasound images categorized by BI‑RADS. Using 2,945 training images and 936 validation images from 1,540 patients, the models were tested in full fine‑tuning, linear evaluation, and training‑from‑scratch settings. The best performance was achieved with full fine‑tuning, yielding 76.39 % accuracy and a 67.94 % F1 score.
By Malitha Gunawardhana, Norbert Zolek
CoMa introduces a contextual massing generation framework that leverages vision‑language models to produce building massings that fit a target parcel and align with surrounding urban morphology. The study uses a dataset of 12,845 Melbourne massings, incorporating parcel contours, 3D geometry, neighboring buildings, and multi‑view images, and proposes a learned relevance metric to assess morphological compatibility. Experiments with Qwen3‑VL models show that larger model size improves generation quality, multimodal training enhances the use of individual modalities, and multimodal inference yields a stronger contextual signal than isolated inputs.
By Evgenii Maslov, Alexandra Vabnits, Vladimir Vorona, Anastasia Antsiferova, Valentin Khrulkov, Anastasia Volkova, Anton Gusarov, Andrey Kuznetsov, Ivan Oseledets
The paper investigates how the choice of the π parameter in λπ norm-constrained adversarial attacks influences the sparsity and smoothness of the perturbations. By applying two established sparsity metrics and introducing three new smoothness measures—including one based on first-order Taylor approximations—the authors perform extensive experiments on real-world image datasets and various neural network architectures. Their results indicate that λρ norms with π values between 1.3 and 1.5 consistently provide the best balance between sparsity and smoothness, challenging the common use of λ1 or λ2 norms.
By Christof Duhme, Florian Eilers, Xiaoyi Jiang
The paper introduces Block Parallelism (BP) and Context‑Sharded Block Parallelism (CSBP) to improve training efficiency for Block Diffusion Language Models (BDLMs) with long contexts. By assigning each corrupted‑block computation to a separate rank and sharding the shared clean sequence, CSBP reduces communication overhead and memory usage while preserving training semantics. Experiments on 16 H200 GPUs and 8 H100 GPUs show throughput gains of up to 1.61× and 7.59×, respectively, and higher benchmark pass rates in practical fine‑tuning scenarios.
By Tarun Suresh, Pranshu Chaturvedi, Hangoo Kang, Parth Shroff, Ishan S. Khare, Hermann Kumbong, Azalia Mirhoseini
The paper evaluates twelve financial sentiment models—including dictionary-based methods, finance-specific transformers, and open-source large language models—using linguistic and economic validity criteria. General-purpose LLMs match finance-specific transformers in classification performance but do not yield stronger economic relationships. While several models correlate with earnings surprises, none shows a significant link to next‑day stock returns, and performance is strongest for large earnings beats or misses.
By Arslan Bisharat, Oudom Hean
QEncodeBench evaluates whether large language models can translate classical constraint problems into verified quantum phase oracles. The benchmark measures the correctness of generated circuits using an adversarial self‑validated verifier that checks full solution‑set equivalence while enforcing resource limits. Results show that models lacking a reasoning mode perform poorly, whereas enabling native reasoning improves accuracy tenfold; semantic errors dominate, and neuro‑symbolic pipelines close most gaps by delegating critical composition to deterministic procedures.
By Xujun Che, Hanhan Wu, Yuchen Yuan, Chenyang Yu
VákQA is a new Telugu spoken factoid question answering benchmark comprising 2,001 question‑answer pairs across six domains, 2.53 hours of speech audio, bilingual transcriptions, and human‑verified reference answers. The study validates automatic evaluation methods against human judgments, finding that Gemini-as-a-judge best approximates human ratings but is unevenly strict, while open‑weight judges tend to penalize correct Telugu answers that differ in surface form. Using this validated setup, the authors benchmark proprietary and open‑weight models, highlighting challenges such as cultural specificity lost in translation, phonetic confusions from speech input, and cascading ASR‑MT errors.
By Bhavana Akkiraju, Ravi Sastry Kolluru, Sri Charan D, Srihari Bandarupalli, Santosh Kesiraju, Anil Vuppala
The paper proposes a hierarchical architecture for long-horizon language‑model agents that must operate over days or weeks without forgetting. It introduces three key components: time‑scale levels that store bounded summaries, a clocked tick as the basic action unit, and cascaded intelligence that escalates tasks to more capable models only after review failures. A ten‑day experiment demonstrated that the agent maintained continuity across context resets, adapted its behavior based on early knowledge, and identified where learned components could be integrated.
By Erik Nijkamp, Anurag Koul, Egor Pakhomov, Bo Pang
The paper introduces a unified evaluation framework for assessing the trustworthiness of large language models, agentic AI, and multimodal systems. It connects output-level, trajectory-level, and cross-modal assessments across eight dimensions—capability, robustness, safety, fairness, transparency, governance, oversight, and efficiency—while preserving system-specific metrics and providing uncertainty estimates. A meta-evaluation layer checks the validity, reliability, and reproducibility of the evaluation itself, and the framework aligns with governance standards and regulatory requirements.
By Shaina Raza, Ahmed Y. Radwan, Imran Liaquat, Kathryn Hume
The paper examines when multi‑agent collaboration is beneficial versus single‑agent approaches. It finds that collaboration yields systematic advantages mainly in long‑horizon tasks with sparse dependencies, while single agents perform better in tightly coupled, sequential workflows. The authors introduce SAIGE, a lightweight multi‑agent mechanism that models collaboration as a dynamically evolving graph, and show that it balances context efficiency and task performance without always improving outcomes as more agents are added.
By Yishuo Yuan, Yibo Wu, Yihan Zhang, Minyuan Sun, Shenliang Li, Xinkai Ma, Yifan Li, Jiaheng Liu
The study shows that while large language model (LLM) annotations of stakeholder consultation submissions are highly reproducible (intraclass correlations > 0.99), they do not reliably capture the intended construct measured by structured survey responses. Divergence between LLM-inferred and survey measures varies by stakeholder group, with business associations expressing more AI risk concern in text than in surveys, and spatial autocorrelation indicates neighboring European countries share similar text-based stances. Despite these divergences, survey-reported concerns remain strongly linked to support for explainability across all levels of divergence.
By Veronika Batzdorfer (KIT), Carlo Romano Marcello Alessandro Santagiustina (ALMAnaCH, m\'edialab, Sciences Po)
SkillAA (Skill Abductive Attribution) is a structured skill‑optimization framework designed for frozen language models. It represents skill applicability, execution, and composition in a unified graph, enabling skill selection, attribution‑guided repair, and update validation within the same structure. By contrasting successful and failed executions, SkillAA routes candidate repairs to specific graph objects, updates only the selected local structure, and uses Local and Big Gates to screen candidate changes before commitment, achieving high performance on SearchQA, LiveMath, and DocVQA.
By Ziqiao Shang, Ling-Yue Ge, Lan-Zhe Guo
The paper addresses the lack of statistical validity in language‑model‑based network intrusion detection. It introduces traffic‑aware conformal prediction, which calibrates on attacker‑expected traffic to restore coverage guarantees, and further mitigates adaptive attacks by removing attacker‑controllable features, achieving exact pathwise coverage. Experiments on three benchmarks show that this approach maintains coverage while incurring a modest accuracy cost.
By Zhenpeng Li
The paper introduces Riemannian–Lorentz Parameter Fusion (RLPF), a method for merging a Vision Transformer and a state‑space model without gradient descent. RLPF aligns parameter groups by semantic role, projects them onto a common coordinate system, lifts selected coordinates to the Lorentz hyperboloid, computes a regularized geodesic barycenter, and decodes the result back into the two branches, with a learned gate combining their logits. The resulting fine‑tuned system achieves 82.37 % on CIFAR‑10, 75.04 % on Oxford‑IIIT Pet, and 78.58 % top‑1 accuracy on ImageNet‑1K, surpassing the best‑parent accuracies of 76.54 %, 71.42 %, and 76.42 % respectively.
By Badri N. Patro, Vijay S. Agneeswaran
The paper introduces SELF-INDEX, a framework that allows an information retrieval index to autonomously evolve without human intervention. Its Optimizer diagnoses retrieval shortcomings, selectively updates index keys, and validates changes before applying them. Additionally, a Query Simulator proactively explores new demands, enabling the index to improve beyond current queries and consistently outperform existing optimization methods across various corpora and retrievers.
By Sangam Lee, Wonjae Lee, Sunghwan Kim, Deogyong Kim, Jaehoon Kim, Daye Nam, SeongKu Kang, Dongha Lee
EPIG-Tree proposes a compute‑optimal branching strategy for gradient‑efficient reinforcement learning, arguing that branches should be placed where they most reduce policy‑gradient uncertainty per unit of compute. By deriving allocation laws from a law‑of‑total‑variance decomposition, the method introduces an EPIG‑Tree score that guides branch placement using already computed rollouts, estimating occupancy‑ and score‑weighted value uncertainty. Empirical results show EPIG‑Tree reduces gradient MSE in cloned‑state control, improves frozen‑LLM gradient calibration, and outperforms flat GRPO and entropy branching in both single‑turn math and multi‑turn Wordle tasks.
By Nikita Khomich, Leopold Hermansson, Ido Hakimi
Astronex-World 1.0 is an open, controllable video world‑model foundation that can generate future visual states from text prompts or initial images, supporting frame‑aligned camera trajectories, continuous actions, and text events during rollout. It offers both a bidirectional model for full‑context generation and a causal model with block‑causal attention, built on the Wan2.2‑TI2V‑5B prior, and achieves real‑time 832×480 video at 24 fps. The model was trained over five stages on two NVIDIA L20 GPUs, scores 73.5 on WBench Navi and 70.0 on WBench Full, and outperforms several larger competitors while providing interfaces for embodied intelligence and autonomous driving.
By Xin Zhou, Cong Miao
The paper introduces a discriminative adaptation for SpeechLLMs that reads the hidden state of the final prompt token via a simple classification head, enabling emotion recognition in a single forward pass without altering the backbone. This approach replaces the generative decoder, which can produce out‑of‑set labels and favor frequent classes, with a controlled comparison between generative and discriminative inference. Experiments on IEMOCAP show improved Macro F1 scores, elimination of hallucinations, and larger gains on realistic ASR transcripts, while revealing that emotion directions encode indirect associations reflecting web‑scale text biases.
By Hasindri Watawana, Sergio Burdisso, Esa\'u Villatoro-Tello, Manjunath K E, Kadri Hacioglu, Petr Motlicek, Andreas Stolcke
The paper introduces SCRR-Net, a scene-conditioned spatial relation routing framework designed to forecast urban cellular activity by jointly modeling heterogeneous spatiotemporal signals such as SMS usage, mobile network traffic, and call activity. SCRR-Net integrates a context encoder, a spatial graph expert routing module, a temporal Transformer encoder, and a task knowledge routing module, allowing urban contextual information to control spatial dependency selection and cross-task knowledge transfer. Experiments on Milano and Trento datasets show that SCRR-Net consistently outperforms competing methods across all three forecasting tasks while offering interpretable routing behaviors.
By Qingzhong Li, Jingye Lin, Hui Ma, Yajun Zhang, Xinjun Pei, Ming Yan, Fei Xing
The paper introduces AttnPrint, a white‑box fingerprinting method that extracts low‑frequency components of cross‑modal attention distributions to identify multimodal large language models (MLLMs). It also presents DistillTrace, a black‑box auditing tool that uses hypothesis testing of MLLM outputs to detect potential model infringement. Experiments on 154 model instances across 19 architectures show that AttnPrint effectively detects derivative models and remains robust to downstream modifications, while DistillTrace reveals distillation relationships under various techniques.
By Chao Huang, Meng Tong, Kejiang Chen