
Data Skeptic
by Kyle Polich
Is this your podcast?Insights from recent episode analysis
Audience Interest
Podcast Focus
Publishing Consistency
Platform Reach
Insights are generated by CastFox AI using publicly available data, episode content, and proprietary models.
Most discussed topics
Brands & references
Total monthly reach
Estimated from 13 chart positions in 13 markets.
By chart position
- 🇨🇦CA · Technology#9730K to 100K
- 🇰🇷KR · Technology#5030K to 100K
- 🇭🇺HU · Technology#3010K to 30K
- 🇳🇴NO · Technology#4710K to 30K
- 🇮🇱IL · Technology#753K to 10K
- Per-Episode Audience
Est. listeners per new episode within ~30 days
46K to 154K🎙 ~2x weekly·599 episodes·Last published 2d ago - Monthly Reach
Unique listeners across all episodes (30 days)
92K to 308K🇨🇦32%🇰🇷32%🇭🇺10%+10 more - Active Followers
Loyal subscribers who consistently listen
28K to 92K
Market Insights
Platform Distribution
Reach across major podcast platforms, updated hourly
Total Followers
—
Total Plays
—
Total Reviews
—
* Data sourced directly from platform APIs and aggregated hourly across all major podcast directories.
On the show
From 14 epsHost
Recent guests
Recent episodes
Recommender Systems Optimization Goals
Sep 1, 2026
Unknown duration
Recommender Systems Origin Story
Aug 18, 2026
Unknown duration
Social Choice for Fair Recommendations
Jul 27, 2026
Unknown duration
News Recommendations
Jul 2, 2026
46m 06s
Give Users the Wheel
Jun 23, 2026
35m 28s
Social Links & Contact
Official channels & resources
Official Website
Login
RSS Feed
Login
| Date | Episode | Topics | Guests | Brands | Places | Keywords | Sponsor | Length | |
|---|---|---|---|---|---|---|---|---|---|
| 9/1/26 | Recommender Systems Optimization Goals | In part two of the Data Skeptic Recommender Systems season finale, Kyle asks a deceptively difficult question: what should recommender systems actually optimize for? Drawing on conversations from across the season, the episode explores engagement, filter bubbles, popularity bias, fairness, human curation, embeddings, and the growing role—and risks—of large language models in shaping what gets recommended to us. | — | ||||||
| 8/18/26 | Recommender Systems Origin Story | Where did recommender systems come from, and how do we know when they're actually working? In part one of Data Skeptic's three-part Recommender Systems finale, Kyle traces the field from collaborative filtering and the Netflix Prize to matrix factorization and modern approaches, while exploring why accuracy alone can't capture what makes a recommendation useful, surprising, or meaningful. | — | ||||||
| 7/27/26 | Social Choice for Fair Recommendations | Recommender systems influence nearly every aspect of our digital lives—but what does it mean for those systems to be fair? Robin Burke joins Data Skeptic to discuss the history of recommender systems, the limitations of optimizing purely for accuracy, and how ideas from social choice theory can help balance the needs of users, creators, and society. The conversation explores the future of recommendation algorithms and why fairness is a far more complex challenge than it first appears. | — | ||||||
| 7/2/26 | news recommendationresponsible AI+5 | Andreea Iana | NewsRecLib | — | news recommendationAI+5 | — | 46m 06s | ||
| 6/23/26 | recommendation systemsnatural language processing+3 | Fuyuan Lyu | YouTubeTikTok | — | recommendation systemDPR framework+5 | — | 35m 28s | ||
| 6/17/26 | recommendation systemsreinforcement learning+3 | Hieu Le | TikTok | — | recommendation systemsreinforcement learning+4 | — | 35m 18s | ||
| 5/1/26 | data analyticsforecasting+3 | Aaron Payne | Georgia TechChick-fil-A+1 | Colombia | data analystbusiness analytics+3 | — | 25m 59s | ||
| 4/25/26 | recommender systemsresponsible AI+5 | Yashar Deldjoo | Polytechnic University of Bari | — | recommender systemstrustworthiness+8 | — | 49m 25s | ||
| 3/27/26 | book ratingsreader preferences+4 | — | — | — | Goodreadsbook quality+4 | — | 39m 19s | ||
| 3/10/26 | disentangled representation learningrecommender systems+3 | Ervin Dervishaj | University of Copenhagen | — | disentanglementinterpretability+5 | — | 30m 33s | ||
Want analysis for the episodes below?Free for Pro Submit a request, we'll have your selected episodes analyzed within an hour. Free, at no cost to you, for Pro users. | |||||||||
| 2/27/26 | recommender systemsstrategic learning+3 | Ekaterina (Kat) Fedorova | MIT EECS | — | recommender systemsstrategic learning+5 | — | 54m 35s | ||
| 2/18/26 | recommender systemsfairness+3 | Anas Buhayh | S'mores framework | — | recommender systemsmulti-stakeholder fairness+4 | — | 34m 10s | ||
| 2/2/26 | job recommender systemsAI+4 | Roan Schellingerhout | Maastricht University | — | job matchingAI explanations+3 | — | 26m 37s | ||
| 1/26/26 | recommender systemsalgorithmic fairness+4 | David Liu | Cornell UniversityMeta+1 | — | recommender systemsalgorithmic fairness+5 | — | 49m 59s | ||
| 12/26/25 | content discoverymachine learning+4 | Cory Zechmann | Silence NogoodTikTok | — | video recommendationsalgorithms+5 | — | 38m 16s | ||
| 12/18/25 | eye trackingrecommender systems+3 | Santiago de Leon | RecGaze datasetKempelin Institute+2 | — | eye trackingrecommender systems+3 | — | 52m 08s | ||
| 12/8/25 | recommender systemsmachine learning+3 | Boya Xu | Virginia Tech | — | recommender systemscollaborative filtering+5 | — | 39m 57s | ||
| 11/23/25 | Designing Recommender Systems for Digital Humanities | In this episode of Data Skeptic, we explore the fascinating intersection of recommender systems and digital humanities with guest Florian Atzenhofer-Baumgartner, a PhD student at Graz University of Technology. Florian is working on Monasterium.net, Europe's largest online collection of historical charters, containing millions of medieval and early modern documents from across the continent. The conversation delves into why traditional recommender systems fall short in the digital humanities space, where users range from expert historians and genealogists to art historians and linguists, each with unique research needs and information-seeking behaviors. Florian explains the technical challenges of building a recommender system for cultural heritage materials, including dealing with sparse user-item interaction matrices, the cold start problem, and the need for multi-modal similarity approaches that can handle text, images, metadata, and historical context. The platform leverages various embedding techniques and gives users control over weighting different modalities—whether they're searching based on text similarity, visual imagery, or diplomatic features like issuers and receivers. A key insight from Florian's research is the importance of balancing serendipity with utility, collection representation to prevent bias, and system explainability while maintaining effectiveness. The discussion also touches on unique evaluation challenges in non-commercial recommendation contexts, including Florian's "research funnel" framework that considers discovery, interaction, integration, and impact stages. Looking ahead, Florian envisions recommendation systems becoming standard tools for exploration across digital archives and cultural heritage repositories throughout Europe, potentially transforming how researchers discover and engage with historical materials. The new version of Monasterium.net, set to launch with enhanced semantic search and recommendation features, represents an important step toward making cultural heritage more accessible and discoverable for everyone. | — | ||||||
| 11/13/25 | DataRec Library for Reproducible in Recommend Systems | In this episode of Data Skeptic's Recommender Systems series, host Kyle Polich explores DataRec, a new Python library designed to bring reproducibility and standardization to recommender systems research. Guest Alberto Carlo Maria Mancino, a postdoc researcher from Politecnico di Bari, Italy, discusses the challenges of dataset management in recommendation research—from version control issues to preprocessing inconsistencies—and how DataRec provides automated downloads, checksum verification, and standardized filtering strategies for popular datasets like MovieLens, Last.fm, and Amazon reviews. The conversation covers Alberto's research journey through knowledge graphs, graph-based recommenders, privacy considerations, and recommendation novelty. He explains why small modifications in datasets can significantly impact research outcomes, the importance of offline evaluation, and DataRec's vision as a lightweight library that integrates with existing frameworks rather than replacing them. Whether you're benchmarking new algorithms or exploring recommendation techniques, this episode offers practical insights into one of the most critical yet overlooked aspects of reproducible ML research. | — | ||||||
| 11/5/25 | Shilling Attacks on Recommender Systems | In this episode of Data Skeptic's Recommender Systems series, Kyle sits down with Aditya Chichani, a senior machine learning engineer at Walmart, to explore the darker side of recommendation algorithms. The conversation centers on shilling attacks—a form of manipulation where malicious actors create multiple fake profiles to game recommender systems, either to promote specific items or sabotage competitors. Aditya, who researched these attacks during his undergraduate studies at SPIT before completing his master's in computer science with a data science specialization at UC Berkeley, explains how these vulnerabilities emerge particularly in collaborative filtering systems. From promoting a friend's ska band on Spotify to inflating product ratings on e-commerce platforms, shilling attacks represent a significant threat in an industry where approximately 4% of reviews are fake, translating to $800 billion in annual sales in the US alone. The discussion delves deep into collaborative filtering, explaining both user-user and item-item approaches that create similarity matrices to predict user preferences. However, these systems face various shilling attacks of increasing sophistication: random attacks use minimal information with average ratings, while segmented attacks strategically target popular items (like Taylor Swift albums) to build credibility before promoting target items. Bandwagon attacks focus on highly popular items to connect with genuine users, and average attacks leverage item rating knowledge to appear authentic. User-user collaborative filtering proves particularly vulnerable, requiring as few as 500 fake profiles to impact recommendations, while item-item filtering demands significantly more resources. Aditya addresses detection through machine learning techniques that analyze behavioral patterns using methods like PCA to identify profiles with unusually high correlation and suspicious rating consistency. However, this remains an evolving challenge as attackers adapt strategies, now using large language models to generate more authentic-seeming fake reviews. His research with the MovieLens dataset tested detection algorithms against synthetic attacks, highlighting how these concerns extend to modern e-commerce systems. While companies rarely share attack and detection data publicly to avoid giving attackers advantages, academic research continues advancing both offensive and defensive strategies in recommender systems security. | — | ||||||
| 10/29/25 | Music Playlist Recommendations | In this episode, Rebecca Salganik, a PhD student at the University of Rochester with a background in vocal performance and composition, discusses her research on fairness in music recommendation systems. She explores three key types of fairness—group, individual, and counterfactual—and examines how algorithms create challenges like popularity bias (favoring mainstream content) and multi-interest bias (underserving users with diverse tastes). Rebecca introduces LARP, her multi-stage multimodal framework for playlist continuation that uses contrastive learning to align text and audio representations, learn song relationships, and create playlist-level embeddings to address the cold start problem. A significant contribution of Rebecca's work is the Music Semantics dataset, created by scraping Reddit discussions to capture how people naturally describe music using atmospheric qualities, contextual comparisons, and situational associations rather than just technical features. This dataset, available on Hugging Face, enables more nuanced recommendation systems that better understand user preferences and support niche tastes. Her research utilizes industry datasets including Last.fm and Spotify's Million Playlist Dataset, and points toward exciting future applications in music generation and multimodal systems that combine audio, text, and video. | — | ||||||
| 10/15/25 | Bypassing the Popularity Bias | No description provided. | — | ||||||
| 10/9/25 | Sustainable Recommender Systems for Tourism | In this episode, we speak with Ashmi Banerjee, a doctoral candidate at the Technical University of Munich, about her pioneering research on AI-powered recommender systems in tourism. Ashmi illuminates how these systems can address exposure bias while promoting more sustainable tourism practices through innovative approaches to data acquisition and algorithm design. Key highlights include leveraging large language models for synthetic data generation, developing recommendation architectures that balance user satisfaction with environmental concerns, and creating frameworks that distribute tourism more equitably across destinations. Ashmi's insights offer valuable perspectives for both AI researchers and tourism industry professionals seeking to implement more responsible recommendation technologies. | — | ||||||
| 9/22/25 | Interpretable Real Estate Recommendations | In this episode of Data Skeptic's Recommender Systems series, host Kyle Polich interviews Dr. Kunal Mukherjee, a postdoctoral research associate at Virginia Tech, about the paper "Z-REx: Human-Interpretable GNN Explanations for Real Estate Recommendations" The discussion explores how the post-COVID real estate landscape has created a need for better recommendation systems that can introduce home buyers to emerging neighborhoods they might not know about. Dr. Mukherjee, explains how his team developed a graph neural network approach that not only recommends properties but provides human-interpretable explanations for why certain regions are suggested. The conversation covers the advantages of using graph-based models over traditional recommendation systems, the importance of regional context in real estate features, and how co-click data from similar users can create more effective recommendations. Key topics include the distinction between model developer explanations and end-user explanations, the challenges of feature perturbation in recommendation systems, and how graph neural networks can discover novel pathways to emerging real estate markets that traditional models might miss. | — | ||||||
| 9/8/25 | Why Am I Seeing This? | In this episode of Data Skeptic, we explore the challenges of studying social media recommender systems when exposure data isn't accessible. Our guests Sabrina Guidotti, Gregor Donabauer, and Dimitri Ognibene introduce their innovative "recommender neutral user model" for inferring the influence of opaque algorithms. | — | ||||||
Showing 25 of 607
Pitch Fit is a Pro feature
See how bookable this show is for guests, which brands already advertise, the per-episode ad value, and the best-fit guest and sponsor profile. The numbers are blurred on the free plan.
How readily this show books outside guests like you.
How proven this show is for host-read sponsorships.
For Guests
ProFor Advertisers
ProUpgrade to Pro to unlock guest cadence, sponsor categories, fit scores, and per-episode ad value for this show.
Chart history for Data Skeptic
Peaked at #30 in HU, currently #30 in HU.
| Market | Genre | Peak | Current | Trend |
|---|---|---|---|---|
| HU | — | #30 | #30 | — |
| Norway | — | #47 | #47 | — |
| South Korea | — | #50 | #50 | — |
| IL | — | #75 | #75 | — |
| VN | — | #90 | #90 | — |
| HK | — | #96 | #96 | — |
| Canada | — | #97 | #97 | — |
| AR | — | #116 | #116 | — |
| PT | — | #129 | #129 | — |
| PL | — | #129 | #129 | — |
| NG | — | #130 | #130 | — |
| PE | — | #138 | #138 | — |
| IS | — | #185 | #185 | — |
Chart Positions
13 placements across 13 markets.
Chart Positions
13 placements across 13 markets.