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
Admissibility in Strength-based Argumentation: Complexity and Algorithms (Extended Version with Proofs)
Yohann Bacquey, Jean-Guy Mailly, Pavlos Moraitis, Julien Rossit
Online 2-stage Stable Matching
Evripidis Bampis, Bruno Escoffier, Paul Youssef
Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value
Isac M. Lacerda, Eber A. Schmitz, Jayme L. Szwarcfiter, Rosiane de Freitas
A Generative Framework for Personalized Learning and Estimation: Theory, Algorithms, and Privacy
Kaan Ozkara, Antonious M. Girgis, Deepesh Data, Suhas Diggavi