r/econometrics • u/EdgeAlternative4691 • 52m ago
New Python Package: hitspy for Fast, Deterministic Maximum Score Estimation using the HITS Algorithm (SoftwareX 2025)
Hi r/econometrics,
I wanted to share a new open-source Python tool that might be useful for anyone working with semi-parametric discrete choice models.
As many of you know, Manski’s Maximum Score Estimator (MSE) is a powerful semi-parametric alternative to Logit/Probit because it relaxes heavy distributional assumptions on errors. However, because the objective function is a step function with multiple local optima, traditional optimization relies on Simulated Annealing, which can be computationally slow and unstable due to random number generators.
Based on our recent paper in *SoftwareX* (2025) by Florios, Louka, and Bilias, we developed the **HITS algorithm (Hyperplanes Intersection Tabu Search)**. It provides a fast, deterministic global optimization approach specifically tailored for the Maximum Score Estimator.
We just officially published the Python implementation on PyPI: **`hitspy`**
### Key Features:
* **Deterministic:** No more relying on random seeds or stochastic jumps; the search leverages the geometric structure of the hyperplanes.
* **Scalable:** Drastically reduces computation time compared to traditional simulated annealing for larger datasets.
* **Easy Integration:** Built on top of standard libraries (NumPy/Pandas) and ready to be integrated into your empirical pipelines.
### Links & Resources:
* 📦 **PyPI:** `pip install hitspy` (https://pypi.org)
* 💻 **GitHub Repository:** [https://github.com/kflorios/hitspy]
* 📄 **Paper (SoftwareX, 2025):** [https://doi.org/10.1016/j.softx.2025.102164]
If you are currently working on discrete choice models or global optimization in econometrics, I would love for you to try it out! Any feedback, feature requests, or bug reports on GitHub are highly appreciated.
Happy to answer any questions about the algorithm or the implementation below!

