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
Proof Number Based Monte-Carlo Tree Search
Jakub Kowalski, Elliot Doe, Mark H. M. Winands, Daniel Górski, Dennis J. N. J. Soemers
Explaining Groups of Instances Counterfactually for XAI: A Use Case, Algorithm and User Study for Group-Counterfactuals
Greta Warren, Mark T. Keane, Christophe Gueret, Eoin Delaney