Skip to main content
cancel
Showing results forย 
Search instead forย 
Did you mean:ย 

Get Fabric certified for FREE! Don't miss your chance! Learn more

Reply
Arshi8109
New Contributor

Cold Start in Recommendation Models

How can we sold cold start user issue even we have send the user cohort signals also, without penalizing other users

1 ACCEPTED SOLUTION
deborshi_nag
Contributor

Hi @Arshi8109 

 

Please use the following approach:

 

  • Global Baseline (safe, non-personalized)

    • Popularity & recency trends with minimal bias and diversity constraints.
    • Use catalogโ€‘level controls (e.g., de-dupe, diversity by category/brand).
  • Cohortโ€‘Aware Prior (hierarchical / Bayesian flavor)

    • Treat cohorts as priors on preferences, not hard filters.
    • Combine cohort priors with global baseline via learned weights (per cohort).
    • This avoids overfitting cohorts and preserves personalization as data accrues.
  • Contentโ€‘Based Recommendations (robust for item coldโ€‘start too)

    • Build item embeddings from metadata (text, category, attributes) and optionally image features.
    • Recommend via nearest neighbors in embedding space; weight by cohort priors.
  • Lookalike Modeling (user embedding โ†’ nearest neighbor)

    • Map new users to similar existing users using shared signals (device, referrer, campaign, geography, time-of-day).
    • Use their top items as seed recommendations.
  • Contextual Bandits (controlled exploration for new users only)

    • Allocate a small exploration budget (e.g., 5โ€“10%) for new users using contextual bandits (Thompson Sampling or LinUCB).
    • Keep bandit scope restricted to coldโ€‘start segment; this avoids penalizing the rest.
  • Hybrid Model Router

    • A router decides for each request:
      • If user has โ‰ฅN events โ†’ warm-start (ALS/BPR/LTR).
      • Else โ†’ cold-start route (cohort prior + content KNN + bandit).
    • This isolation keeps warm users stable.
  • Graceful Handover

    • As interactions arrive, gradually shift from coldโ€‘start mixture to warmโ€‘start model via learned blending (e.g., a calibrated metaโ€‘model).

 

Avoid โ€œPenalizing Other Usersโ€: Design Principles

  1. Segmentation-based routing: Only new users hit the exploration policy.
  2. Budgeted exploration: Cap exploration impressions (e.g., 1โ€“2 items per topโ€‘N).
  3. Catalogโ€‘safe baseline: Use a robust popularity baseline that does not change due to coldโ€‘start policy shifts.
  4. Hierarchical priors (not hard rules): Cohort influence is additive, not exclusive.
  5. Counterfactual offline evaluation: Use IPS/SNIPS to estimate policy performance without risking production stability.
  6. Progressive personalization: Smoothly decay cohort weights as user-specific signals grow.

 

Hope this helps! PLease mark as a Kudos or a Solution. 

I trust this will be helpful. If you found this guidance useful, you are welcome to acknowledge with a Kudos or by marking it as a Solution.

View solution in original post

4 REPLIES 4
Chandhana_nm10
New Contributor

To address the cold-start user issue without penalizing existing users, combine cohort signals with a layered strategy that blends lightweight personalization with robust default behaviors. Start with strong global or popularity-based priors to ensure high-quality baseline recommendations, then gradually personalize using implicit signals such as short-term behavioral data (clicks, dwell time, and session interactions), contextual features (device, time, and location), and content-based matching instead of relying solely on collaborative signals. Apply explorationโ€“exploitation techniques, such as bandits, to safely test personalized options while protecting overall system performance. Use fallback models, caps on experimental exposure, and continuous monitoring so that weak personalization never degrades the broader user experience. Over time, as the user generates richer data, smoothly transition them into full recommendation modelsโ€”achieving quick personalization without harming others.

deborshi_nag
Contributor

Hi @Arshi8109 

 

