Algorithms

GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing IJCAI 2025 GRICP: Granular-Ball Iterative Closest Point with Multikernel Correntropy for Point Cloud Fine Registration AAAI 2025 Heterophily-Aware Personalized PageRank for Node Classification IJCAI 2025 Hierarchical Refinement: Optimal Transport to Infinity and Beyond ICML 2025 Hierarchical Speculative Decoding with Dynamic Window NAACL 2025 How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions ICLR 2025 Human-AI Co-Development of a Geometric Algorithm for Infinite Shuriken Artwork Design Generation NeurIPS 2025 Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions ICLR 2025 Improved Approximation Algorithms for Clustered TSP and Subgroup Planning AAAI 2025 Improved Approximations for Hard Graph Problems using Predictions ICML 2025 Improved MMS Approximations for Few Agent Types IJCAI 2025 Inapproximability of Optimal Multi-Agent Pathfinding Problems AAAI 2025 InfVC: An Inference-Enhanced Local Search Algorithm for the Minimum Vertex Cover Problem in Massive Graphs IJCAI 2025 kNN Attention Demystified: A Theoretical Exploration for Scalable Transformers ICLR 2025 Learning Algorithms in the Limit COLT 2025 Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors ICML 2025 Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems AISTATS 2025 Learning-Augmented Frequent Directions ICLR 2025 Learning Configurations for Data-Driven Multi-Objective Optimization ICML 2025 Learning Partitions with Optimal Query and Round Complexities COLT 2025 Less is More: Efficient Image Vectorization with Adaptive Parameterization CVPR 2025 LevAttention: Time, Space and Streaming Efficient Algorithm for Heavy Attentions ICLR 2025 Leveraging Predictive Equivalence in Decision Trees ICML 2025 List Update with Prediction AAAI 2025 Logarithmic Approximations for Fair k-Set Selection IJCAI 2025