The latest AI news, in focus.

CHROMA-MILL: Joint Low-Light Enhancement and White Balance under Colored Illumination

arXiv:2611.04092v1 Announce Type: new Abstract: Capturing an image in a low-light environment produces a weak, noisy sensor signal. Low-light image enhancement (LLIE) aims to restore it. Auto white balance (AWB) is also required for every image, and the same noisy signal degrades its ability to infer the scene illuminant. LLIE is typically performed first, followed by AWB, but this strategy remains largely unexamined because existing low-light datasets span a narrow range of illuminants and lack illuminant ground truth for evaluating AWB. We address this with CHROMA-MILL, a RAW dataset of 50 scenes captured with a DSLR and smartphone under four calibrated illuminants at eleven intensity levels. Because light is additive, we blend these captures in the linear RAW domain to synthesize physically valid illuminant mixtures with exact chromaticity ground truth. Benchmarking on this data, we find joint correction is best, and introduce CTI-Retinexformer, which supervises an illumination map, a chromaticity prediction, and an illumination-invariant scene embedding, outperforming the best cascade by 0.7 dB PSNR$_L$ and 1.1 $\Delta E_{00}$.

Minimal Superior Penalties: Characterising and Calibrating Decision-Aware Proper Scoring Rules

arXiv:2611.03734v1 Announce Type: new Abstract: Training a classifier means letting a validation metric decide which model is kept and when training stops. A natural requirement on that metric is superiority: every correctly classified forecast should score better than every incorrectly classified one, however close the underlying probabilities are. Neither the Brier score nor the logarithmic score satisfies this on its own. We show that superiority is governed by the separation between two endpoints -- the supremum of the score on correct predictions and the infimum on incorrect predictions -- and derive both in closed form for each score. Their difference is the infimal penalty, the greatest lower bound on the penalty needed to restore superiority. Prior work restores superiority with a penalty calibrated from the first endpoint alone; for the Brier base, our infimal penalty is smaller than that published penalty by a factor ranging from 4.00 at three classes to 2.11 at twenty. We further embed the published and infimal penalties in a one-parameter family and show that, under a single-valued tie convention, every member of the family is strictly proper. In a pre-specified two-dataset case study, mean selected-model macro-F1 rises with the penalty in the reported ten-class regimes, though not distinguishably from noise once seed/selection-mode nesting is accounted for; a fifth regime at forty-seven classes does not reproduce even this descriptive pattern. The intended no-superiority baseline is algebraically a rescaling of the family under test, so the experiment cannot attribute the observed pattern specifically to superiority. When superiority itself is the objective, any penalty strictly above the infimal value suffices; choosing a larger penalty is a separate calibration trade-off rather than a requirement for the guarantee.

SSPE: Robust Sequential Staypoint Extraction in Degraded Trajectory Data

arXiv:2611.03737v1 Announce Type: new Abstract: Extracting semantically meaningful staypoints from raw trajectory streams is a foundational prerequisite for mobility analytics. However, real-world trajectory data is frequently degraded by severe spatial noise and protracted temporal dropouts. Classic threshold-based extraction methods, such as the widely adopted sliding-window algorithm, are highly sensitive to these anomalies, routinely fracturing continuous stationary episodes into disjointed fragments. To overcome this limitation, we propose the Sequential Staypoint Extraction (SSPE) algorithm. SSPE employs a resilient, state-driven architecture that replaces static spatial anchors with a dynamic centroid and introduces an $n$-step lookahead heuristic to structurally tolerate transient coordinate drift. Concurrently, it utilizes temporal bridging mechanisms to prevent artificial fragmentation during prolonged signal loss. Since optimal extraction parameters vary significantly across datasets, we further introduce a fully unsupervised, consensus-based parameter estimation framework. This framework derives baseline statistical scales directly from the raw trajectory data and identifies the optimal parameter configuration by maximizing structural agreement, thereby eliminating the reliance on annotated ground truth. We evaluate SSPE on the ExtraSensory dataset, a real-world mobility corpus with manually verified ground-truth staypoints, against the sliding-window implementation of Trackintel, one of the most widely adopted extraction baselines in the field. Empirical results demonstrate that SSPE achieves superior accuracy, yielding higher F1-scores while simultaneously improving computational efficiency over this standard.

Latent Cluster Separation as a Regularizer for Lifelong Anomaly Detection

