Foundations

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 Laplacian Positional Encodings for Heterophilous Graphs AISTATS 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 LLM-Based Multi-Agent Systems are Scalable Graph Generative Models ACL 2025 Logarithmic Approximations for Fair k-Set Selection IJCAI 2025 Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions AAAI 2025 Lower Bounds for Greedy Teaching Set Constructions COLT 2025 MA-GTS: A Multi-Agent Framework for Solving Complex Graph Problems in Real-World Applications EMNLP 2025 Maintaining Proportional Committees with Dynamic Candidate Sets ICML 2025 Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs AAAI 2025 Matrix-Free Shared Intrinsics Bundle Adjustment CVPR 2025 Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures ICML 2025 Metric Clustering and Graph Optimization Problems using Weak Comparison Oracles COLT 2025 Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams COLT 2025 Minimalistic Predictions for Online Class Constraint Scheduling ICLR 2025 Modeling Vowel System Typology Using Iterated Confusion Minimization Interspeech 2025 MojoBench: Language Modeling and Benchmarks for Mojo NAACL 2025 Multi-Agent Corridor Generating Algorithm IJCAI 2025