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
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
Aligning Vision Models with Human Aesthetics in Retrieval: Benchmarks and Algorithms
Miaosen Zhang, Yixuan Wei, Zhen Xing, Yifei Ma, Zuxuan Wu, Ji Li, Zheng Zhang, Qi Dai, Chong Luo, Xin Geng, Baining Guo
Step-by-Step Diffusion: An Elementary Tutorial
Preetum Nakkiran, Arwen Bradley, Hattie Zhou, Madhu Advani