ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2606.14046· 17 results

cs.IRcs.AIEmpiricalRecentJun 11, 2026

Mood-Aware Music Recommendation: Integrating User Affective Signals into Ranking Systems

Terence Zeng, Abhishek K. Umrawal

This paper proposes a mood-conditioned ranking framework for music recommendation systems using user affective signals in the energy-valence space.

View →
cs.IRcs.AIRecentJun 1, 2026

Time-Aware Diffusion based on Preference Disentanglement for Generative Recommendation

Bangguo Zhu, Peng Huo, Yuanbo Zhao, Zhicheng Du +2 more

The paper proposes TDPM, a time-aware diffusion model for generative recommendation, which significantly improves recommendation accuracy by explicitly modeling the non-stationary, time-evolving natur…

View →
cs.IRcs.AIRecentMay 27, 2026

Fine-Tuned LLM as a Complementary Predictor Improving Ads System

Hui Yang, Daiwei He, Kevin Jiang, Taejin Park +19 more

The paper introduces a novel paradigm where a fine-tuned LLM acts as an ancillary predictor to forecast likely advertisers, significantly improving ad recommendation systems by augmenting candidate ge…

View →
cs.IRcs.AIRecentMay 27, 2026

Toward User Preference Alignment in LLM Recommendation via Explicit Context Feedback

Weizhi Zhang, Wooseong Yang, Yuxin Cui, Zhaohui Guo +8 more

The paper advocates for integrating explicit contextual feedback (like reviews and comments) into LLM-based recommender systems to achieve more personalized, transparent, and semantically aligned reco…

View →
cs.LGcs.AIRecentMay 27, 2026

ProRL: Effective Reinforcement Learning for Proactive Recommendation via Rectified Policy Gradient Estimation

Hongru Hou, Tiehua Mei, Denghui Geng, Jinhui Huang +4 more

The paper proposes ProRL, an effective Reinforcement Learning framework that rectifies gradient estimation deficiencies to optimize proactive recommendation paths, significantly outperforming existing…

View →
cs.IRcs.CRRecentApr 26, 2026

Green-Red Watermarking for Recommender Systems

Lei Zhou, Min Gao, Zongwei Wang, Yibing Bai +1 more

The paper proposes GREW, a novel Green-REd Watermarking framework that embeds ownership signals into recommender systems' intrinsic ranking process without requiring synthetic data, achieving robust p…

View →
stat.MLcs.LGRecentJun 2, 2026

Privacy-Robust Incrementality Measurement for Advertising Systems under Signal Loss

Prashant Shekhar, Caroline Howard

The paper proposes a robust causal decision framework to measure advertising incrementality despite multiple sources of privacy-induced signal degradation, providing certified decisions on the strengt…

View →
cs.LGcs.CLRecentMay 31, 2026

Trust Functions: Near-Lossless Weak-to-Strong Generalization by Learning When to Trust the Weak Teacher

Arda Uzunoglu, Alvin Zhang, Daniel Khashabi

The paper introduces trust functions to filter weak supervision labels, enabling near-lossless weak-to-strong generalization by selectively training a strong student using only the most reliable weak…

View →
cs.IRRecentJun 3, 2026

Dual-Stream MLP is All You Need for CTR Prediction

Kesha Ou, Zhen Tian, Wayne Xin Zhao, Long Zhang +2 more

This paper proposes a novel framework, DS-MLP, for click-through rate prediction in online advertising and recommendation systems.

View →
cs.LGcs.AIRecentMay 28, 2026

Quotient DAGs for Off-Policy Evaluation:Forward-Flow Importance Sampling and Exact Slate Propensities

Ziwen Xie, Shaowen Xiang, Hongyu He, Dianbo Liu

The paper introduces a quotient-DAG view to accurately estimate unordered slate propensities for off-policy evaluation, solving the nuisance variance and computational gap inherent in standard importa…

View →
cs.CRcs.AIRecentMay 9, 2026

Few-Shot Truly Benign DPO Attack for Jailbreaking LLMs

Sangyeon Yoon, Wonje Jeung, Yoonjun Cho, Dongjae Jeon +1 more

The paper introduces a truly benign Direct Preference Optimization (DPO) attack that can jailbreak large language models (LLMs) by fine-tuning them with minimal, harmless preference data, thereby supp…

View →
cs.IREmpiricalRecentJun 10, 2026

Tail-Aware Adaptive-k: Query-Adaptive Context Selection for Retrieval-Augmented Generation

Ziyu Song, Jiaming Fang, Kuangyu Li, Tuo Xia +1 more

This paper proposes Tail-Aware Adaptive-k (TAA-k), a training-free framework for adaptive context selection in retrieval-augmented generation systems using Extreme Value Theory.

View →
cs.CLcs.AIcs.LGRecentJun 4, 2026

Self-Augmenting Retrieval for Diffusion Language Models

Paul Jünger, Justin Lovelace, Linxi Zhao, Dongyoung Go +1 more

The paper introduces SARDI, a novel, training-free framework that uses low-confidence 'lookahead' tokens generated during the denoising process of discrete diffusion language models to dynamically gui…

View →
cs.IRcs.LGstat.MLRecentJun 3, 2026

Distributional Approximate Nearest Neighbour Search for Uncertainty-Aware Retrieval

Olivier Jeunen

The paper proposes DINOSAUR, a framework that incorporates embedding uncertainty into Approximate Nearest Neighbour search to improve retrieval for niche, long-tail content.

View →
cs.IRRecentJun 2, 2026

MARS: Multi-rate Aggregation of Recency Signals for Sequential Recommendation across Sparse and Dense Regimes

Zhenyu Yu, Shuigeng Zhou

MARS proposes an encoder-agnostic aggregation operator that explicitly models multi-scale temporal structure in sequential recommendation, achieving state-of-the-art performance across both sparse and…

View →
cs.LGcs.AIRecentMay 28, 2026

Score Broadcast and Decorrelation: A General Framework for Broadcast-Based Credit Assignment

Mustafa Uzun, Mete Erdogan, Cengiz Pehlevan, Alper T. Erdogan

The paper introduces Score Broadcast and Decorrelation (SBD), a general theoretical framework that unifies broadcast-based credit assignment across various differentiable loss functions by leveraging…

View →
cs.CVcs.AIRecentJun 1, 2026

Why Not Hyperparameter-Friendly Optimisation? A Monotonic Adaptive Norm Rescaling Approach For Long-Tailed Recognition

Shuo Zhang, Chenqi Li, Tingting Zhu

The paper proposes Self-Adaptive Monotonic Normalization (SAMN), a hyperparameter-friendly method that improves long-tailed recognition by enforcing monotonicity on per-class weight norms without requ…

View →