arXiv:2611.03652v1 Announce Type: new Abstract: Lifelong (continual) anomaly detection systems must learn a sequence of tasks without forgetting how to recognize anomaly types seen earlier -- a property known as backward transfer. A common way to try to improve backward transfer is to reshape a model's internal representation around learnable concept centroids, typically coupled with a new way of scoring anomalies based on distance to those centroids. Because these two design choices are usually introduced together, it is unclear which one is actually responsible for any performance gain. In this paper, we unbundle the two mechanisms within a VAE-based lifelong anomaly detector and study them separately. We find that used purely as a training-time regularizer -- while leaving anomaly scoring unchanged -- latent cluster separation can improve detection quality and backward transfer, though whether it outperforms the alternative scoring approach depends on the dataset's underlying representation. Switching to distance-based scoring is instead where most of the instability commonly associated with this class of method actually originates; we identify and explain the underlying mechanism. This benefit depends on the dataset's underlying representation, and we report this as practical guidance for choosing between the two design choices, rather than as a list of caveats.

What Constitutes Food Similarity? Visual Representations and Retrieval in Indian Cuisine

arXiv:2610.37867v1 Announce Type: new Abstract: Food similarity underlies retrieval, recommendation, substitution, and other food computing tasks, yet food representations are typically evaluated by identity preservation. We ask what happens to food similarity beyond identity: how different visual representations organize foods into relational neighborhoods, what culinary relationships these neighborhoods reveal or obscure, and how consistently these structures emerge across representations. Indian cuisine provides a challenging setting in which visually similar foods may have different culinary identities, while foods within a culinary family can vary substantially in appearance. Using an expanded Khana dataset and seven pretrained visual representations spanning convolutional, transforme

DouBao’s PR team responds to the “150,000 extras fed into a model” rumor: The claim is seriously inaccurate.

Liu Xing, head of DouBao’s PR department, issued a statement debunking the rumor, stating that the claim “Hengdian has partnered with ByteDance to feed the portraits and voices of 150,000 extras into ByteDance’s large AI model” is seriously false. He explained that the real “Hengdian Film & TV AI Service Platform” aims to build public digital infrastructure, organizing on-site assets such as film studio locations into high-quality datasets. This helps production crews efficiently scout locations, prepare for shoots, and streamline filming, while also lowering the barrier for small and medium-sized film and TV companies to adopt AI, enabling more creators to produce quality work.

Structured Maps for Landmark-Based Route Instructions with LLMs

arXiv:2610.36582v1 Announce Type: new Abstract: To generate landmark-based route instructions, models must understand both map geometry and human landmark preferences. Although large language models (LLMs) show great abilities in language tasks, the best way to structure map data for these models is not yet established. This paper proposes a structured text representation for landmark selection tasks in route navigation, utilizing SVG format to encode spatial features. The structured text maintains a geometric connection with rendered map images, allowing language models to directly access spatial and semantic data. Using a new dataset created from human-written route descriptions and OpenStreetMap data, we evaluate models on two tasks: landmark selection at turns and around destinations.

CFBrainAug: Modularity-Induced Counterfactual Brain Network Augmentation for Interpretable fMRI-based Autism Diagnosis

arXiv:2610.32184v1 Announce Type: new Abstract: Machine learning on resting-state functional magnetic resonance imaging (rs-fMRI) brain networks is promising for diagnosing Autism Spectrum Disorder (ASD), but existing methods are prone to overfitting on limited training data, and their post-hoc statistical attribution offers limited clinical interpretability. We propose CFBrainAug, a counterfactual brain network learning framework that unifies data augmentation and counterfactual explanation by learning label-altered brain networks. Unlike conventional label-preserving augmentation, CFBrainAug first retrieves a label-opposite yet topologically similar candidate and then refines it under a module-number constraint. Jointly training on factual and counterfactual networks enriches the trainin

The study proposes a multimodal approach to predict the successful perception of dyadic conversations between individuals with and without autism.

A new study published on arXiv (ID 2610.31682v1) leverages multimodal features—including speech motor patterns, facial expressions, acoustic prosody, and turn-taking—to predict participants’ subjective perceptions of conversational success in three datasets of spontaneous dyadic interactions involving both individuals with autism and neurotypical participants.

Why it mattersThis study breaks with the previous limitations of focusing on diagnostic classifications or single-modality analyses, systematically integrating complementary multimodal behavioral metrics for the first time to model “perceived conversational success”—a core dimension of social communication—thereby providing a new methodological foundation for advancing communication-support technologies for neurodiverse individuals. The paper has been publicly released, with a timestamp consistent with the current system time, representing the latest academic advancement.

