Sumit

@reachsumit.com

Senior MLE at Meta. Trying to keep up with the Information Retrieval domain! Blog: https://blog.reachsumit.com/ Newsletter: https://recsys.substack.com/

LLM-Derived Priors for Thompson Sampling in Cold-Start Comment Recommendation NAVER turns LLM signals from comment text into Bayesian priors warm-starting Thompson sampling, with biggest CTR gains under sparse feedback in a live test. ๐Ÿ“ arxiv.org/abs/2608.03382

LLM-Derived Priors for Thompson Sampling in Cold-Start Comment Recommendation

Multi-armed bandit algorithms, especially Thompson sampling, are widely used in online recommendation. Despite their ability to adapt from online feedback, these methods often suffer from cold-start l...

arxiv.org

Search, Inspect, Fetch: Exploiting Boolean Retrieval for Deep-Research Agents Filters docs via Boolean queries, then fetches just the relevant section, beating Search-Visit with 20-50% fewer tokens. ๐Ÿ“ arxiv.org/abs/2608.02751 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/ielab/skim-s...

Search, Inspect, Fetch: Exploiting Boolean Retrieval for Deep-Research Agents

Existing deep-research agents use a search-visit workflow that retrieves and reads whole pages, without considering the addressable structure that web sources expose through titles, headings, sections...

arxiv.org

Coverage Matters: MarginMerge for Compressing Multi-Vector Visual Document Retrievers Compresses ColPali/ColQwen retrievers into synthetic cluster representatives, keeping 97-99% quality at 90-95% fewer vectors. ๐Ÿ“ arxiv.org/abs/2608.02969 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/ailarmhz/Mar...

Coverage Matters: MarginMerge for Compressing Multi-Vector Visual Document Retrievers

Multi-vector visual document retrievers such as ColPali and ColQwen achieve strong retrieval by storing fine-grained patch embeddings, but this produces large indexes and costly late-interaction scori...

arxiv.org

Position Bias Undermines Preference Consistency in Listwise LLM-Based Reranking Shows LLM rerankers yield unstable rankings across equivalent candidate permutations, even as top-ranked relevance improves. ๐Ÿ“ arxiv.org/abs/2608.03091 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/ejbito/Invar...

Position Bias Undermines Preference Consistency in Listwise LLM-Based Reranking

Large language models (LLMs) have emerged as promising listwise rerankers for recommender systems, but their reliability under equivalent candidate permutations remains unclear. Since recommendation c...

arxiv.org

UniGD: A Unified Generative-Discriminative Framework for Industrial Retrieval Kuaishou presents a unified model merging generative retrieval with relevance scoring via gradient coordination and codebook-anchored ad representations. ๐Ÿ“ arxiv.org/abs/2608.03150

UniGD: A Unified Generative-Discriminative Framework for Industrial Retrieval

Generative retrieval (GR) is a promising paradigm for industrial search advertising, yet its deployment is constrained by strict relevance and latency requirements. Existing systems cascade GR with an...

arxiv.org

RAG-Stack: Co-Optimizing RAG Serving Performance and Quality Jointly searches RAG's algorithm and system configs for the quality-performance Pareto frontier, without deploying every candidate to measure performance. ๐Ÿ“ arxiv.org/abs/2608.03487 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/haiqiang-zha...

RAG-Stack: Co-Optimizing RAG Serving Performance and Quality

Retrieval-augmented generation (RAG), which augments large language model (LLM) generation with information retrieved from databases, has become a widely used approach for knowledge-intensive applicat...

arxiv.org

Training Documents Reranker with Search Rubrics for Deep Research Agent Tencent proposes a document reranker trained with query-specific search rubrics via SFT and RL to select high-quality document sets for deep research. ๐Ÿ“ arxiv.org/abs/2608.03527 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/8421BCD/Rubr...

Training Documents Reranker with Search Rubrics for Deep Research Agent

Retrieval systems help deep research agents generate high-quality answers by providing relevant documents. However, existing retrievers typically select documents through relevance matching, while ind...

arxiv.org

SITA: Semantic Interest Tokens for Target-Aware Compression in Long-Sequence Recommendation Kuaishou proposes a compression method that organizes user interests into semantic groups, enabling target-aware selection for long-sequence recommendation. ๐Ÿ“ arxiv.org/abs/2608.03692

SITA: Semantic Interest Tokens for Target-Aware Compression in Long-Sequence Recommendation

As user behavior histories continue to grow on modern Internet platforms, effectively modeling long behavior sequences has become crucial for predicting user interests in candidate items. Existing met...

arxiv.org

ATLAS: Learning to Recommend Across Unseen Domains Sony presents a multi-source framework that learns domain-invariant user-item representations, enabling zero-shot recommendation on entirely unseen domains without target-domain adaptation. ๐Ÿ“ arxiv.org/abs/2608.03899

ATLAS: Learning to Recommend Across Unseen Domains

Recommender systems remain domain-bound: a model trained on one interaction environment typically requires retraining or target-domain adaptation before it can operate on a new catalogue. A recommende...

arxiv.org

EviSD: Evidence-Conditioned Self-Distillation for Search-Augmented Agents Presents a self-distillation method that uses evidence and golden answers as privileged context to refine credit in search agents. ๐Ÿ“ arxiv.org/abs/2608.01359 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/JiananXie/Ev...

EviSD: Evidence-Conditioned Self-Distillation for Search-Augmented Agents

Outcome-based reinforcement learning enables search-augmented language agents to learn from verifiable final answers, but its trajectory-level credit cannot distinguish the contributions of individual...

arxiv.org

