Embedding Vector Placement Probability for Position Bias Estimation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing technologies fail to accurately estimate position bias in item rankings, particularly when items are placed at fixed positions, leading to biased rankings.
Innovation Solution
An algorithm that estimates position bias by converting items into embedding vectors, calculating assignment probabilities, and deriving placement probabilities using a distribution of placement and assignment probabilities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If items are placed at fixed positions in a carousel advertisement, then the placement process is simple and deterministic, but position bias occurs that distorts the accuracy of click data for ranking construction
Solution Approach 1:
The patent introduces embedding vectors as an intermediary representation between items and their placement positions. Instead of directly observing item-position assignments, the system converts items into embedding vectors and learns the distribution of these vectors across potential positions. This intermediary representation allows the system to account for fixed placement patterns while still estimating position bias accurately, resolving the contradiction between simple fixed placement and accurate bias estimation.
Solution Approach 2:
The patent transforms the problem from directly analyzing item placement positions to analyzing the distribution of embedding vectors across positions. By changing the parameter space from discrete item IDs to continuous embedding vector distributions, the system can model fixed placement patterns while estimating position bias. This parameter transformation enables accurate bias estimation even when items are consistently placed at fixed positions.
2Productivity
If click data is used directly to construct rankings, then the process is straightforward, but position bias causes inaccurate ranking results that do not reflect true user preferences
Solution Approach 1:
The patent introduces embedding vectors as an intermediary layer between click data and ranking construction. Instead of directly using click counts at fixed positions, the system first converts items to embedding vectors, then models the distribution of these vectors across potential positions to estimate position bias. This intermediary step allows the system to correct for position bias while still efficiently constructing rankings from click data.
Solution Approach 2:
The patent replaces the mechanical approach of directly counting clicks at fixed positions with a probabilistic model based on embedding vector distributions. Instead of simple click aggregation, the system uses learned distributions to estimate what clicks would look like without position bias, then adjusts the ranking accordingly. This substitution enables accurate ranking construction that accounts for position bias while maintaining computational efficiency.
Data Source
AI summary
An information processing apparatus acquires a placement probability that expresses a probability of each of n items, where n is a natural number of 2 or higher, being placed at k positions, where k is a natural number of 2 or higher, converts the n items into m embedding vectors, where m is a natural number of 2 or higher, that express abstract representations of features of the n items, calculates an assignment probability that expresses a probability of assignment from the n items to the m embedding vectors, and derives, using a distribution of the placement probability and a distribution of the assignment probability, a probability expression of each of the m embedding vectors being placed at each of the k positions.


