newsResearchers developed UPath, a universal AI-powered pathfinding algorithm that improves A* search performance by up to 2.2x across diverse grid environments. The deep learning model generalizes across different map types without retraining, achieving near-optimal solutions within 3% of optimal cost on unseen tasks.
Researchers propose FedNSAM, a new federated learning algorithm that improves global model performance by addressing the inconsistency between local and global flatness in distributed training environments. The algorithm uses global Nesterov momentum to harmonize local and global optimization, showing superior performance compared to existing FedSAM approaches.
Researchers developed RL-CMSA, a hybrid reinforcement learning approach for solving the min-max Multiple Traveling Salesman Problem that combines probabilistic clustering, exact optimization, and solution refinement. The method outperforms existing algorithms by balancing exploration and exploitation to minimize the longest tour across multiple salesmen.
Researchers introduce pact, a new SMT model counter that can handle hybrid formulas containing both discrete and continuous variables using hashing-based approximate counting. The tool significantly outperforms existing baselines, successfully processing 456 out of 3119 test instances compared to only 83 for the baseline method.
Researchers introduce FLOP, a new causal discovery algorithm for linear models that significantly reduces computation time through fast parent selection and Cholesky-based score updates. The algorithm achieves near-perfect accuracy in standard benchmarks and makes discrete search approaches viable for causal structure learning.
Researchers propose an enhanced methodology using rough set theory to improve explainability of Graph Spectral Clustering (GSC) algorithms. The approach addresses challenges in explaining clustering results, particularly when applied to text documents where spectral space embeddings lack clear relation to content.