Practical Algorithm
Practical algorithm research focuses on developing and improving algorithms for diverse applications, prioritizing efficiency, accuracy, and interpretability. Current research emphasizes areas like efficient model training and inference (e.g., low-bit quantization for LLMs, distributed algorithms for large datasets), robust optimization techniques (e.g., evolutionary algorithms, Q-learning variants), and methods for handling noisy data or dynamic environments. These advancements have significant implications across various fields, including machine learning, robotics, and data analysis, by enabling more efficient and reliable solutions to complex problems.
Papers
Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
Taining Zhang, Adam Goldstein, Michael Levin
SAT-Based Algorithms for Regular Graph Pattern Matching
Miguel Terra-Neves, José Amaral, Alexandre Lemos, Rui Quintino, Pedro Resende, Antonio Alegria
Improved Differentially Private and Lazy Online Convex Optimization
Naman Agarwal, Satyen Kale, Karan Singh, Abhradeep Guha Thakurta
Algorithms for automatic intents extraction and utterances classification for goal-oriented dialogue systems
Leonid Legashev, Alexander Shukhman, Vadim Badikov