Speeding Up OPFython with Numba
Gustavo H. de Rosa, Jo\~ao Paulo Papa

TL;DR
This paper enhances the Python implementation of the OPF classifier by integrating Numba to significantly improve its computational speed, especially for large datasets.
Contribution
It introduces a Numba-based acceleration method for OPFython, significantly boosting its performance over naive Python implementations.
Findings
Achieved faster distance calculations with Numba integration.
Outperformed naive Python OPF in speed and efficiency.
Demonstrated improved scalability for large datasets.
Abstract
A graph-inspired classifier, known as Optimum-Path Forest (OPF), has proven to be a state-of-the-art algorithm comparable to Logistic Regressors, Support Vector Machines in a wide variety of tasks. Recently, its Python-based version, denoted as OPFython, has been proposed to provide a more friendly framework and a faster prototyping environment. Nevertheless, Python-based algorithms are slower than their counterpart C-based algorithms, impacting their performance when confronted with large amounts of data. Therefore, this paper proposed a simple yet highly efficient speed up using the Numba package, which accelerates Numpy-based calculations and attempts to increase the algorithm's overall performance. Experimental results showed that the proposed approach achieved better results than the na\"ive Python-based OPF and speeded up its distance measurement calculation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Numerical Methods and Algorithms · Neural Networks and Applications
