
Scalable geometric and statistical software
Showing 5 of 34 projects. Click any project card for scope, mentors, and proposal studio.
Mentors: Student: JimmysPavlou
This project aims to develop a Benchmark Polytope Import Suite for the volesti library, enabling automated conversion of standard Linear Programming instances and metabolic network models into H-Polytopes compatible with volesti. A user-friendly CLI tool will allow researchers to perform conversions easily without directly interacting with the code. Additionally, a curated benchmark collection with regeneration scripts will support reproducible testing and demonstration of the pipeline. The project will follow best software engineering practices, including, unit, integration and end to end tests, as well as comprehensive documentation and tutorials. By providing a robust and easy to use import suite pipeline, this project will expand volesti's accessibility and usability for researchers in volume approximation and sampling of convex bodies.
Mentors: Student: Ke Shih
This project will implement a new volume-based approach for approximately counting linear extensions of partially ordered sets in volesti. The core idea is to exploit the special geometry of order polytopes by designing optimized exact Hamiltonian Monte Carlo boundary oracles, rather than relying on generic polytope routines. The work will include implementing specialized HMC walks, extending them to general Gaussian settings, integrating them into volesti’s volume-estimation pipeline, and evaluating their performance against existing approximation methods. Expected deliverables include the new C++ implementation, tests, examples, documentation, and a benchmark study on representative poset families.
Mentors: Student: Iva Janković
This project explores the problem of estimating how the volume of a high-dimensional convex polytope changes under sequential constraint additions. In genome-scale metabolic models, this is prevalent. The feasible steady states form such a polytope, and biological interventions (gene deletions) correspond to additional linear constraints. Quantifying the resulting volume contraction provides a geometric measure of robustness and enables detection of synthetic lethality, but existing methods require recomputing volume from scratch after each update. A dynamic volume updating algorithm that estimates relative volume changes incrementally is proposed. The method introduces constraints via an annealing schedule of parallel hyperplanes and computes local volume ratios using sample reuse with selective resampling. To maintain efficiency as the polytope becomes thin or anisotropic, the approach incorporates Constrained Riemannian Hamiltonian Monte Carlo (CRHMC). Deliverables include an annealed update framework, an incremental relative volume estimator, integration into volesti with dingo interfaces, and validation on metabolic models for robustness analysis and synthetic lethality detection.
Mentors: Student: Chrthegreat
Sampling from high-dimensional convex polytopes is a fundamental problem with applications in statistics, machine learning, optimization, and systems biology. Modern libraries such as VolEsti provide a rich collection of geometric random walk algorithms; however, there is currently no unified, extensible, and reproducible framework for benchmarking these methods in practice. In my recent MSc thesis, I conducted a large-scale empirical comparison of state-of-the art sampling algorithms across multiple software ecosystems. This work revealed a clear gap: while many algorithms exist, there is no standardized way to evaluate them under consistent configurations, geometries, and diagnostics. The goal of this project is to design and implement a complete benchmarking suite for VolEsti, enabling systematic, reproducible, and extensible evaluation of geometric random walks. The framework will support configurable experiments, advanced diagnostics, and integration with Python tools for visualization and analysis. Ultimately, we aim to implement a research-grade benchmarking platform where any algorithm can be evaluated quickly and thoroughly and every new suggested algorithm can be easily compared to existing methods.
Mentors: Student: Sophia Qian
This project develops an approximation algorithm for counting the linear extensions of a partial order by estimating the volume of its associated order polytope. Since exact counting is #P-complete, we exploit the fact that the polytope's volume is proportional to the number of linear extensions. Building on the volesti C++ library, the project will implement an optimized exact Hamiltonian Monte Carlo (HMC) sampler with a Gaussian target and a general mass matrix, including efficient boundary oracles for handling polytope constraints. The new HMC-based approach is designed to improve sampling efficiency and scalability, especially in high-dimensional settings, and will be integrated into existing volume estimation algorithms. Deliverables include the new C++ module, enhanced integration with volesti, extensive empirical evaluations against current approximation methods, comprehensive documentation, and reproducible benchmarks.