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
Stop ordering machine learning algorithms by their explainability! A user-centered investigation of performance and explainability
Lukas-Valentin Herm, Kai Heinrich, Jonas Wanner, Christian Janiesch
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
Tonmoy Dey, Yixin Chen, Alan Kuhnle
Online Segmentation of LiDAR Sequences: Dataset and Algorithm
Romain Loiseau, Mathieu Aubry, Loïc Landrieu
Challenges and Opportunities in Deep Reinforcement Learning with Graph Neural Networks: A Comprehensive review of Algorithms and Applications
Sai Munikoti, Deepesh Agarwal, Laya Das, Mahantesh Halappanavar, Balasubramaniam Natarajan
Performance analysis of coreset selection for quantum implementation of K-Means clustering algorithm
Fanzhe Qu, Sarah M. Erfani, Muhammad Usman
Learning-Augmented Algorithms for Online TSP on the Line
Themis Gouleakis, Konstantinos Lakis, Golnoosh Shahkarami
A Geometry-Sensitive Quorum Sensing Algorithm for the Best-of-N Site Selection Problem
Grace Cai, Nancy Lynch
FETA: Fairness Enforced Verifying, Training, and Predicting Algorithms for Neural Networks
Kiarash Mohammadi, Aishwarya Sivaraman, Golnoosh Farnadi
A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations
Bangwei Guo, Xingyu Li, Miaomiao Yang, Hong Zhang, Xu Steven Xu
On Preemption and Learning in Stochastic Scheduling
Nadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet
The CLRS Algorithmic Reasoning Benchmark
Petar Veličković, Adrià Puigdomènech Badia, David Budden, Razvan Pascanu, Andrea Banino, Misha Dashevskiy, Raia Hadsell, Charles Blundell