{"count":6,"next":null,"previous":null,"results":[{"id":595,"title":"AI-Powered Weld Inspection System and NDT Testing in Automotive Manufacturing test","slug":"industry-filter-test-02","dataset":{"id":949,"title":"Regression data for OC - Train","description":null,"intent":"train","dataset_key":"db2uyi44","data_samples":"[]","dataset_meta":"{\n    \"count\": {\n        \"label\": {\n            \"11\": 2,\n            \"12\": 3,\n            \"13\": 3,\n            \"14\": 4,\n            \"15\": 3,\n            \"16\": 4,\n            \"17\": 4,\n            \"18\": 4,\n            \"21\": 3,\n            \"22\": 2,\n            \"23\": 1,\n            \"24\": 5,\n            \"25\": 2,\n            \"26\": 2,\n            \"27\": 1,\n            \"29\": 1,\n            \"30\": 2,\n            \"31\": 3,\n            \"32\": 2,\n            \"33\": 2,\n            \"34\": 1,\n            \"35\": 1,\n            \"37\": 1,\n            \"8\": 2,\n            \"9\": 2\n        }\n    },\n    \"total\": 60,\n    \"data_items_label_count\": {\n        \"1\": 60\n    },\n    \"label_density\": {\n        \"11\": 2,\n        \"12\": 3,\n        \"13\": 3,\n        \"14\": 4,\n        \"15\": 3,\n        \"16\": 4,\n        \"17\": 4,\n        \"18\": 4,\n        \"21\": 3,\n        \"22\": 2,\n        \"23\": 1,\n        \"24\": 5,\n        \"25\": 2,\n        \"26\": 2,\n        \"27\": 1,\n        \"29\": 1,\n        \"30\": 2,\n        \"31\": 3,\n        \"32\": 2,\n        \"33\": 2,\n        \"34\": 1,\n        \"35\": 1,\n        \"37\": 1,\n        \"8\": 2,\n        \"9\": 2\n    },\n    \"description\": {},\n    \"unique_data_items_count\": 60\n}","isCompetition":true,"allow_feature_modification":false,"category":"tabular_regression","data_format":"tabular","edge_devices":[{"id":347,"pue_constant":1.0,"tdp_of_cpu":100.0,"v_cpu_cores":8.0,"tdp_of_gpu":1.0,"v_gpu_cores":1.0,"ram":8.32,"vram":0.0,"cpu_name":"Unknown","gpu_name":null,"pod_cpu_cores_initial":2.0,"pod_cpu_cores_limit":2.0,"pod_ram_initial":8.59,"pod_ram_limit":8.59,"pod_num_gpus_initial":1.0,"pod_num_gpus_limit":1.0,"pod_vram_initial":null,"pod_vram_limit":0.0,"cpu_nodes":{"AMD EPYC 7R32-4-16.11":{"cpu_name":"AMD EPYC 7R32","ram":16.11,"tdp_of_cpu":225.0,"v_cpu_cores":4},"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz-4-16.77":{"cpu_name":"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz","ram":16.77,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.55":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.55,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.56":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.56,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Unknown-8-16.73":{"cpu_name":"Unknown","ram":16.73,"tdp_of_cpu":100.0,"v_cpu_cores":8},"Unknown-8-8.32":{"cpu_name":"Unknown","ram":8.32,"tdp_of_cpu":100.0,"v_cpu_cores":8}},"gpu_nodes":{},"location":"PK","status":0}],"status":1,"is_deleted":false,"edge_dataset_status":"available","created_date":"2026-03-25T11:21:06.691157Z","updated_date":"2026-03-25T11:21:07.252331Z"},"dataset_key":"db2uyi44","submit_testdata_size":60,"final_testdata_size":0,"dataset_eda_file":null,"teams":[],"account":{"id":5,"name":"Tracebloc GmbH","logo":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/photos/company9abd7e0aa83a452eb87f9051adc7cbc0.png"},"prize_type":"knowledge","privacy_type":"public","total_prize_amount":0.0,"description":"<p><br>&nbsp;</p><div><h2><span>Overview</span></h2></div><p><br>&nbsp;</p><div><div><span>&gt; **About this use case:** This page shows how a paediatric clinical institution monetises its rare disease liquid biopsy dataset — letting pharmaceutical and diagnostics companies train non-invasive classification models on it — without sharing a single patient record. The scenario and figures are based on patterns observed across paediatric rare disease research environments. The dataset is augmented to reflect the proteomic structure of real-world blood-based biomarker cohorts without containing any identifiable patient data. Explore the data, submit your own model, and see how your approach compares.</span></div></div><p><br>&nbsp;</p><div><h2><span>Problem</span></h2></div><p><br>&nbsp;</p><div><div><span>The Dr. von Hauner Children's Hospital holds the most comprehensive **liquid biopsy** dataset for paediatric rare disease in Europe: 1,200 blood-based proteomic samples spanning circulating tumour markers, broad protein panels, and clinical variables from children across multiple rare disease groups. Pharmaceutical companies developing non-invasive diagnostics need to train classification models on this data. Ethics approval, GDPR compliance, and re-identification risk mean they cannot access a single patient record directly.</span></div></div><p><br>&nbsp;</p><div><div><span>#### Solution</span></div></div><p><br>&nbsp;</p><div><div><span>Prof. Dr. Elisabeth Hartmann, Director of Clinical Research Data, deploys a tracebloc workspace loaded with 1,200 paediatric liquid biopsy samples. Pharmaceutical and diagnostics companies submit their classification models to the workspace. Inside tracebloc's containerised [training environment](/explore/liquid-biopsy-proteomics?tab=training), models train on the patient sample set — fine-tuning weights to the skewed marker distributions and protein expression patterns specific to paediatric rare disease — without the data ever leaving the hospital's infrastructure. tracebloc orchestrates training, scores each adapted model against the evaluation cohort, and publishes results to a [live leaderboard](/explore/liquid-biopsy-proteomics?tab=leaderboard) automatically. This is a [federated learning application](https://www.tracebloc.io/blog/federated-learning-applications) of data monetisation: the institution controls the asset, the contributors train on it, and not one patient record moves. Each contributor pays a training access fee. The institution generates recurring research revenue from data it already owns.</span></div></div><p><br>&nbsp;</p><div><div><span>### Outcome</span></div></div><p><br>&nbsp;</p><div><div><span>In this example evaluation, contributors range from diagnostics firms validating existing blood-based assay models against a paediatric rare disease cohort to pharma companies building novel **cell-free DNA analysis** classifiers from scratch. The workspace surfaces which approaches handle the skewed marker distributions effectively and which collapse when rare-disease-elevated markers dominate predictions. The tracebloc workspace stays in place as the institution's liquid biopsy cohort grows, enabling continuous model improvement without renegotiating access.</span></div></div><p><br>&nbsp;</p><div><div><span>---</span></div></div><p><br>&nbsp;</p><div><div><span>## The Operational Challenge</span></div></div><p><br>&nbsp;</p><div><div><span>Prof. Hartmann's institution has been running the SCIVIAS study for eight years. The liquid biopsy layer of the cohort — blood-based proteomic samples from children across 13 therapeutic areas — is the result of a data collection programme that no pharma company could replicate independently. It required ethics approval, patient consent infrastructure for a paediatric population, multi-year longitudinal sampling, and a clinical team experienced in paediatric rare disease phenotyping. The data exists because a hospital built it. It is not a dataset any company can buy.</span></div></div><p><br>&nbsp;</p><div><div><span>The diagnostic gap it addresses is substantial. For most paediatric rare diseases, the path to diagnosis still runs through invasive procedures: tissue biopsies, bone marrow aspirates, lumbar punctures. These are painful, carry procedural risk, and are difficult to justify in young children without strong clinical suspicion. The average rare disease diagnosis takes five years from first symptoms. In that window, children are treated empirically, disease progresses, and families carry a burden of uncertainty that compounds the clinical problem.</span></div></div><p><br>&nbsp;</p><div><div><span>Blood-based biomarkers — **blood based biomarkers** circulating in plasma after tissue release — could transform this pathway. If proteomics from a standard blood draw can classify disease state accurately enough, invasive procedures can be reserved for confirmation rather than used as first-line diagnostics. Several pharma and diagnostics companies are actively developing liquid biopsy classifiers for paediatric rare disease. Every one of them needs access to an external paediatric cohort to validate or train their model. None of them can replicate the SCIVIAS sample base.</span></div></div><p><br>&nbsp;</p><div><div><span>The commercial interest is real and growing. Companies are willing to pay for training access to this cohort. The institution's problem is not demand — it is compliance. A data transfer agreement covering 1,200 paediatric patients with rare disease diagnoses, proteomic profiles, and clinical variables would require months of legal review, GDPR impact assessments, and data protection board sign-off. And at the end of that process, the institution would have given away its most valuable asset. The dataset — once transferred — is no longer under the institution's control. It can be copied, redistributed, and used beyond any agreement's scope.</span></div></div><p><br>&nbsp;</p><div><div><span>The institution's research ethics board and data protection officer have been clear: no raw transfer. But the institution also cannot afford to leave recurring commercial revenue on the table. Research budgets are under pressure. Clinical data assets that took eight years to build deserve to generate ongoing value.</span></div></div><p><br>&nbsp;</p><div><div><span>### Stakeholders</span></div></div><p><br>&nbsp;</p><div><div><span>- **Prof. Dr. Elisabeth Hartmann, Director of Clinical Research Data:** Owns the data governance strategy and the commercial licensing framework. KPIs: revenue per access period, data governance compliance, publication output from trained models. Needs a monetisation model that does not require raw data transfer.</span></div><div><span>- **Data Protection Officer:** Responsible for GDPR compliance across all research data uses. The paediatric rare disease cohort carries elevated re-identification risk — disease phenotype combined with proteomic profile creates a quasi-unique signature in small populations. No raw transfer under any commercial agreement.</span></div><div><span>- **Research Ethics Board:** Ethics approval covers the cohort's use for academic and translational research. Commercial use by external pharma companies requires explicit scope review. Training access through a controlled environment — where the institution maintains full data custody — is within scope; data transfer is not.</span></div><div><span>- **Head of Bioinformatics:** Technical lead for the SCIVIAS data pipeline. Owns the exploratory data analysis, feature engineering, and the tracebloc workspace configuration. Monitors contributor training runs for anomalous access patterns.</span></div><div><span>- **Pharma / Diagnostics Contributor (VP Clinical Diagnostics):** Needs access to an independent paediatric liquid biopsy cohort to validate or extend their non-invasive classifier. Willing to pay for controlled training access. Evaluation data has to be genuinely independent — not a dataset curated to match their internal model's training distribution.</span></div></div><p><br>&nbsp;</p><div><div><span>---</span></div></div><p><br>&nbsp;</p><div><div><span>## The Underlying Dataset</span></div></div><p><br>&nbsp;</p><div><div><span>The evaluation dataset contains **1,200 paediatric liquid biopsy samples** from children across multiple rare disease groups. Full dataset statistics, feature distributions, and marker behaviour are available in the [Exploratory Data Analysis tab](/explore/liquid-biopsy-proteomics?tab=exploratory-data-analysis).</span></div></div><p><br>&nbsp;</p><div><div><span>**This dataset is augmented.** It was constructed to reflect the statistical structure of a real-world paediatric rare disease liquid biopsy cohort — the circulating marker distributions, the broad protein expression ranges, and the skew profiles characteristic of disease-state versus baseline biomarker behaviour — without containing any identifiable patient records, diagnoses, or hospital data.</span></div></div><p><br>&nbsp;</p><div><div><span>| Property | Value |</span></div><div><span>|----------|-------|</span></div><div><span>| Total samples | 1,200 |</span></div><div><span>| Features | 153 |</span></div><div><span>| Circulating proteins | ~100 (continuous, bulk blood protein levels) |</span></div><div><span>| Specialised disease markers | ~20 (continuous, highly skewed — baseline in most, elevated in disease-state subset) |</span></div><div><span>| Clinical variables | ~30 (continuous, clinical phenotype measurements) |</span></div><div><span>| Categorical features | 3 (including patient identifier and classification target) |</span></div><div><span>| Missing values | None |</span></div><div><span>| Zero inflation | None across all examined features |</span></div><div><span>| Evaluation metric | MSE |</span></div></div><p><br>&nbsp;</p><div><div><span>**A note on the marker features:** The specialised disease markers show highly skewed distributions with heavy right tails. Most patients show near-baseline values; a subset shows strongly elevated readings. This is not a data quality issue — it is the diagnostic signal. Disease-state elevation in these markers is what makes liquid biopsy diagnostically useful. Models that cannot handle right-skewed, sparse biomarker distributions will underperform relative to those that do.</span></div></div><p><br>&nbsp;</p><div><div><span>---</span></div></div><p><br>&nbsp;</p><div><div><span>## Contributor Evaluation Setup</span></div></div><p><br>&nbsp;</p><div><div><span>Each contributor submitted their non-invasive classification model to the tracebloc workspace. The evaluation ran in two phases.</span></div></div><p><br>&nbsp;</p><div><div><span>**Phase 1 — Out-of-the-box performance.** Each model was scored as submitted, with no adaptation to this paediatric cohort. This establishes what the system actually delivers when applied to a new patient population — typically the number that diverges most sharply from what contributors claim in their proposals.</span></div></div><p><br>&nbsp;</p><div><div><span>**Phase 2 — Fine-tuning.** Contributors were given access to the [training environment](/explore/liquid-biopsy-proteomics?tab=training) inside the tracebloc workspace. Each contributor transferred their model into the workspace and ran training on the 1,200-sample patient cohort. This fine-tuned the model weights to the specific marker distributions, protein expression patterns, and clinical variable ranges of the paediatric rare disease population — adapting from a generalised classifier to one calibrated for this cohort. After training, the adapted model was evaluated automatically against the held-out evaluation set. The patient data never left the hospital's infrastructure. Contributors received only their own results; no contributor had visibility into another's training runs or scores before the leaderboard published.</span></div></div><p><br>&nbsp;</p><div><div><span>### Each contributor received:</span></div></div><p><br>&nbsp;</p><div><div><span>- **Training access:** 1,200 liquid biopsy samples (153 features, paediatric rare disease cohort) for model fine-tuning inside the workspace</span></div><div><span>- **Evaluation environment:** Sandboxed execution — adapted models run against the evaluation cohort, no patient data export path available</span></div><div><span>- **Metrics tracked:** MSE on the classification target, performance breakdown by feature block (marker-driven vs. broad protein-driven vs. clinically-augmented), and feature attribution outputs for companion diagnostic development</span></div><div><span>- **Key modelling challenge:** Handling the right-skewed marker distributions — contributors whose models assume normally distributed inputs typically show the largest out-of-the-box degradation and the largest fine-tuning recovery</span></div></div><p><br>&nbsp;</p><div><div><span>---</span></div></div><p><br>&nbsp;</p><div><div><span>## Results</span></div></div><p><br>&nbsp;</p><div><div><span>→ **[View the full model leaderboard](/explore/liquid-biopsy-proteomics?tab=leaderboard)** — complete contributor rankings, MSE breakdown, and marker feature attribution across all submissions.</span></div></div><p><br>&nbsp;</p><div><div><span>| Contributor | Claimed MSE | Out-of-the-Box | After Fine-tuning | Marker-Only MSE |</span></div><div><span>|-------------|------------|----------------|-------------------|----------------|</span></div><div><span>| Contributor A | 0.11 | 0.19 | 0.14 | 0.22 |</span></div><div><span>| **Contributor B** ✅ | **0.13** | **0.15** | **0.11** | **0.13** |</span></div><div><span>| Contributor C ⚠️ | 0.10 | 0.24 | 0.18 | 0.31 |</span></div><div><span>| Contributor D | 0.14 | 0.21 | 0.16 | 0.25 |</span></div></div><p><br>&nbsp;</p><div><div><span>**What the numbers reveal:**</span></div></div><p><br>&nbsp;</p><div><div><span>Contributor B is the only model to improve beyond its own claimed MSE after fine-tuning on this paediatric cohort — moving from 0.13 claimed to 0.11 post-fine-tuning. More tellingly, its marker-only MSE of 0.13 is the strongest in the evaluation: this model has learned to extract diagnostic signal from the skewed, sparse circulating marker features that define liquid biopsy performance. Its architecture handles right-tailed distributions natively rather than transforming them away.</span></div></div><p><br>&nbsp;</p><div><div><span>Contributor C entered with the strongest claimed MSE at 0.10 — the most optimistic proposal in the evaluation. On this paediatric cohort, it delivered 0.24 out-of-the-box and recovered only to 0.18 after fine-tuning. Its marker-only MSE of 0.31 indicates that the model is essentially ignoring the disease markers and relying on the broader protein panel, which carries less disease-specific signal in this population. A claimed MSE advantage of 0.03 over Contributor B becomes a 0.07 gap on real data.</span></div></div><p><br>&nbsp;</p><div><div><span>Contributor A shows moderate generalisation and a meaningful recovery through fine-tuning — from 0.19 to 0.14 — but its marker-only performance reveals the same structural weakness: the model treats the specialised markers as noise rather than signal.</span></div></div><p><br>&nbsp;</p><div><div><span>---</span></div></div><p><br>&nbsp;</p><div><div><span>## Business Impact</span></div></div><p><br>&nbsp;</p><div><div><span>**Illustrative assumptions:** Institution receives €120,000 per contributor access period (6-month training window) / 4 contributors in the initial cohort / paediatric rare disease diagnostic journey currently averages 5 years / validated blood-based classifier could reduce pre-biopsy diagnostic window by 18 months for patients in screened populations</span></div></div><p><br>&nbsp;</p><div><div><span>| Scenario | Annual Revenue | Patient Impact | Companion Diagnostic Readiness |</span></div><div><span>|----------|---------------|----------------|-------------------------------|</span></div><div><span>| No external access | €0 | — | — |</span></div><div><span>| Raw data transfer | One-time fee, asset relinquished | Delayed (legal timeline) | External — institution loses attribution |</span></div><div><span>| **tracebloc workspace access** ✅ | **€480,000 / year recurring** | **18-month earlier diagnosis window** | **Institution retains data custody and co-authorship** |</span></div></div><p><br>&nbsp;</p><div><div><span>The recurring revenue model is the key differentiator. A one-time data transfer agreement generates a single payment and surrenders the asset. A tracebloc workspace generates access fees per contributor per period, scales with demand, and leaves the institution in full control of the data. As the SCIVIAS cohort grows and new therapeutic areas are added, the workspace becomes more valuable — not less — because the training dataset improves without the institution losing custody.</span></div></div><p><br>&nbsp;</p><div><div><span>---</span></div></div><p><br>&nbsp;</p><div><div><span>## Decision</span></div></div><p><br>&nbsp;</p><div><div><span>Prof. Hartmann's institution selects **Contributor B's architecture** as the recommended approach for companion diagnostic development, based on marker-only MSE performance and the model's demonstrated ability to handle paediatric rare disease proteomic distributions. A co-development agreement is initiated: the institution provides ongoing cohort access through the tracebloc workspace; the contributor develops the companion diagnostic towards clinical-grade performance and includes the institution as a named data partner in any regulatory submission.</span></div></div><p><br>&nbsp;</p><div><div><span>The tracebloc workspace stays active after the initial evaluation. As new contributors enter the market and the SCIVIAS cohort adds new therapeutic areas and additional samples, each new contributor enters the same workspace under the same terms. The [leaderboard](/explore/liquid-biopsy-proteomics?tab=leaderboard) becomes a live record of how liquid biopsy classification performance is progressing across contributors and architectures — turning a one-time research asset into an ongoing data collaboration infrastructure.</span></div></div><p><br>&nbsp;</p><div><div><span>**Explore this use case further:**</span></div><div><span>- [View the model leaderboard](/explore/liquid-biopsy-proteomics?tab=leaderboard) — full contributor rankings, marker vs. protein performance breakdown</span></div><div><span>- [Explore the dataset](/explore/liquid-biopsy-proteomics?tab=exploratory-data-analysis) — circulating marker distributions, protein panel statistics, skewness analysis</span></div><div><span>- [Start training](/explore/liquid-biopsy-proteomics?tab=training) — submit your own liquid biopsy classification model to this cohort</span></div></div><p><br>&nbsp;</p><div><div><span>**Related use cases:** See how the same secure access model applies to [pharmacodynamic proteomics validation in paediatric IBD](/explore/pd-proteomics) and [safety metabolomics validation in DILI](/explore/safety-metabolomic). For a broader view of federated learning applications across pharma and healthcare, see our [federated learning applications](https://www.tracebloc.io/blog/federated-learning-applications) guide.</span></div></div><p><br>&nbsp;</p><div><div><span>[Deploy your workspace](https://www.tracebloc.io/?utm_source=templates&amp;utm_medium=app&amp;utm_content=liquid-biopsy-proteomics) or [schedule a call](https://outlook.office.com/book/G0b5c8460107b421ba52e5d891ac7a1ef@NETORGFT4920025.onmicrosoft.com/?ismsaljsauthenabled).</span></div></div><p><br>&nbsp;</p><div><div><span>---</span></div></div><p><br>&nbsp;</p><div><div><span>## Disclaimer</span></div></div><p><br>&nbsp;</p><div><div><span>&gt; **Disclaimer:** The dataset used in this use case is augmented — designed to reflect the statistical structure of real-world paediatric rare disease liquid biopsy proteomics data, including circulating marker distributions, protein expression ranges, and skew profiles characteristic of disease-state biomarker behaviour, without containing any identifiable patient records, diagnoses, or hospital data. The persona, contributor labels, claimed performance figures, revenue assumptions, and commercial scenario are illustrative and based on patterns observed across paediatric rare disease research environments. They do not represent any specific institution, company, dataset, or contractual arrangement.</span></div></div><p><br>&nbsp;</p>","industry":"Agro","flops_per_user":1000000000000000,"owner":{"id":311,"first_name":"waqas","last_name":"khan","profile_image":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/user_profile_photos/user-b023b5000cdf44d49bfbfcd743d497bd.jpeg","is_active":true},"announced_date":null,"start_date":"2026-03-25T11:21:08Z","current_date":"2026-04-03","team_merger_date":null,"final_submission_date":null,"end_date":"2026-06-27T11:20:00Z","created_date":"2026-03-25T11:21:07.204577Z","updated_date":"2026-04-02T10:10:40.499834Z","competition_image":null,"competition_thumbnail":null,"og_image":null,"seo_description_page_title":"","seo_description_page_description":"","seo_leaderboard_page_title":"","seo_leaderboard_page_description":"","seo_eda_page_title":"","seo_eda_page_description":"","keywords":[],"total_participants":0,"high_score":0.0,"test_data_percentage":100,"final_data_percentage":0,"progress_status":"Active","is_sustainable":false,"competition_rules_template":"","score_formula_display":"mean bias error (mbe)","score_formula_description":"<h4><strong>Definition</strong></h4>\r\n\r\n<p>Mean Bias Error (MBE) measures the average bias in a model’s predictions by computing the mean difference between predicted and actual values.</p>\r\n\r\n<p>It indicates whether a model tends to systematically <strong>overestimate</strong> or <strong>underestimate</strong> the target variable.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Calculation</strong></h4>\r\n\r\n<p>Mean Bias Error is calculated as the average of the prediction errors.</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = (1 / N) × Σ ( ŷᵢ − yᵢ )</code>\r\n</p>\r\n\r\n<p>Where:</p>\r\n\r\n<ul>\r\n  <li><strong>yᵢ</strong> = Ground truth value</li>\r\n  <li><strong>ŷᵢ</strong> = Predicted value</li>\r\n  <li><strong>N</strong> = Number of samples</li>\r\n</ul>\r\n\r\n<p>A positive MBE indicates overestimation, while a negative MBE indicates underestimation.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Example</strong></h4>\r\n\r\n<p>If the average prediction error across all samples is −1.5, then:</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = −1.5</code>\r\n</p>","score_formula_code_block":"# NumPy / scikit-learn style implementation\r\nimport numpy as np\r\n\r\n# Ground truth values\r\ny_true = np.array([3, 5, 2.5, 7])\r\n\r\n# Predicted values\r\ny_pred = np.array([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = np.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe)\r\n\r\n\r\n# PyTorch\r\nimport torch\r\n\r\ny_true = torch.tensor([3.0, 5.0, 2.5, 7.0])\r\ny_pred = torch.tensor([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = torch.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe.item())","is_draft":false,"top_leaderboard_entries":[],"daily_inference_limit":3,"task_type":"Classification"},{"id":594,"title":"industry filter test 01","slug":"industry-filter-test-01","dataset":{"id":947,"title":"Regression data for OC - Train","description":null,"intent":"train","dataset_key":"dvbyt4e5","data_samples":"[]","dataset_meta":"{\n    \"count\": {\n        \"label\": {\n            \"11\": 2,\n            \"12\": 3,\n            \"13\": 3,\n            \"14\": 4,\n            \"15\": 3,\n            \"16\": 4,\n            \"17\": 4,\n            \"18\": 4,\n            \"21\": 3,\n            \"22\": 2,\n            \"23\": 1,\n            \"24\": 5,\n            \"25\": 2,\n            \"26\": 2,\n            \"27\": 1,\n            \"29\": 1,\n            \"30\": 2,\n            \"31\": 3,\n            \"32\": 2,\n            \"33\": 2,\n            \"34\": 1,\n            \"35\": 1,\n            \"37\": 1,\n            \"8\": 2,\n            \"9\": 2\n        }\n    },\n    \"total\": 60,\n    \"data_items_label_count\": {\n        \"1\": 60\n    },\n    \"label_density\": {\n        \"11\": 2,\n        \"12\": 3,\n        \"13\": 3,\n        \"14\": 4,\n        \"15\": 3,\n        \"16\": 4,\n        \"17\": 4,\n        \"18\": 4,\n        \"21\": 3,\n        \"22\": 2,\n        \"23\": 1,\n        \"24\": 5,\n        \"25\": 2,\n        \"26\": 2,\n        \"27\": 1,\n        \"29\": 1,\n        \"30\": 2,\n        \"31\": 3,\n        \"32\": 2,\n        \"33\": 2,\n        \"34\": 1,\n        \"35\": 1,\n        \"37\": 1,\n        \"8\": 2,\n        \"9\": 2\n    },\n    \"description\": {},\n    \"unique_data_items_count\": 60\n}","isCompetition":true,"allow_feature_modification":false,"category":"tabular_regression","data_format":"tabular","edge_devices":[{"id":347,"pue_constant":1.0,"tdp_of_cpu":100.0,"v_cpu_cores":8.0,"tdp_of_gpu":1.0,"v_gpu_cores":1.0,"ram":8.32,"vram":0.0,"cpu_name":"Unknown","gpu_name":null,"pod_cpu_cores_initial":2.0,"pod_cpu_cores_limit":2.0,"pod_ram_initial":8.59,"pod_ram_limit":8.59,"pod_num_gpus_initial":1.0,"pod_num_gpus_limit":1.0,"pod_vram_initial":null,"pod_vram_limit":0.0,"cpu_nodes":{"AMD EPYC 7R32-4-16.11":{"cpu_name":"AMD EPYC 7R32","ram":16.11,"tdp_of_cpu":225.0,"v_cpu_cores":4},"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz-4-16.77":{"cpu_name":"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz","ram":16.77,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.55":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.55,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.56":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.56,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Unknown-8-16.73":{"cpu_name":"Unknown","ram":16.73,"tdp_of_cpu":100.0,"v_cpu_cores":8},"Unknown-8-8.32":{"cpu_name":"Unknown","ram":8.32,"tdp_of_cpu":100.0,"v_cpu_cores":8}},"gpu_nodes":{},"location":"PK","status":0}],"status":1,"is_deleted":false,"edge_dataset_status":"available","created_date":"2026-03-25T11:17:42.954831Z","updated_date":"2026-03-25T11:17:43.412290Z"},"dataset_key":"dvbyt4e5","submit_testdata_size":60,"final_testdata_size":0,"dataset_eda_file":null,"teams":[],"account":{"id":5,"name":"Tracebloc GmbH","logo":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/photos/company9abd7e0aa83a452eb87f9051adc7cbc0.png"},"prize_type":"knowledge","privacy_type":"public","total_prize_amount":0.0,"description":"<p>hi....</p>","industry":"Fin","flops_per_user":1000000000000000,"owner":{"id":311,"first_name":"waqas","last_name":"khan","profile_image":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/user_profile_photos/user-b023b5000cdf44d49bfbfcd743d497bd.jpeg","is_active":true},"announced_date":null,"start_date":"2026-03-25T11:17:45Z","current_date":"2026-04-03","team_merger_date":null,"final_submission_date":null,"end_date":"2026-05-12T11:16:00Z","created_date":"2026-03-25T11:17:43.373239Z","updated_date":"2026-04-03T14:55:48.338941Z","competition_image":null,"competition_thumbnail":null,"og_image":null,"seo_description_page_title":"","seo_description_page_description":"","seo_leaderboard_page_title":"","seo_leaderboard_page_description":"","seo_eda_page_title":"","seo_eda_page_description":"","keywords":[],"total_participants":0,"high_score":0.0,"test_data_percentage":100,"final_data_percentage":0,"progress_status":"Active","is_sustainable":false,"competition_rules_template":"","score_formula_display":"mean bias error (mbe)","score_formula_description":"<h4><strong>Definition</strong></h4>\r\n\r\n<p>Mean Bias Error (MBE) measures the average bias in a model’s predictions by computing the mean difference between predicted and actual values.</p>\r\n\r\n<p>It indicates whether a model tends to systematically <strong>overestimate</strong> or <strong>underestimate</strong> the target variable.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Calculation</strong></h4>\r\n\r\n<p>Mean Bias Error is calculated as the average of the prediction errors.</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = (1 / N) × Σ ( ŷᵢ − yᵢ )</code>\r\n</p>\r\n\r\n<p>Where:</p>\r\n\r\n<ul>\r\n  <li><strong>yᵢ</strong> = Ground truth value</li>\r\n  <li><strong>ŷᵢ</strong> = Predicted value</li>\r\n  <li><strong>N</strong> = Number of samples</li>\r\n</ul>\r\n\r\n<p>A positive MBE indicates overestimation, while a negative MBE indicates underestimation.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Example</strong></h4>\r\n\r\n<p>If the average prediction error across all samples is −1.5, then:</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = −1.5</code>\r\n</p>","score_formula_code_block":"# NumPy / scikit-learn style implementation\r\nimport numpy as np\r\n\r\n# Ground truth values\r\ny_true = np.array([3, 5, 2.5, 7])\r\n\r\n# Predicted values\r\ny_pred = np.array([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = np.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe)\r\n\r\n\r\n# PyTorch\r\nimport torch\r\n\r\ny_true = torch.tensor([3.0, 5.0, 2.5, 7.0])\r\ny_pred = torch.tensor([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = torch.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe.item())","is_draft":false,"top_leaderboard_entries":[],"daily_inference_limit":5,"task_type":"Segmentation"},{"id":593,"title":"AI-Powered Weld Inspection System and NDT Testing in Automotive","slug":"industry-filter-testing-2","dataset":{"id":945,"title":"Regression data for OC - Train","description":null,"intent":"train","dataset_key":"drgzq7wg","data_samples":"[]","dataset_meta":"{\n    \"count\": {\n        \"label\": {\n            \"11\": 2,\n            \"12\": 3,\n            \"13\": 3,\n            \"14\": 4,\n            \"15\": 3,\n            \"16\": 4,\n            \"17\": 4,\n            \"18\": 4,\n            \"21\": 3,\n            \"22\": 2,\n            \"23\": 1,\n            \"24\": 5,\n            \"25\": 2,\n            \"26\": 2,\n            \"27\": 1,\n            \"29\": 1,\n            \"30\": 2,\n            \"31\": 3,\n            \"32\": 2,\n            \"33\": 2,\n            \"34\": 1,\n            \"35\": 1,\n            \"37\": 1,\n            \"8\": 2,\n            \"9\": 2\n        }\n    },\n    \"total\": 60,\n    \"data_items_label_count\": {\n        \"1\": 60\n    },\n    \"label_density\": {\n        \"11\": 2,\n        \"12\": 3,\n        \"13\": 3,\n        \"14\": 4,\n        \"15\": 3,\n        \"16\": 4,\n        \"17\": 4,\n        \"18\": 4,\n        \"21\": 3,\n        \"22\": 2,\n        \"23\": 1,\n        \"24\": 5,\n        \"25\": 2,\n        \"26\": 2,\n        \"27\": 1,\n        \"29\": 1,\n        \"30\": 2,\n        \"31\": 3,\n        \"32\": 2,\n        \"33\": 2,\n        \"34\": 1,\n        \"35\": 1,\n        \"37\": 1,\n        \"8\": 2,\n        \"9\": 2\n    },\n    \"description\": {},\n    \"unique_data_items_count\": 60\n}","isCompetition":true,"allow_feature_modification":false,"category":"tabular_regression","data_format":"tabular","edge_devices":[{"id":347,"pue_constant":1.0,"tdp_of_cpu":100.0,"v_cpu_cores":8.0,"tdp_of_gpu":1.0,"v_gpu_cores":1.0,"ram":8.32,"vram":0.0,"cpu_name":"Unknown","gpu_name":null,"pod_cpu_cores_initial":2.0,"pod_cpu_cores_limit":2.0,"pod_ram_initial":8.59,"pod_ram_limit":8.59,"pod_num_gpus_initial":1.0,"pod_num_gpus_limit":1.0,"pod_vram_initial":null,"pod_vram_limit":0.0,"cpu_nodes":{"AMD EPYC 7R32-4-16.11":{"cpu_name":"AMD EPYC 7R32","ram":16.11,"tdp_of_cpu":225.0,"v_cpu_cores":4},"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz-4-16.77":{"cpu_name":"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz","ram":16.77,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.55":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.55,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.56":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.56,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Unknown-8-16.73":{"cpu_name":"Unknown","ram":16.73,"tdp_of_cpu":100.0,"v_cpu_cores":8},"Unknown-8-8.32":{"cpu_name":"Unknown","ram":8.32,"tdp_of_cpu":100.0,"v_cpu_cores":8}},"gpu_nodes":{},"location":"PK","status":0}],"status":1,"is_deleted":false,"edge_dataset_status":"available","created_date":"2026-03-25T10:53:16.215111Z","updated_date":"2026-03-27T15:11:13.766834Z"},"dataset_key":"drgzq7wg","submit_testdata_size":60,"final_testdata_size":0,"dataset_eda_file":null,"teams":[551,552],"account":{"id":5,"name":"Tracebloc GmbH","logo":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/photos/company9abd7e0aa83a452eb87f9051adc7cbc0.png"},"prize_type":"knowledge","privacy_type":"public","total_prize_amount":0.0,"description":"<h2>Overview</h2><blockquote><p><strong>About this use case:</strong> This page shows how biomarker research teams evaluate candidate multi-omic panels across independent patient cohorts — and how tracebloc makes it possible to run that validation on real patient data without centralising a single record. The scenario and numbers reflect patterns observed across rare disease research environments. The dataset is augmented to represent the statistical structure of real-world rare disease cohorts without containing any identifiable patient data. Explore the data, submit your own model, and see how your panel holds up.</p></blockquote><h4>Problem</h4><p>Published biomarker panels rarely survive first contact with an independent cohort. Biomarker validation is the discipline's persistent failure: a panel trained and reported on one institution's patients classifies a second institution's patients significantly worse — often enough to invalidate the clinical claim. For rare disease research teams working across Cystic Fibrosis, Duchenne Muscular Dystrophy, and Spinal Muscular Atrophy, where patient numbers are small and cohorts are hard to assemble, failed replication does not just delay publication. It delays regulatory submission and, ultimately, patient access to treatment.</p><h4>Solution</h4><p>Dr. Sophie Hartmann, Head of Translational Biomarker Research at a rare disease foundation, deploys a tracebloc workspace loaded with 320 anonymised patient records spanning three rare genetic diseases. Biomarker research teams — internal and external — submit their candidate panel models to the workspace. Inside tracebloc's containerised <a href=\"/explore/stratification-genomics?tab=training\">training environment</a>, each model trains on the 256-record patient cohort — fine-tuning to the specific multi-omic feature distributions, disease subtypes, and clinical covariate patterns present in this dataset — without any patient data leaving Sophie's infrastructure. tracebloc handles orchestration, scores each adapted model against the holdout cohort, and publishes results to a <a href=\"/explore/stratification-genomics?tab=leaderboard\">live leaderboard</a> automatically. This is a <a href=\"https://www.tracebloc.io/blog/federated-learning-applications\">federated learning application</a> of reproducible benchmarking: contributors test their panels on real patient data, and the data never moves.</p><h3>Outcome</h3><p>In this example evaluation, the best-performing model held up across all three disease subgroups after fine-tuning — but the gap between the top contributor and the second-best was larger on the Spinal Muscular Atrophy cohort than on Cystic Fibrosis, a finding invisible in any single-institution benchmark. The <a href=\"/explore/stratification-genomics?tab=leaderboard\">leaderboard</a> captures those subgroup differences persistently. The workspace stays active so that as new candidate panels are developed, they face the same holdout cohort and the same evaluation conditions.</p><hr><h2>The Operational Challenge</h2><p>Sophie's team has spent three years assembling a rare disease cohort — 320 patients across Cystic Fibrosis, Duchenne Muscular Dystrophy, and Spinal Muscular Atrophy, each with longitudinal clinical assessments, CFTR mutation profiling, and a suite of functional measures including six-minute walk distance, FEV1 percent predicted, motor function score, and sweat chloride levels. The dataset took two ethics committee cycles, four clinical site agreements, and significant effort to harmonise across measurement protocols. It is, for the field, genuinely valuable.</p><p>The problem is that every biomarker panel her team has evaluated — whether developed internally or submitted by academic collaborators — has been trained and tested on the same patient records it was developed on. When those panels are published, other groups attempt to replicate them. They often cannot. Not because the methods are wrong, but because the panels were never tested on an independent cohort before publication.</p><p>This is not a niche critique. The biomarker replication crisis is well documented. In rare disease specifically, where each disease subtype may have fewer than 100 patients available globally, overfitting to the available cohort is almost inevitable without systematic independent validation. A six-minute walk distance that predicts progression in Sophie's Cystic Fibrosis patients may perform differently in another centre's cohort where patient age distribution or treatment history differs. A CFTR mutation combination that separates disease classes in one country's registry may not separate them in another's.</p><p>The structural problem Sophie faces: the specialists who could validate her panels are at academic centres across Europe. They have their own patient cohorts, their own biomarker expertise, and every incentive to collaborate. But they cannot access her patient records. Ethics approval does not transfer across institutions. GDPR does not permit unilateral data sharing. And even setting aside the legal constraints, centralising sensitive rare disease patient data into a shared research database is a governance commitment that takes months to establish and creates ongoing risk.</p><p>She needs a mechanism that lets external research groups test their models on her cohort — calibrating to her specific disease population — without those researchers ever seeing a single patient record.</p><h3>Stakeholders</h3><ul><li data-list-item-id=\"e2d603a7b7fd22afd63e93923862078e7\"><strong>Dr. Sophie Hartmann, Head of Translational Biomarker Research:</strong> Owns the cohort, the ethics approval, and the responsibility to produce reproducible biomarker evidence that will hold up in regulatory submissions</li><li data-list-item-id=\"e146366a363af409e6b77df0bd9b3944c\"><strong>VP Biomarker Strategy:</strong> Needs validated panels that survive independent replication before committing to Phase II/III endpoint selection; panel failure at regulatory review costs years</li><li data-list-item-id=\"e66f097d187082e933725a16084964ef6\"><strong>Clinical Affairs Lead:</strong> Requires biomarker evidence with documented multi-cohort validation to support IND filings and EMA interactions</li><li data-list-item-id=\"e3cc074858e6e8c2c49beb1509c74c97b\"><strong>Data Protection Officer:</strong> Responsible for GDPR compliance — any data transfer to external academic partners requires formal data sharing agreements that can take six to twelve months</li><li data-list-item-id=\"e9d63d94305ed6a4fefded62e1fa4216e\"><strong>Academic Collaborators (external):</strong> Bioinformatics groups at partner universities with expertise in specific disease subtypes; they want to contribute but cannot access Sophie's patient records under current governance arrangements</li></ul><hr><h2>The Underlying Dataset</h2><p>The evaluation dataset contains <strong>320 anonymised rare disease patient records</strong> spanning three disease groups. Full dataset statistics, feature distributions, and class-level analysis are available in the <a href=\"/explore/stratification-genomics?tab=exploratory-data-analysis\">Exploratory Data Analysis tab</a>.</p><p><strong>This dataset is augmented.</strong> It was constructed to reflect the statistical structure of real-world rare disease cohorts — the disease class distribution, CFTR mutation prevalence patterns, clinical measurement distributions, and feature correlation structure — without containing any identifiable patient information.</p><figure class=\"table\"><table><thead><tr><th>Property</th><th>Value</th></tr></thead><tbody><tr><td>Total records</td><td>320</td></tr><tr><td>Training cohort</td><td>256 records</td></tr><tr><td>Holdout cohort</td><td>64 records</td></tr><tr><td>Features</td><td>254 (250 numerical, 4 categorical)</td></tr><tr><td>Disease classes</td><td>3</td></tr><tr><td>Missing values</td><td>None</td></tr><tr><td>Duplicate records</td><td>None</td></tr><tr><td>Class imbalance ratio</td><td>2.5×</td></tr><tr><td>Evaluation metric</td><td>Multi-class F1 score</td></tr></tbody></table></figure><p><strong>Disease class distribution (full dataset):</strong></p><figure class=\"table\"><table><thead><tr><th>Disease</th><th>Patients</th><th>Share</th></tr></thead><tbody><tr><td>Cystic Fibrosis</td><td>165</td><td>51.6%</td></tr><tr><td>Duchenne Muscular Dystrophy</td><td>89</td><td>27.8%</td></tr><tr><td>Spinal Muscular Atrophy</td><td>66</td><td>20.6%</td></tr></tbody></table></figure><p><strong>A note on the features:</strong> The 254 features span three categories. Mutation markers (CFTR_c_1 through CFTR_c_100+) are binary variables encoding specific CFTR gene variants — present or absent in each patient. Clinical measures include six-minute walk distance (metres), FEV1 percent predicted, motor function score, sweat chloride concentration (mmol/L), steroid use, and cardiac ejection fraction. SMN1 variant markers are included for the SMA subgroup. No features require imputation — the dataset is complete. The class imbalance (Spinal Muscular Atrophy at 20.6% versus Cystic Fibrosis at 51.6%) is preserved as observed in real cohort distributions. A model that classifies every patient as Cystic Fibrosis achieves 51.6% accuracy — which is why per-class recall and macro-F1 are the metrics that matter here.</p><hr><h2>Contributor Evaluation Setup</h2><p>Each contributor submitted their candidate biomarker panel model to the tracebloc workspace. The evaluation ran in two phases.</p><p><strong>Phase 1 — Out-of-the-box performance.</strong> Each model was scored as submitted, with no adaptation to Sophie's patient cohort. This establishes the true baseline: what the published or internally-validated panel actually delivers when applied to an independent patient population without retraining.</p><p><strong>Phase 2 — Fine-tuning.</strong> Contributors were given access to the <a href=\"/explore/stratification-genomics?tab=training\">training environment</a> inside the tracebloc workspace. Each contributor transferred their model into tracebloc and ran training on the 256-record cohort. This process fine-tuned the model to the specific covariate distributions, mutation prevalence patterns, and disease subtype characteristics in Sophie's patient population — adapting from a generalised biomarker classifier to one calibrated for this specific rare disease cohort. After training, the adapted model was evaluated automatically against the 64-record holdout. Contributors received only their own results back; no contributor had visibility into another's performance before the leaderboard published.</p><h3>Each contributor received:</h3><ul><li data-list-item-id=\"eea250e5a14ebe0b0e150b4905c10d59f\"><strong>Training access:</strong> 256 anonymised patient records (254 features, 3 disease classes at realistic distribution) for model fine-tuning inside the workspace</li><li data-list-item-id=\"eb7a95f03e0b5a2215974d470a6f35598\"><strong>Evaluation environment:</strong> Sandboxed execution — adapted models run against the holdout cohort, no patient data export path available</li><li data-list-item-id=\"e25614c7045a85d656dc12b2d7ddaae22\"><strong>Metrics tracked:</strong> Macro-F1 score, per-class recall (especially Duchenne MD and SMA — the minority classes), and feature importance rankings for submitted biomarker panels</li><li data-list-item-id=\"e1ef5a0e6019e251f4145af4957714b5e\"><strong>Subgroup constraint:</strong> Performance on Duchenne MD (27.8%) and Spinal Muscular Atrophy (20.6%) cohorts is weighted in contributor ranking — these are the clinically critical groups where replication failures have the highest consequence</li></ul><hr><h2>Results</h2><p>→ <a href=\"/explore/stratification-genomics?tab=leaderboard\"><strong>View the full model leaderboard</strong></a> — complete contributor rankings, per-class recall, and biomarker feature importance across all submitted panels.</p><figure class=\"table\"><table><thead><tr><th>Contributor</th><th>Claimed F1</th><th>Out-of-the-Box</th><th>After Fine-tuning</th><th>SMA Recall</th></tr></thead><tbody><tr><td>Contributor A</td><td>0.84</td><td>0.71</td><td>0.79</td><td>0.61</td></tr><tr><td><strong>Contributor B</strong> ✅</td><td><strong>0.81</strong></td><td><strong>0.74</strong></td><td><strong>0.86</strong></td><td><strong>0.78</strong></td></tr><tr><td>Contributor C ⚠️</td><td>0.88</td><td>0.77</td><td>0.83</td><td>0.52</td></tr></tbody></table></figure><p><strong>What the numbers reveal:</strong></p><p>Contributor B achieved the strongest macro-F1 after fine-tuning at 0.86, and — more critically — held the highest recall on the Spinal Muscular Atrophy subgroup at 0.78. Starting at 0.74 out-of-the-box, the model improved meaningfully after training on 256 real-distribution patient records inside the tracebloc workspace, with its SMA recall rising from 0.63 to 0.78. This is the replication result: not just that the panel works on a new cohort, but that it can be calibrated to perform robustly on the minority subgroup where clinical decisions are hardest.</p><p>Contributor C had the highest claimed F1 at 0.88 and the strongest out-of-the-box baseline at 0.77. After fine-tuning it reached 0.83 — a meaningful result, but with SMA recall at 0.52, it misclassifies roughly one in two SMA patients. In a disease where the patient population is small and each misclassification delays or misdirects clinical decision-making, a 52% recall on the rarest subgroup is not a publishable panel.</p><p>Contributor A's claimed F1 of 0.84 dropped to 0.71 on the independent cohort before fine-tuning — the largest out-of-the-box degradation in the evaluation. After adaptation it recovered to 0.79, still below both other contributors. The claimed performance was measured on a training distribution that does not match Sophie's patient population.</p><hr><h2>Business Impact</h2><p><strong>Illustrative assumptions:</strong> Rare disease pipeline with 3 candidate biomarker panels / Phase II endpoint selection decision worth $80M+ in downstream trial investment / Cost of failed replication at regulatory review: 12–18 months delay, estimated €3–6M in additional study costs per episode</p><figure class=\"table\"><table><thead><tr><th>Strategy</th><th>SMA Recall</th><th>Replication Risk</th><th>Regulatory Readiness</th><th>Est. Cost of Late Failure</th></tr></thead><tbody><tr><td>Unvalidated (internal only)</td><td>Unknown</td><td>High</td><td>Low — single-cohort evidence</td><td>€3–6M per episode</td></tr><tr><td>Contributor A</td><td>0.61</td><td>Moderate</td><td>Partial — SMA subgroup underperforms</td><td>€1.5–3M exposure</td></tr><tr><td><strong>Contributor B</strong> ✅</td><td><strong>0.78</strong></td><td><strong>Low</strong></td><td><strong>Strong — reproducible across subtypes</strong></td><td><strong>Minimised</strong></td></tr><tr><td>Contributor C</td><td>0.52</td><td>Moderate-High</td><td>Partial — SMA recall insufficient</td><td>€2–4M exposure</td></tr></tbody></table></figure><p>The primary value of this evaluation is not the cost saved on one decision — it is the ability to generate reproducible, multi-cohort biomarker evidence without a data sharing agreement, without centralising patient records, and without the 12–18 month governance cycle those agreements require. Contributor B delivers that evidence. The alternative is publishing a panel that has never been independently validated, and discovering at EMA interaction that the evidence base is insufficient.</p><hr><h2>Decision</h2><p>Sophie selects <strong>Contributor B</strong>'s panel for advancement, with the validation run against her cohort constituting the first independent replication evidence for the panel. The feature importance output from the fine-tuning run identifies which CFTR variant combinations and clinical measures — particularly sweat chloride and motor function score — are driving performance in each disease subgroup, giving her team a mechanistic basis for the panel's design that supports regulatory submission narratives.</p><p>The tracebloc workspace stays active after the initial evaluation. New candidate panels — whether developed by Sophie's team or submitted by academic collaborators — face the same holdout cohort under identical evaluation conditions. The <a href=\"/explore/stratification-genomics?tab=leaderboard\">leaderboard</a> becomes a persistent record of which biomarker approaches replicate and which do not, turning a one-off validation exercise into ongoing reproducibility infrastructure.</p><p><strong>Explore this use case further:</strong></p><ul><li data-list-item-id=\"e6a055fea1aa354286013ffccc61be8b6\"><a href=\"/explore/stratification-genomics?tab=leaderboard\">View the model leaderboard</a> — full contributor rankings, per-class F1, subgroup recall breakdown</li><li data-list-item-id=\"e0975f2a3807a66b26e1db56eaf9eca44\"><a href=\"/explore/stratification-genomics?tab=exploratory-data-analysis\">Explore the dataset</a> — disease class distribution, mutation feature profiles, clinical measure statistics</li><li data-list-item-id=\"e9a0a00c188a75abbc167f240d3cff879\"><a href=\"/explore/stratification-genomics?tab=training\">Start training</a> — submit your own biomarker panel model to this evaluation</li></ul><p><strong>Related use cases:</strong> See how the same federated evaluation approach applies to <a href=\"/explore/prognostic-transcriptomics\">prognostic transcriptomics in neuromuscular disease</a> and <a href=\"/explore/combination-multiomics\">combination multi-omics therapy response prediction</a>. For proteomics-based biomarker discovery, see the <a href=\"/explore/liquid-biopsy-proteomics\">liquid biopsy rare disease use case</a>. For a broader view of what <a href=\"https://www.tracebloc.io/blog/federated-learning-applications\">federated learning applications</a> look like across life sciences, see our guide.</p><p><a href=\"https://www.tracebloc.io/?utm_source=templates&amp;utm_medium=app&amp;utm_content=stratification-genomics\">Deploy your workspace</a> or <a href=\"https://outlook.office.com/book/G0b5c8460107b421ba52e5d891ac7a1ef@NETORGFT4920025.onmicrosoft.com/?ismsaljsauthenabled\">schedule a call</a>.</p><hr><h2>Disclaimer</h2><blockquote><p><strong>Disclaimer:</strong> The dataset used in this use case is augmented — constructed to reflect the statistical structure of real-world rare disease cohorts, including disease class distribution, CFTR mutation prevalence, clinical measurement distributions, and feature correlation patterns, without containing any identifiable patient information. The persona, contributor names, claimed performance figures, and scenario are illustrative and based on patterns observed across rare disease biomarker research environments. They do not represent any specific institution, research group, or regulatory submission.</p></blockquote>","industry":"Fin","flops_per_user":1000000000000000,"owner":{"id":311,"first_name":"waqas","last_name":"khan","profile_image":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/user_profile_photos/user-b023b5000cdf44d49bfbfcd743d497bd.jpeg","is_active":true},"announced_date":null,"start_date":"2026-03-25T10:53:18Z","current_date":"2026-04-03","team_merger_date":null,"final_submission_date":null,"end_date":"2026-05-12T10:52:00Z","created_date":"2026-03-25T10:53:16.740970Z","updated_date":"2026-03-31T07:15:36.508589Z","competition_image":null,"competition_thumbnail":null,"og_image":null,"seo_description_page_title":"","seo_description_page_description":"","seo_leaderboard_page_title":"","seo_leaderboard_page_description":"","seo_eda_page_title":"","seo_eda_page_description":"","keywords":[],"total_participants":2,"high_score":0.0,"test_data_percentage":100,"final_data_percentage":0,"progress_status":"Active","is_sustainable":false,"competition_rules_template":"","score_formula_display":"mean bias error (mbe)","score_formula_description":"<h4><strong>Definition</strong></h4>\r\n\r\n<p>Mean Bias Error (MBE) measures the average bias in a model’s predictions by computing the mean difference between predicted and actual values.</p>\r\n\r\n<p>It indicates whether a model tends to systematically <strong>overestimate</strong> or <strong>underestimate</strong> the target variable.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Calculation</strong></h4>\r\n\r\n<p>Mean Bias Error is calculated as the average of the prediction errors.</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = (1 / N) × Σ ( ŷᵢ − yᵢ )</code>\r\n</p>\r\n\r\n<p>Where:</p>\r\n\r\n<ul>\r\n  <li><strong>yᵢ</strong> = Ground truth value</li>\r\n  <li><strong>ŷᵢ</strong> = Predicted value</li>\r\n  <li><strong>N</strong> = Number of samples</li>\r\n</ul>\r\n\r\n<p>A positive MBE indicates overestimation, while a negative MBE indicates underestimation.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Example</strong></h4>\r\n\r\n<p>If the average prediction error across all samples is −1.5, then:</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = −1.5</code>\r\n</p>","score_formula_code_block":"# NumPy / scikit-learn style implementation\r\nimport numpy as np\r\n\r\n# Ground truth values\r\ny_true = np.array([3, 5, 2.5, 7])\r\n\r\n# Predicted values\r\ny_pred = np.array([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = np.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe)\r\n\r\n\r\n# PyTorch\r\nimport torch\r\n\r\ny_true = torch.tensor([3.0, 5.0, 2.5, 7.0])\r\ny_pred = torch.tensor([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = torch.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe.item())","is_draft":false,"top_leaderboard_entries":[{"id":760,"team_name":"28146592","running_score":0.0},{"id":761,"team_name":"10a80611","running_score":0.0}],"daily_inference_limit":2,"task_type":"Regression"},{"id":592,"title":"industry filter testing 1","slug":"industry-filter-testing-1","dataset":{"id":943,"title":"Regression data for OC - Train","description":null,"intent":"train","dataset_key":"dnrexmol","data_samples":"[]","dataset_meta":"{\n    \"count\": {\n        \"label\": {\n            \"11\": 2,\n            \"12\": 3,\n            \"13\": 3,\n            \"14\": 4,\n            \"15\": 3,\n            \"16\": 4,\n            \"17\": 4,\n            \"18\": 4,\n            \"21\": 3,\n            \"22\": 2,\n            \"23\": 1,\n            \"24\": 5,\n            \"25\": 2,\n            \"26\": 2,\n            \"27\": 1,\n            \"29\": 1,\n            \"30\": 2,\n            \"31\": 3,\n            \"32\": 2,\n            \"33\": 2,\n            \"34\": 1,\n            \"35\": 1,\n            \"37\": 1,\n            \"8\": 2,\n            \"9\": 2\n        }\n    },\n    \"total\": 60,\n    \"data_items_label_count\": {\n        \"1\": 60\n    },\n    \"label_density\": {\n        \"11\": 2,\n        \"12\": 3,\n        \"13\": 3,\n        \"14\": 4,\n        \"15\": 3,\n        \"16\": 4,\n        \"17\": 4,\n        \"18\": 4,\n        \"21\": 3,\n        \"22\": 2,\n        \"23\": 1,\n        \"24\": 5,\n        \"25\": 2,\n        \"26\": 2,\n        \"27\": 1,\n        \"29\": 1,\n        \"30\": 2,\n        \"31\": 3,\n        \"32\": 2,\n        \"33\": 2,\n        \"34\": 1,\n        \"35\": 1,\n        \"37\": 1,\n        \"8\": 2,\n        \"9\": 2\n    },\n    \"description\": {},\n    \"unique_data_items_count\": 60\n}","isCompetition":true,"allow_feature_modification":false,"category":"tabular_regression","data_format":"tabular","edge_devices":[{"id":347,"pue_constant":1.0,"tdp_of_cpu":100.0,"v_cpu_cores":8.0,"tdp_of_gpu":1.0,"v_gpu_cores":1.0,"ram":8.32,"vram":0.0,"cpu_name":"Unknown","gpu_name":null,"pod_cpu_cores_initial":2.0,"pod_cpu_cores_limit":2.0,"pod_ram_initial":8.59,"pod_ram_limit":8.59,"pod_num_gpus_initial":1.0,"pod_num_gpus_limit":1.0,"pod_vram_initial":null,"pod_vram_limit":0.0,"cpu_nodes":{"AMD EPYC 7R32-4-16.11":{"cpu_name":"AMD EPYC 7R32","ram":16.11,"tdp_of_cpu":225.0,"v_cpu_cores":4},"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz-4-16.77":{"cpu_name":"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz","ram":16.77,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.55":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.55,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.56":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.56,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Unknown-8-16.73":{"cpu_name":"Unknown","ram":16.73,"tdp_of_cpu":100.0,"v_cpu_cores":8},"Unknown-8-8.32":{"cpu_name":"Unknown","ram":8.32,"tdp_of_cpu":100.0,"v_cpu_cores":8}},"gpu_nodes":{},"location":"PK","status":0}],"status":1,"is_deleted":false,"edge_dataset_status":"available","created_date":"2026-03-25T10:48:49.465879Z","updated_date":"2026-03-25T10:48:50.016358Z"},"dataset_key":"dnrexmol","submit_testdata_size":60,"final_testdata_size":0,"dataset_eda_file":null,"teams":[],"account":{"id":5,"name":"Tracebloc GmbH","logo":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/photos/company9abd7e0aa83a452eb87f9051adc7cbc0.png"},"prize_type":"knowledge","privacy_type":"public","total_prize_amount":0.0,"description":"Briefly explain the AI use case:\r\n  <ul>\r\n    <li>The use case the model should solve</li>\r\n    <li>The goal of the model (e.g. accuracy, speed, efficiency)</li>\r\n    <li>The evaluation metrics that will be used</li>\r\n    <li>Any technical constraints (frameworks, runtime limits, compute resources)</li>\r\n    <li>Any incentives or recognition for top models</li>\r\n  </ul>","industry":"Cross","flops_per_user":1000000000000000,"owner":{"id":311,"first_name":"waqas","last_name":"khan","profile_image":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/user_profile_photos/user-b023b5000cdf44d49bfbfcd743d497bd.jpeg","is_active":true},"announced_date":null,"start_date":"2026-03-25T10:48:51Z","current_date":"2026-04-03","team_merger_date":null,"final_submission_date":null,"end_date":"2026-05-12T10:45:00Z","created_date":"2026-03-25T10:48:49.973267Z","updated_date":"2026-03-25T10:51:00.073614Z","competition_image":null,"competition_thumbnail":null,"og_image":null,"seo_description_page_title":"","seo_description_page_description":"","seo_leaderboard_page_title":"","seo_leaderboard_page_description":"","seo_eda_page_title":"","seo_eda_page_description":"","keywords":[],"total_participants":0,"high_score":0.0,"test_data_percentage":100,"final_data_percentage":0,"progress_status":"Active","is_sustainable":false,"competition_rules_template":"","score_formula_display":"mean bias error (mbe)","score_formula_description":"<h4><strong>Definition</strong></h4>\r\n\r\n<p>Mean Bias Error (MBE) measures the average bias in a model’s predictions by computing the mean difference between predicted and actual values.</p>\r\n\r\n<p>It indicates whether a model tends to systematically <strong>overestimate</strong> or <strong>underestimate</strong> the target variable.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Calculation</strong></h4>\r\n\r\n<p>Mean Bias Error is calculated as the average of the prediction errors.</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = (1 / N) × Σ ( ŷᵢ − yᵢ )</code>\r\n</p>\r\n\r\n<p>Where:</p>\r\n\r\n<ul>\r\n  <li><strong>yᵢ</strong> = Ground truth value</li>\r\n  <li><strong>ŷᵢ</strong> = Predicted value</li>\r\n  <li><strong>N</strong> = Number of samples</li>\r\n</ul>\r\n\r\n<p>A positive MBE indicates overestimation, while a negative MBE indicates underestimation.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Example</strong></h4>\r\n\r\n<p>If the average prediction error across all samples is −1.5, then:</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = −1.5</code>\r\n</p>","score_formula_code_block":"# NumPy / scikit-learn style implementation\r\nimport numpy as np\r\n\r\n# Ground truth values\r\ny_true = np.array([3, 5, 2.5, 7])\r\n\r\n# Predicted values\r\ny_pred = np.array([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = np.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe)\r\n\r\n\r\n# PyTorch\r\nimport torch\r\n\r\ny_true = torch.tensor([3.0, 5.0, 2.5, 7.0])\r\ny_pred = torch.tensor([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = torch.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe.item())","is_draft":false,"top_leaderboard_entries":[],"daily_inference_limit":5,"task_type":"Object Detection"},{"id":589,"title":"usecase industry test 1","slug":"usecase-industry-test-1","dataset":{"id":937,"title":"Regression data for OC - Train","description":null,"intent":"train","dataset_key":"dsqw6l7l","data_samples":"[]","dataset_meta":"{\n    \"count\": {\n        \"label\": {\n            \"11\": 2,\n            \"12\": 3,\n            \"13\": 3,\n            \"14\": 4,\n            \"15\": 3,\n            \"16\": 4,\n            \"17\": 4,\n            \"18\": 4,\n            \"21\": 3,\n            \"22\": 2,\n            \"23\": 1,\n            \"24\": 5,\n            \"25\": 2,\n            \"26\": 2,\n            \"27\": 1,\n            \"29\": 1,\n            \"30\": 2,\n            \"31\": 3,\n            \"32\": 2,\n            \"33\": 2,\n            \"34\": 1,\n            \"35\": 1,\n            \"37\": 1,\n            \"8\": 2,\n            \"9\": 2\n        }\n    },\n    \"total\": 60,\n    \"data_items_label_count\": {\n        \"1\": 60\n    },\n    \"label_density\": {\n        \"11\": 2,\n        \"12\": 3,\n        \"13\": 3,\n        \"14\": 4,\n        \"15\": 3,\n        \"16\": 4,\n        \"17\": 4,\n        \"18\": 4,\n        \"21\": 3,\n        \"22\": 2,\n        \"23\": 1,\n        \"24\": 5,\n        \"25\": 2,\n        \"26\": 2,\n        \"27\": 1,\n        \"29\": 1,\n        \"30\": 2,\n        \"31\": 3,\n        \"32\": 2,\n        \"33\": 2,\n        \"34\": 1,\n        \"35\": 1,\n        \"37\": 1,\n        \"8\": 2,\n        \"9\": 2\n    },\n    \"description\": {},\n    \"unique_data_items_count\": 60\n}","isCompetition":true,"allow_feature_modification":false,"category":"tabular_regression","data_format":"tabular","edge_devices":[{"id":347,"pue_constant":1.0,"tdp_of_cpu":100.0,"v_cpu_cores":8.0,"tdp_of_gpu":1.0,"v_gpu_cores":1.0,"ram":8.32,"vram":0.0,"cpu_name":"Unknown","gpu_name":null,"pod_cpu_cores_initial":2.0,"pod_cpu_cores_limit":2.0,"pod_ram_initial":8.59,"pod_ram_limit":8.59,"pod_num_gpus_initial":1.0,"pod_num_gpus_limit":1.0,"pod_vram_initial":null,"pod_vram_limit":0.0,"cpu_nodes":{"AMD EPYC 7R32-4-16.11":{"cpu_name":"AMD EPYC 7R32","ram":16.11,"tdp_of_cpu":225.0,"v_cpu_cores":4},"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz-4-16.77":{"cpu_name":"Intel(R) Xeon(R) CPU E5-2686 v4 @ 2.30GHz","ram":16.77,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.55":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.55,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.56":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.56,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Unknown-8-16.73":{"cpu_name":"Unknown","ram":16.73,"tdp_of_cpu":100.0,"v_cpu_cores":8},"Unknown-8-8.32":{"cpu_name":"Unknown","ram":8.32,"tdp_of_cpu":100.0,"v_cpu_cores":8}},"gpu_nodes":{},"location":"PK","status":0}],"status":1,"is_deleted":false,"edge_dataset_status":"available","created_date":"2026-03-25T09:02:04.908575Z","updated_date":"2026-03-25T09:02:05.474781Z"},"dataset_key":"dsqw6l7l","submit_testdata_size":60,"final_testdata_size":0,"dataset_eda_file":null,"teams":[],"account":{"id":5,"name":"Tracebloc GmbH","logo":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/photos/company9abd7e0aa83a452eb87f9051adc7cbc0.png"},"prize_type":"knowledge","privacy_type":"public","total_prize_amount":0.0,"description":"Briefly explain the AI use case:\r\n  <ul>\r\n    <li>The use case the model should solve</li>\r\n    <li>The goal of the model (e.g. accuracy, speed, efficiency)</li>\r\n    <li>The evaluation metrics that will be used</li>\r\n    <li>Any technical constraints (frameworks, runtime limits, compute resources)</li>\r\n    <li>Any incentives or recognition for top models</li>\r\n  </ul>","industry":"Agro","flops_per_user":1000000000000000,"owner":{"id":311,"first_name":"waqas","last_name":"khan","profile_image":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/user_profile_photos/user-b023b5000cdf44d49bfbfcd743d497bd.jpeg","is_active":true},"announced_date":null,"start_date":"2026-03-25T09:02:07Z","current_date":"2026-04-03","team_merger_date":null,"final_submission_date":null,"end_date":"2026-05-12T09:01:00Z","created_date":"2026-03-25T09:02:05.428405Z","updated_date":"2026-03-25T09:02:56.171696Z","competition_image":null,"competition_thumbnail":null,"og_image":null,"seo_description_page_title":"","seo_description_page_description":"","seo_leaderboard_page_title":"","seo_leaderboard_page_description":"","seo_eda_page_title":"","seo_eda_page_description":"","keywords":[],"total_participants":0,"high_score":0.0,"test_data_percentage":100,"final_data_percentage":0,"progress_status":"Active","is_sustainable":false,"competition_rules_template":"","score_formula_display":"mean bias error (mbe)","score_formula_description":"<h4><strong>Definition</strong></h4>\r\n\r\n<p>Mean Bias Error (MBE) measures the average bias in a model’s predictions by computing the mean difference between predicted and actual values.</p>\r\n\r\n<p>It indicates whether a model tends to systematically <strong>overestimate</strong> or <strong>underestimate</strong> the target variable.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Calculation</strong></h4>\r\n\r\n<p>Mean Bias Error is calculated as the average of the prediction errors.</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = (1 / N) × Σ ( ŷᵢ − yᵢ )</code>\r\n</p>\r\n\r\n<p>Where:</p>\r\n\r\n<ul>\r\n  <li><strong>yᵢ</strong> = Ground truth value</li>\r\n  <li><strong>ŷᵢ</strong> = Predicted value</li>\r\n  <li><strong>N</strong> = Number of samples</li>\r\n</ul>\r\n\r\n<p>A positive MBE indicates overestimation, while a negative MBE indicates underestimation.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Example</strong></h4>\r\n\r\n<p>If the average prediction error across all samples is −1.5, then:</p>\r\n\r\n<p>\r\n  <code>Mean Bias Error = −1.5</code>\r\n</p>","score_formula_code_block":"# NumPy / scikit-learn style implementation\r\nimport numpy as np\r\n\r\n# Ground truth values\r\ny_true = np.array([3, 5, 2.5, 7])\r\n\r\n# Predicted values\r\ny_pred = np.array([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = np.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe)\r\n\r\n\r\n# PyTorch\r\nimport torch\r\n\r\ny_true = torch.tensor([3.0, 5.0, 2.5, 7.0])\r\ny_pred = torch.tensor([2.5, 4.5, 2.0, 6.0])\r\n\r\nmbe = torch.mean(y_pred - y_true)\r\nprint(\"Mean Bias Error:\", mbe.item())","is_draft":false,"top_leaderboard_entries":[],"daily_inference_limit":5,"task_type":"Classification"},{"id":534,"title":"Divya - Object Detection CPU","slug":"divya-object-detection-cpu","dataset":{"id":758,"title":"Crowd Mini Train","description":null,"intent":"train","dataset_key":"dpa0jef1","data_samples":"[]","dataset_meta":"{\n    \"count\": {\n        \"label\": {\n            \"awning-tricycle\": 73,\n            \"bicycle\": 108,\n            \"bus\": 69,\n            \"car\": 1802,\n            \"motor\": 368,\n            \"pedestrian\": 905,\n            \"people\": 358,\n            \"tricycle\": 83,\n            \"truck\": 197,\n            \"van\": 261\n        }\n    },\n    \"total\": 4224,\n    \"data_items_label_count\": {\n        \"1\": 4224\n    },\n    \"label_density\": {\n        \"awning-tricycle\": 73,\n        \"bicycle\": 108,\n        \"bus\": 69,\n        \"car\": 1802,\n        \"motor\": 368,\n        \"pedestrian\": 905,\n        \"people\": 358,\n        \"tricycle\": 83,\n        \"truck\": 197,\n        \"van\": 261\n    },\n    \"description\": {},\n    \"unique_data_items_count\": 4224\n}","isCompetition":true,"allow_feature_modification":false,"category":"object_detection","data_format":"image","edge_devices":[{"id":304,"pue_constant":1.0,"tdp_of_cpu":120.0,"v_cpu_cores":4.0,"tdp_of_gpu":70.0,"v_gpu_cores":448.0,"ram":16.55,"vram":15.0,"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","gpu_name":"Tesla T4","pod_cpu_cores_initial":2.0,"pod_cpu_cores_limit":2.0,"pod_ram_initial":8.59,"pod_ram_limit":8.59,"pod_num_gpus_initial":1.0,"pod_num_gpus_limit":1.0,"pod_vram_initial":0.0,"pod_vram_limit":15.0,"cpu_nodes":{"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.55":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.55,"tdp_of_cpu":120.0,"v_cpu_cores":4},"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz-4-16.56":{"cpu_name":"Intel(R) Xeon(R) Platinum 8259CL CPU @ 2.50GHz","ram":16.56,"tdp_of_cpu":120.0,"v_cpu_cores":4}},"gpu_nodes":{"Tesla T4-448-15.0":{"gpu_name":"Tesla T4","tdp_of_gpu":70.0,"v_gpu_cores":448,"vram":15.0}},"location":"DE","status":1}],"status":1,"is_deleted":false,"edge_dataset_status":"available","created_date":"2025-09-25T13:13:07.695514Z","updated_date":"2026-03-11T08:09:54.423932Z"},"dataset_key":"dpa0jef1","submit_testdata_size":1194,"final_testdata_size":0,"dataset_eda_file":null,"teams":[331,332,333,334,335,484,541,542],"account":{"id":5,"name":"Tracebloc GmbH","logo":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/photos/company9abd7e0aa83a452eb87f9051adc7cbc0.png"},"prize_type":"knowledge","privacy_type":"public","total_prize_amount":0.0,"description":"<h1 id=\"title-0\">Description</h1><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><br>This competition is the ideal starting point for you to learn the in’s and out’s of how federated machine learning code competitions on the tracebloc platform work. Think of this competition as a fun space to try out all the features we offer.​<br>​ ​<br>The key distinction between this code competition and others found on tracebloc is that it doesn't involve sensitive information. However, we encourage you to handle the data as if it were sensitive, using only the resources provided us. This will help you become accustomed to the exciting competitions that await you in the future.​<br>​<br>The goal of this competition is to take some work from the shoulders of doctors and classify medical x-ray mammography images using your machine learning models. If you want to get to know the dataset, simply have a look at the \"Data\" and \"Explorative Data Analysis\" tabs.​<br>​<br>Once you’re ready to join the fun, click on the \"join competition\" button.​<br>​</p><h3 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:18px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:600 !important;letter-spacing:0.1px !important;line-height:28px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">The Challenge</h3><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">&nbsp;</p><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">Did you know that breast cancer is the most common cancer found in women worldwide? &nbsp;<br><br>​ Sadly, breast cancer prevention options are limited, which makes early detection incredibly important to increase the chances of a successful treatment and cure. Mammography is currently the most effective method for detecting breast cancer in women aged 50 to 69 years. Mammography is a medical imaging test utilizing low energy X-rays. During the test, the breast is compressed between two plates and an X-ray image is taken. &nbsp;<br>The critical point in this challenge is that every X-ray image contains a suspicious mass found by a radiologist. Your challenge will be to use machine learning techniques to accurately separate the malignant masses from the benign masses.<br>&nbsp;</p><h3 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:18px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:600 !important;letter-spacing:0.1px !important;line-height:28px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">The Data</h3><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">&nbsp;</p><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">Our competition features the CBIS-DDSM dataset (Curated Breast Imaging Subset of DDSM), an updated and standardized version of the Digital Database for Screening Mammography (DDSM).<br>​<br>The DDSM is a comprehensive database of 2,620 scanned film mammography studies that contains benign and malignant cases with verified pathology information. This dataset is widely regarded as a valuable tool in the development and testing of decision support systems for breast cancer detection.<br>​ CBIS-DDSM (Curated Breast Imaging Subset of DDSM), includes decompressed images, data selection and curation by trained mammographers and pathologic diagnosis for training data, formatted like modern computer vision data sets.<br>​ Join us in this exciting code competition and help to find new ways of saving lives by further improving breast-cancer screening!<br>​<br>​</p><h3 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:18px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:600 !important;letter-spacing:0.1px !important;line-height:28px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">Resources</h3><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e8bf039b9a58044a9c8294584984424cd\">Sawyer-Lee, R., Gimenez, F., Hoogi, A., &amp; Rubin, D. (2016). Curated Breast Imaging Subset of Digital Database for Screening Mammography (CBIS-DDSM) (Version 1) [Data set]. The Cancer Imaging Archive. <a style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(1, 165, 204);font-family:Barlow, sans-serif;font-size:16px;font-weight:500;letter-spacing:0.16px;line-height:24px;margin:0px;padding:0px;text-decoration:inherit;text-rendering:optimizelegibility;transition:color 0.2s;\" href=\"https://doi.org/10.7937/K9/TCIA.2016.7O02S9CY\" target=\"_blank\">https://doi.org/10.7937/K9/TCIA.2016.7O02S9CY​</a></li></ul><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">&nbsp;</p><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-1\">Evaluation</h2><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">&nbsp;</p><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">Here you’ll find the evaluation metric your model's performance will be measured with, as well as a short example and explanation. The main objective of the competition is to improve that score by as much as possible.​<br>​<br>​ For this competition, you are tasked with binary classification and need to improve your models F1 score on the test dataset.​<br>​<br>​ The F1 score is the harmonic mean between precision and recall and can be computed like this (for an example ground truth and model prediction)​ (click <a style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(1, 165, 204);font-family:Barlow, sans-serif;font-size:16px;font-weight:500;letter-spacing:0.16px;line-height:24px;margin:0px;padding:0px;text-decoration:inherit;text-rendering:optimizelegibility;transition:color 0.2s;\" href=\"https://en.wikipedia.org/wiki/F-score\">here</a> for reference)<br>​<br>​</p><h3 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:18px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:600 !important;letter-spacing:0.1px !important;line-height:28px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">Code Implementation</h3><div style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;margin:0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><pre style=\"background-color:rgb(31, 31, 31) !important;border-radius:8px !important;border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(244, 244, 244) !important;font-family:&quot;Courier New&quot;, monospace !important;font-feature-settings:normal;font-size:1em;font-variation-settings:normal;margin-bottom:16px !important;margin-left:0px;margin-right:0px;margin-top:16px !important;overflow-x:auto;padding:16px !important;text-rendering:optimizelegibility;\"><code class=\"language-plaintext\" style=\"background-color:initial;border-radius:4px;border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(244, 244, 244);font-family:&quot;Courier New&quot;, monospace;font-feature-settings:normal;font-size:14px;font-variation-settings:normal;margin:0px;padding:0px;text-rendering:optimizelegibility;\">\r\n# Example Ground Truth and Model Prediction\r\n\r\nground_truth = [1, 1, 1, 0, 0, 1, 0, 1, 0]\r\nprediction = [1, 1, 0, 0, 1, 1, 0, 1, 0]\r\n\r\n\r\n# implementation using sklearn\r\n\r\nfrom sklearn import metrics\r\nmetrics.f1_score(ground_truth, prediction)\r\n\r\n\r\n# basic implementation\r\n\r\ndef true_positive(ground_truth, prediction):\r\n    tp = 0\r\n    for gt, pred in zip(ground_truth, prediction):\r\n        if gt == 1 and pred == 1:\r\n            tp +=1\r\n    return tp\r\n\r\ndef true_negative(ground_truth, prediction):\r\n    tn = 0\r\n    for gt, pred in zip(ground_truth, prediction):\r\n        if gt == 0 and pred == 0:\r\n            tn +=1\r\n    return tn\r\n\r\ndef false_positive(ground_truth, prediction):\r\n    fp = 0\r\n    for gt, pred in zip(ground_truth, prediction):\r\n        if gt == 0 and pred == 1:\r\n            fp +=1\r\n    return fp\r\n\r\ndef false_negative(ground_truth, prediction):\r\n    fn = 0\r\n    for gt, pred in zip(ground_truth, prediction):\r\n        if gt == 1 and pred == 0:\r\n            fn +=1\r\n    return fn\r\n\r\ndef recall(ground_truth, prediction):\r\n    tp = true_positive(ground_truth, prediction)  \r\n    fn = false_negative(ground_truth, prediction)  \r\n    prec = tp/ (tp + fn)  \r\n    return prec\r\n\r\ndef precision(ground_truth, prediction):\r\n    tp = true_positive(ground_truth, prediction)  \r\n    fp = false_positive(ground_truth, prediction)  \r\n    prec = tp/ (tp + fp)  \r\n    return prec\r\n\r\ndef f1(ground_truth, prediction):\r\n    p = precision(ground_truth, prediction)\r\n    r = recall(ground_truth, prediction)\r\n    f1_score = 2 * p * r/ (p + r) \r\n    return f1_score\r\n\r\nf1(ground_truth, prediction)\r\n</code></pre></div><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-2\">Timeline</h2><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">&nbsp;</p><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">This competition will run all year and around the clock, but that won’t usually be the case with other competitions.<br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"eff564bbe1005e748872086c79650f773\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Announced</strong>: The announcement date, is the point in time where the dataset or competition information are shared with the data science community.</li></ul><p><br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e38e483d76e8d64fe86c133088aa6eb73\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Start</strong>: The specific day and time when participants are able to start working on the data science competition.</li></ul><p><br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e2c66ef691b01654b7a4921d286615537\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Team Merger Deadline</strong>: The last date by which participants can decide to join forces and work together as a team in the competition.</li></ul><p><br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e9362348e9f05aa6a39ad233804f7779e\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Final submission deadline</strong>: The date by when the final 2 submissions need to be submitted. These two final submission from each team will be used to create the final leaderboard</li></ul><p><br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e0f2813904eba4513031d05ef78de7b6b\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Final Results</strong>: The rankings or scores of all participants or teams, determined after all submissions are evaluated according to the competition's scoring system.</li></ul><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><br>All deadlines are at 11:59 PM UTC on the corresponding day unless otherwise noted. The competition organizers reserve the right to update the contest timeline if they deem it necessary.</p><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">&nbsp;</p><h3 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:18px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:600 !important;letter-spacing:0.1px !important;line-height:28px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">Acknowledgements</h3><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e959623dc510c61a4bd2ad218bccb9ccd\">Lee, R. S., Gimenez, F., Hoogi, A., Miyake, K. K., Gorovoy, M., &amp; Rubin, D. L. (2017). A curated mammography data set for use in computer-aided detection and diagnosis research. In Scientific Data (Vol. 4, Issue 1). Springer Science and Business Media LLC. <a style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(1, 165, 204);font-family:Barlow, sans-serif;font-size:16px;font-weight:500;letter-spacing:0.16px;line-height:24px;margin:0px;padding:0px;text-decoration:inherit;text-rendering:optimizelegibility;transition:color 0.2s;\" href=\"https://doi.org/10.1038/sdata.2017.177%E2%80%8B\" target=\"_blank\">https://doi.org/10.1038/sdata.2017.177​</a></li><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:8px 0px 0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e9e20bd6eac148602dd1eb6c1c8175012\">​</li><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:8px 0px 0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e5f786c085c6734bd5c60110ec040a206\">Clark, K., Vendt, B., Smith, K., Freymann, J., Kirby, J., Koppel, P., Moore, S., Phillips, S., Maffitt, D., Pringle, M., Tarbox, L., &amp; Prior, F. (2013). The Cancer Imaging Archive (TCIA): Maintaining and Operating a Public Information Repository. In Journal of Digital Imaging (Vol. 26, Issue 6, pp. 1045–1057). Springer Science and Business Media LLC. <a style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(1, 165, 204);font-family:Barlow, sans-serif;font-size:16px;font-weight:500;letter-spacing:0.16px;line-height:24px;margin:0px;padding:0px;text-decoration:inherit;text-rendering:optimizelegibility;transition:color 0.2s;\" href=\"https://doi.org/10.1007/s10278-013-9622-7\" target=\"_blank\">https://doi.org/10.1007/s10278-013-9622-7​</a></li></ul><p><br><br>&nbsp;</p><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-3\">Data Details</h2><p><br>&nbsp;</p><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-4\">Generally,</h2><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">here you’ll find general information about the competition dataset. The data itself is kept federated within our partners and tracebloc’s infrastructure to ensure the privacy of the data. As this is competition is for introductory purposes, the privacy of the data doesn’t really need to be protected. However, this won’t be the case for most of our other competitions.<br>If you want to learn more about how federated learning works, have a look at this.</p><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-5\">The Dataset</h2><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">This excerpt from the CBIS-DDSM dataset contains 16000 images, with a train / test split of 0.75 / 0.25. The test dataset is further divided into a validation part (3000 images) and a test part (1000 images) for the final evaluation of your model. The images you can see here are 10 sample images that are representative but not part of the actual dataset you will be training your models on.<br><br>Your task is binary classification of the X-ray mammography images into the classes “benign” and “malignant”. The dataset contains images of both the right and left breast.</p><p><br><br>&nbsp;</p><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-6\">Evaluation</h2><p><br>&nbsp;</p><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-7\">Evaluation</h2><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">Here you’ll find the evaluation metric your model's performance will be measured with, as well as a short example and explanation. The main objective of the competition is to improve that score by as much as possible.​<br>​<br>​ For this competition, you are tasked with binary classification and need to improve your models F1 score on the test dataset.​<br>​<br>​ The F1 score is the harmonic mean between precision and recall and can be computed like this (for an example ground truth and model prediction)​ (click <a style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(1, 165, 204);font-family:Barlow, sans-serif;font-size:16px;font-weight:500;letter-spacing:0.16px;line-height:24px;margin:0px;padding:0px;text-decoration:inherit;text-rendering:optimizelegibility;transition:color 0.2s;\" href=\"https://en.wikipedia.org/wiki/F-score\">here</a> for reference)<br>​<br>​</p><h3 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:18px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:600 !important;letter-spacing:0.1px !important;line-height:28px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">Code Implementation</h3><div style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;margin:0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><pre style=\"background-color:rgb(31, 31, 31) !important;border-radius:8px !important;border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(244, 244, 244) !important;font-family:&quot;Courier New&quot;, monospace !important;font-feature-settings:normal;font-size:1em;font-variation-settings:normal;margin-bottom:16px !important;margin-left:0px;margin-right:0px;margin-top:16px !important;overflow-x:auto;padding:16px !important;text-rendering:optimizelegibility;\"><code class=\"language-plaintext\" style=\"background-color:initial;border-radius:4px;border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(244, 244, 244);font-family:&quot;Courier New&quot;, monospace;font-feature-settings:normal;font-size:14px;font-variation-settings:normal;margin:0px;padding:0px;text-rendering:optimizelegibility;\">\r\n# Example Ground Truth and Model Prediction\r\n\r\nground_truth = [1, 1, 1, 0, 0, 1, 0, 1, 0]\r\nprediction = [1, 1, 0, 0, 1, 1, 0, 1, 0]\r\n\r\n\r\n# implementation using sklearn\r\n\r\nfrom sklearn import metrics\r\nmetrics.f1_score(ground_truth, prediction)\r\n\r\n\r\n# basic implementation\r\n\r\ndef true_positive(ground_truth, prediction):\r\n    tp = 0\r\n    for gt, pred in zip(ground_truth, prediction):\r\n        if gt == 1 and pred == 1:\r\n            tp +=1\r\n    return tp\r\n\r\ndef true_negative(ground_truth, prediction):\r\n    tn = 0\r\n    for gt, pred in zip(ground_truth, prediction):\r\n        if gt == 0 and pred == 0:\r\n            tn +=1\r\n    return tn\r\n\r\ndef false_positive(ground_truth, prediction):\r\n    fp = 0\r\n    for gt, pred in zip(ground_truth, prediction):\r\n        if gt == 0 and pred == 1:\r\n            fp +=1\r\n    return fp\r\n\r\ndef false_negative(ground_truth, prediction):\r\n    fn = 0\r\n    for gt, pred in zip(ground_truth, prediction):\r\n        if gt == 1 and pred == 0:\r\n            fn +=1\r\n    return fn\r\n\r\ndef recall(ground_truth, prediction):\r\n    tp = true_positive(ground_truth, prediction)  \r\n    fn = false_negative(ground_truth, prediction)  \r\n    prec = tp/ (tp + fn)  \r\n    return prec\r\n\r\ndef precision(ground_truth, prediction):\r\n    tp = true_positive(ground_truth, prediction)  \r\n    fp = false_positive(ground_truth, prediction)  \r\n    prec = tp/ (tp + fp)  \r\n    return prec\r\n\r\ndef f1(ground_truth, prediction):\r\n    p = precision(ground_truth, prediction)\r\n    r = recall(ground_truth, prediction)\r\n    f1_score = 2 * p * r/ (p + r) \r\n    return f1_score\r\n\r\nf1(ground_truth, prediction)\r\n\r\n\r\n</code></pre></div><p><br><br>&nbsp;</p><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-8\">Timeline</h2><p><br>&nbsp;</p><h2 style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:20px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:700 !important;letter-spacing:0.1px !important;line-height:26px !important;margin:48px 0px 0px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\" id=\"title-9\">General Info</h2><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">&nbsp;</p><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\">This competition will run all year and around the clock, but that won’t usually be the case with other competitions.<br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"eeb48cabfc25045000f2849ca4d7bb380\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Announced</strong>: The announcement date, is the point in time where the dataset or competition information are shared with the data science community.</li></ul><p><br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e2edf924591cbc7d0c319c74f822c4e93\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Start</strong>: The specific day and time when participants are able to start working on the data science competition.</li></ul><p><br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e170dcaed188339e81324afa20f53688d\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Team Merger Deadline</strong>: The last date by which participants can decide to join forces and work together as a team in the competition.</li></ul><p><br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e2c7d0046fcd0371a1d2a0f9f7da70ac2\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Final submission deadline</strong>: The date by when the final 2 submissions need to be submitted. These two final submission from each team will be used to create the final leaderboard</li></ul><p><br>&nbsp;</p><ul style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(75, 75, 75);font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:16px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.16px;list-style:outside disc;margin:20px 0px 0px 24px;orphans:2;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><li style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, sans-serif;font-size:17px !important;font-style:normal;font-weight:500 !important;letter-spacing:0.1px !important;line-height:30px !important;margin:0px;padding:0px 0px 0px 8px;text-rendering:optimizelegibility;\" data-list-item-id=\"e459a71cc567c87e50990de53b2ee49d9\"><strong style=\"border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0);font-family:Barlow, &quot;Barlow Fallback&quot; !important;margin:0px;padding:0px;text-rendering:optimizelegibility;\">Final Results</strong>: The rankings or scores of all participants or teams, determined after all submissions are evaluated according to the competition's scoring system.</li></ul><p style=\"-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);border-style:solid;border-width:0px;box-sizing:inherit;color:rgb(0, 0, 0) !important;font-family:Barlow, &quot;Barlow Fallback&quot;;font-size:17px !important;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:500;letter-spacing:0.1px !important;line-height:30px !important;margin-bottom:0px;margin-left:0px;margin-right:0px;margin-top:20px !important;orphans:2;overflow-wrap:break-word !important;padding:0px;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-rendering:optimizelegibility;text-transform:none;white-space:normal;widows:2;word-spacing:0px;\"><br>All deadlines are at 11:59 PM UTC on the corresponding day unless otherwise noted. The competition organizers reserve the right to update the contest timeline if they deem it necessary.</p>","industry":"","flops_per_user":200000000000000000,"owner":{"id":33,"first_name":"Lukas","last_name":"Wuttke","profile_image":"https://s3.eu-central-1.amazonaws.com/tracebloc-develop-s3-bucket/xrayimagedata/media/user_profile_photos/user-65fb32b7675b47bbb6ef89ef1690967a.jpeg","is_active":true},"announced_date":null,"start_date":"2025-09-25T13:13:09Z","current_date":"2026-04-03","team_merger_date":null,"final_submission_date":null,"end_date":"2025-11-12T14:11:00Z","created_date":"2025-09-25T13:13:08.240002Z","updated_date":"2026-03-17T11:41:21.880920Z","competition_image":null,"competition_thumbnail":null,"og_image":null,"seo_description_page_title":"","seo_description_page_description":"","seo_leaderboard_page_title":"","seo_leaderboard_page_description":"","seo_eda_page_title":"","seo_eda_page_description":"","keywords":[],"total_participants":8,"high_score":0.0009821143466979265,"test_data_percentage":100,"final_data_percentage":0,"progress_status":"Finished","is_sustainable":false,"competition_rules_template":"","score_formula_display":"Intersection Over Union (IOU)","score_formula_description":"<h4><strong>Definition</strong></h4>\r\n\r\n<p>Intersection over Union (IoU) measures the overlap between predicted and ground truth regions.</p>\r\n\r\n<p>It is commonly used in object detection and image segmentation tasks to evaluate how accurately a model predicts the location and shape of objects.</p>\r\n\r\n<hr />\r\n\r\n<h4><strong>Calculation</strong></h4>\r\n\r\n<p>IoU is computed as the ratio of the intersection area to the union area of the predicted and ground truth regions.</p>\r\n\r\n<p>\r\n  <code>IoU = Intersection / Union</code>\r\n</p>\r\n\r\n<p>Where:</p>\r\n\r\n<ul>\r\n  <li><strong>Intersection</strong> = Overlapping area between prediction and ground truth</li>\r\n  <li><strong>Union</strong> = Total area covered by both prediction and ground truth</li>\r\n</ul>\r\n\r\n<hr />\r\n\r\n<h4><strong>Example</strong></h4>\r\n\r\n<p>If the overlapping area between a predicted region and the ground truth is 40 pixels, and the total combined area is 70 pixels, then:</p>\r\n\r\n<p>\r\n  <code>IoU = 40 / 70 ≈ 0.57</code>\r\n</p>","score_formula_code_block":"# scikit-learn\r\nfrom sklearn.metrics import jaccard_score\r\n\r\n# Ground truth mask (1 = object, 0 = background)\r\ny_true = [1, 1, 0, 0, 1, 0, 1]\r\n\r\n# Predicted mask\r\ny_pred = [1, 0, 0, 0, 1, 1, 1]\r\n\r\niou = jaccard_score(y_true, y_pred)\r\nprint(\"IoU:\", iou)\r\n\r\n\r\n# PyTorch\r\nimport torch\r\n\r\n# Ground truth mask\r\ny_true = torch.tensor([1, 1, 0, 0, 1, 0, 1], dtype=torch.bool)\r\n\r\n# Predicted mask\r\ny_pred = torch.tensor([1, 0, 0, 0, 1, 1, 1], dtype=torch.bool)\r\n\r\nintersection = (y_true & y_pred).sum().float()\r\nunion = (y_true | y_pred).sum().float()\r\n\r\niou = intersection / union\r\nprint(\"IoU:\", iou.item())","is_draft":false,"top_leaderboard_entries":[{"id":540,"team_name":"eafeb5ab","running_score":0.0009821143466979265},{"id":541,"team_name":"7bfb1702","running_score":0.0},{"id":542,"team_name":"yolo v8 - bot","running_score":0.0}],"daily_inference_limit":5,"task_type":null}]}