Danish Kalim
Danish Kalim has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Olivier Jeunen
Independent Researcher, Antwerp, Belgium
2 shared publications - Srijan Saket
ShareChat, Seattle, USA
2 shared publications - Aleksei Ustimenko
ShareChat, United Kingdom
1 shared publication - Christopher Green
ShareChat, USA
1 shared publication - Deepanshu Hardaha
ShareChat, Bangaluru, India
1 shared publication - Himanshu Doi
ShareChat, India
1 shared publication
Latest Publications
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 3119-3121
When Less is Enough: Optimizations for Low-Cost Recommendation Systems
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 3119-3121
Open AccessWhen Less is Enough: Optimizations for Low-Cost Recommendation Systems
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 442-448
Dimension Mask Layer: Optimizing Embedding Efficiency for Scalable ID-based Models
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 442-448
Open AccessDimension Mask Layer: Optimizing Embedding Efficiency for Scalable ID-based Models
- Open Access
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 2935-2939
Monitoring the Evolution of Behavioural Embeddings in Social Media Recommendation
Emerging short-video platforms like TikTok, Instagram Reels, and ShareChat present unique challenges for recommender systems, primarily originating from a continuous stream of new content. ShareChat alone receives approximately 2 million pieces of fresh content daily, complicating efforts to assess quality, learn effective latent representations, and accurately match content with the appropriate user base, especially given limited user feedback. Embedding-based approaches are a popular choice for industrial recommender systems because they can learn low-dimensional representations of items, leading to effective recommendation that can easily scale to millions of items and users. Our work characterizes the evolution of such embeddings in short-video recommendation systems, comparing the effect of batch and real-time updates to content embeddings. We investigate how embeddings change with subsequent updates, explore the relationship between embeddings and popularity bias, and highlight their impact on user engagement metrics. Our study unveils the contrast in the number of interactions needed to achieve mature embeddings in a batch learning setup versus a real-time one, identifies the point of highest information updates, and explores the distribution of l2-norms across the two competing learning modes. Utilizing a production system deployed on a large-scale short-video app with over 180 million users, our findings offer insights into designing effective recommendation systems and enhancing user satisfaction and engagement in short-video applications.
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 2935-2939
Open AccessMonitoring the Evolution of Behavioural Embeddings in Social Media Recommendation
Emerging short-video platforms like TikTok, Instagram Reels, and ShareChat present unique challenges for recommender systems, primarily originating from a continuous stream of new content. ShareChat alone receives approximately 2 million pieces of fresh content daily, complicating efforts to assess quality, learn effective latent representations, and accurately match content with the appropriate user base, especially given limited user feedback. Embedding-based approaches are a popular choice for industrial recommender systems because they can learn low-dimensional representations of items, leading to effective recommendation that can easily scale to millions of items and users. Our work characterizes the evolution of such embeddings in short-video recommendation systems, comparing the effect of batch and real-time updates to content embeddings. We investigate how embeddings change with subsequent updates, explore the relationship between embeddings and popularity bias, and highlight their impact on user engagement metrics. Our study unveils the contrast in the number of interactions needed to achieve mature embeddings in a batch learning setup versus a real-time one, identifies the point of highest information updates, and explores the distribution of l2-norms across the two competing learning modes. Utilizing a production system deployed on a large-scale short-video app with over 180 million users, our findings offer insights into designing effective recommendation systems and enhancing user satisfaction and engagement in short-video applications.
- Open Access
- 15 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 136-141
On Gradient Boosted Decision Trees and Neural Rankers: A Case-Study on Short-Video Recommendations at ShareChat
- 15 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 136-141
Open AccessOn Gradient Boosted Decision Trees and Neural Rankers: A Case-Study on Short-Video Recommendations at ShareChat