paper-with-me

Papers

LLMAR: A Tuning-Free Recommendation Framework for Sparse and Text-Rich Industrial Domains

2026-03-25 · Ryogo Hishikawa, Ichiro Kataoka, Shinya Yuda arxiv

Industrial B2B applications (e.g., construction site risk prediction, material procurement) face extreme data sparsity yet feature rich textual interactions. In such environments, traditional ID-based collaborative filtering fails lacking co-occurrence signals, while fine-tuning standard Large Language Models (LLMs) incurs high operational costs and struggles with frequent data drift. We propose LLMAR (LLM-Annotated Recommendation), a tuning-free framework. Moving beyond simple embeddings, LLMAR systematically integrates LLM reasoning to capture user "latent motives" without any training process. We introduce three core contributions: (1) Inference-Driven Annotation: uses LLMs to transform behavioral history into structured semantic motives, enabling reasoning-based matching unattainable by ID-based methods; (2) Reflection Loop: a self-correction mechanism that refines generated queries to mitigate hallucinations and resolve "context competition" between past history and current instructions; and (3) Cost-Effective Architecture: relies on tuning-free components and asynchronous batch processing to minimize maintenance costs. Evaluations on public benchmarks (MovieLens-1M, Amazon Prime Pantry) and a sparse industrial dataset (construction risk prediction) demonstrate that LLMAR outperforms state-of-the-art learning-based models (SASRecF), achieving up to a 54.6% nDCG@10 improvement on the industrial dataset. Inference costs remain highly practical (~$1 per 1,000 users). For B2B domains where strict real-time latency is not critical, combining LLM reasoning with self-verification offers a superior alternative to training-based approaches across accuracy, explainability, and operational cost.

📄 PDF Abstract BibTeX arXiv:2604.16379

Code (0)

등록된 구현이 없습니다.

Tasks

Collaborative Filtering

Similar Papers 제목 키워드 기반

STAR: A Simple Training-free Approach for Recommendations using Large Language Models

2024-10-21 · Dong-Ho Lee, Adam Kraft, Long Jin, Nikhil Mehta 외

Recent progress in large language models (LLMs) offers promising new approaches for recommendation system tasks. While the current state-of-the-art methods rely on fine-tuning LLMs to achieve optimal results, this proces…

Recommendation SystemsRetrieval

Path Thresholding: Asymptotically Tuning-Free High-Dimensional Sparse Regression

2014-02-23 · Divyanshu Vats, Richard G. Baraniuk

In this paper, we address the challenging problem of selecting tuning parameters for high-dimensional sparse regression. We propose a simple and computationally efficient method, called path thresholding (PaTh), that tra…

Model SelectionregressionVocal Bursts Intensity Prediction

Tuning-Free Structured Sparse Recovery of Multiple Measurement Vectors using Implicit Regularization

2025-12-03 · Lakshmi Jayalal, Sheetal Kalyani arxiv

Recovering jointly sparse signals in the multiple measurement vectors (MMV) setting is a fundamental problem in machine learning, but traditional methods often require careful parameter tuning or prior knowledge of the s…

Contrastive Graph Prompt-tuning for Cross-domain Recommendation

2023-08-21 · Zixuan Yi, Iadh Ounis, Craig Macdonald

Recommender systems are frequently challenged by the data sparsity problem. One approach to mitigate this issue is through cross-domain recommendation techniques. In a cross-domain context, sharing knowledge between doma…

Contrastive LearningRecommendation Systems

RecIS: Sparse to Dense, A Unified Training Framework for Recommendation Models

2025-09-25 · Hua Zong, Qingtao Zeng, Zhengxiong Zhou, Zhihua Han 외 arxiv

In this paper, we propose RecIS, a unified Sparse-Dense training framework designed to achieve two primary goals: 1. Unified Framework To create a Unified sparse-dense training framework based on the PyTorch ecosystem th…