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
CASET: Complexity Analysis using Simple Execution Traces for CS* submissions
Aaryen Mehta, Gagan Aryan
Symmetry Nonnegative Matrix Factorization Algorithm Based on Self-paced Learning
Lei Wang, Liang Du, Peng Zhou, Peng Wu
Learning-Augmented Algorithms for the Bahncard Problem
Hailiang Zhao, Xueyan Tang, Peng Chen, Shuiguang Deng