# US 2026/0099558 A1 · Predictive feedback engine for improving search relevance in a tenant configurable hybrid search system

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

- Number: US 2026/0099558 A1
- Document ID: US20260099558A1
- Status: Published application
- Kind: A1
- Application number: 19/357,263
- Filed: 2025-10-14
- Published: 2026-04-09
- Earliest claimed: 2023-06-29
- Assignees: Workday, Inc.
- Applicants: Workday, Inc.
- Inventors: Karthik ARUN KOTEESWARAN; Vivek KUMAR
- Web page: https://patentgrep.com/patent/US20260099558A1

## CPC

- G06F 16/953: Querying, e.g. by the use of web search engines
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In some implementations, the techniques described herein relate to a method including: loading, by a processor, a predictive model, the predictive model including a first set of hidden layers; loading, by the processor, a semantic model, the semantic model including a second set of hidden layers; generating, by the processor, a tenant model using the first set of hidden layers and a third set of hidden layers, the third set of hidden layers receiving, as input, an output of the first set of hidden layers; loading, by the processor, a tenanted training data set; training, by the processor, the tenant model by biasing the first set of hidden layers with the second set of hidden layers and training weights of at least the third set of hidden layers using the tenanted training data set; and building, by the processor, an embedding index using the tenant model.

## Claims

### Claim 1

A method comprising:
loading, by a processor, a predictive model, the predictive model including a first set of hidden layers;
loading, by the processor, a semantic model, the semantic model including a second set of hidden layers;
generating, by the processor, a tenant model using the first set of hidden layers and a third set of hidden layers, the third set of hidden layers receiving, as input, an output of the first set of hidden layers;
loading, by the processor, a tenanted training data set;
training, by the processor, the tenant model by biasing the first set of hidden layers with the second set of hidden layers and training weights of at least the third set of hidden layers using the tenanted training data set; and
building, by the processor, an embedding index using the tenant model.

### Claim 2 (depends on 1)

The method of claim 1, wherein the tenanted training data set comprises a data set comprising interactions of users with a network search application.

### Claim 3 (depends on 2)

The method of claim 2, wherein the interactions include search queries and corresponding selections of search results.

### Claim 4 (depends on 1)

The method of claim 1, wherein biasing the first set of hidden layers with the second set of hidden layers comprises adjusting bias terms of the first set of hidden layers with corresponding bias terms of the second set of hidden layers.

### Claim 5 (depends on 1)

The method of claim 1, wherein biasing the first set of hidden layers with the second set of hidden layers comprises combining the second set of hidden layers with the first set of hidden layers.

### Claim 6 (depends on 1)

The method of claim 1, further comprising analyzing a size of the tenanted training data set and determining which layers in the tenant model to re-train based on the size of the tenanted training data set.

### Claim 7 (depends on 6)

The method of claim 6, wherein training the tenant model further comprises re-training the first set of hidden layers when the size is below a threshold.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
receiving a search query;
converting the search query to a search embedding;
building a search embedding from the search query;
identifying similar embeddings stored in the embedding index;
querying a document index using the search query to identify responsive documents; and
returning a set of search results selected from the similar embeddings and responsive documents.

### Claim 9

A non-transitory computer-readable storage medium for tangibly storing computer program instructions capable of being executed by a computer processor, the computer program instructions defining steps of:
loading a predictive model, the predictive model including a first set of hidden layers;
loading a semantic model, the semantic model including a second set of hidden layers;
generating a tenant model using the first set of hidden layers and a third set of hidden layers, the third set of hidden layers receiving, as input, an output of the first set of hidden layers;
loading a tenanted training data set;
training the tenant model by biasing the first set of hidden layers with the second set of hidden layers and training weights of at least the third set of hidden layers using the tenanted training data set; and
building an embedding index using the tenant model.

### Claim 10 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, wherein the tenanted training data set comprises a data set comprising interactions of users with a network search application.

### Claim 11 (depends on 10)

The non-transitory computer-readable storage medium of claim 10, wherein the interactions include search queries and corresponding selections of search results.

### Claim 12 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, wherein biasing the first set of hidden layers with the second set of hidden layers comprises adjusting bias terms of the first set of hidden layers with corresponding bias terms of the second set of hidden layers.

### Claim 13 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, wherein biasing the first set of hidden layers with the second set of hidden layers comprises combining the second set of hidden layers with the first set of hidden layers.

### Claim 14 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, further comprising analyzing a size of the tenanted training data set and determining which layers in the tenant model to re-train based on the size of the tenanted training data set.

### Claim 15 (depends on 14)

The non-transitory computer-readable storage medium of claim 14, wherein training the tenant model further comprises re-training the first set of hidden layers when the size is below a threshold.

### Claim 16 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, the steps further comprising:
receiving a search query;
converting the search query to a search embedding;
building a search embedding from the search query;
identifying similar embeddings stored in the embedding index;
querying a document index using the search query to identify responsive documents; and
returning a set of search results selected from the similar embeddings and responsive documents.

### Claim 17

A device comprising:
a processor; and
a storage medium for tangibly storing thereon logic for execution by the processor, the logic comprising instructions for:
loading a predictive model, the predictive model including a first set of hidden layers;
loading a semantic model, the semantic model including a second set of hidden layers;
generating a tenant model using the first set of hidden layers and a third set of hidden layers, the third set of hidden layers receiving, as input, an output of the first set of hidden layers;
loading a tenanted training data set;
training the tenant model by biasing the first set of hidden layers with the second set of hidden layers and training weights of at least the third set of hidden layers using the tenanted training data set; and
building an embedding index using the tenant model.

### Claim 18 (depends on 17)

The device of claim 17, wherein biasing the first set of hidden layers with the second set of hidden layers comprises adjusting bias terms of the first set of hidden layers with corresponding bias terms of the second set of hidden layers.

### Claim 19 (depends on 17)

The device of claim 17, wherein biasing the first set of hidden layers with the second set of hidden layers comprises combining the second set of hidden layers with the first set of hidden layers.

### Claim 20 (depends on 17)

The device of claim 17, further comprising analyzing a size of the tenanted training data set and determining which layers in the tenant model to re-train based on the size of the tenanted training data set.
