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
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs
Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun
Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
Bowen Li, Bin Shi, Ya-xiang Yuan
A Smooth Binary Mechanism for Efficient Private Continual Observation
Joel Daniel Andersson, Rasmus Pagh
A Linearly Convergent GAN Inversion-based Algorithm for Reverse Engineering of Deceptions
Darshan Thaker, Paris Giampouras, René Vidal
Yet Another Algorithm for Supervised Principal Component Analysis: Supervised Linear Centroid-Encoder
Tomojit Ghosh, Michael Kirby
Analysing the Robustness of NSGA-II under Noise
Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt
Improving and Benchmarking Offline Reinforcement Learning Algorithms
Bingyi Kang, Xiao Ma, Yirui Wang, Yang Yue, Shuicheng Yan
Sea Ice Extraction via Remote Sensed Imagery: Algorithms, Datasets, Applications and Challenges
Anzhu Yu, Wenjun Huang, Qing Xu, Qun Sun, Wenyue Guo, Song Ji, Bowei Wen, Chunping Qiu