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
Soft Robotic Mannequin: Design and Algorithm for Deformation Control
Yingjun Tian, Guoxin Fang, Justas Petrulis, Andrew Weightman, Charlie C. L. Wang
A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural Networks
Mingrui Liu, Zhenxun Zhuang, Yunwei Lei, Chunyang Liao