# clustering

Clustering is a data-analysis technique that groups observations or variables into clusters based on similarity, using methods such as hierarchical clustering and k-means.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Coordinate Basis Linear Bandits with Sublinear Regret over Low-Rank Clusters

DevFeed: [Coordinate Basis Linear Bandits with Sublinear Regret over Low-Rank Clusters](<https://devfeed.tech/articles/coordinate-basis-linear-bandits-with-sublinear-regret-over-low-rank-clusters-145054.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25424>)

Author: Hantao Yang, Hong Xie, Defu Lian

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [approximation](<https://devfeed.tech/tags/approximation.md>), [arm](<https://devfeed.tech/tags/arm.md>), [bandits](<https://devfeed.tech/tags/bandits.md>), [basis](<https://devfeed.tech/tags/basis.md>), [cluster](<https://devfeed.tech/tags/cluster.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [costs](<https://devfeed.tech/tags/costs.md>), [covariance](<https://devfeed.tech/tags/covariance.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [dimension](<https://devfeed.tech/tags/dimension.md>), [effective](<https://devfeed.tech/tags/effective.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [feature](<https://devfeed.tech/tags/feature.md>), [fixed](<https://devfeed.tech/tags/fixed.md>), [full](<https://devfeed.tech/tags/full.md>), [linear](<https://devfeed.tech/tags/linear.md>), [low-rank](<https://devfeed.tech/tags/low-rank.md>)

### AI overview

The Coordinate Basis Linear Bandit (CBL) algorithm aims to reduce the per-round update cost of high-dimensional linear bandits while retaining sublinear regret when data have a heavy spectral tail. Unlike fixed-size matrix sketching methods such as SOFUL, which the abstract says may incur linear regret if the approximation rank is inadequate, CBL keeps an exact orthonormal basis for each cluster's column space and a low-dimensional coordinate representation, preserving full covariance information within clusters. It uses a sentinel for each cluster to handle switching. The stated update cost is O(\bar r²), where \bar r = min(r,l), r is the data's intrinsic rank, and l < d is a tunable rank bound.

### Source excerpt

arXiv:2611.25424v1 Announce Type: new Abstract: We study the problem of computational efficiency for linear bandits in high-dimensional settings with a finite arm set. In linear bandits, the increase in the dimension $d$ of the feature vectors leads to growing computational costs of $O(d^2)$ at each round of update. Traditional low-rank approximation methods such as SOFUL reduce computation via fixed-size matrix sketching, yet run the risk of incurring vacuous linear regret when the spectral tail of the data is heavy and the approximation rank is inadequately selected. To guarantee regret convergence and effectively reduce computational costs, we introduce a clustering mechanism and propose the Coordinate Basis Linear Bandit (CBL) algorithm. Our method preserves the full covariance information in each cluster by maintaining an exact orthonormal basis of the cluster's column space together with a low-dimensional coordinate representation, which guarantees robust sublinear regret without spectral-tail vulnerabilities. It performs cluster switching by assigning a sentinel for each cluster, and reduces per-round update computation to $O(\bar r^2)$ in the cluster's effective dimension $\bar r=\min(r,l)$, where $r$ is the intrinsic rank of the data and $l

## DSFlow: A Neuro-Symbolic Data Workflow Agent with Statistical Diagnostic Guardrails

DevFeed: [DSFlow: A Neuro-Symbolic Data Workflow Agent with Statistical Diagnostic Guardrails](<https://devfeed.tech/articles/dsflow-a-neuro-symbolic-data-workflow-agent-with-statistical-diagnostic-guardrails-145469.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25111>)

Author: Junfeng Nie, Xiaohui Chen

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Data Science](<https://devfeed.tech/topics/data-science.md>), [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [clustering](<https://devfeed.tech/topics/clustering.md>), [linear-regression](<https://devfeed.tech/topics/linear-regression.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [data](<https://devfeed.tech/tags/data.md>), [diagnostic](<https://devfeed.tech/tags/diagnostic.md>), [guardrails](<https://devfeed.tech/tags/guardrails.md>), [langgraph](<https://devfeed.tech/tags/langgraph.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [regression](<https://devfeed.tech/tags/regression.md>), [reports](<https://devfeed.tech/tags/reports.md>), [skills](<https://devfeed.tech/tags/skills.md>), [workflow](<https://devfeed.tech/tags/workflow.md>)

### AI overview

DSFlow combines reusable skills selected by an LLM with deterministic statistical checks to guide data-science workflows. Its symbolic validation can accept a proposed method, ask for clarification or replanning, override an unsuitable choice, or provide a safe fallback. Regression and clustering case studies show diagnostic evidence correcting method choices, with decisions recorded in auditable reports. The supplied text is an abstract and does not provide implementation details or case-study results.

### Source excerpt

arXiv:2611.25111v1 Announce Type: new Abstract: Data science workflows often require tools that presume non-trivial technical knowledge. Large language models (LLMs) reduce this barrier, but a gap remains between flexible general-purpose agents and statistically controlled pipelines. We introduce DSFlow, a LangGraph-based neuro-symbolic data-agent platform that combines reusable, LLM-selected skills with deterministic diagnostic guardrails. Skills provide extensible task knowledge. Symbolic validation can accept a proposed method, request clarification or replanning, override an unsuitable method, or supply a safe fallback. Regression and clustering case studies illustrate how DSFlow uses diagnostic evidence to correct method choices and documents those decisions in auditable reports.

## Fast and Memory-Light Evaluation of Density-Based Clusterings with the DISCO Index in R

DevFeed: [Fast and Memory-Light Evaluation of Density-Based Clusterings with the DISCO Index in R](<https://devfeed.tech/articles/fast-and-memory-light-evaluation-of-density-based-clusterings-with-the-disco-index-in-r-145010.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25114>)

Author: Amin Entezari

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [cluster](<https://devfeed.tech/tags/cluster.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [disco](<https://devfeed.tech/tags/disco.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [fast](<https://devfeed.tech/tags/fast.md>), [index](<https://devfeed.tech/tags/index.md>), [light](<https://devfeed.tech/tags/light.md>), [r](<https://devfeed.tech/tags/r.md>), [stat-co](<https://devfeed.tech/tags/stat-co.md>)

### AI overview

The discoCVI R package computes DISCO, a density-based clustering validity index that also evaluates noise labels and can compare clusterings or tune HDBSCAN parameters without ground truth. Version 0.2.0 derives the required quantities from the single-linkage merge tree of the mutual-reachability minimum spanning tree, reducing memory growth from quadratic to linear while retaining quadratic running time. It corrects singleton-cluster scores to match the published definition and agrees with the Python implementation within 3 x 10⁻¹³. Benchmarks report 23-138x speedups over the prior R version and 3-9x over the Python reference on the stated smaller datasets, with lower memory use; for 100,000 points, it takes about 50 seconds and under 200 MB.

### Source excerpt

arXiv:2611.25114v1 Announce Type: new Abstract: DISCO is a recent internal cluster validity index for density-based clustering that, unlike earlier indices, also evaluates the quality of noise labels. The discoCVI package makes DISCO available in R. This article describes the design of the package and a typical workflow, in which DISCO is used to compare clusterings and to choose the parameters of HDBSCAN without ground truth, followed by the implementation introduced in version 0.2.0. DISCO is defined through density-connectivity distances between all pairs of points, so direct implementations store several n-by-n matrices. We show that every quantity DISCO needs can be read off the single-linkage merge tree of the mutual-reachability minimum spanning tree, so that the index can be computed exactly with memory that grows linearly with the number of points, while the running time remains quadratic as in the original definition. The implementation is tested against the previous version, agrees with the original Python implementation to within $3 \times 10^{-13}$, and corrects the score of singleton clusters to match the published definition. In benchmarks, discoCVI is 23 to 138 times faster than its previous version for 500 to 4,000 points and 3 to 9 times faster than the Python reference for 500 to 8,000 points, using a fraction of the memory of both, and it scores 100,000 points in about 50 seconds with less than 200 MB of memory.

## SCAR: State-Space Compression for AI-Based Radio Resource Management of Vehicular Services

DevFeed: [SCAR: State-Space Compression for AI-Based Radio Resource Management of Vehicular Services](<https://devfeed.tech/articles/scar-state-space-compression-for-ai-based-radio-resource-management-of-vehicular-services-144855.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2508.06243>)

Author: Ioan-Sorin Comsa, Purav Shah, Karthik Vaidhyanathan, Deepak Gangadharan, Christof Imhof, Per Bergamin, Aryan Kaushik, Gabriel-Miro Muntean, Ramona Trestian

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [clustering](<https://devfeed.tech/topics/clustering.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [Compression](<https://devfeed.tech/topics/compression.md>), [World models](<https://devfeed.tech/topics/world-models.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [compression](<https://devfeed.tech/tags/compression.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ne](<https://devfeed.tech/tags/cs-ne.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [edge](<https://devfeed.tech/tags/edge.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [fairness](<https://devfeed.tech/tags/fairness.md>), [learning](<https://devfeed.tech/tags/learning.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [management](<https://devfeed.tech/tags/management.md>), [management-policies](<https://devfeed.tech/tags/management-policies.md>), [metrics](<https://devfeed.tech/tags/metrics.md>), [ml](<https://devfeed.tech/tags/ml.md>), [network](<https://devfeed.tech/tags/network.md>), [radio](<https://devfeed.tech/tags/radio.md>), [results](<https://devfeed.tech/tags/results.md>), [rl](<https://devfeed.tech/tags/rl.md>), [sast](<https://devfeed.tech/tags/sast.md>), [services](<https://devfeed.tech/tags/services.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [state-space](<https://devfeed.tech/tags/state-space.md>)

### AI overview

SCAR compresses high-dimensional vehicular network Channel Quality Indicator data into compact states for reinforcement-learning-based radio resource management. Its edge-assisted framework uses clustering and radial basis function networks to preserve information relevant to decisions, allowing policies to adjust the throughput-fairness trade-off against NGMN service-level fairness objectives. In simulations, compression raised average occupancy of the NGMN feasible region from 56.32% to 88.07% across ten RL algorithms, with the best configuration reaching 97.76%; the abstract reports limited throughput degradation and competitive computational overhead. SAST-based clustering reduced compression distortion by about 10% versus conventional K-means. These findings are simulation results, not evidence of deployment performance.

### Source excerpt

arXiv:2508.06243v3 Announce Type: replace Abstract: The increasing demand for connected vehicular services poses significant challenges for AI-based network and service management due to the high volume and rapid variability of network state information. Traditional management and control mechanisms struggle to scale when processing fine-grained metrics such as Channel Quality Indicators (CQIs) in dynamic vehicular environments. To address this challenge, we propose SCAR (State-Space Compression for AI-Based Radio Resource Management), an edge-assisted framework that abstracts high-dimensional CQI information into compact representations for AI-based management. SCAR employs machine-learning (ML)-based compression techniques, including clustering and radial basis function (RBF) networks, to reduce the dimensionality of CQI-derived state information while preserving essential features relevant to management decisions. The resulting compressed states are used to train reinforcement learning (RL)-based management policies that dynamically adapt the throughput-fairness trade-off according to service-level fairness objectives defined by the NGMN. Simulation results show that CQI compression improves average NGMN feasible-region occupancy from 56.32% to 88.07% across ten RL algorithms, reaching 97.76% for the best-performing RL configuration, with limited throughput degradation and competitive computational overhead. Furthermore, simulated annealing with stochastic tunneling (SAST)-based clustering reduces state compression distortion by approximately 10% compared with conventional K-means clustering. These results demonstrate SCAR's ability to provide compact state representations for RL-based network and service management while improving service-level fairness in dynamic vehicular systems.

## Enhancing Active Learning Performance with Initial Data Selection Based on Foundation Models

DevFeed: [Enhancing Active Learning Performance with Initial Data Selection Based on Foundation Models](<https://devfeed.tech/articles/enhancing-active-learning-performance-with-initial-data-selection-based-on-foundation-models-142789.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24384>)

Author: Mohammad Mirzaee, Mehrshad Fallah Estalkhzir, Mohammad Reza Mohammadi

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [clustering](<https://devfeed.tech/topics/clustering.md>), [image recognition](<https://devfeed.tech/topics/image-recognition.md>)

Tags: [clustering](<https://devfeed.tech/tags/clustering.md>), [consistency](<https://devfeed.tech/tags/consistency.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [data](<https://devfeed.tech/tags/data.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [detection](<https://devfeed.tech/tags/detection.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [framework](<https://devfeed.tech/tags/framework.md>), [image](<https://devfeed.tech/tags/image.md>), [labeling](<https://devfeed.tech/tags/labeling.md>), [learning](<https://devfeed.tech/tags/learning.md>), [model-performance](<https://devfeed.tech/tags/model-performance.md>), [object-detection](<https://devfeed.tech/tags/object-detection.md>), [performance](<https://devfeed.tech/tags/performance.md>), [pool](<https://devfeed.tech/tags/pool.md>), [resource](<https://devfeed.tech/tags/resource.md>), [results](<https://devfeed.tech/tags/results.md>), [robustness](<https://devfeed.tech/tags/robustness.md>), [sampling](<https://devfeed.tech/tags/sampling.md>)

### AI overview

The framework uses YOLO-World feature clustering and objectness scores to select and refine the initial labeled pool for active object detection, instead of uncertainty sampling in the first cycle; later cycles use consistency-based sampling. Evaluated on Aquarium and NWPU VHR-10, it reports an average 6.6% increase in image-based mAP50 on NWPU, while image refinement improves object-based evaluation by approximately 11%. The abstract also reports gains in model performance and labeling time, but does not quantify the latter.

### Source excerpt

arXiv:2611.24384v1 Announce Type: cross Abstract: In active object detection, selecting the initial labeled pool is essential, especially in complex datasets with expensive labeling and low resource budget. This study presents an active learning framework designed to optimize the initial training cycle of active learning for the object detection task. Our approach diverges from traditional methods by utilizing feature-based clustering from the YOLO-World model and refining images based on objectness scores rather than relying on uncertainty sampling in the initial cycle. This approach focuses on finding samples with various features and emphasizes training in areas where the foundation model is most confident. Doing so helps the model better understand different types of objects. For subsequent cycles, we employ a consistency-based sampling technique to maintain the robustness of the training process. To evaluate our method, we use two complex datasets called Aquarium and NWPU VHR-10, which are well known for their diverse object sizes and challenging conditions. In the NWPU dataset, our method increases mAP50 by an average of 6.6% in image-based evaluation. Moreover, the image refinement method shows an improvement of approximately 11% in object-based evaluation. The results show improvements in model performance and labeling time, demonstrating the advantages of using foundation models in early cycles of active learning. An implementation of the algorithm is available at https://github.com/Mhrshd-fllh/ALBoost-FM

## FairPGT: Partitioned Graph Transformers for Dual-Level Fair Graph Clustering

DevFeed: [FairPGT: Partitioned Graph Transformers for Dual-Level Fair Graph Clustering](<https://devfeed.tech/articles/fairpgt-partitioned-graph-transformers-for-dual-level-fair-graph-clustering-142683.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23631>)

Author: Siamak Ghodsi, Amjad Seyedi, Sahar Tahmasebi, Eirini Ntoutsi, S\\"oren Auer

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>), [Transformers](<https://devfeed.tech/topics/transformers.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>)

Tags: [attention](<https://devfeed.tech/tags/attention.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [bias](<https://devfeed.tech/tags/bias.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distillation](<https://devfeed.tech/tags/distillation.md>), [fairness](<https://devfeed.tech/tags/fairness.md>), [graph](<https://devfeed.tech/tags/graph.md>), [information](<https://devfeed.tech/tags/information.md>), [parity](<https://devfeed.tech/tags/parity.md>), [partitions](<https://devfeed.tech/tags/partitions.md>), [ratio](<https://devfeed.tech/tags/ratio.md>), [routing](<https://devfeed.tech/tags/routing.md>), [scalability](<https://devfeed.tech/tags/scalability.md>), [transformers](<https://devfeed.tech/tags/transformers.md>)

### AI overview

FairPGT combines partitioned graph attention with two fairness controls for graph clustering. It limits attention to METIS partitions linked by routing tokens, reducing quadratic attention cost by the number of partitions. A mutual-information term targets demographic parity in cluster assignments, while nCGAR-based self-distillation guides attention toward group neutrality; the authors prove a neutrality correction bound and a condition against overshooting. Across seven benchmarks, it reports the best clustering performance and statistical parity on the three largest graphs, with a statistical-parity gap about ten times lower than DMoN, and is Pareto-dominated on one dataset. In controlled stochastic block models with aligned communities and protected groups, it reaches 97% of a derived NMI upper bound for exactly fair clustering. The abstract also reports that either fairness control alone can leave a different failure: assignment fairness can make attention group-heterophilous, while attention fairness alone does not guarantee fair clusters.

### Source excerpt

arXiv:2611.23631v1 Announce Type: cross Abstract: Clustering on attributed graphs can produce demographically biased clusters, particularly when communities align with protected groups. Graph transformers can amplify this bias through same-group attention, while global attention limits scalability. We propose FairPGT, a partitioned graph transformer for fair graph clustering. FairPGT restricts attention to METIS partitions and connects them through routing tokens, which divides the quadratic cost of attention by the number of partitions. A graph-aware self-training target guides clustering, with a provably bounded deviation from the standard DEC target. Fairness is imposed at two levels: a mutual-information term promotes demographic parity in cluster assignments, while a normalized cross-group attention ratio (nCGAR) guides attention toward group neutrality through self-distillation. We prove that the nCGAR correction moves attention toward neutrality and establish a condition preventing overshooting. Across seven benchmarks, FairPGT achieves the best clustering performance and statistical parity on the three largest graphs (Credit, Pokec-n, Pokec-z), with a statistical-parity gap approximately ten times lower than DMoN, and is Pareto-dominated on only one dataset. On controlled stochastic block models, FairPGT attains 97% of the derived upper bound on NMI for exactly fair clustering when communities and protected groups coincide. These graphs further show that, under strong alignment, assignment-level fairness alone makes the attention group-heterophilous, whereas attention-level fairness alone improves neutrality without ensuring fair clusters. Code for reproducibility is available at https://github.com/SiamakGhodsi/FairPGT.

## What Is an Embedding? How AI Turns Meaning Into Numbers

DevFeed: [What Is an Embedding? How AI Turns Meaning Into Numbers](<https://devfeed.tech/articles/what-is-an-embedding-how-ai-turns-meaning-into-numbers-141932.md>)

Original publisher: [Read original article](<https://montecarlo.ai/blog-embedding>)

Author: Ruslan Sultanov

Published: 2026-11-18T18:58:12Z

Content type: article

Language: en

Sources: [Monte Carlo](<https://devfeed.tech/sources/monte-carlo.md>)

Topics: [vector embeddings in AI](<https://devfeed.tech/topics/vector-embeddings-in-ai.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [cosine similarity search](<https://devfeed.tech/topics/cosine-similarity-search.md>), [Data Quality](<https://devfeed.tech/topics/data-quality.md>), [AI Context Management](<https://devfeed.tech/topics/ai-context-management.md>), [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [agent-trust](<https://devfeed.tech/tags/agent-trust.md>), [agent-trust-glossary](<https://devfeed.tech/tags/agent-trust-glossary.md>), [ai](<https://devfeed.tech/tags/ai.md>), [cosine-similarity](<https://devfeed.tech/tags/cosine-similarity.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [embedding-model](<https://devfeed.tech/tags/embedding-model.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [embeddings-in-machine-learning](<https://devfeed.tech/tags/embeddings-in-machine-learning.md>), [embeddings-rag](<https://devfeed.tech/tags/embeddings-rag.md>), [glossary](<https://devfeed.tech/tags/glossary.md>), [meaning](<https://devfeed.tech/tags/meaning.md>), [text-embeddings](<https://devfeed.tech/tags/text-embeddings.md>), [vector-database](<https://devfeed.tech/tags/vector-database.md>), [vector-embeddings](<https://devfeed.tech/tags/vector-embeddings.md>), [what-is-an-embedding](<https://devfeed.tech/tags/what-is-an-embedding.md>)

### AI overview

Embeddings represent text, images, or other data as numeric vectors, placing semantically similar items near each other so systems can retrieve by meaning rather than exact wording. In a typical RAG pipeline, documents are split into chunks, embedded and indexed with metadata; a query is embedded to retrieve nearby passages for an LLM. Vectors are meaningful only within the model that produced them, and they become outdated when source content changes. Production reliability therefore depends on versioning vectors, re-embedding changed documents, removing deleted content, monitoring index freshness and evaluating and tracing retrieval. Stale or missing passages can lead an agent to give confident but outdated answers.

### Source excerpt

A customer types "can I send this back?" Your help center never uses that phrase. It talks about the "return window" and the "refund policy." Keyword search finds nothing. Yet a modern AI agent pulls up the right policy in milliseconds, because it isn't matching words. It's matching meaning. That's what embeddings do. This guide ...

## SIMQ: A Single Graph-based Index for Multi-Vector Query

DevFeed: [SIMQ: A Single Graph-based Index for Multi-Vector Query](<https://devfeed.tech/articles/simq-a-single-graph-based-index-for-multi-vector-query-140627.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22079>)

Author: Yifan Lu, Jiabao Jin, Xiaoyao Zhong, Peng Cheng, Xiangyu Wang, Haotian Li, Hua Chen, Junqing Chen, Wei Xi, Heng Tao Shen

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [ann](<https://devfeed.tech/topics/ann.md>), [clustering](<https://devfeed.tech/topics/clustering.md>), [Vectors & LLMs](<https://devfeed.tech/topics/vectors-llms.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [accelerated](<https://devfeed.tech/tags/accelerated.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [approximation](<https://devfeed.tech/tags/approximation.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [bottlenecks](<https://devfeed.tech/tags/bottlenecks.md>), [candidate](<https://devfeed.tech/tags/candidate.md>), [cluster](<https://devfeed.tech/tags/cluster.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [compression](<https://devfeed.tech/tags/compression.md>), [construction](<https://devfeed.tech/tags/construction.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [data](<https://devfeed.tech/tags/data.md>), [graph](<https://devfeed.tech/tags/graph.md>), [index](<https://devfeed.tech/tags/index.md>), [query](<https://devfeed.tech/tags/query.md>), [vector](<https://devfeed.tech/tags/vector.md>)

### AI overview

SIMQ approximates ColBERT-style MaxSim retrieval by grouping token vectors into fine-grained, data-aware clusters, indexing their centroids in one graph, and navigating that graph per query token. The approach avoids building a full centroid interaction matrix and does not require GPU acceleration for this search process; the index is independent of PLAID's residual representation. The paper's theoretical result is conditional on a manifold assumption and successful cell retrieval, under which data-aware partitioning has lower expected approximation error than data-oblivious partitioning. SIMQ+ adds count-based scoring and a dynamic candidate set to improve robustness across query conditions. Evaluation on five benchmarks compares recall, throughput, and construction time against several baselines, primarily on CPU; large-scale PLAID k-means centroids were built on a separate GPU machine. SIMQ is integrated into VSAG.

### Source excerpt

arXiv:2611.22079v1 Announce Type: cross Abstract: Multi-vector retrieval models such as ColBERT achieve state-of-the-art effectiveness by representing documents as sets of token-level vectors and scoring via MaxSim, but their high computational cost limits scalability to large corpora. Existing approximate methods face fundamental bottlenecks: centroid interaction matrix approaches require computing a full matrix at every query and rely on GPU-accelerated clustering, while data-oblivious compression methods yield unstable recall that requires repeated compensation. We propose SIMQ (Single graph Index for Multi-vector Query), a framework that bridges single-vector graph indices and multi-vector retrieval through data-aware sampling-based clustering and per-token graph navigation, simultaneously bypassing all aforementioned bottlenecks. SIMQ organizes all token vectors into fine-grained clusters via data-aware sampling, builds a single graph index over cluster centroids independently of PLAID's residual representation, and approximates the MaxSim score through per-token graph search without materializing any interaction matrix or relying on GPU acceleration. We provide theoretical analysis showing that, under a manifold assumption and successful cell retrieval, data-aware partitioning has a smaller expected approximation error than a data-oblivious partition. Building on this foundation, SIMQ+ further introduces count-based scoring and a dynamic candidate set to improve robustness across varying query conditions. Experiments on five benchmarks compare recall, throughput, and construction time against several baselines, primarily on CPU; large-scale PLAID k-means centroids are built on a separate GPU machine. SIMQ has been integrated into VSAG, an Ant Group's open-source vector search library.

## Two Counterexamples for e-means

DevFeed: [Two Counterexamples for e-means](<https://devfeed.tech/articles/two-counterexamples-for-e-means-141728.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22065>)

Author: Zhenisbek Assylbekov

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [cluster](<https://devfeed.tech/tags/cluster.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [learning](<https://devfeed.tech/tags/learning.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

The paper reports two counterexamples in which the published e-means recipe ends with higher loss than standard Lloyd k-means from identical initial centers. It highlights mass-based cluster revival: the authors say this step can destroy a global optimum and make the ratio of expected losses unbounded, even when seeding uses k-means++. The supplied text gives no construction details or broader evaluation.

### Source excerpt

arXiv:2611.22065v1 Announce Type: new Abstract: e-means (Bessa et al., 2026) combines exponential averaging and cluster revival. We give two counterexamples to its published recipe with higher final loss than standard k-means (Lloyd, 1982) from identical initial centers. Mass-based revival can destroy a global optimum and make the ratio of expected losses unbounded even with k-means++ seeding.

## Modeling Document and Section Hierarchies in Embedding Space

DevFeed: [Modeling Document and Section Hierarchies in Embedding Space](<https://devfeed.tech/articles/modeling-document-and-section-hierarchies-in-embedding-space-139942.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21980>)

Author: Kriste Krstovski, Sharyn O'Halloran, Kshitij Chandna

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [VAE](<https://devfeed.tech/topics/vae.md>), [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [clustering](<https://devfeed.tech/tags/clustering.md>), [coherent](<https://devfeed.tech/tags/coherent.md>), [company](<https://devfeed.tech/tags/company.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [discussion](<https://devfeed.tech/tags/discussion.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [domains](<https://devfeed.tech/tags/domains.md>), [embedded](<https://devfeed.tech/tags/embedded.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [flat](<https://devfeed.tech/tags/flat.md>), [forums](<https://devfeed.tech/tags/forums.md>), [government](<https://devfeed.tech/tags/government.md>), [inference](<https://devfeed.tech/tags/inference.md>), [legal](<https://devfeed.tech/tags/legal.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [models](<https://devfeed.tech/tags/models.md>), [performance](<https://devfeed.tech/tags/performance.md>), [perplexity](<https://devfeed.tech/tags/perplexity.md>), [quality](<https://devfeed.tech/tags/quality.md>), [reports](<https://devfeed.tech/tags/reports.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

The Hierarchical Embedded Topic Model (hETM) addresses the fact that flat embedded topic models assign one topic distribution to an entire document, overlooking distinct section topics. It couples document and section topic distributions through a hierarchical prior in embedding space and uses amortized variational inference. On structured collections of legal documents, reports and online discussions, hETM achieved the lowest or near-lowest held-out perplexity among flat and hierarchical baselines, with comparable or higher topic quality. It also had the best clustering performance on most collections.

### Source excerpt

arXiv:2611.21980v1 Announce Type: cross Abstract: Embedded topic models integrate word embeddings into the topic generation process, producing coherent topics and robust performance on large vocabularies. However, each document is represented by a single topic distribution, ignoring its internal structure. Many real world collections, including legal documents, company and government reports, and online discussion forums, exhibit hierarchical organization in which documents consist of multiple sections that often address distinct subtopics. We introduce the Hierarchical Embedded Topic Model (hETM), a structured topic model that couples the topic distribution of a document and those of its sections through a hierarchical prior in the embedding space. We derive an amortized variational inference procedure for hETM and evaluate it on structured collections from each of these domains. Experimental results show that hETM achieves the lowest or near-lowest held-out perplexity among flat and hierarchical topic model baselines, along with comparable or higher topic quality. It also performs strongly on a downstream clustering task, achieving the best clustering performance on most of the collections.

## When Does Discrete Ricci Curvature Help? An Edge-Level Analysis of Curvature-Enhanced GCNs for PPI Prediction

DevFeed: [When Does Discrete Ricci Curvature Help? An Edge-Level Analysis of Curvature-Enhanced GCNs for PPI Prediction](<https://devfeed.tech/articles/when-does-discrete-ricci-curvature-help-an-edge-level-analysis-of-curvature-enhanced-gcns-for-ppi-prediction-141685.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21849>)

Author: Clara Joswig, Elham Gholamzadeh, Ghazal Mostofi, Nico Scherf

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [communities](<https://devfeed.tech/tags/communities.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [edge](<https://devfeed.tech/tags/edge.md>), [graph](<https://devfeed.tech/tags/graph.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [protein](<https://devfeed.tech/tags/protein.md>)

### AI overview

Across four protein-protein interaction datasets, curvature-enhanced graph convolutional networks (CGCN) improve aggregate AUC, AUPR, and F1 over a standard GCN, but the gains are concentrated on low-degree edges. Performance on low-curvature bottleneck edges declines in three of four datasets, contrary to the proposed over-squashing explanation. The authors' analyses support an alternative account: curvature weighting sharpens cluster separation, helping within-cluster predictions while hurting predictions between clusters. Their guidance on choosing CGCN or a standard GCN depends on whether intra- or inter-cluster predictions matter more.

### Source excerpt

arXiv:2611.21849v1 Announce Type: new Abstract: Curvature-enhanced graph convolutional networks (CGCN) incorporate Ollivier-Ricci curvature (ORC), grounded in optimal transport theory, into message passing, motivated by the claim that curvature-weighted edges alleviate "over-squashing" at structural bottlenecks. But does CGCN's improvement actually come from mitigating over-squashing? We investigate this on four real-world protein-protein interaction (PPI) datasets, comparing CGCN against a standard GCN at the level of individual edges rather than aggregate metrics alone. While CGCN improves aggregate AUC, AUPR, and F1 across all four datasets, this gain is concentrated almost entirely on low-degree edges, while performance on low-curvature (bottleneck) edges systematically degrades in three of four datasets, the opposite of what the over-squashing motivation predicts. Examining the learned edge-weight function directly, together with clustering-validity metrics, edge-distance ratios, and a layer-depth ablation across four depths, we find evidence for an alternative account: curvature-weighting sharpens the separation between clusters, which improves intra-cluster predictions at the cost of inter-cluster (bottleneck) ones. We test this account against topologically defined communities rather than the classification labels used elsewhere. Additionally, we offer practical guidance on when to prefer CGCN over standard GCN, depending on whether intra- or inter-cluster predictions matter most.

## TabDAG: Structured Evolutionary Search for Tabular Feature Engineering

DevFeed: [TabDAG: Structured Evolutionary Search for Tabular Feature Engineering](<https://devfeed.tech/articles/tabdag-structured-evolutionary-search-for-tabular-feature-engineering-141811.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22828>)

Author: Anastasia Volkova (FusionBrain Lab), Andrey Kuznetsov (FusionBrain Lab), Ivan Oseledets (AXXX), Valentin Khrulkov (FusionBrain Lab, AXXX)

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [clustering](<https://devfeed.tech/topics/clustering.md>), [Structured-data](<https://devfeed.tech/topics/structured-data.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ne](<https://devfeed.tech/tags/cs-ne.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [feature-engineering](<https://devfeed.tech/tags/feature-engineering.md>), [graph](<https://devfeed.tech/tags/graph.md>), [performance](<https://devfeed.tech/tags/performance.md>), [search](<https://devfeed.tech/tags/search.md>), [structured](<https://devfeed.tech/tags/structured.md>)

### AI overview

TabDAG searches for tabular features by evolving executable dependency graphs: nodes represent row-wise or data-fitted transformations, and structured, schema-constrained edits build compositions such as interactions, encodings, and clustering or neighborhood features. In experiments on ten regression and classification datasets and three model families, evolved features improve performance over raw inputs. TabDAG and TabDAG combined with OpenFE have the best mean ranks among compared methods, though pairwise rank differences between feature-engineering methods do not survive multiple-testing correction. With the search engine, model backbone, and candidate budget held fixed, constrained graph edits produce fewer failed evaluations than free-form Python or whole-graph JSON rewrites. Structural checks prevent invalid programs from reaching evaluation, but proposals may be rejected and valid graphs can still fail at runtime.

### Source excerpt

arXiv:2611.22828v1 Announce Type: cross Abstract: Feature engineering can improve tabular prediction, but useful transformations are compositional, data-dependent, and subject to leakage constraints. We present TabDAG, a framework that combines evolutionary search with a graph representation of feature-engineering programs. Nodes implement row-wise or data-fitted transformations; edges encode dependencies among raw variables, intermediate values, and final features. The representation supports interactions, statistical encodings, clustering- and neighborhood-based features, and multi-stage compositions in a single executable program. Mutations are structured edits constrained by a parent-specific schema and checked before evaluation. In our experiments, no structurally invalid program reached evaluation, although proposals could be rejected and valid graphs could still fail at runtime. Across ten regression and classification datasets and three tabular model families, evolved features improve predictive performance over raw inputs. TabDAG and its combination with OpenFE achieve the two best mean ranks among the compared methods; pairwise rank differences between feature-engineering methods do not survive multiple-testing correction. The LLM-based searches use the same backbone and candidate-evaluation budget. A controlled ablation compares free-form Python, whole-graph JSON, and constrained graph edits with the search engine, budget, and backbone held fixed. Constrained edits yield fewer failed evaluations than either rewrite baseline. The resulting graphs expose the transformations and dependencies selected by search, enabling feature-level analysis of the observed gains.

## How Much Distribution Shift Can a Clustering Withstand? Exact Split and Merge Certificates for Structured Transports

DevFeed: [How Much Distribution Shift Can a Clustering Withstand? Exact Split and Merge Certificates for Structured Transports](<https://devfeed.tech/articles/how-much-distribution-shift-can-a-clustering-withstand-exact-split-and-merge-certificates-for-structured-transports-141717.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22000>)

Author: Alisina Bayati, Srinivasa Salapaka, Shahriar Talebi

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [applications](<https://devfeed.tech/tags/applications.md>), [certificates](<https://devfeed.tech/tags/certificates.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [machine](<https://devfeed.tech/tags/machine.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [merge](<https://devfeed.tech/tags/merge.md>), [robustness](<https://devfeed.tech/tags/robustness.md>), [sdp](<https://devfeed.tech/tags/sdp.md>), [shift](<https://devfeed.tech/tags/shift.md>), [split](<https://devfeed.tech/tags/split.md>), [structured](<https://devfeed.tech/tags/structured.md>)

### AI overview

The paper quantifies how much a clustering can shift before a cluster reaches a split or merge threshold. It defines these events using a local stability criterion based on deterministic annealing phase transitions. For shifts restricted to a prescribed subspace, it gives exact semidefinite programming reformulations for the smallest shifts that trigger each event; the split formulation uses only two scalar decision variables. The resulting split and merge radii combine into a certificate for the smallest structured shift that reaches any monitored threshold.

### Source excerpt

arXiv:2611.22000v1 Announce Type: new Abstract: In clustering, the distribution of the population being clustered is often uncertain or changes over time, so the true distribution may shift away from the nominal distribution used to form the clustering. Once the clustering is committed and each member is assigned to a cluster, such shifts may change the distribution of each cluster. They can make a cluster too spread out for one representative at a given resolution, motivating a split, or bring distinct clusters close enough to share a representative at that resolution, motivating a merge. We make these split and merge events precise using a local stability criterion built on the phase-transition analysis in deterministic annealing. This notion of stability enables us to quantify how robust a clustering is against such events. Furthermore, motivated by applications in which uncertainty and population change are structured, we study shifts whose displacements are restricted to a prescribed subspace. The smallest structured shifts that reach the respective thresholds define the split and merge radii, for which we obtain exact semidefinite programming (SDP) reformulations. The split SDP has only two scalar decision variables. These convex reformulations enable us to combine the radii into a robustness certificate for the full clustering that gives the size of the smallest structured shift that reaches any monitored split or merge threshold.

## Clustering in pure-attention hardmax transformers and its role in sentiment analysis

DevFeed: [Clustering in pure-attention hardmax transformers and its role in sentiment analysis](<https://devfeed.tech/articles/clustering-in-pure-attention-hardmax-transformers-and-its-role-in-sentiment-analysis-141515.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2407.01602>)

Author: Albert Alcalde, Giovanni Fantuzzi, Enrique Zuazua

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Transformer](<https://devfeed.tech/topics/transformer.md>), [clustering](<https://devfeed.tech/topics/clustering.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [model architecture](<https://devfeed.tech/topics/model-architecture.md>)

Tags: [attention](<https://devfeed.tech/tags/attention.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [math-ds](<https://devfeed.tech/tags/math-ds.md>), [sentiment-analysis](<https://devfeed.tech/tags/sentiment-analysis.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [transformers](<https://devfeed.tech/tags/transformers.md>)

### AI overview

For transformers with hardmax self-attention and normalization, the analysis treats layer-by-layer input evolution as a discrete-time dynamical system and proves that inputs converge asymptotically to clusters organized around special points called leaders. The authors use this account to build a fully interpretable sentiment-analysis transformer: less meaningful words cluster around leader words that carry more meaning, providing the model's account of context. The abstract says the work also outlines remaining challenges in connecting this mathematical analysis to real-world transformer implementation.

### Source excerpt

arXiv:2407.01602v3 Announce Type: replace-cross Abstract: Transformers are extremely successful machine learning models whose mathematical properties remain poorly understood. Here, we rigorously characterize the behavior of transformers with hardmax self-attention and normalization sublayers as the number of layers tends to infinity. By viewing such transformers as discrete-time dynamical systems describing the evolution of points in a Euclidean space, and thanks to a geometric interpretation of the self-attention mechanism based on hyperplane separation, we show that the transformer inputs asymptotically converge to a clustered equilibrium determined by special points called \textit{leaders}. We then leverage this theoretical understanding to solve sentiment analysis problems from language processing using a fully interpretable transformer model, which effectively captures `context' by clustering meaningless words around leader words carrying the most meaning. Finally, we outline remaining challenges to bridge the gap between the mathematical analysis of transformers and their real-life implementation.

## Integrating Latent Block Models into Variational Autoencoders for Disentangled Representation Learning

DevFeed: [Integrating Latent Block Models into Variational Autoencoders for Disentangled Representation Learning](<https://devfeed.tech/articles/integrating-latent-block-models-into-variational-autoencoders-for-disentangled-representation-learning-137552.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20253>)

Author: Anasse Essalih, Reda Khoufache, Laurent Durville, Mohamed-Cherif Rahal, Mustapha Lebbah, Hanene Azzag, Walid Kheriji, Fouad Hadj Selem

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [VAE](<https://devfeed.tech/topics/vae.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [autoencoders](<https://devfeed.tech/tags/autoencoders.md>), [block](<https://devfeed.tech/tags/block.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [dimensions](<https://devfeed.tech/tags/dimensions.md>), [framework](<https://devfeed.tech/tags/framework.md>), [groups](<https://devfeed.tech/tags/groups.md>), [inference](<https://devfeed.tech/tags/inference.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [representation-learning](<https://devfeed.tech/tags/representation-learning.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [structured](<https://devfeed.tech/tags/structured.md>)

### AI overview

LBM-VAE combines Latent Block Models with variational autoencoders to jointly cluster observations and latent dimensions. Its block-structured representation can encode factors of variation across groups of latent dimensions, rather than assigning each factor to a single dimension. The abstract reports promising clustering performance and competitive disentangled representation learning, but provides no experimental details or comparisons.

### Source excerpt

arXiv:2611.20253v1 Announce Type: cross Abstract: We introduce LBM-VAE, a novel framework that integrates Latent Block Models (LBMs) into Variational Autoencoders (VAEs) to jointly cluster observations and latent dimensions. Beyond its clustering capabilities, LBM-VAE provides a block-structured latent representation that naturally supports disentangled representation learning. In contrast to conventional approaches that associate each factor of variation with an individual latent dimension, our framework allows factors of variation to be encoded across groups of latent dimensions. Experimental results demonstrate the promising clustering performance of LBM-VAE, while achieving competitive results in disentangled representation learning. LBM-VAE highlights the potential of combining co-clustering and variational inference to learn structured and interpretable latent representations.

## UncertainGen: Scalable Uncertainty-Aware Representation Learning of DNA Sequences

DevFeed: [UncertainGen: Scalable Uncertainty-Aware Representation Learning of DNA Sequences](<https://devfeed.tech/articles/uncertaingen-scalable-uncertainty-aware-representation-learning-of-dna-sequences-138726.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2509.26116>)

Author: Abdulkadir Celikkanat, Andres R. Masegosa, Mads Albertsen, Thomas D. Nielsen

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [adaptive](<https://devfeed.tech/tags/adaptive.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [binning](<https://devfeed.tech/tags/binning.md>), [capture](<https://devfeed.tech/tags/capture.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [cs-ce](<https://devfeed.tech/tags/cs-ce.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [data-analysis](<https://devfeed.tech/tags/data-analysis.md>), [distributions](<https://devfeed.tech/tags/distributions.md>), [dna](<https://devfeed.tech/tags/dna.md>), [effective](<https://devfeed.tech/tags/effective.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [existing](<https://devfeed.tech/tags/existing.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [learning](<https://devfeed.tech/tags/learning.md>), [representation-learning](<https://devfeed.tech/tags/representation-learning.md>), [sequences](<https://devfeed.tech/tags/sequences.md>), [uncertainty](<https://devfeed.tech/tags/uncertainty.md>)

### AI overview

UncertainGen represents DNA sequences as probability distributions in a latent space, using embedding variance to capture positional ambiguity and increase when a sequence is compatible with multiple genomic clusters. The authors report theoretical guarantees on embedding distinguishability and a data-adaptive metric that expands the effective representational space. In metagenomic binning experiments, probabilistic embeddings reportedly outperform deterministic k-mer methods and large genome foundation models while remaining lightweight and efficient. The supplied text does not describe the model architecture, datasets, or quantitative results.

### Source excerpt

arXiv:2509.26116v2 Announce Type: replace Abstract: Learning effective representations of DNA sequences is fundamental to genomic data analysis, especially in the presence of high sequence similarity and inter-species DNA sharing. Existing approaches rely on deterministic embeddings, such as k-mer statistics or representations from large language models, which fail to capture the inherent uncertainty in short and ambiguous DNA fragments. We propose UncertainGen, a lightweight probabilistic representation learning framework that embeds DNA sequences as distributions in a latent space. The learned embedding variance captures positional ambiguity, increasing for sequences compatible with multiple genomic clusters. We establish theoretical guarantees on embedding distinguishability, and show that the probabilistic formulation induces a data-adaptive metric that expands the effective representational space. We evaluate UncertainGen in the metagenomic binning task to demonstrate the practical benefits of uncertainty-aware representations. Experiments show that probabilistic embeddings consistently outperform deterministic k-mer and large genome foundation models, while remaining lightweight and efficient.

## Clustering-Based Artificial Tree Ensembles for Random Forest Approximation

DevFeed: [Clustering-Based Artificial Tree Ensembles for Random Forest Approximation](<https://devfeed.tech/articles/clustering-based-artificial-tree-ensembles-for-random-forest-approximation-138790.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18803>)

Author: Lea L. Kronziel, Maren S. Wieder, Silke Szymczak, Bj\\"orn-Hergen Laabs

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [approximation](<https://devfeed.tech/tags/approximation.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [linear](<https://devfeed.tech/tags/linear.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [partitions](<https://devfeed.tech/tags/partitions.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [regression](<https://devfeed.tech/tags/regression.md>), [rf](<https://devfeed.tech/tags/rf.md>), [similarity](<https://devfeed.tech/tags/similarity.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [trees](<https://devfeed.tech/tags/trees.md>)

### AI overview

The study finds that larger representative tree ensembles generally improve random forest surrogate fidelity, prediction accuracy, and stability. In simulations, artificial representative tree (ART) ensembles have higher fidelity and often greater stability for small ensembles; similarity-based clustering generally improves ART fidelity over random tree partitions. On regression benchmarks, ensembles of top-ranked most representative trees (MRTs) generally achieve higher fidelity and prediction accuracy, while ART ensembles have fewer terminal nodes. ARTs may suit applications prioritizing compactness when their fidelity and accuracy meet requirements.

### Source excerpt

arXiv:2611.18803v1 Announce Type: new Abstract: Random Forests (RFs) offer strong prediction performance but are difficult to interpret. Most representative trees (MRTs) and artificial representative trees (ARTs) provide surrogate explanations, but a single tree may miss patterns within a forest. We investigate benefits and limitations of clustering-based representative tree ensembles for RF surrogate modeling and assess the contribution of similarity-based clustering relative to random tree partitions. Using linear and nonlinear simulations and regression benchmarks, we evaluate fidelity, prediction accuracy, complexity, and prediction stability against equally sized ensembles of top-ranked MRTs and randomly selected trees. Increasing ensemble size generally improves fidelity, accuracy, and prediction stability. ART ensembles show higher fidelity in simulations and often greater prediction stability for small ensembles. Compared with random tree partitions, similarity-based clustering generally improves ART fidelity in simulations and often on benchmarks. On benchmark datasets, MRT-based ensembles generally achieve higher fidelity and prediction accuracy, whereas ART ensembles have fewer terminal nodes. ART ensembles provide compact surrogates when reduced complexity matters and their fidelity and prediction accuracy meet application requirements. These findings clarify both the trade-offs of representative tree ensembles as RF surrogates and the contribution of similarity-based clustering beyond random clustering.

## Privacy-Preserving Clustering Algorithm and Parameter Selection for Collaborative Population Stratification Using Distributed PCA

DevFeed: [Privacy-Preserving Clustering Algorithm and Parameter Selection for Collaborative Population Stratification Using Distributed PCA](<https://devfeed.tech/articles/privacy-preserving-clustering-algorithm-and-parameter-selection-for-collaborative-population-stratification-using-distributed-pca-138805.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18925>)

Author: Maryam Ghasemian, Lynette Hammond Gerido, Erman Ayday

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>), [Differential Privacy](<https://devfeed.tech/topics/differential-privacy.md>), [Hyperparameter optimization](<https://devfeed.tech/topics/hyperparameter-optimization.md>)

Tags: [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [selection](<https://devfeed.tech/tags/selection.md>)

### AI overview

The framework selects clustering methods and hyperparameters from privacy-protected data for collaborative population stratification. Each party computes local top-r principal-component information; a server aggregates low-rank summaries to form a global basis without a public reference basis. It supports three locally differentially private pipelines: PCA then Noise, Noise then PCA, and Noise-Only. The server scores configurations with internal validation metrics on perturbed data, a post-processing step. Experiments on openSNP and 1000 Genomes report that PCA-based pipelines outperform Noise-Only in clustering utility, communication cost, and runtime, and have lower membership-inference attack power at small privacy budgets. These findings apply to the reported experimental setting.

### Source excerpt

arXiv:2611.18925v1 Announce Type: cross Abstract: We propose a privacy-preserving selection layer for collaborative population stratification workflows, enabling an honest-but-curious server to recommend a strong clustering algorithm-hyperparameter configuration from privacy protected shares. Instead of using a fixed workflow such as PCA followed by K-Means with a preset number of clusters, the framework compares multiple clustering methods and parameter settings under privacy constraints. To avoid relying on a public reference basis, we construct a shared low-dimensional representation through a distributed-PCA (DPCA) procedure in which each party computes local top-$r$ principal-component information and the server aggregates only low-rank summaries to recover a global basis. Building on this representation, the framework supports three LDP-protected pipelines: PCA then Noise, Noise then PCA, and Noise-Only. The server evaluates clustering methods and parameter settings using internal validation metrics and recommends a top-performing configuration from the perturbed data; this step is pure post-processing. Experiments on openSNP and 1000 Genomes show that the server-side selection layer reliably identifies strong settings from LDP-protected data. Across both datasets, the PCA-based pipelines outperform Noise-Only in clustering utility, communication cost, and runtime, and show lower membership-inference attack (MIA) power at small privacy budgets. Overall, they provide the best utility--scalability trade-off in our setting.

## Can a Vision-Language Model Tune Clustering In Context?

DevFeed: [Can a Vision-Language Model Tune Clustering In Context?](<https://devfeed.tech/articles/can-a-vision-language-model-tune-clustering-in-context-138784.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18768>)

Author: Javith Ranatunga, Paimon Goulart, Evangelos E. Papalexakis

Published: 2026-11-17T05:00:00Z

Content type: news

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>), [Hyperparameter optimization](<https://devfeed.tech/topics/hyperparameter-optimization.md>), [vlm](<https://devfeed.tech/topics/vlm.md>), [Multi-step AI processes](<https://devfeed.tech/topics/multi-step-ai-processes.md>)

Tags: [agentic](<https://devfeed.tech/tags/agentic.md>), [agentic-loop](<https://devfeed.tech/tags/agentic-loop.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [bayesian](<https://devfeed.tech/tags/bayesian.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [proof-of-concept](<https://devfeed.tech/tags/proof-of-concept.md>), [qwen3-5](<https://devfeed.tech/tags/qwen3-5.md>), [unsupervised-learning](<https://devfeed.tech/tags/unsupervised-learning.md>), [vision-language-model](<https://devfeed.tech/tags/vision-language-model.md>), [vlm](<https://devfeed.tech/tags/vlm.md>)

### AI overview

The study tests whether Qwen3.5-27B can tune k-means by visually judging clustering plots. Across five controlled synthetic scenarios, it first chooses the better result from plot pairs, then scores plots, and finally uses scores in a loop to propose updated hyperparameters. The model performs well when clusters are clear but struggles with ambiguous or noisy data. In the full experiment, its resulting silhouette scores are relatively close to grid search and Bayesian optimization, while it terminates in fewer iterations. The authors present this as an initial proof of concept; the evidence is exploratory and limited to the tested scenarios.

### Source excerpt

arXiv:2611.18768v1 Announce Type: new Abstract: Clustering is a widely used unsupervised learning method, but selecting an appropriate algorithm and set of hyperparameters for a specific dataset can require many possible configurations and evaluations. In this work, we investigate whether a Vision-Language Model can instead visually evaluate clustering results and use those decisions to then tune an explicit clustering algorithm. We study this through three progressive experiments using Qwen3.5-27B and five controlled synthetic clustering scenarios. First, we test whether the VLM can distinguish the best clustering result from a pair of plots. Second, we test whether it can assign numerical scores to those plots where a higher score represents a better result. Finally, we use these judgments within an agentic loop in which the VLM scores a k-means clustering and proposes updated hyperparameters that may result in better clustering. Our exploratory results show that the VLM performs well when clear cluster structure is present, while struggling on more ambiguous and noisy settings. In the full agentic experiment, the VLM produces clustering configurations with silhouette scores relatively close to those of grid search and Bayesian optimization, while terminating in much fewer iterations. Overall, these results provide an initial proof of concept that VLM-based visual feedback can be used to autonomously tune an explicit clustering algorithm.

## CapCover Filter: Semantic Approximate Membership Queries over Embeddings

DevFeed: [CapCover Filter: Semantic Approximate Membership Queries over Embeddings](<https://devfeed.tech/articles/capcover-filter-semantic-approximate-membership-queries-over-embeddings-137541.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20132>)

Author: Dvir David Biton, Shay Hahiashvili, Nadav Keren, Gil Einziger, Roy Friedman

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [cosine similarity search](<https://devfeed.tech/topics/cosine-similarity-search.md>), [quantization](<https://devfeed.tech/topics/quantization.md>), [ann](<https://devfeed.tech/topics/ann.md>), [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [also](<https://devfeed.tech/tags/also.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [can](<https://devfeed.tech/tags/can.md>), [compare](<https://devfeed.tech/tags/compare.md>), [construction](<https://devfeed.tech/tags/construction.md>), [cosine](<https://devfeed.tech/tags/cosine.md>), [cosine-similarity](<https://devfeed.tech/tags/cosine-similarity.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [data](<https://devfeed.tech/tags/data.md>), [data-structure](<https://devfeed.tech/tags/data-structure.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [faiss](<https://devfeed.tech/tags/faiss.md>), [filter](<https://devfeed.tech/tags/filter.md>), [over](<https://devfeed.tech/tags/over.md>), [queries](<https://devfeed.tech/tags/queries.md>), [semantic](<https://devfeed.tech/tags/semantic.md>)

### AI overview

CapCover Filter uses spherical caps to summarize embeddings and reject queries when no indexed vector meets a requested similarity threshold, while guaranteeing no false negatives. Its threshold-independent representation supports arbitrary thresholds without reconstruction. Across five datasets at cosine similarity 0.95, it eliminated about 20-100% of index accesses using 2% of raw FP32 embedding memory. Ahead of a FAISS flat index, it increased throughput by up to 382% and about 116% on average while returning the same range-search result. The reported gains are strongest when thresholds are tight, retrieval is expensive, and embeddings are highly clustered; the abstract also says lower thresholds were evaluated but gives no results for them.

### Source excerpt

arXiv:2611.20132v1 Announce Type: cross Abstract: Determining whether an embedding is sufficiently similar to any vector in a vector store without performing a nearest-neighbor search can substantially improve query throughput in vector-store systems. We study Semantic Approximate Membership Queries (SAMQs), which allow queries to be rejected when no indexed vector meets the requested similarity threshold, while guaranteeing no false negatives. We introduce CapCover Filter, a geometric data structure that summarizes a set of embeddings using spherical caps. Its representation is independent of the query threshold, allowing a single filter to support arbitrary thresholds without reconstruction. We evaluate alternative construction and quantization methods, compare CapCover Filter with competing filters, and measure its impact on query throughput. Across five real-world datasets, at a cosine similarity threshold of 0.95, CapCover Filter eliminates approximately 20--100\% of index accesses while using only 2\% of the raw (FP32) embedding memory. When placed before a FAISS flat index, it improves query throughput by up to 382\% and by approximately 116\% on average across the five datasets, while returning the same range-search result. We also evaluate lower similarity thresholds. Our results show that CapCover Filter can substantially improve vector-store throughput when similarity thresholds are tight, retrieval is expensive, and indexed embeddings are highly clustered. We release an optimized implementation of CapCover Filter and its evaluation framework.

## Ghost businesses are easier to build than ever

DevFeed: [Ghost businesses are easier to build than ever](<https://devfeed.tech/articles/ghost-businesses-are-easier-to-build-than-ever-135534.md>)

Original publisher: [Read original article](<https://www.cio.com/article/4248460/ghost-businesses-are-easier-to-build-than-ever.html>)

Author: Hal Lonas

Published: 2026-11-16T10:00:00Z

Content type: opinion

Language: en

Sources: [CIO](<https://devfeed.tech/sources/cio.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>), [Data pipelines](<https://devfeed.tech/topics/data-pipelines.md>), [Finance](<https://devfeed.tech/topics/finance.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [billing](<https://devfeed.tech/tags/billing.md>), [business](<https://devfeed.tech/tags/business.md>), [business-cybercrime-fraud-industry-markets-security](<https://devfeed.tech/tags/business-cybercrime-fraud-industry-markets-security.md>), [california](<https://devfeed.tech/tags/california.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [contributor](<https://devfeed.tech/tags/contributor.md>), [cybercrime](<https://devfeed.tech/tags/cybercrime.md>), [data](<https://devfeed.tech/tags/data.md>), [data-analysis](<https://devfeed.tech/tags/data-analysis.md>), [edition-us](<https://devfeed.tech/tags/edition-us.md>), [financial](<https://devfeed.tech/tags/financial.md>), [fraud](<https://devfeed.tech/tags/fraud.md>), [ghost](<https://devfeed.tech/tags/ghost.md>), [industry](<https://devfeed.tech/tags/industry.md>), [language-en](<https://devfeed.tech/tags/language-en.md>), [markets](<https://devfeed.tech/tags/markets.md>), [security](<https://devfeed.tech/tags/security.md>), [storytype-opinion](<https://devfeed.tech/tags/storytype-opinion.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>)

### AI overview

The excerpt argues that ghost-business fraud is visible in relationships among entities, not necessarily in checks of individual registrations. In California hospice data, the team reports that clusters, registration spikes, shared directors and dense addresses highlighted patterns missed by single-company verification; connected records can also help trace layered ownership to beneficial owners. The proposed approach combines graph analysis with historical and continuously updated business data to flag risk at onboarding and afterward, with decisions traceable to their evidence. The excerpt notes limits: emerging patterns may be difficult to detect before they become statistically visible, and attackers are using AI to create convincing entities at lower cost.

### Source excerpt

Earlier this year, CBS News reporters set out to investigate 89 licensed hospice companies. The task was simpler than it seemed at first glance: state records tied these companies to a single, 32,000-square-foot Los Angeles building that also housed a salon, a law office and a modeling agency. The building's owner said only 12 were still there. The gap between the business registry and on-the-ground reality was clearly a problem. When I saw that story, I did what any curious technologist in my position would do; I started thinking about finding those ghost businesses automatically using modern data analysis techniques. I turned our tools loose on it. Trulioo's business data covers more than 100 million U.S. business records, and its value here is in how those records connect. Linking each company to its directors, addresses and owners turns a registry into a map. My team quickly found clusters and registration spikes that appeared to confirm what federal investigators had spent years documenting manually. Many of these providers have been billing Medicare for years and collecting federal tax dollars. The CBS News story is not an isolated case, unique to Southern California hospice care. We need to understand it as a window into a fraudulent architecture that operates in many different forms across industries and states and around the world. While most of the conversation about synthetic fraud has centered on creating fake people, fake businesses are the quieter half of the same problem, and likely much more impactful from a financial fraud standpoint. Catching ghost businesses By the time federal authorities finished connecting the dots on California's hospice crisis, they had charged 15 people across nine interconnected investigations and estimated $3.5 billion in Medicare fraud from Los Angeles County alone. One licensed physician was linked to 63 separate hospice facilities, billing Medicare more than $35 million in a single year. A couple with prior tax evasion

## Lightweight Semantic EEG Foundation Model for Frozen Cross-Disorder Transfer

DevFeed: [Lightweight Semantic EEG Foundation Model for Frozen Cross-Disorder Transfer](<https://devfeed.tech/articles/lightweight-semantic-eeg-foundation-model-for-frozen-cross-disorder-transfer-135726.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.05503>)

Author: Rita Huan-Ting Peng, Nhat Bui

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [after](<https://devfeed.tech/tags/after.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [architectures](<https://devfeed.tech/tags/architectures.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [base](<https://devfeed.tech/tags/base.md>), [but](<https://devfeed.tech/tags/but.md>), [classification](<https://devfeed.tech/tags/classification.md>), [clinical-decision-support](<https://devfeed.tech/tags/clinical-decision-support.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [decision](<https://devfeed.tech/tags/decision.md>), [detection](<https://devfeed.tech/tags/detection.md>), [eeg](<https://devfeed.tech/tags/eeg.md>), [eess-sp](<https://devfeed.tech/tags/eess-sp.md>), [existing](<https://devfeed.tech/tags/existing.md>), [foundation](<https://devfeed.tech/tags/foundation.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [model](<https://devfeed.tech/tags/model.md>), [q-bio-nc](<https://devfeed.tech/tags/q-bio-nc.md>), [semantic](<https://devfeed.tech/tags/semantic.md>)

### AI overview

USE-FM uses self-supervised signal reconstruction on the Temple University Hospital EEG Corpus to learn EEG representations, then tests cross-disorder transfer with its encoder frozen. At 1.46 million parameters--about one-fifth the size of the compared models--it reports competitive results on abnormal EEG detection (TUAB; AUC 85.24 ± 5.61) and seizure recognition (TUEP; sensitivity 75.00 ± 14.14, F1 70.37 ± 4.01). The abstract also reports organized latent representations from k-means, PCA, and t-SNE, comparable to larger foundation models. These abstract-level results suggest a computationally lighter transfer approach; they do not establish clinical effectiveness.

### Source excerpt

arXiv:2610.05503v2 Announce Type: replace Abstract: Large-scale EEG foundation models have demonstrated promising transferability across neurological disorders, but often require millions of parameters and substantial computational resources. In this paper, we present the Universal Semantic EEG Foundation Model (USE-FM), a lightweight EEG foundation model that learns transferable neural representations through self-supervised signal reconstruction on the Temple University Hospital EEG Corpus (TUEG). After pretraining, the encoder is frozen and evaluated on two clinically distinct downstream tasks, abnormal EEG detection (TUAB) and epileptic seizure recognition (TUEP), using a unified frozen-transfer protocol against recent EEG foundation models, including LUNA-Base and CBraMod. With only 1.46 million parameters, approximately one-fifth the size of existing models, USE-FM achieves competitive overall performance, including strong sensitivity and F1-score on TUEP (SEN $75.00 \pm 14.14$, F1 $70.37 \pm 4.01$), while maintaining competitive performance on TUAB (AUC $85.24 \pm 5.61$). Beyond downstream classification, latent representation analysis using $k$-means clustering together with PCA and t-SNE demonstrates that USE-FM learns organized semantic EEG representations comparable to substantially larger foundation models. These results suggest that large-scale self-supervised pretraining enables lightweight architectures to learn transferable semantic EEG representations, providing a computationally efficient foundation for cross-disorder analysis and future clinical decision support in neurological disorders.

## Multimodal Person Concept Model for Person Identification under Varying Observation Conditions

DevFeed: [Multimodal Person Concept Model for Person Identification under Varying Observation Conditions](<https://devfeed.tech/articles/multimodal-person-concept-model-for-person-identification-under-varying-observation-conditions-135119.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17802>)

Author: Mizuho Okitani, Yoshinobu Hagiwara

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [concept-learning](<https://devfeed.tech/topics/concept-learning.md>), [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [appearance](<https://devfeed.tech/tags/appearance.md>), [audio](<https://devfeed.tech/tags/audio.md>), [availability](<https://devfeed.tech/tags/availability.md>), [bayesian](<https://devfeed.tech/tags/bayesian.md>), [clip](<https://devfeed.tech/tags/clip.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-hc](<https://devfeed.tech/tags/cs-hc.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ro](<https://devfeed.tech/tags/cs-ro.md>), [features](<https://devfeed.tech/tags/features.md>), [generative](<https://devfeed.tech/tags/generative.md>), [language](<https://devfeed.tech/tags/language.md>), [model](<https://devfeed.tech/tags/model.md>), [multimodal](<https://devfeed.tech/tags/multimodal.md>), [noise](<https://devfeed.tech/tags/noise.md>), [pretraining](<https://devfeed.tech/tags/pretraining.md>), [principal-component-analysis](<https://devfeed.tech/tags/principal-component-analysis.md>), [process](<https://devfeed.tech/tags/process.md>), [restaurant](<https://devfeed.tech/tags/restaurant.md>), [robot](<https://devfeed.tech/tags/robot.md>), [robust](<https://devfeed.tech/tags/robust.md>), [toyota](<https://devfeed.tech/tags/toyota.md>), [transcription](<https://devfeed.tech/tags/transcription.md>)

### AI overview

The proposed multimodal person concept model identifies people from a small number of unlabeled observations while inferring how many person concepts are present. It combines visual, acoustic, and linguistic features from CLIP and CLAP, reduced with PCA, in a nonparametric Bayesian generative model based on the Chinese restaurant process. In tests with six participants across eight conditions involving appearance changes, additive noise, and transcription errors, it averaged 0.89 identification accuracy, comparable to k-means given the true participant count (0.88). The study also examined PCA dimensionality, available modalities, and variation strength, and demonstrated the model on a Toyota Human Support Robot. The abstract reports that identification could succeed even when the inferred concept count was incorrect.

### Source excerpt

arXiv:2611.17802v1 Announce Type: cross Abstract: Service robots in domestic and office environments must identify users to provide personalized services based on their preferences and previous interactions. This is challenging because only a few observations may be available for learning, while observation conditions change owing to appearance, environmental noise, and utterance content. To address this challenge, this study proposes a multimodal person concept model that learns person concepts from a small number of observations, without person labels, and enables robust identification under changing conditions. The model employs a nonparametric Bayesian generative model based on the Chinese restaurant process and integrates visual, acoustic, and linguistic features extracted using Contrastive Language-Image Pre-training (CLIP) and Contrastive Language-Audio Pretraining (CLAP), followed by principal component analysis (PCA). We evaluated six participants under eight conditions in which appearance changes, additive noise, and transcription errors were introduced individually and in combination. Averaged over the eight conditions, the proposed model achieved an identification accuracy of 0.89 while inferring the number of person concepts from the observations, which is comparable to k-means clustering that was supplied with the true number of participants (0.88). We also examined PCA dimensionality, modality availability, and variation strength, and demonstrated the model on a Toyota Human Support Robot. These results show that multimodal person concept learning supports robust person identification under changing conditions, and that identification can succeed even when the number of concepts is not correctly recovered. The project page and demonstration video are available at https://okitamisan01.github.io/person_concept/.

## LLM-Guided Cluster Lifecycle Management: Deciding When and How to Evolve Behavioral Clusters

DevFeed: [LLM-Guided Cluster Lifecycle Management: Deciding When and How to Evolve Behavioral Clusters](<https://devfeed.tech/articles/llm-guided-cluster-lifecycle-management-deciding-when-and-how-to-evolve-behavioral-clusters-135086.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17616>)

Author: Himanshu Kulkarni, Siddharth Krishnamurthy, Jianhong Xin

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>)

Tags: [clustering](<https://devfeed.tech/tags/clustering.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [decision](<https://devfeed.tech/tags/decision.md>), [drift](<https://devfeed.tech/tags/drift.md>), [fusion](<https://devfeed.tech/tags/fusion.md>), [lifecycle](<https://devfeed.tech/tags/lifecycle.md>), [llm](<https://devfeed.tech/tags/llm.md>), [merge](<https://devfeed.tech/tags/merge.md>), [semantics](<https://devfeed.tech/tags/semantics.md>), [split](<https://devfeed.tech/tags/split.md>), [statistics](<https://devfeed.tech/tags/statistics.md>)

### AI overview

The study proposes using an LLM to decide in place whether behavioral clusters should be split, merged, retired, created, or left unchanged, using a whole-population view of cluster statistics, labels, member texts, and residual mass without re-clustering. Its fixed policy uses statistics when labels are weakly distinctive and combines statistics with semantics when labels are richer. Across three public datasets, the policy-selected mode reportedly achieved the highest F1 with fewer interventions and greater restraint than tuned threshold heuristics and a MONIC-style baseline; gains were more pronounced in precision than recall. The useful signal varied by dataset: semantics hurt on YooChoose, fusion was roughly neutral on MOOC, and semantic input was required on News-Category. The authors frame this modality shift as a diagnostic from three datasets, not a validated general rule.

### Source excerpt

arXiv:2611.17616v1 Announce Type: new Abstract: Behavioral clusters learned over user or item interactions drift as behavior evolves: some fragment into sub-behaviors, some converge, some disappear, and new patterns emerge. Two paradigms dominate the maintenance of evolving clusterings. Threshold triggers fire a pre-specified action when a hardcoded statistic crosses a cutoff; refit-and-track (MONIC-style) re-clusters every window and infers transitions from how the new clusters align with the previous window's. Both hardwire the decision into a threshold or a re-clustering rule. We study an alternative in which a large language model (LLM) makes the lifecycle decision in place. Given a threshold-free, whole-population view of the current cluster set (statistical health, labels, member texts, residual mass), the LLM decides per cluster whether and how to act (split, merge, retire, create, or no-action) without re-clustering. Because the useful signal channel depends on how informative the labels are, we fix a richness-conditioned policy in advance: statistics when label distinctiveness is low, fused statistics+semantics when it is high. On three public datasets spanning label richness (YooChoose 0.17, MOOC 0.50, News-Category 0.70), the policy-selected LLM mode obtains the highest F1 on all three, with far fewer interventions and stronger restraint than tuned threshold heuristics and a MONIC steelman (paired Wilcoxon p <= 0.003, bootstrap 95% CIs excluding zero). The gain is concentrated more in precision than recall. The useful modality shifts from statistics to semantics/fusion as richness rises. Semantics hurt on YooChoose, fusion is roughly neutral on MOOC, and the semantic channel is required on News. One base prompt template and one fixed policy serve all three datasets, whereas the tuned baseline collapses when moved between them. We treat this shift as a practitioner diagnostic observed on three datasets, not a validated law.

[Next page](<https://devfeed.tech/topics/clustering.md?cursor=WyIyMDI2LTExLTE2VDA1OjAwOjAwKzAwOjAwIiwgImE3OWE0OWRkLWNkZGMtNDcyZS1hYTRhLWVhNWJjYTNlYTM4OCJd>)