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
Multi-Power Level $Q$-Learning Algorithm for Random Access in NOMA mMTC Systems
Giovanni Maciel Ferreira Silva, Taufik Abrão
Improvement of Computational Performance of Evolutionary AutoML in a Heterogeneous Environment
Nikolay O. Nikitin, Sergey Teryoshkin, Valerii Pokrovskii, Sergey Pakulin, Denis Nasonov