arXiv Machine Learning July 31, 2026 By Zeqiang Xian, Caihui Liu, Yong Zhang, Wenjing Qiu, Duoqian Miao, Witold Pedrycz

MDL-GBG: A Non-parametric and Interpretable Granular-Ball Generation Method for Clustering

Read the original on arXiv Machine Learning →

arXiv:2605. 08759v3 Announce Type: replace Abstract: Existing granular-ball generation methods are still mainly driven by handcrafted quality measures and heuristic splitting or stopping criteria, which may weaken the transparency of local generation decisions in clustering.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv AI

Jun 30

Granular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method

arXiv:2304. 11171v5 Announce Type: replace-cross Abstract: To overcome the limitations of point-based inputs, overly fine computation and limited adaptability in existing artificial intelligence methods, Guoyin Wang and Shuyin Xia proposed granular-ball computing as a new artificial intelligence learning paradigm.

By Shuyin Xia, Guoyin Wang, Xinbo Gao, Xiaoyu Lian, Hongzhi Kuai

nlp safety

arXiv Machine Learning

Jun 30

Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering

arXiv:2605. 22410v2 Announce Type: replace Abstract: Spectral clustering largely depends on the affinity graph, yet constructing a graph that preserves reliable local connectivity while adapting to heterogeneous data structures remains challenging.

By Zeqiang Xian, Caihui Liu, Yong Zhang, Wenjing Qiu

arXiv Machine Learning

5d ago

Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing

arXiv:2608. 12903v1 Announce Type: new Abstract: The $k$-Nearest Neighbor~(KNN) algorithm is widely used across various tasks.

By Xiaoyu Lian, Shuyin Xia, Hongxuan He, Lifeng Shen, Guoyin Wang, Xinbo Gao

arXiv AI

Jul 3

HERMES: A Multi-Granularity Labeling Substrate for Pre-training Data Mixtures

arXiv:2607. 02266v1 Announce Type: cross Abstract: Most data-mixing methods assume the corpus has already been partitioned into groups, and the choice of those groups determines what a mixer can express.

By Ziyun Qiao, Yue Min, Ruining Chen, Yujun Li

rag efficiency

arXiv Machine Learning

Jun 5

Central Description Length (CDL) Clustering Validation Index

arXiv:2606. 05230v1 Announce Type: cross Abstract: Selecting a clustering algorithm and its hyperparameters without labels is a common difficulty in engineering machine learning pipelines that work with unsupervised analysis of sensor, image, or process data.

By Mahdi Shamsi, Soosan Beheshti

rag benchmarks

arXiv AI

Jun 2

Off-the-Shelf LLMs as Process Scorers: Training-Free Alternative to PRMs for Mathematical Reasoning

arXiv:2606. 01682v1 Announce Type: cross Abstract: Selecting the best response from multiple small-model samples using a stronger scorer is a simple inference-time strategy, but fails when the small model has already committed to incorrect reasoning paths.

By Atoosa Chegini, Soheil Feizi

llms reinforcement-learning benchmarks safety

Related stories

Granular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method

Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering

Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing

HERMES: A Multi-Granularity Labeling Substrate for Pre-training Data Mixtures

Central Description Length (CDL) Clustering Validation Index

Off-the-Shelf LLMs as Process Scorers: Training-Free Alternative to PRMs for Mathematical Reasoning