Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

10.7%21.4%32.2%42.9% · Jun 202019922001200920172026
48 results for click data

In the cost per click (CPC) pricing model, an advertiser pays an ad network only when a user clicks on an ad; in turn, the ad network gives a share of that revenue to the publisher where the ad was impressed. Still, advertisers may be unsatisfied with ad networks charging them for "valueless" clicks, or so-called accid…

2018-04-03abs ↗pdf ↗

A new model predicts conversion rates by analyzing post-click actions.

problem Challenges in predicting conversion rates due to sample selection bias and data sparsity.
method Post-click behavior decomposition and multi-task learning.
result The model effectively addresses sample selection bias and data sparsity issues.

A new dataset tracks user interactions and click responses in online marketplaces.

problem Lack of exposure data in recommender systems datasets.
method Proposes a novel dataset including slates and click responses, allowing more accurate likelihood models.
result Models using exposure data show more natural likelihood, reducing bias towards previously exposed items.

Improved conversion rate prediction in online advertising using self-supervised pre-training.

problem Data sparsity and calibration issues in predicting conversions given clicks.
method Self-supervised pre-training on all conversion events to enrich CVR prediction model without compromising calibration.
result Improvements in offline training and online A/B tests, with full deployment to Yahoo native advertising system.

Many web systems rank and present a list of items to users, from recommender systems to search and advertising. An important problem in practice is to evaluate new ranking policies offline and optimize them before they are deployed. We address this problem by proposing evaluation algorithms for estimating the expected …

2018-04-27abs ↗pdf ↗

Predicting the click-through rate of an advertisement is a critical component of online advertising platforms. In sponsored search, the click-through rate estimates the probability that a displayed advertisement is clicked by a user after she submits a query to the search engine. Commercial search engines typically rel…

2017-07-07abs ↗pdf ↗

Online learning to rank is a core problem in information retrieval and machine learning. Many provably efficient algorithms have been recently proposed for this problem in specific click models. The click model is a model of how the user interacts with a list of documents. Though these results are significant, their im…

2017-03-07abs ↗pdf ↗

New ranking algorithms improve online content delivery by learning from click data.

problem Bias in ranking systems due to production system biases.
method Proposed novel extensions of LinUCB and Linear Thompson Sampling algorithms to handle position-based click model.
result Validated the proposed algorithms through offline and online experiments.

This paper optimizes ad bids and daily budgets for multiple campaigns in pay-per-click advertising.

problem Optimizing ad bids and daily budgets for multiple campaigns in pay-per-click advertising.
method Formulated as a combinatorial semi-bandit problem, solved using Gaussian Processes and four algorithms.
result Regret upper bounded as O(sqrt{T}), where T is the time horizon.

A search engine recommends to the user a list of web pages. The user examines this list, from the first page to the last, and clicks on all attractive pages until the user is satisfied. This behavior of the user can be described by the dependent click model (DCM). We propose DCM bandits, an online learning variant of t…

2016-02-09abs ↗pdf ↗

Click-through rate (CTR) prediction is a critical task in online advertising systems. A large body of research considers each ad independently, but ignores its relationship to other ads that may impact the CTR. In this paper, we investigate various types of auxiliary ads for improving the CTR prediction of the target a…

2019-06-10abs ↗pdf ↗

Estimates conversion probabilities from click sequences with privacy constraints.

problem Training models in advertising with limited direct click-conversion links.
method Formalizes learning from attribution sets, constructs unbiased estimator, applies Empirical Risk Minimization.
result Empirical Risk Minimization achieves generalization guarantees and robustness against prior errors.

Historically, machine learning in computer security has prioritized defense: think intrusion detection systems, malware classification, and botnet traffic identification. Offense can benefit from data just as well. Social networks, with their access to extensive personal data, bot-friendly APIs, colloquial syntax, and …

2018-02-14abs ↗pdf ↗

Best performing nuclear segmentation methods are based on deep learning algorithms that require a large amount of annotated data. However, collecting annotations for nuclear segmentation is a very labor-intensive and time-consuming task. Thereby, providing a tool that can facilitate and speed up this procedure is very …

2019-09-07abs ↗pdf ↗

Paper improves recommendation systems by optimizing sequence of items for clicks.

problem Improving recommendation systems robustness against bots and clicks.
method Minimizing pairwise ranking loss over sequences of items, with thresholds to prevent bot influence.
result The proposed algorithms converge and outperform existing methods in various ranking measures.

