CE23 - Intelligence artificielle et science des données 2025

Compression and Alignment for Efficient Machine Learning – CALME

Submission summary

The increasing availability of massive datasets presents a number of challenges for machine learning (ML), with two key issues standing out: the high dimensionality of the data and the difficulty of obtaining high-quality labelled data.

This project aims to develop ML methods that require moderate computational and labeling resources and with robust theoretical principles, aligning with the principles of frugal ML.

While many methods attempt to address these challenges, this project is distinctive in its focus on two key concepts: compression—an algorithmic process that simplifies data into a “lower-complexity” space—and alignment, which connects parts of different objects by identifying their correspondences, often using optimal transport techniques.
The central idea is that there exists a fruitful duality between these two concepts, which can be uncovered and leveraged to advance towards more frugal ML algorithms.

The main objectives of this project are to: 1) explore the theoretical foundations of modern data summarization methods through the lens of optimal transport and develop new, efficient compression techniques that are mathematically sound, and 2) create ML methods suited for scenarios with limited or noisy labeled data with the help of optimal transport and alignment.

Project coordination

Titouan Vayer (Centre Inria de l’Université de Rennes)

The author of this summary is the project coordinator, who is responsible for the content of this summary. The ANR declines any responsibility as for its contents.

Partnership

Centre Inria de l’Université de Rennes

Help of the ANR 281,480 euros
Beginning and duration of the scientific project: September 2025 - 48 Months

Useful links

Explorez notre base de projets financés

 

 

ANR makes available its datasets on funded projects, click here to find more.

Sign up for the latest news:
Subscribe to our newsletter