Table of Contents

Challenge: Personalized Age Estimation

📅 Deadline: 31.12.2025 21:59

🏦 Points: 15 (beating baseline) + 20 (leader-board)

This page outlines the course challenge on Personalized Age Estimation. This project is intended for students interested in exploring the course topics in greater depth through a practical application.

Participation is optional and does not contribute to the mandatory homework point total. However, successful completion provides a more direct and easier path to achieving a final grade of A or B.

Update 07.10.2025: A PyTorch checkpoint of the pretrained model is now available at this link. Feel free to finetune the weights. Make sure to follow the rules and use only the provided data from the template.

Task Description

The challenge is to implement a model for personalized age estimation. The objective is to improve the age prediction for an individual by leveraging a reference image of the same person with a known age.

The prediction problem is defined as follows: Given face 1 of a person, its corresponding age 1, and a second image, face 2, of the same person, the task is to predict age 2.

For instance, using the first image of Zdeněk Svěrák and his known age, the task is to predict his age in the second image.

 Reference Image: Age is known  Target Image: Predict this age

Rules

Provided Resources

A template (.zip) is provided, containing the dataset and a baseline solution.

Try to submit the baseline solution to see the leader-board

(ZIP the provided files without the dataset)

Dataset

The dataset is partitioned into `train`, `val`, and `test` sets.

The age distribution is consistent across the data splits, meaning performance on the public data should generalize to the hidden evaluation set.

 Age Distribution Across Data Splits

Baseline Model and Solution

The template includes a pre-trained ResNet-50 model.

The baseline script implements a simple offset-based approach:

# Calculate the prediction error on the reference image
offset = true_age_1 - prediction(face1)

# Adjust the target prediction using half of the calculated error
final_prediction_face_2 = prediction(face2) + (offset / 2)

The objective of the challenge is to design and implement a method that improves upon this baseline.

Grading and Evaluation

Solutions will be evaluated based on Mean Absolute Error (MAE) on a hidden test set.

The exact point distribution for the top solutions will be determined based on the final standings. We will likely interpolate between the top contender and the baseline to assign the points.

You can see the leader-board after submitting a solution and clicking the AE Result button.

Submission and Testing Procedures

Local Testing

After implementing your solution, you can test it locally using the provided public test cases:

python main.py test-cases/public/instances/test_processed.json

Submission

Ensure that all Python files are located in the root of the submitted .zip archive.
Submissions are evaluated sequentially (BRUTE processes GPU jobs one submission at a time). Because of this system limitation, results for simultaneous submissions may be delayed. To avoid long queues and reduce wait times for everyone, please do not spam the submission system with incremental changes. Instead, refine and test locally, and submit to BRUTE sparingly — for example, no more than once per day.

Environment

The evaluation is performed using Python in a Docker environment with GPU support: BRUTE PyTorch GPU Docker.

Support and Contact

For any questions or issues, please contact Jakub Paplhám at paplhjak@fel.cvut.cz. He is also available in person during the 2nd and 3rd seminars every Thursday or at the lectures.