中文
相关论文

相关论文: Adaptive Keywords Extraction with Contextual Bandi…

200 篇论文

Advertising (ad for short) keyword suggestion is important for sponsored search to improve online advertising and increase search revenue. There are two common challenges in this task. First, the keyword bidding problem: hot ad keywords are…

计算与语言 · 计算机科学 2019-02-28 Hao Zhou , Minlie Huang , Yishun Mao , Changlei Zhu , Peng Shu , Xiaoyan Zhu

Domain dependence and annotation subjectivity pose challenges for supervised keyword extraction. Based on the premises that second-order keyness patterns are existent at the community level and learnable from annotated keyword extraction…

信息检索 · 计算机科学 2024-09-30 Dongmei Zhou , Xuri Tang

Contextual bandit algorithms are essential for solving real-world decision making problems. In practice, collecting a contextual bandit's feedback from different domains may involve different costs. For example, measuring drug reaction from…

机器学习 · 计算机科学 2025-04-08 Ziyan Wang , Xiaoming Huo , Hao Wang

Contextual bandits algorithms have become essential in real-world user interaction problems in recent years. However, these algorithms rely on context as attribute value representation, which makes them unfeasible for real-world domains…

机器学习 · 计算机科学 2020-12-18 Ashutosh Kakadiya , Sriraam Natarajan , Balaraman Ravindran

Contextual bandit algorithms are commonly used in digital health to recommend personalized treatments. However, to ensure the effectiveness of the treatments, patients are often requested to take actions that have no immediate benefit to…

机器学习 · 计算机科学 2024-03-14 Kyra Gan , Esmaeil Keyvanshokooh , Xueqing Liu , Susan Murphy

We propose a probabilistic approach to select a subset of a \textit{target domain representative keywords} from a candidate set, contrasting with a context domain. Such a task is crucial for many downstream tasks in natural language…

计算与语言 · 计算机科学 2022-06-07 Pritom Saha Akash , Jie Huang , Kevin Chen-Chuan Chang , Yunyao Li , Lucian Popa , ChengXiang Zhai

For sponsored search auctions, we consider contextual multi-armed bandit problem in the presence of strategic agents. In this setting, at each round, an advertising platform (center) runs an auction to select the best-suited ads relevant to…

计算机科学与博弈论 · 计算机科学 2020-02-27 Kumar Abhishek , Shweta Jain , Sujit Gujar

The World Wide Web caters to the needs of billions of users in heterogeneous groups. Each user accessing the World Wide Web might have his / her own specific interest and would expect the web to respond to the specific requirements. The…

信息检索 · 计算机科学 2017-11-22 K. S. Kuppusamy , G. Aghila

Many efficient algorithms with strong theoretical guarantees have been proposed for the contextual multi-armed bandit problem. However, applying these algorithms in practice can be difficult because they require domain expertise to build…

机器学习 · 计算机科学 2018-10-23 Adam N. Elmachtoub , Ryan McNellis , Sechan Oh , Marek Petrik

Contextual Multi-Armed Bandits is a well-known and accepted online optimization algorithm, that is used in many Web experiences to tailor content or presentation to users' traffic. Much has been published on theoretical guarantees (e.g.…

信息检索 · 计算机科学 2019-07-12 David Abensur , Ivan Balashov , Shaked Bar , Ronny Lempel , Nurit Moscovici , Ilan Orlov , Danny Rosenstein , Ido Tamir

Sponsored search advertising (SSA) requires advertisers to constantly adjust keyword strategies. While bid adjustment and keyword generation are well-studied, keyword pruning-refining keyword sets to enhance campaign performance-remains…

信息检索 · 计算机科学 2026-01-12 Hou-Wan Long , Yicheng Song , Zidong Wang , Tianshu Sun

The growth of domain-specific applications of semantic models, boosted by the recent achievements of unsupervised embedding learning algorithms, demands domain-specific evaluation datasets. In many cases, content-based recommenders being a…

计算与语言 · 计算机科学 2020-11-24 Pierangelo Lombardo , Alessio Boiardi , Luca Colombo , Angelo Schiavone , Nicolò Tamagnone

Contextual bandits provide an effective way to model the dynamic data problem in ML by leveraging online (incremental) learning to continuously adjust the predictions based on changing environment. We explore details on contextual bandits,…

机器学习 · 计算机科学 2020-09-24 Dattaraj Rao

Classical collaborative filtering, and content-based filtering methods try to learn a static recommendation model given training data. These approaches are far from ideal in highly dynamic recommendation domains such as news recommendation…

机器学习 · 计算机科学 2016-06-01 Shuai Li , Alexandros Karatzoglou , Claudio Gentile

Keyword extraction has been an important topic for modern natural language processing. With its applications ranging from ontology generation, fact verification in summarized text, and recommendation systems. While it has had significant…

计算与语言 · 计算机科学 2022-11-17 Aman Priyanshu , Supriti Vijay

We consider an online decision making setting known as contextual bandit problem, and propose an approach for improving contextual bandit performance by using an adaptive feature extraction (representation learning) based on online…

人工智能 · 计算机科学 2020-09-15 Baihan Lin , Djallel Bouneffouf , Guillermo Cecchi , Irina Rish

Multi-armed bandit problems are receiving a great deal of attention because they adequately formalize the exploration-exploitation trade-offs arising in several industrially relevant applications, such as online advertisement and, more…

机器学习 · 计算机科学 2013-11-05 Nicolò Cesa-Bianchi , Claudio Gentile , Giovanni Zappella

Personalized web services strive to adapt their services (advertisements, news articles, etc) to individual users by making use of both content and user information. Despite a few recent advances, this problem remains challenging for at…

机器学习 · 计算机科学 2012-03-05 Lihong Li , Wei Chu , John Langford , Robert E. Schapire

Keyword extraction is a fundamental task in natural language processing that facilitates mapping of documents to a concise set of representative single and multi-word phrases. Keywords from text documents are primarily extracted using…

计算与语言 · 计算机科学 2018-07-17 Debanjan Mahata , John Kuriakose , Rajiv Ratn Shah , Roger Zimmermann , John R. Talburt

Sponsored search positions are typically allocated through real-time auctions, where the outcomes depend on advertisers' quality-adjusted bids - the product of their bids and quality scores. Although quality scoring helps promote ads with…

计算机科学与博弈论 · 计算机科学 2025-09-01 Mohammad Rashid , Omid Rafieian , Soheil Ghili
‹ 上一页 1 2 3 10 下一页 ›