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
Ontologies for Models and Algorithms in Applied Mathematics and Related Disciplines
Björn Schembera, Frank Wübbeling, Hendrik Kleikamp, Christine Biedinger, Jochen Fiedler, Marco Reidelbach, Aurela Shehu, Burkhard Schmidt, Thomas Koprucki, Dorothea Iglezakis, Dominik Göddeke
Utilitarian Algorithm Configuration
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
What Algorithms can Transformers Learn? A Study in Length Generalization
Hattie Zhou, Arwen Bradley, Etai Littwin, Noam Razin, Omid Saremi, Josh Susskind, Samy Bengio, Preetum Nakkiran
YOLO-Angio: An Algorithm for Coronary Anatomy Segmentation
Tom Liu, Hui Lin, Aggelos K. Katsaggelos, Adrienne Kline
From Oja's Algorithm to the Multiplicative Weights Update Method with Applications
Dan Garber