Basic Information

Competition Structure

CAIO 2026 is a two-stage competition consisting of the National Qualifier and the National Training Camp.
• The CAIO National Qualifier will be held in November 2025
• Selected students will be invited to the CAIO National Training Camp in January 2026

 

Each stage includes two 90-minute rounds:
• Round 1: AI Fundamentals Challenge
• Round 2: Applied Problem Solving

 

For detailed schedules and content outlines, please refer to this page and the “Prepare” page.

Registeration Period

Registration is from July to October 30th 2025.

Eligibility

The competition is open to individuals only, with no restrictions on nationality.
• For the CAIO National Qualifier, all students currently enrolled full-time in secondary schools (Grades 7–12), regardless of country, are eligible to participate.
• Students advancing to the CAIO National Training Camp must be enrolled full-time in Canadian secondary schools (Grades 7–12). Proof of enrollment will be required.

Timeline

Syllabus

Data Processing

  • Python Pandas

  • Python Numpy

  • Linear algebra fundamentals

  • Exploratory data analysis (EDA)

Data Visulization

  • Python Matpolitlib

  • Python Seaborn

Regression Models

  • Linear regression (Least Squares, Gradient Descent)

  • Polynomial regression

Classification Models

  • Decision Trees (entropy, information gain)

  • Support Vector Machines (SVM) and hyperplanes

  • Naïve Bayes classification

Regularization & Overfitting

  • L1 (Lasso) and L2 (Ridge) Regularization

  • Cross-validation techniques

Clustering

  • K-means clustering (cost function minimization)

  • Hierarchical clustering

  • Gaussian Mixture Models (GMM)

Dimensionality Reduction

  • PCA and its application in visualization

  • t-SNE for high-dimensional data representation

Markov Decision Processes (MDPs)

  • States, actions, rewards

  • Bellman Equations

Q-Learning

  • Temporal Difference Learning

  • Exploration vs. exploitation

Uninformed Search

  • Breadth-First Search (BFS), Depth-First Search (DFS)

  • Uniform Cost Search

Informed Search

  • A* Algorithm and heuristics

  • Minimax search (game AI)

Propositional & First-Order Logic

  • CNF, logical connectives

  • Unification in inference

Resolution Theorem Proving

  • Satisfiability and SAT solvers

Classification Metrics

  • Precision, recall, F1-score

  • ROC-AUC curves

Bias-Variance Tradeoff

  • Overfitting detection

  • K-fold cross-validation

Backtracking & Constraint Propagation

  • AC-3 algorithm

  • Forward checking

Support Vector Machines (SVM)

  • Margin maximization

  • Soft-margin vs. hard-margin SVM

Kernel Trick

  • Transforming low-dimensional data to high-dimensional space

  • Radial Basis Function (RBF) kernel

Collaborative Filtering

  • User-based and item-based filtering

  • Similarity metrics (cosine similarity, Pearson correlation)

Content-Based Filtering

  • TF-IDF and word embeddings

  • Feature engineering for recommendation models

Hybrid Recommender Systems

  • Combining collaborative and content-based filtering

  • Matrix factorization (SVD, ALS algorithms)

  • Deep learning approaches (Neural Collaborative Filtering, Autoencoders for recommendations)

Resources

Here are some resources that will be useful when preparing for the CAIO contest. 

We expect participants who do well in the contest to have some knowledge of the following areas.