time complexity
A measure of the amount of time an algorithm takes to complete as a function of the input size, critical for evaluating the efficiency of AI methods.
- Accelerated Evolving Set Processes for Local PageRank Computation
- Brain network science modelling of sparse neural networks enables Transformers and LLMs to perform as fully connected
- Efficient Federated Learning against Byzantine Attacks and Data Heterogeneity via Aggregating Normalized Gradients
- Equilibrium Policy Generalization: A Reinforcement Learning Framework for Cross-Graph Zero-Shot Generalization in Pursuit-Evasion Games
- Fast Computation and Optimization for Opinion-Based Quantities of Friedkin-Johnsen Model
- Learning Gradient Boosted Decision Trees with Algorithmic Recourse
- OPTFM: A Scalable Multi-View Graph Transformer for Hierarchical Pre-Training in Combinatorial Optimization
- Overcoming Long Context Limitations of State Space Models via Context Dependent Sparse Attention
- Parallelizing MCMC Across the Sequence Length
- ROVER: Recursive Reasoning Over Videos with Vision-Language Models for Embodied Tasks
- Robust learning of halfspaces under log-concave marginals
- Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
- Scaling Up Liquid-Resistance Liquid-Capacitance Networks for Efficient Sequence Modeling