Skip to main content
ProblemsCompetitionsArticlesLeaderboard
Loading...
01Terms and Conditions02Privacy Policy03Contact

© 2026 MLCompete. All rights reserved.

    Available problems

    Problems

    Explore and solve machine learning challenges.

    Have an idea? Propose a problem

    Filters

    Difficulty
    Categories
    Competitions

    110 problems

    01
    Hard#320

    Fleet Recovery

    Coordinate two robots with one shared policy under actuator stalls, limited batteries, and hidden layouts.

    Author: Echipa științifică ONIAYour best score:N/A
    View Problem
    02
    Hard#318

    Noisy Oracle Labyrinth

    Build a cost-aware adaptive DAG for noisy ternary identification that remains robust under receiver shift.

    Author: Echipa științifică ONIAYour best score:N/A
    View Problem
    03
    Hard#316

    Echoes under Drift

    Recognize known and unknown audio events, locate their boundaries, and remain calibrated under domain shift.

    Author: Echipa științifică ONIAYour best score:N/A
    View Problem
    04
    Hard#314

    Silent Transmitters

    Design an adaptive decision graph that robustly identifies a transmitter in at most 15 calls.

    Author: Echipa științifică ONIAYour best score:N/A
    View Problem
    05
    Hard#312

    Courier Recovery

    Train a delivery policy that recovers from actuator stalls and generalizes to hidden layouts.

    Author: Echipa științifică ONIAYour best score:N/A
    View Problem
    06
    Hard#310

    Nightwatch Soundscapes

    Detect overlapping sound events over time while adapting to new classes without forgetting the old ones.

    Author: Echipa științifică ONIAYour best score:N/A
    View Problem
    07
    Hard#308

    The Analytical Language of John Wilkins

    Identify hidden animals in at most 15 calls by adaptively choosing yes/no questions and guesses.

    Author: IOAI 2026 Organizing TeamYour best score:N/A
    View Problem
    08
    Hard#306

    The analytical language of John Wilkins - deterministic oracle

    Build an adaptive YES/NO question policy that identifies each animal from a catalogue of 250 candidates using at most 15 calls.

    Author: IOAI CommitteeYour best score:N/A
    View Problem
    09
    Hard#304

    Robot Delivery Academy

    Train a behavioral-cloning model to deliver packages on unseen 8 × 8 maps.

    Author: IOAI 2026 Organizing TeamYour best score:N/A
    View Problem

    Page 1 of 13

    PreviousNext

    Contribute to the catalog

    Build the challenge you would want to solve

    Bring together the statement, data, evaluator, and scoring model in a private draft. If the proposal is accepted, the published problem is credited to you and appears on your profile.

    Your draft and evaluator stay private while the platform team validates safety, clarity, and scoring.

    Start a problem proposalRead the evaluator guide