Model improves CVR estimation in recommender systems by mitigating bias and overlooking causal relationships.

problem Data sparsity and sample selection bias in CVR estimation.
method Entire Space Counterfactual Multitask Model (ESCM2^2) incorporating counterfactual risk minimizer.
result Significantly enhances recommendation performance by effectively mitigating bias and overlooking causal relationships.

Method detects interactions for better CTR prediction.

problem Predicting click-through rate with high-dimensional categorical features and time-varying interactions.
method Online Random Intersection Chains (ORIC) for detecting informative interactions.
result ORIC detects high-interpretability interactions that improve CTR prediction.

The probability that a user will click a search result depends both on its relevance and its position on the results page. The position based model explains this behavior by ascribing to every item an attraction probability, and to every position an examination probability. To be clicked, a result must be both attracti…

2017-03-19abs ↗pdf ↗

SIM models user interests from long sequential behavior data, improving click-through rate prediction.

problem Challenges in capturing user interests with long user behavior sequences.
method SIM uses a cascaded search paradigm with two units: General Search Unit and Exact Search Unit.
result SIM achieves significant CTR and RPM lifts in Alibaba's display advertising system.

Online learning to rank is a sequential decision-making problem where in each round the learning agent chooses a list of items and receives feedback in the form of clicks from the user. Many sample-efficient algorithms have been proposed for this problem that assume a specific click model connecting rankings and user b…

2018-06-06abs ↗pdf ↗

We present a unified framework for Batch Online Learning (OL) for Click Prediction in Search Advertisement. Machine Learning models once deployed, show non-trivial accuracy and calibration degradation over time due to model staleness. It is therefore necessary to regularly update models, and do so automatically. This p…

2018-09-12abs ↗pdf ↗

The paper tackles decision making problems with funnel structure in email marketing campaigns.

problem Decision making challenges in systems with funnel structure, where fewer observations are received from deeper layers.
method Formulated as a contextual bandit with funnel structure and developed a multi-task learning algorithm.
result Our algorithms offer significant improvement over previous methods in email marketing campaigns.

Paper proposes TPathMine model for more accurate user attribute prediction.

problem Predicting user attributes from click data in heterogeneous networks.
method HetPathMine model with meta-path weights optimized for user emotional preferences.
result TPathMine model achieves higher accuracy in user attribute prediction.

Click-through rate (CTR) prediction is a critical task in online advertising systems. Most existing methods mainly model the feature-CTR relationship and suffer from the data sparsity issue. In this paper, we propose DeepMCP, which models other types of relationships in order to learn more informative and statistically…

2019-06-11abs ↗pdf ↗

Sharp bounds on negative impact identified from observational data.

problem Identifying the fraction of users negatively affected by a treatment.
method Developed robust inference algorithm to derive tightest-possible bounds on negative impact.
result Valid conservative bounds on the fraction negatively affected, even when functions are mislearned.

Optimizing news headlines is important for publishers and media sites. A compelling headline will increase readership, user engagement and social shares. At Yahoo Front Page, headline testing is carried out using a test-rollout strategy: we first allocate equal proportion of the traffic to each headline variation for a…

2019-08-17abs ↗pdf ↗

Interprets feature interactions in ad-click prediction models.

problem Improving interpretability of black-box recommender systems.
method Interprets feature interactions from a source model and encodes them in a target model.
result Interpretations significantly outperform existing recommender models.

Click-through rate~(CTR) prediction, whose goal is to estimate the probability of the user clicks, has become one of the core tasks in advertising systems. For CTR prediction model, it is necessary to capture the latent user interest behind the user behavior data. Besides, considering the changing of the external envir…

2018-09-11abs ↗pdf ↗

The increase in data collection has made data annotation an interesting and valuable task in the contemporary world. This paper presents a new methodology for quickly annotating data using click-supervision and hierarchical object detection. The proposed work is semi-automatic in nature where the task of annotations is…

2018-10-01abs ↗pdf ↗

New model improves website ranking by considering user choices as a whole.

problem Optimizing content ordering for user clicks in website design.
method Introduced multinomial logit (MNL) choice model to LTR framework, proposing UCB algorithms.
result Proved theoretical bounds on regret for UCB algorithms in both known and unknown position parameter settings.