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
Why Algorithms Remain Unjust: Power Structures Surrounding Algorithmic Activity
Andrew Balch
Deriving Causal Order from Single-Variable Interventions: Guarantees & Algorithm
Mathieu Chevalley, Patrick Schwab, Arash Mehrjou
Metaheuristics and Large Language Models Join Forces: Towards an Integrated Optimization Approach
Camilo Chacón Sartori, Christian Blum, Filippo Bistaffa, Guillem Rodríguez Corominas
Utilitarian Algorithm Configuration for Infinite Parameter Spaces
Devon Graham, Kevin Leyton-Brown