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
Computational thematics: Comparing algorithms for clustering the genres of literary fiction
Oleg Sobchuk, Artjoms Šeļa
Simulation of a Variational Quantum Perceptron using Grover's Algorithm
Nouhaila Innan, Mohamed Bennai
Algorithms for Finding Compatible Constraints in Receding-Horizon Control of Dynamical Systems
Hardik Parwana, Ruiyang Wang, Dimitra Panagou
Multi-Cluster Aggregative Games: A Linearly Convergent Nash Equilibrium Seeking Algorithm and its Applications in Energy Management
Yue Chen, Peng Yi
Online Sequence Clustering Algorithm for Video Trajectory Analysis
Aximu Yuemaier, Xiaogang Chen, Xingyu Qian, Longfei Liang, Shunfeng Li, Zhitang Song
Fast and Efficient Matching Algorithm with Deadline Instances
Zhao Song, Weixin Wang, Chenbo Yin, Junze Yin
Optimal Scheduling of Agents in ADTrees: Specialised Algorithm and Declarative Models
Jaime Arias, Carlos Olarte, Laure Petrucci, Łukasz Maśko, Wojciech Penczek, Teofil Sidoruk
Larger Offspring Populations Help the $(1 + (\lambda, \lambda))$ Genetic Algorithm to Overcome the Noise
Alexandra Ivanova, Denis Antipov, Benjamin Doerr