recommendation-algorithm-design

Design social media recommendation pipelines with candidate retrieval, ranking, and diversity strategies.

5|Updated May 2, 2026
One-click install
npx skills add https://github.com/nirholas/three-ui --skill recommendation-algorithm-design
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: recommendation-algorithm-design
Source: https://github.com/nirholas/three-ui/tree/main/data/skills/development/recommendation-algorithm-design
Command: npx skills add https://github.com/nirholas/three-ui --skill recommendation-algorithm-design

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

It solves the challenge of building feeds and ranking engines that reliably show relevant content while avoiding echo chambers and engagement-trap failure modes.

Core Features & Use Cases

  • End-to-end Recommendation Pipeline: Learn candidate generation, ranking, filtering/mixing, and final feed composition from first principles.
  • Modeling & Retrieval Techniques: Understand two-tower retrieval, embedding similarity, and approximate nearest neighbor (ANN) scaling.
  • Real-World Feed Engineering: Apply multi-objective ranking, diversity injection, exploration vs. exploitation (bandits), and long-term feedback metrics.
  • Domain Adaptation for Crypto Feeds: Incorporate crypto/community-specific quality signals such as on-chain proof, watchlists/portfolios, and agent reputation.

Quick Start

Use this skill to design a full social recommendation pipeline by asking: "Teach me how to go from candidate generation to multi-objective ranking and diversity-aware feed delivery for a crypto community platform."

Frequently Asked Questions about recommendation-algorithm-design

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I design a recommendation system that avoids filter bubbles and engagement traps?

Design recommendation systems by applying diversity injection, bandit exploration strategies, and anti-filter-bubble metrics to balance feed relevance with long-term user satisfaction, avoiding echo chambers and engagement-trap failure modes.

How does approximate nearest neighbor indexing work for scaling embedding retrieval?

Approximate nearest neighbor (ANN) indexing scales embedding similarity retrieval by efficiently searching high-dimensional vector spaces, enabling rapid candidate generation in recommendation pipelines without exhaustive distance calculations across massive item sets.

How do I build a multi-objective ranking model for social media feeds?

Build multi-objective ranking models by combining embedding similarity scores with diverse quality signals, applying multi-objective scoring and diversity-aware feed composition to optimize both immediate relevance and long-term user satisfaction.

Can I use two-tower retrieval models for crypto community content curation?

Yes, two-tower retrieval models support crypto community curation by incorporating on-chain proof, watchlists, and agent reputation signals into candidate generation, enabling domain-specific feed relevance for blockchain platforms.

What's the best way to evaluate long-term feedback loops in recommendation systems?

Evaluate long-term feedback loops using anti-filter-bubble metrics and exploration vs. exploitation bandit strategies, measuring whether the recommendation system maintains diversity and avoids degrading user satisfaction over time.

What are the limitations of using exploration-exploitation bandits for feed ranking?

Exploration-exploitation bandits require careful tuning to balance content discovery with proven relevance, as excessive exploration may temporarily reduce feed quality while pure exploitation risks reinforcing filter bubbles and echo chambers.