Research has released the Latin-specific language model LAMB, along with two new corpora: Acervus and Corpus Trinum.

On October 26, 2026, arXiv published the paper arXiv:2610.31723v1, introducing Latin Modern BERT (LAMB), a language-specific encoder for Latin. Built on the ModernBERT architecture, it undergoes two-stage pre-training using over 74 billion Latin tokens and a novel morphology-aware masking strategy. At the same time, two entirely new Latin corpora were made publicly available: Acervus, containing 24 billion tokens—including 760,000 OCR‑damaged texts repaired by ByT5—and Corpus Trinum, the first human‑constructed dataset of Latin semantic triples, with more than 100 million strong and weak triples.

Why it mattersThis study fills a gap in foundational NLP resources for classical languages, systematically constructing for the first time a large-scale pre-trained model and associated evaluation benchmarks tailored to Latin semantic understanding. Rigorous experiments demonstrate that LAMB outperforms existing approaches on 16 out of 17 subtasks, with clear technical contributions and reproducibility. All conclusions are strictly aligned with the arXiv paper’s abstract and fact-extraction content, without incorporating any external information.

The study uses the BabyView dataset to validate mechanisms of children’s cross-context word-meaning learning.

The paper (arXiv:2610.31842v1), published on October 26, 2026, trains a contrastive vision–language model using the BabyView corpus—comprising 2,441 hours of longitudinal first-person‑view video from 48 children—to examine the feasibility of the “cross-context learning” hypothesis in real‑world child experiences.

Why it mattersThe study is the first to systematically evaluate cross-context word-meaning learning on large-scale, naturalistic developmental data, revealing the critical role of pre-trained visual representations, the sparsity of learning signals, and the fundamental differences between model and child learning trajectories, thereby holding methodological significance for developmental cognitive modeling and AI language acquisition research.

StackGen3D: Stable 3D Block Stack Generation from Multiview Silhouettes

arXiv:2610.31803v1 Announce Type: new Abstract: Generating physically stable 3D structures from visual specifications requires resolving geometric ambiguity while accounting for physical interactions among objects. We present StackGen3D, a framework for generating stable block assemblies conditioned on a given block inventory and three orthographic silhouettes. Our approach consists of two stages. First, we develop a physics-informed graph neural network (PI-GNN) that models support relations between blocks and serves as a fast stability predictor for curating a diverse dataset of stable structures. Second, we train a conditional flow-matching model on this dataset to capture the multimodal distribution of block configurations consistent with the target silhouettes. At inference time, ligh

Research reveals that reward model scoring exhibits significant prompt dependency: pairwise evaluation fails to detect this bias.

An AI research paper published on arXiv on October 24, 2026, points out that current mainstream pairwise evaluation methods automatically cancel out the scoring components common to all responses under the same prompt, leaving a critical “prompt-level bias” in reward models unexamined. Using human ratings as a benchmark, the authors conducted an audit of 18 publicly available scorers and found that, on the HelpSteer2 dataset, 6 models exhibited 34%–64% of their rating variance attributable to the prompt itself—whereas human ratings show virtually no such phenomenon.

Why it mattersThe study highlights a long-overlooked fundamental flaw in the alignment process of large language models: reward model scores are heavily biased toward the prompt text rather than the actual quality of the response. Its methodology—human‑reference auditing, prompt substitution, and variance decomposition—is reproducible, and its conclusions are grounded in empirical analysis across multiple mainstream open-source scorers, offering direct implications for preference optimization, RLHF, and safety‑assessment practices.

WikiOriginQA released: A question-answering dataset for assessing cultural bias, automatically constructed based on the creation times of multilingual Wikipedia editions.

On October 24, 2026, the research team published a paper on arXiv (ID 2610.30677v1), introducing WikiOriginQA, a fully automated question-answering dataset that leverages the creation dates of Wikipedia editions in various languages to objectively characterize the origins of knowledge, with the aim of enhancing the scalability of cultural bias assessment.

Why it mattersThis study proposes a method for generating culturally grounded provenance data at scale across languages without manual annotation, and experimental results demonstrate that large language models exhibit systematic performance advantages on Anglophone cultural-related tasks, providing a new tool for the quantitative analysis of cultural bias.

AutoSynthData: Generating Training Data for Enterprise Agents

AutoSynthData: Generating Training Data for Enterprise Agents