Greedy SLIM
Greedy algorithms, characterized by their iterative, locally optimal choices, are being explored across diverse machine learning applications. Current research focuses on improving their efficiency and effectiveness in areas such as recommender systems (Greedy SLIM), large language model inference acceleration ("stairs" assisted greedy generation), and vision graph neural networks (GreedyViG), often demonstrating significant performance gains compared to alternative approaches. This focus on greedy methods stems from their computational advantages, particularly in high-dimensional or real-time settings, offering a valuable trade-off between computational cost and solution quality across various domains.
Papers
October 28, 2024
July 29, 2024
July 15, 2024
June 10, 2024
May 10, 2024
March 28, 2024
March 25, 2024
March 2, 2024
February 7, 2024
September 26, 2023
August 14, 2023
July 3, 2023
November 22, 2022
November 1, 2022
October 3, 2022
July 15, 2022
June 1, 2022
May 5, 2022
May 3, 2022