PulseAugur
中
实时 04:08:03
English(EN) Learning to Select and Rank from Choice-Based Feedback: A Simple Nested Approach

新算法简化了从客户选择中学习排序

作者 PulseAugur 编辑部 · [1 个来源] ·

研究人员开发了一种新颖的嵌套方法，用于从基于选择的反馈中学习排序和选择，当公司按顺序展示商品并收集客户选择时尤其有用。所提出的算法，用于识别最佳商品的Nested Elimination (NE)和用于完整排序识别的Nested Partition (NP)，旨在高效并提供强大的理论保证。这些算法旨在以最少的样本和高置信度识别最受欢迎的商品或完整排序，数值实验支持它们在合成和真实世界数据上的有效性。 AI

影响 引入了从交互数据中学习用户偏好的新方法，有可能改进推荐系统和个性化产品。

排序理由 该集群包含一篇详细介绍机器学习问题新算法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv stat.ML 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

新算法简化了从客户选择中学习排序

本文如何被排名

Signal score
2 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
该集群包含一篇详细介绍机器学习问题新算法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
High
Clearly on-topic for AI-industry coverage.
Story freshness
1 days old
Coverage has settled into its steady-state source set.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv stat.ML TIER_1 English(EN) · Junwen Yang, Yifan Feng ·

    从基于选择的反馈中学习选择和排序：一种简单的嵌套方法

    arXiv:2307.09295v3 Announce Type: replace-cross Abstract: We study a ranking and selection problem of learning from choice-based feedback with dynamic assortments. In this problem, a company sequentially displays a set of items to a population of customers and collects their choi…

相关话题