Back to Programs

Science and medicine

GeomScale

Scalable geometric and statistical software

c++github actionsjupyterpythonr

Participation history

7 GSoC years

2026

4 projects

Official year page

A Benchmarking Framework for Geometric Random Walks

Sampling from high-dimensional convex polytopes is a fundamental problem with applications in statistics, machine learning, optimization, and systems...

Dynamic Volume Updating of Convex Polytopes via Random-Walk Sampling

This project explores the problem of estimating how the volume of a high-dimensional convex polytope changes under sequential constraint additions....

Benchmark Polytope Import Suite For Volesti

This project aims to develop a Benchmark Polytope Import Suite for the volesti library, enabling automated conversion of standard Linear Programming...

Counting linear extensions with volume computation and applications in AI

This project will implement a new volume-based approach for approximately counting linear extensions of partially ordered sets in volesti. The core...

2025

6 projects

Official year page

Expose C++ Sampling, Rounding and Volume Computation in Dingo

Dingo is a Python library built on top of the C++ library volesti, primarily designed for sampling from convex polytopes, especially within the...

Randomized SDP solver and improved preprocessing

The proposed project aims to continue the implementation of the semidefinite pro- gramming (SDP) solver in the VolEsti library and to integrate it...

Shake and Bake - Sampling from the boundary of convex polytopes

The project aims to implement the Markov Chain Monte Carlo-based Shake and Bake algorithm for uniform sampling from the boundary of a convex polytope...

Counting Linear Extensions with Volume Computation and Applications in AI

This project develops an approximation algorithm for counting the linear extensions of a partial order by estimating the volume of its associated...

Initiating the dingo-stats library

Genome-scale metabolic network reconstructions (GENREs) are comprehensive maps of all known metabolic reactions and associated genes in a given...

Sparse Polytope Sampling via Lazy Rounding

The goal of this project is to enhance the Volesti library by implementing a sparse variant of the Billiard Walk sampling algorithm, which proposes...

2024

7 projects

Official year page

Machine Learning and Optimization for Finance: Index Replication

Indexes are baskets of stocks with specific characteristic. They provide examples for diversification in investing to mitigate the volatility of...

Pre- and post-sampling features to leverage flux sampling at both the strain and the community level

The first genome-scale models of metabolism appeared in 1999 and 2000. In the following years fundamental Microbial Systems concepts were developed...

Develop a new rounding method for convex polytopes

The goal of this project is to improve currently existing implementations for rounding convex polytopes from Volesti as well as develop a new method...

Efficient Volume Computation

The current state-of-the-art algorithms for the volume computation of high dimensional convex bodies, such as the one currently used within the...

Refactor Multiphase Monte Carlo Sampling for volesti and dingo

The proposed project aims to refactor the Multiphase Monte Carlo Sampling (MMCS) algorithm, currently implemented in Python with Cython bindings, to...

Modernize Linear Program solver interface in dingo

The proposed project aims to modernize the Linear Program (LP) solver interface in dingo, a Python package for analyzing metabolic net- works. By...

Improving sampling routines for correlation matrices and R interface

The goal of this project is to (1) improve sampling routines for correlation matrices and (2) further enhance the R interface with sampling...

2023

3 projects

Official year page

Support exponential sampling from the space of steady states of a metabolic network

My proposal is to extend the Python package dingo with two Markov Chain Monte Carlo sampling methods, which will enable exponential sampling from the...

Memory allocation in facet redundancy removal in dingo

This project will improve the memory allocation in the main routine for facet redundancy removal in GeomScale's Python package dingo. The project is...

Move R Interface of Volesti to a New Repository

The main goal of this project is to create a dedicated repository for the R interface code of Volesti, a tool developed by GeomScale for volume...

2022

6 projects

Official year page

Automatic differentiation support in volesti

The most efficient algorithm to sample from a log-concave distribution, that volesti supports is the Hamiltonian Monte Carlo with leapfrog...

Counting linear extensions with volume computation

In this project, we will implement different algorithms to count linear extensions approximately. In the problem of counting the linear extensions,...

Memory allocation in facet redundancy removal in dingo

Sampling and volume computation of convex polytopes is a challenging computational problem with many applications in inference from linear...

Support for new sampling methods and new model formats in dingo

Package dingo is a python package that analyzes metabolic networks. It relies on high dimensional sampling with Markov Chain Monte Carlo (MCMC)...

Randomized SDP solver with Riemannian Hamiltonian Monte Carlo

The relationship between sampling and optimization has gained increasing interest in recent years. A great number of optimization algorithms that are...

Sampling correlation matrices

We study the sampling of correlation matrices from a given probability density, which has applications in various scientific, engineering and...

2021

5 projects

Official year page

High dimensional geometric computations with least matrix inequalities

Package volesti supports volume estimation for polytopes, providing several randomized approximation methods. The most efficient implementation...

From DNA sequences to metabolic interactions: building a pipeline to extract key metabolic processes

Metabolic modeling has been interwoven with constraing-based methods. The value of randomized sampling in the framework of metabolic modeling has...

Parallel Geometric Random Walks with Sparse Numerical Optimizations

Package volesti provides several geometric random walks for high dimensional sampling from convex polytopes. The current implementations can be used...

GeomScale: Monte Carlo Integration

Integration is a fundamental problem in mathematics, physics and computer science with many applications that span the whole spectrum of sciences and...

Counting linear extensions

The problem of counting the linear extensions of a given partial order consists of finding (counting) all the possible ways that we can extend the...

2020

3 projects

Official year page

Optimization and Sum of Squares

We aim to provide an implementation of modern approaches to Sum of Squares problems.

A comparative study of uniform high dimensional samplers

Uniform sampling from convex polytopes in high dimensions is very useful in many scientific fields and applications. The package volesti is a C++...

Sampling from High-Dimensional log-concave densities

This proposal aims to provide functionality on sampling from high-dimensional densities. A log-concave density is a density g(x) proportional to...