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
NAS: N-step computation of All Solutions to the footstep planning problem
Jiayi Wang, Saeid Samadi, Hefan Wang, Pierre Fernbach, Olivier Stasse, Sethu Vijayakumar, Steve Tonneau
Strawberry detection and counting based on YOLOv7 pruning and information based tracking algorithm
Shiyu Liu, Congliang Zhou, Won Suk Lee
Dynamic Dimension Wrapping (DDW) Algorithm: A Novel Approach for Efficient Cross-Dimensional Search in Dynamic Multidimensional Spaces
Dongnan Jin, Yali Liu, Qiuzhi Song, Xunju Ma, Yue Liu, Dehao Wu
Thorns and Algorithms: Navigating Generative AI Challenges Inspired by Giraffes and Acacias
Waqar Hussain