惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

GbyAI
GbyAI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 叶小钗
大猫的无限游戏
大猫的无限游戏
H
Help Net Security
G
Google Developers Blog
D
Docker
阮一峰的网络日志
阮一峰的网络日志
A
About on SuperTechFans
aimingoo的专栏
aimingoo的专栏
博客园 - 聂微东
Hugging Face - Blog
Hugging Face - Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
Apple Machine Learning Research
Apple Machine Learning Research
云风的 BLOG
云风的 BLOG
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
腾讯CDC
T
The Blog of Author Tim Ferriss
Microsoft Security Blog
Microsoft Security Blog
WordPress大学
WordPress大学
I
InfoQ
Engineering at Meta
Engineering at Meta
Stack Overflow Blog
Stack Overflow Blog
Google DeepMind News
Google DeepMind News

Apple Machine Learning Research

Multilingual Knowledge Transfer under Data Constraints via Lexical Interventions Scaling Laws for Mixture Pretraining Under Data Constraints Examining Human-Like Behaviors in LLMs: A Multi-Dimensional Analysis of Model Behaviors, User Factors, and System Prompts The P-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs GRPO Beyond English: A Large-Scale Study of GRPO in Non-English and Multilingual Settings MVICAD2: Multi-View Independent Component Analysis with Delays and Dilations A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport When Unlearning Is Free: Leveraging Low Influence Points to Reduce Computational Costs Scaling Categorical Flow Maps Beyond Next-Token Prediction: A Performance Characterization of Diffusion versus Autoregressive Language Models Arbitrage: Efficient Reasoning via Advantage-Aware Speculation Locking Pretrained Weights via Deep Low-Rank Residual Distillation DeepAmbigQA: Ambiguous Multi-hop Questions for Benchmarking LLM Answer Completeness Taming Outlier Tokens in Diffusion Transformers Understanding Alignment in Multimodal LLMs: A Comprehensive Study Dimensionality Reduction Meets Network Science: Sensemaking on UMAP’s kNN Graph MoMo: Dial Motion Mode in Robot Manipulation with Spatiotemporal Action Tokenization Memory Efficient Audio Synthesis with Decoupled Temporal Depth Diffusion Transformers GH-ESD: Grounded Hypothesis-Driven Error Slice Discovery for Instance-Level Vision Tasks LEAD: Breaking the No-Recovery Bottleneck in Long-Horizon Reasoning Environment-free Synthetic Data Generation for API-Calling Agents Accelerating Text-to-Video Generation with Calibrated Sparse Attention RayRoPE: Projective Ray Positional Encoding for Multi-View Attention LVSum: A Benchmark for Timestamp-Aware Long Video Summarization Length Value Model: Scalable Value Pretraining for Token-Level Length Modeling When Unlearning Is Free: Leveraging Low Influence Points to Reduce Computational Costs Show Me Examples: Inferring Visual Concepts from Image Sets Location-Invariant Properties of Functions Versus Properties of Distributions: United in Testing but Separated in Verification Interactive Proofs for General Distribution Properties Doubly Sub-linear Interactive Proofs of Proximity
Personalizing Incremental Video Search with Hybrid Text a...
2026-07-16 · via Apple Machine Learning Research

AuthorsVivek Kanojiya, Vishalaksh Aggarwal, Daeho Baek, Lyndon Kennedy, Xuetao Yin

Incremental video search requires high-quality ranking after each keystroke, where intent is often underspecified (e.g., 1–3 character prefixes). We present a personalization system for Apple TV search that combines complementary semantic and collaborative signals at ranking time. Our approach learns two item embedding spaces: (i) a text-based multilingual encoder (TextEmb) fine-tuned on co-engagement triplets via contrastive learning, and (ii) an ID-based collaborative embedding model (IdEmb) trained on interaction-derived positives. At serving time, we construct user representations from recent watch history and inject text- and ID-based user–item cosine similarities into a pairwise XGBoost ranker. We evaluate the system with temporally held-out offline datasets and a three-week online controlled experiment. Offline, for sessions with user history, the personalized ranker improves NDCG@10 by 2.99% and MRR by 3.30% over the non-personalized baseline. Crucially, slice analyses show that personalization is most needed in incremental search, where intent is still forming: on ambiguous prefix queries (1–3 characters), NDCG@10 lift is +8.63%, versus only +1.46% on longer, more fully specified queries. Users with longer watch histories benefit more from personalization than newer users: NDCG lift rises from +2.13% for users with 1–5 history items to +4.37% for users with 51–100. This larger lift occurs even though baseline relevance is lower for long-history cohorts (NDCG@10 drops from 0.733 to 0.680), indicating that personalization adds the most value where default ranking underperforms. Online, treatment yields statistically significant gains of +1.14% tap-through rate and +1.23% conversion rate, with a 2.91% improvement in converted-item rank position. We further analyze coverage–precision trade-offs between semantic and collaborative embeddings through ablations isolating each signal, and evaluate embedding quality on a held-out corpus with LLM-judged similarity labels to reduce click/exposure bias.

Related readings and updates.

Information Retrieval (IR) systems used in search and recommendation platforms frequently employ Learning-to-Rank (LTR) models to rank items in response to user queries. These models heavily rely on features derived from user interactions, such as clicks and engagement data. This dependence introduces cold start issues for items lacking user engagement and poses challenges in adapting to non-stationary shifts in user behavior over time. We…

Read more

Collaborative filtering is the de facto standard for analyzing users’ activities and building recommendation systems for items. In this work we develop Sliced Anti-symmetric Decomposition (SAD), a new model for collaborative filtering based on implicit feedback. In contrast to traditional techniques where a latent representation of users (user vectors) and items (item vectors) are estimated, SAD introduces one additional latent vector to each…

Read more