Please use the following approach:

 

  • Global Baseline (safe, non-personalized)

    • Popularity & recency trends with minimal bias and diversity constraints.
    • Use catalogโ€‘level controls (e.g., de-dupe, diversity by category/brand).
  • Cohortโ€‘Aware Prior (hierarchical / Bayesian flavor)

    • Treat cohorts as priors on preferences, not hard filters.
    • Combine cohort priors with global baseline via learned weights (per cohort).
    • This avoids overfitting cohorts and preserves personalization as data accrues.
  • Contentโ€‘Based Recommendations (robust for item coldโ€‘start too)

    • Build item embeddings from metadata (text, category, attributes) and optionally image features.
    • Recommend via nearest neighbors in embedding space; weight by cohort priors.
  • Lookalike Modeling (user embedding โ†’ nearest neighbor)

    • Map new users to similar existing users using shared signals (device, referrer, campaign, geography, time-of-day).
    • Use their top items as seed recommendations.
  • Contextual Bandits (controlled exploration for new users only)

    • Allocate a small exploration budget (e.g., 5โ€“10%) for new users using contextual bandits (Thompson Sampling or LinUCB).
    • Keep bandit scope restricted to coldโ€‘start segment; this avoids penalizing the rest.
  • Hybrid Model Router

    • A router decides for each request:
      • If user has โ‰ฅN events โ†’ warm-start (ALS/BPR/LTR).
      • Else โ†’ cold-start route (cohort prior + content KNN + bandit).
    • This isolation keeps warm users stable.
  • Graceful Handover

    • As interactions arrive, gradually shift from coldโ€‘start mixture to warmโ€‘start model via learned blending (e.g., a calibrated metaโ€‘model).

 

Avoid โ€œPenalizing Other Usersโ€: Design Principles

  1. Segmentation-based routing: Only new users hit the exploration policy.
  2. Budgeted exploration: Cap exploration impressions (e.g., 1โ€“2 items per topโ€‘N).
  3. Catalogโ€‘safe baseline: Use a robust popularity baseline that does not change due to coldโ€‘start policy shifts.
  4. Hierarchical priors (not hard rules): Cohort influence is additive, not exclusive.
  5. Counterfactual offline evaluation: Use IPS/SNIPS to estimate policy performance without risking production stability.
  6. Progressive personalization: Smoothly decay cohort weights as user-specific signals grow.

 

Hope this helps! PLease mark as a Kudos or a Solution. 

I trust this will be helpful. If you found this guidance useful, you are welcome to acknowledge with a Kudos or by marking it as a Solution.
v-menakakota
Honored Contributor III

Hi @Arshi8109 ,
Thanks for reaching out to the Microsoft fabric community forum. 

 

I would also take a moment to thankโ€ฏ @deborshi_nag  and @Chandhana_nm10 , for actively participating in the community forum and for the solutions youโ€™ve been sharing in the community forum. Your contributions make a real difference.

I hope the above details help you fix the issue. If you still have any questions or need more help, feel free to reach out. Weโ€™re always here to support you .

 

 

Best Regards, 
Community Support Team  

v-menakakota
Honored Contributor III

Hi @Arshi8109 ,

 

I hope the above details help you fix the issue. If you still have any questions or need more help, feel free to reach out. Weโ€™re always here to support you .

 

Best Regards, 
Community Support Team 

Helpful resources

Announcements
Sticker Challenge 2026 Carousel

Join our Community Sticker Challenge 2026

If you love stickers, then you will definitely want to check out our Community Sticker Challenge!

Free Fabric Certifications

Free Fabric Certifications

Get Fabric certified for free! Don't miss your chance.

January Fabric Update Carousel

Fabric Monthly Update - January 2026

Check out the January 2026 Fabric update to learn about new features.

FabCon Atlanta 2026 carousel

FabCon Atlanta 2026

Join us at FabCon Atlanta, March 16-20, for the ultimate Fabric, Power BI, AI and SQL community-led event. Save $200 with code FABCOMM.

Users online (2,721)