Linear Complexity
Linear complexity in algorithms and models is a crucial area of research aiming to reduce computational costs while maintaining performance. Current efforts focus on developing linear-time alternatives to computationally expensive methods like softmax attention in transformers and improving the efficiency of algorithms for tasks such as graph processing, diffusion model inference, and signal processing. This research is significant because it enables the application of sophisticated models and algorithms to larger datasets and more complex problems, impacting fields ranging from autonomous navigation to natural language processing. The development of linear-complexity methods is driving progress towards more efficient and scalable solutions across numerous scientific and engineering domains.
Papers
Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity
Kaan Gokcesu, Hakan Gokcesu
Variational inference of fractional Brownian motion with linear computational complexity
Hippolyte Verdier, François Laurent, Alhassan Cassé, Christian Vestergaard, Jean-Baptiste Masson