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.
arXiv:2601. 06135v3 Announce Type: replace Abstract: Spatial computation in geographic systems increasingly requires query-conditioned, local, interpretable aggregation under metric constraints.
arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.
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.
arXiv:2609. 20701v1 Announce Type: cross Abstract: We study efficient algorithms for realizing the first-order oracle complexity of optimization of $G$-Lipschitz convex functions with respect to the $\ell_{q}$-norm over an $\ell_{p}$-ball of radius $R$, where $1\leq p,q\leq \infty$.
arXiv:2603. 06660v2 Announce Type: replace-cross Abstract: Approximate Nearest Neighbor Search (ANNS) is fundamental to modern AI applications.
arXiv:2609.15274v1 Announce Type: new Abstract: Kolmogorov-Arnold Networks (KANs) with spline activations have recently shown promise for interpretable function approximation. Distance-Aware Error fo...
arXiv:2608. 04398v1 Announce Type: cross Abstract: Robotic planning often involves multiple objectives with complex priority relationships, such as safety, efficiency, and regulatory compliance.
arXiv:2607. 23393v1 Announce Type: new Abstract: Existing exact methods for 4-connected grid pathfinding reduce online search, but often either retain fine-grained search states or require substantial preprocessing.
We study certain extremal problems in combinatorial geometry that ask about configurations of points in an $n \times n$ grid that satisfy strict, global geometric constraints. Classical exact solvers suffer from combinatorial explosion for these types of problems, and standard reinforcement learning and transformer-based models struggle with the sparse reward "validity cliff" and quadratic token-consumption limits.
arXiv:2608. 08876v1 Announce Type: cross Abstract: A graph layout is normally a table of $N$ free coordinates.
The paper introduces GBFRVFL, a fuzzy granular-ball random vector functional link network designed to improve robustness in noisy, imbalanced, or uncertain data settings. It employs granular-ball computing to group raw samples into adaptive balls and proposes two membership assignment schemes: F-GBRVFL, which uses fuzzy membership to gauge ball reliability, and SDAP-GBRVFL, which introduces a statistical density‑adaptive Pythagorean membership that adjusts based on class variance, local sparsity, and ball compactness. Experiments on 37 UCI and KEEL datasets show that these models outperform baseline methods in both clean and noisy conditions, achieving higher accuracy and stability.