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
Reputational Algorithm Aversion
Gregory Weitzner
NeuralSolver: Learning Algorithms For Consistent and Efficient Extrapolation Across General Tasks
Bernardo Esteves, Miguel Vasco, Francisco S. Melo
Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
Sungwoo Park, Junyeop Kwon, Byeongnoh Kim, Suhyun Chae, Jeeyong Lee, Dabeen Lee
Effective anytime algorithm for multiobjective combinatorial optimization problems
Miguel Ángel Domínguez-Ríos, Francisco Chicano, Enrique Alba
Distributed Generalized Nash Equilibria Seeking Algorithms Involving Synchronous and Asynchronous Schemes
Huaqing Li, Liang Ran, Lifeng Zheng, Zhe Li, Jinhui Hu, Jun Li, Tingwen Huang
Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
Tuan-Anh Nguyen, Nguyen Kim Thang, Denis Trystram
Online Uniform Allocation:Randomized Learning-Augmented Approximation Algorithms with Application to Digital Health
Xueqing Liu, Kyra Gan, Esmaeil Keyvanshokooh, Susan Murphy