PROGRESS: Coverage-guided RL to Train Search-augmented LLM Agent Samsung proposes a coverage-guided RL framework that trains search-augmented LLM agents using teacher-generated queries to supervise search decomposition quality. ๐Ÿ“ arxiv.org/abs/2608.00969

PROGRESS: Coverage-guided RL to Train Search-augmented LLM Agent

Existing search-augmented LLM agents are trained using Reinforcement Learning to boost its reasoning capabilities. However, these approaches primarily rely on outcome-level rewards, which provide litt...

arxiv.org

Before Reasoning Fails: Pre-Evidence Procedural Failures in Agentic RAG Find that RAG agents often skip reading evidence before answering. Presents a method to force reading first, recovering lost accuracy. ๐Ÿ“ arxiv.org/abs/2608.02011 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/Noverse0/bef...

Before Reasoning Fails: Pre-Evidence Procedural Failures in Agentic RAG

Agentic retrieval-augmented generation (RAG) systems can fail before evidence-conditioned reasoning is tested: an agent may retrieve candidate snippets but finalize without inspecting them. We study t...

arxiv.org

Search-GRT: Guided Retrieval Training of Search Agents to Optimize for Complex Question Answering Samsung restricts RL retrieval to ground-truth-relevant documents, giving search agents a stronger training signal and improving multi-hop QA. ๐Ÿ“ arxiv.org/abs/2608.00974

Search-GRT: Guided Retrieval Training of Search Agents to Optimize for Complex Question Answering

The effective use of search engines by large language models (LLMs) remains a significant challenge, particularly in complex, multi-hop question-answering (MHQA) tasks. These tasks require the model t...

arxiv.org

TEngineDB-V: An OLAP-Native Vector Search System for Large-k Workloads at Tencent Tencent materializes vector indexes as relational tables, achieving up to 145x speedup over StarRocks at large-k scale. ๐Ÿ“ arxiv.org/abs/2608.00650 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/petrizhang/r...

TEngineDB-V: An OLAP-Native Vector Search System for Large-$k$ Workloads at Tencent

Vector search systems are essential infrastructure for modern data-driven applications. Large-$k$ analytical vector search, which retrieves $k=10^3$--$10^5$ results for analytics (e.g., aggregation, f...

arxiv.org

Cross-Domain Hybrid OPD for Generalizable Search Agents Tencent presents a hybrid training framework pairing agentic RL for search with cross-domain expert on-policy distillation, mitigating the alignment tax on general capabilities. ๐Ÿ“ arxiv.org/abs/2608.02101

Cross-Domain Hybrid OPD for Generalizable Search Agents

Recent advances in Reinforcement Learning (RL) have substantially improved the capabilities of autonomous search agents, enabling sophisticated planning, and iterative retrieval over dynamic informati...

arxiv.org

H+ Embedding: Harmonizing Global and Token-Level Retrieval with Context-Dependent Phrases Alibaba introduces phrase-level retrieval units between tokens and global vectors, matching token-level quality with 13.7% fewer vectors. ๐Ÿ“ arxiv.org/abs/2608.00065

H+ Embedding: Harmonizing Global and Token-Level Retrieval with Context-Dependent Phrases

Terminology-intensive retrieval, especially in medical settings, depends on preserving multi-word entities, abbreviations, numerical constraints, and compositional concepts. However, existing represen...

arxiv.org

Hierarchical BM25: Lexical Search at Billion-Document Scale IBM presents Hierarchical BM25 that caps resident memory at ~4.4GB and answers 16-term queries in ~300ms over one billion documents, vs. multi-second latency for flat BM25. ๐Ÿ“ arxiv.org/abs/2608.00229

Hierarchical BM25: Lexical Search at Billion-Document Scale

A flat BM25 index over one billion documents occupies about 400 GB. Holding it in memory requires DRAM proportional to corpus size. Serving it from disk takes 4-12 seconds per query. Exact top-k lexic...

arxiv.org

GRACE: Generative Recommender Acceleration Engine for Real-Time Ads Retrieval Meta presents a serving system for generative ads retrieval adding decode-time eligibility filtering, cutting decoder latency 11x via kernel optimizations. ๐Ÿ“ arxiv.org/abs/2608.00938

GRACE: Generative Recommender Acceleration Engine for Real-Time Ads Retrieval

Productionizing generative recommenders for high-volume, real-time ads retrieval creates two serving challenges: eligibility, ensuring that each generated ad is eligible for the request under the adve...

arxiv.org

A Self-Triggered Agentic Push Recommendation System ByteDance introduces a self-triggered agentic system that decides both when to re-invoke and whether to push notifications, deployed on Douyin with 1B+ users. ๐Ÿ“ arxiv.org/abs/2608.01949

A Self-Triggered Agentic Push Recommendation System

Push notification is a critical recommendation scenario on large-scale platforms, allowing the system to proactively reach users outside the application to improve long-term re-engagement. However, de...

arxiv.org

HALT: Verification-Aware Stopping for Retrieval-Augmented Search Agents Uses a lightweight verifier that halts multi-hop RAG search once evidence covers each reasoning hop, cutting redundant loops while preserving accuracy. ๐Ÿ“ arxiv.org/abs/2608.02009 ๐Ÿ‘จ๐Ÿฝโ€๐Ÿ’ป github.com/Noverse0/HALT

HALT: Verification-Aware Stopping for Retrieval-Augmented Search Agents

Retrieval-augmented search agents answer multi-hop questions by repeatedly issuing search queries and accumulating evidence. This creates a stopping problem: after the necessary evidence has appeared,...

arxiv.org