中文
相关论文

相关论文: Combinatorial Keyword Recommendations for Sponsore…

200 篇论文

Digital advertising is a critical part of many e-commerce platforms such as Taobao and Amazon. While in recent years a lot of attention has been drawn to the consumer side including canonical problems like ctr/cvr prediction, the advertiser…

信息检索 · 计算机科学 2021-11-02 Zongtao Liu , Bin Ma , Quan Liu , Jian Xu , Bo Zheng

Job search through online matching engines nowadays are very prominent and beneficial to both job seekers and employers. But the solutions of traditional engines without understanding the semantic meanings of different resumes have not kept…

计算与语言 · 计算机科学 2016-07-27 Yiou Lin , Hang Lei , Prince Clement Addo , Xiaoyu Li

In the last years decision-focused learning framework, also known as predict-and-optimize, have received increasing attention. In this setting, the predictions of a machine learning model are used as estimated cost coefficients in the…

机器学习 · 计算机科学 2022-06-20 Jayanta Mandi , Víctor Bucarey , Maxime Mulamba , Tias Guns

The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely…

人工智能 · 计算机科学 2012-03-07 Tom Schrijvers , Guido Tack , Pieter Wuille , Horst Samulowitz , Peter J. Stuckey

This paper presents a framework to tackle constrained combinatorial optimization problems using deep Reinforcement Learning (RL). To this end, we extend the Neural Combinatorial Optimization (NCO) theory in order to deal with constraints in…

机器学习 · 计算机科学 2020-06-23 Ruben Solozabal , Josu Ceberio , Martin Takáč

Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging…

计算机科学与博弈论 · 计算机科学 2009-01-26 Eyal Even-dar , Yishay Mansour , Vahab Mirrokni , S. Muthukrishnan , Uri Nadav

Branch-and-bound is a systematic enumerative method for combinatorial optimization, where the performance highly relies on the variable selection strategy. State-of-the-art handcrafted heuristic strategies suffer from relatively slow…

机器学习 · 计算机科学 2022-06-15 Tianyu Zhang , Amin Banitalebi-Dehkordi , Yong Zhang

Scale-calibrated ranking systems are ubiquitous in real-world applications nowadays, which pursue accurate ranking quality and calibrated probabilistic predictions simultaneously. For instance, in the advertising ranking system, the…

信息检索 · 计算机科学 2024-06-13 Shunyu Zhang , Hu Liu , Wentian Bao , Enyun Yu , Yang Song

Neural Combinatorial Optimization attempts to learn good heuristics for solving a set of problems using Neural Network models and Reinforcement Learning. Recently, its good performance has encouraged many practitioners to develop neural…

人工智能 · 计算机科学 2022-05-04 Andoni I. Garmendia , Josu Ceberio , Alexander Mendiburu

Feature importance ranking has become a powerful tool for explainable AI. However, its nature of combinatorial optimization poses a great challenge for deep learning. In this paper, we propose a novel dual-net architecture consisting of…

机器学习 · 计算机科学 2020-10-20 Maksymilian Wojtas , Ke Chen

Sponsored search becomes an easy platform to match potential consumers' intent with merchants' advertising. Advertisers express their willingness to pay for each keyword in terms of bids to the search engine. When a user's query matches the…

计算机科学与博弈论 · 计算机科学 2012-07-20 Chenyang Li , Mingyi Hong , Randy Cogill , Alfredo Garcia

Latent factor models are the driving forces of the state-of-the-art recommender systems, with an important insight of vectorizing raw input features into dense embeddings. The dimensions of different feature embeddings are often set to a…

机器学习 · 计算机科学 2020-09-11 Weiyu Cheng , Yanyan Shen , Linpeng Huang

In a sponsored search engine, generative retrieval models are recently proposed to mine relevant advertisement keywords for users' input queries. Generative retrieval models generate outputs token by token on a path of the target library…

信息检索 · 计算机科学 2020-10-22 Weizhen Qi , Yeyun Gong , Yu Yan , Jian Jiao , Bo Shao , Ruofei Zhang , Houqiang Li , Nan Duan , Ming Zhou

We study the problem of learning a good search policy for combinatorial search spaces. We propose retrospective imitation learning, which, after initial training by an expert, improves itself by learning from \textit{retrospective…

机器学习 · 计算机科学 2019-06-25 Jialin Song , Ravi Lanka , Albert Zhao , Aadyot Bhatnagar , Yisong Yue , Masahiro Ono

Multiobjective combinatorial optimization deals with problems considering more than one viewpoint or scenario. The problem of aggregating multiple criteria to obtain a globalizing objective function is of special interest when the number of…

最优化与控制 · 数学 2013-06-07 Elena Fernández , Miguel A. Pozo , Justo Puerto

Federated learning is a distributed form of machine learning where both the training data and model training are decentralized. In this paper, we use federated learning in a commercial, global-scale setting to train, evaluate and deploy a…

A combinatorial recommender (CR) system feeds a list of items to a user at a time in the result page, in which the user behavior is affected by both contextual information and items. The CR is formulated as a combinatorial optimization…

信息检索 · 计算机科学 2022-07-28 Xin Zhao , Zhiwei Fang , Yuchen Guo , Jie He , Wenlong Chen , Changping Peng

Nowadays, search engine users commonly rely on query suggestions to improve their initial inputs. Current systems are very good at recommending lexical adaptations or spelling corrections to users' queries. However, they often struggle to…

信息检索 · 计算机科学 2023-01-24 Jorge Gabín , M. Eduardo Ares , Javier Parapar

This paper presents first successful steps in designing search agents that learn meta-strategies for iterative query refinement in information-seeking tasks. Our approach uses machine reading to guide the selection of refinement terms from…

Commercial entries, such as hotels, are ranked according to score by a search engine or recommendation system, and the score of each can be improved upon by making a targeted investment, e.g., advertising. We study the problem of how a…

计算机科学与博弈论 · 计算机科学 2022-03-29 Amir Ban , Moshe Tennenholtz