# US 2026/0073424 A1 · Predicting a conversion rate

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0073424 A1
- Document ID: US20260073424A1
- Status: Published application
- Kind: A1
- Application number: 19/394,337
- Filed: 2025-11-19
- Published: 2026-03-12
- Earliest claimed: 2023-05-10
- Assignees: Snap Inc.
- Applicants: Snap Inc.
- Inventors: Weizhi Li; Vineet Abhishek; Jason Brewer; Roman Grachev; Yuqi Deng; David B. Lue
- Web page: https://patentgrep.com/patent/US20260073424A1

## CPC

- G06Q 30/0242: Determining effectiveness of advertisements
- G06Q 30/0246: {Traffic}
- G06N 3/045: Combinations of networks
- G06Q 30/0244: {Optimization}
- G06Q 30/0275: {Auctions}
- G06Q 30/0277: {Online advertisement}
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Aspects of the present disclosure involve a system comprising a storage medium storing a program and method for predicting a conversion rate. The program and method provide for receiving, from an advertisement service, a bid to display a first advertisement at a computing device; determining, in response to receiving the bid, a set of features that relate to the first advertisement; providing the set of features to a machine learning model configured to output a predicted conversion rate for the first advertisement, the machine learning model having been trained based on multi-task learning using plural sets of features corresponding to plural second advertisements, the plural sets of features being associated with both click-through conversions and view-through conversions; and determining, based on the output of the machine learning model with respect to the set of features, the predicted conversion rate for the first advertisement.

## Claims

### Claim 1

A system comprising:
at least one processor;
at least one memory component storing instructions that, when executed by the at least one processor, cause the at least one processor to perform operations comprising:
determining continuous features, discrete features, and spare list ids features for a first advertisement;
performing an embedding with respect to the discrete features to generate a first embedding;
performing an embedding with respect to the spare list ids features to generate a second embedding;
concatenating the first embedding and the second embedding together with the continuous features to generate concatenated features;
processing the concatenated features through a deep and cross network comprising multiple cross layers configured to model explicit feature interactions and a deep network configured to model implicit feature interactions;
providing output from the deep and cross network to a progressive layered extraction (PLE) model comprising a plurality of task-specific towers including a pixel sign up tower, a pixel add to cart tower, a pixel purchase tower, and a pixel page view tower;
generating tower outputs from the plurality of task-specific towers;
processing the tower outputs through a click head to generate click prediction data; and
applying inverse propensity weighting to the click prediction data and tower outputs to generate a loss function for training the PLE model.

### Claim 2 (depends on 1)

The system of claim 1, wherein the spare list ids features comprise seven-day swipe identifiers and seven-day advertisement impressions.

### Claim 3 (depends on 1)

The system of claim 1, wherein the deep and cross network corresponds to DCN-V2.

### Claim 4 (depends on 1)

The system of claim 1, wherein the progressive layered extraction model implements customized gate control to separate shared experts and task-specific experts for preventing negative transfer between tasks.

### Claim 5 (depends on 1)

The system of claim 1, wherein the continuous features correspond to features that assume a number of values within a given range, the discrete features correspond to features that assume a countable number of values, and the spare list ids features correspond to features that assume a finite number of values.

### Claim 6 (depends on 1)

The system of claim 1, wherein the plurality of task-specific towers are each configured to be task-specific to pixel events, and wherein the pixel events comprise pixel page view, pixel sign up, pixel add to cart, and pixel purchase.

### Claim 7 (depends on 1)

The system of claim 1, wherein applying inverse propensity weighting comprises accounting for loss based on inverse propensity weighting in association with the click head to remove click causality associated with multi-task learning.

### Claim 8 (depends on 1)

The system of claim 1, wherein the performing an embedding with respect to the discrete features provides for projecting the discrete features from a high-dimensional sparse space to a lower-dimensional dense space, and wherein the performing an embedding with respect to the spare list ids features provides for projecting the spare list ids features from a high-dimensional sparse space to a lower-dimensional dense space.

### Claim 9

A method comprising:
determining continuous features, discrete features, and spare list ids features for a first advertisement;
performing an embedding with respect to the discrete features to generate a first embedding;
performing an embedding with respect to the spare list ids features to generate a second embedding;
concatenating the first embedding and the second embedding together with the continuous features to generate concatenated features;
processing the concatenated features through a deep and cross network comprising multiple cross layers configured to model explicit feature interactions and a deep network configured to model implicit feature interactions;
providing output from the deep and cross network to a progressive layered extraction (PLE) model comprising a plurality of task-specific towers including a pixel sign up tower, a pixel add to cart tower, a pixel purchase tower, and a pixel page view tower;
generating tower outputs from the plurality of task-specific towers;
processing the tower outputs through a click head to generate click prediction data; and
applying inverse propensity weighting to the click prediction data and tower outputs to generate a loss function for training the PLE model.

### Claim 10 (depends on 9)

The method of claim 9, wherein the spare list ids features comprise seven-day swipe identifiers and seven-day advertisement impressions.

### Claim 11 (depends on 9)

The method of claim 9, wherein the deep and cross network corresponds to DCN-V2.

### Claim 12 (depends on 9)

The method of claim 9, wherein the progressive layered extraction model implements customized gate control to separate shared experts and task-specific experts for preventing negative transfer between tasks.

### Claim 13 (depends on 9)

The method of claim 9, wherein the continuous features correspond to features that assume a number of values within a given range, the discrete features correspond to features that assume a countable number of values, and the spare list ids features correspond to features that assume a finite number of values.

### Claim 14 (depends on 9)

The method of claim 9, wherein the plurality of task-specific towers are each configured to be task-specific to pixel events, and wherein the pixel events comprise pixel page view, pixel sign up, pixel add to cart, and pixel purchase.

### Claim 15 (depends on 9)

The method of claim 9, wherein applying inverse propensity weighting comprises accounting for loss based on inverse propensity weighting in association with the click head to remove click causality associated with multi-task learning.

### Claim 16 (depends on 9)

The method of claim 9, wherein the performing an embedding with respect to the discrete features provides for projecting the discrete features from a high-dimensional sparse space to a lower-dimensional dense space, and wherein the performing an embedding with respect to the spare list ids features provides for projecting the spare list ids features from a high-dimensional sparse space to a lower-dimensional dense space.

### Claim 17

A non-transitory computer-readable storage medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform operations comprising:
determining continuous features, discrete features, and spare list ids features for a first advertisement;
performing an embedding with respect to the discrete features to generate a first embedding;
performing an embedding with respect to the spare list ids features to generate a second embedding;
concatenating the first embedding and the second embedding together with the continuous features to generate concatenated features;
processing the concatenated features through a deep and cross network comprising multiple cross layers configured to model explicit feature interactions and a deep network configured to model implicit feature interactions;
providing output from the deep and cross network to a progressive layered extraction (PLE) model comprising a plurality of task-specific towers including a pixel sign up tower, a pixel add to cart tower, a pixel purchase tower, and a pixel page view tower;
generating tower outputs from the plurality of task-specific towers;
processing the tower outputs through a click head to generate click prediction data; and
applying inverse propensity weighting to the click prediction data and tower outputs to generate a loss function for training the PLE model.

### Claim 18 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein the spare list ids features comprise seven-day swipe identifiers and seven-day advertisement impressions.

### Claim 19 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein the deep and cross network corresponds to DCN-V2.

### Claim 20 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein the progressive layered extraction model implements customized gate control to separate shared experts and task-specific experts for preventing negative transfer between tasks.
