Keyword-Aligned Encoding (KAE) Explained

• Keyword-Aligned Encoding (KAE) is a semantic identifier scheme that maps each token position to an interpretable key attribute word, enabling real-time editability in retrieval systems.
• KAE merges 18 fine-grained attribute types into a compact six-slot (ECOM6) design, balancing the need for operational index editability with effective retrieval performance.
• The method employs reserved-slot mechanisms and deterministic, dictionary-driven encoding to allow instant updates without retraining, achieving competitive recall metrics in industrial settings.

Searching arXiv for papers on Keyword-Aligned Encoding and adjacent uses of the acronym KAE. First, searching for the exact phrase "Keyword-Aligned Encoding". Keyword-Aligned Encoding (KAE) is an identifier scheme introduced as the core semantic encoding mechanism in "OneRetrieval: Unifying Multi-Branch E-commerce Retrieval with an Editable Generative Model" (Zhang et al., 11 Jun 2026). In that formulation, KAE ties each identifier position to an interpretable key attribute word rather than to a quantized embedding, so that a generative retriever can preserve the operational editability of an inverted index while retaining the compact, addressable structure of code-based generative retrieval. The term is therefore specific: in the current arXiv record represented here, KAE is not a generic label for keyword-conditioned encoders, but a concrete design for editable semantic identifiers in industrial e-commerce retrieval (Zhang et al., 11 Jun 2026).

1. Industrial setting and motivating problem

KAE is defined against the background of industrial e-commerce retrieval, where search commonly relies on a multi-branch retrieval stage fused by hand-tuned merging rather than by a jointly optimized model (Zhang et al., 11 Jun 2026). In that setting, the inverted-index branch persists despite lower conversion because operations can inject a newly emerging term, brand, category word, or marketing slogan within hours and without retraining. The OneRetrieval paper describes this tension as the “Editability Paradox”: a one-model replacement must recover not only recall quality, but also the same-day intervention capability of lexical retrieval.

The paper positions KAE between two established generative retrieval regimes. In closed-codebook methods, identifier slots are bound to training-time quantized embedding centroids, so a new term cannot be deterministically attached to a slot after deployment. In open-vocabulary methods, a newly emerging term is handled only if the model generalizes to it, because there is no explicit, addressable slot that operations can bind to a designated item set. KAE is introduced to occupy the missing point in this design space: compact and addressable like code-based generative retrieval, but editable like inverted-index retrieval (Zhang et al., 11 Jun 2026).

This industrial framing is central to the meaning of KAE. The method is not primarily a semantic encoding for interpretability alone; it is an operational answer to real-time intervention under production constraints. A plausible implication is that KAE should be understood less as an abstract representation-learning primitive than as a deployment-oriented identifier convention whose semantics are deliberately exposed to upstream dictionaries and downstream lookup tables.

2. Semantic identifier structure

OneRetrieval represents each item $i$ by a semantic identifier

$$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$

where the $\ell$-th token is drawn from a position-specific codebook $\mathcal{V}_\ell$ (Zhang et al., 11 Jun 2026). KAE determines what these tokens mean: each identifier position corresponds to one merged attribute group, and the token at that position is the slot associated with a concrete attribute word from a production attribute dictionary.

The raw attribute substrate is a typed vocabulary derived from an internal attribute-extraction pipeline. The paper lists 18 fine-grained key attribute types: entity, brand, anchor, crowd, color, good_model, specification, material, scene, location, season, marketing, quality, modifier, function, style, pattern, and new. After PV-based pruning and deduplication, the production vocabulary contains about $1.08\times 10^6$ typed attribute words (Zhang et al., 11 Jun 2026).

Encoding each type as its own position would yield $L=18$, which the paper characterizes as too costly and too sparse, so categories are merged information-theoretically. The information loss of collapsing categories $X$ and $Y$ onto one position is defined as

$$\begin{aligned} \mathrm{IL}(X, Y) &= \tfrac{1}{2}\big(H(X\mid Y) + H(Y\mid X)\big) \ &= \tfrac{1}{2}\big(H(X)+H(Y)\big) - \mathrm{MI}(X, Y). \end{aligned}$$

Agglomerative clustering uses average cross-group distance

$$\overline{\mathrm{IL}}(g_a, g_b) = \frac{1}{|g_a||g_b|} \sum_{X\in g_a,\, Y\in g_b} \mathrm{IL}(X, Y),$$

while holding entity out as a singleton anchor because it is “the noun denoting the bought object” and the primary semantic anchor to which all other attributes attach (Zhang et al., 11 Jun 2026).

The target group count is selected from the knee of cumulative information loss by second difference, and the second-difference peak falls at six. The resulting partition is called ECOM6, and OneRetrieval uses $$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$0 (Zhang et al., 11 Jun 2026). This six-position design is therefore not arbitrary: it is the result of merging 18 attribute types into six semantically organized identifier slots with non-uniform capacity.

The paper also argues against hierarchical or entity-conditional codebooks. Variants in which non-entity positions were conditioned on entity hurt retrieval, because conditioning turns slot meaning from a function into a one-to-many relation, weakens the language-model prior exploited in Stage 0, fragments training signal for recurrent attributes across many entities, and magnifies autoregressive error propagation (Zhang et al., 11 Jun 2026). In KAE, positions remain globally shared and semantically interpretable.

3. Codebooks, deterministic encoding, and editability

KAE’s codebooks are position-specific and non-uniform (Zhang et al., 11 Jun 2026). In the deployed configuration, denoted $$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$1, the three densest positions receive $$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$2 and the remaining three receive $$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$3, for $$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$4 core slots. The paper motivates this design by collision control: uniform allocation would force dense positions to pack many more words per slot than sparse ones.

Within each position-specific codebook, the layout has four blocks.

Block	Role	Indices / size
Empty slot	No attribute word or no in-vocabulary word	index $$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$5
Cluster slots	$$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$6-means centroids over embeddings of tail words	$$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$7
Solo slots	Roughly one slot per frequent head word	$$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$8 at dense positions, $$\mathbf{s}_i = \big(s_i^{(1)}, s_i^{(2)}, \ldots, s_i^{(L)}\big),$$9 at lighter positions
Reserved slots	Unbound during training, bound after deployment	$\ell$0 per position

Under $\ell$1 with the recommended allocation, the identifier has six tokens and the vocabulary extension is $\ell$2 core tokens plus $\ell$3 reserved tokens, $\ell$4 total (Zhang et al., 11 Jun 2026).

The actual item-to-SID encoding is deterministic and dictionary-driven. For each item, the system concatenates title, structured properties, detail-page text, and image OCR, then recovers typed attribute words by matching against the production vocabulary using an Aho-Corasick automaton. The same matching is applied to queries. If multiple words fall in one group, KAE selects one representative using two precomputed rules: primary-subject precedence, built offline via LLM judgments over co-occurring same-type words, and a posterior importance score from behavior statistics such as PV and CTR (Zhang et al., 11 Jun 2026).

Reserved slots provide the editable component. After deployment, if a new word $\ell$5 appears, operations select its merged group $\ell$6, assign it to an unused reserved slot $\ell$7, update the dictionary so that matching maps the word to that slot, and bind the slot to a target item population in the SID-to-item lookup $\ell$8, all without retraining the generative model (Zhang et al., 11 Jun 2026). The paper explains this through three properties:

• Syntactic reachability (P1): unconstrained beam search can emit any codebook token at any position, and reserved slots are part of the alphabet from the start.
• Word-agnostic identity routing (P2): reserved slots are absent from Stages 0–2, but Stage 3 adds self-routing supervision of the form $\ell$9.
• Encoder-side determinism (P3): after dictionary update, any query containing $\mathcal{V}_\ell$0 is deterministically encoded to $\mathcal{V}_\ell$1.

These properties are the technical core of KAE’s editability claim. The model learns how to route reserved slots, while their concrete meanings are assigned later through dictionary binding and SID-to-item lookup updates (Zhang et al., 11 Jun 2026).

4. Retrieval model and training pipeline

KAE is integrated into an autoregressive generative retriever rather than used as a standalone encoder (Zhang et al., 11 Jun 2026). Retrieval is defined as

$\mathcal{V}_\ell$2

where top-$\mathcal{V}_\ell$3 is approximated by unconstrained beam search and $\mathcal{V}_\ell$4 is a precomputed SID-to-item lookup index. The policy factorizes as

$\mathcal{V}_\ell$5

and is trained by maximum likelihood: $\mathcal{V}_\ell$6

The backbone is BART-base, extended with the SID alphabet (Zhang et al., 11 Jun 2026). KAE exists on both item and query sides: the query SID $\mathcal{V}_\ell$7 is produced by the same deterministic dictionary-driven KAE used offline, and the policy network decodes top-$\mathcal{V}_\ell$8 item SIDs conditioned on the query, the query SID, and user context. The paper emphasizes that serving does not rely on a neural query encoder in the usual dense-retrieval sense.

The fine-tuning pipeline has four stages, all trained with the same per-token likelihood objective but with different templates (Zhang et al., 11 Jun 2026).

Stage 0: Attribute–SID alignment. This stage teaches the mapping between each populated slot and the attribute word it represents through forward and inverse tasks such as “Attribute word is $\mathcal{V}_\ell$9, category $1.08\times 10^6$0, id is:” $1.08\times 10^6$1. It covers solo and cluster slots, but not reserved slots. The authors state that Stage 0 is retained more for editability and interpretability than for raw retrieval quality.

Stage 1: Content alignment. This stage aligns surface forms of queries and item titles with their SIDs. It includes four bidirectional tasks pairing queries and item titles with SIDs, plus two category prediction tasks $1.08\times 10^6$2 and $1.08\times 10^6$3. In ablation, this stage is the primary support for retrieval quality.

Stage 2: Collaborative co-occurrence. This stage uses click/order co-occurrence. For each $1.08\times 10^6$4 pair from logs, it adds surface-level tasks between queries and item titles and SID-level tasks between $1.08\times 10^6$5 and $1.08\times 10^6$6. The paper characterizes this as the “load-bearing stage for editability”, because it establishes the query-SID-to-item-SID routing later used by reserved slots.

Stage 3: Personalized retrieval. This final stage uses

$1.08\times 10^6$7

where $1.08\times 10^6$8 is recent search history and $1.08\times 10^6$9 is a short sequence of recently interacted item SIDs. It also adds the reserved-slot self-routing auxiliary data. The paper notes that a token never appearing as a target receives only negative gradient and becomes suppressed at decoding time; the tiny self-routing block prevents that by keeping reserved tokens emittable.

This staged construction is integral to the definition of KAE in practice. The identifier design alone does not yield editability; editability emerges from the combination of interpretable slot semantics, reserved-slot codebook structure, deterministic upstream encoding, and stage-specific routing supervision.

5. Empirical behavior, operational trade-offs, and deployment

The main offline benchmark uses 31 days of industrial search logs, with $L=18$0 training request logs and about 20.2 million items on the item side (Zhang et al., 11 Jun 2026). On that benchmark, OneRetrieval with KAE reaches deep recall near parity with the strongest generative baseline, OneSearch. On order targets, OneRetrieval reports HR@350 $L=18$1 versus OneSearch $L=18$2; on click targets, OneRetrieval reports HR@350 $L=18$3 versus OneSearch $L=18$4 (Zhang et al., 11 Jun 2026). The paper explicitly notes a trade-off: OneRetrieval is weaker at shallow cutoffs and MRR, and describes the modest precision gap at shallow cut-offs as “the deliberate price of this editability.”

KAE is evaluated directly against quantization-based closed-codebook identifiers under a shared L6 setup.

Encoding	Order HR@350	Click HR@350	Total IHR@350
KAE	0.5452	0.6033	0.0806
RQ-VAE	0.5075	0.5516	0.0025
RQ-kmeans	0.5355	0.5837	0.0030
RQ-OPQ	0.5376	0.5848	0.0021

The intervention result is the paper’s headline empirical distinction: KAE’s Total IHR@350 $L=18$5 is over an order of magnitude above the closed-codebook alternatives (Zhang et al., 11 Jun 2026). The paper interprets the small nonzero IHR values of quantization baselines as incidental code collisions rather than controllable intervention.

Against the editable BM25 branch, OneRetrieval does not fully match lexical activation but recovers much of it while substantially improving retrieval quality. Table 7 reports:

System	Order HR@350	Click HR@350	Total IAR@350
BM25	0.2215	0.2914	0.7610
OneRetrieval	0.5482	0.6055	0.5530

Thus OneRetrieval recovers about three quarters of the inverted index’s intervention activation rate while more than doubling retrieval quality at HR@350 (Zhang et al., 11 Jun 2026). The paper also reports that, on average, 15.5\% of decoded SIDs carry the injected code in this test.

Stage ablation isolates where editability arises. With fixed L6-D3, the full system reaches Order HR@350 $L=18$6, Click HR@350 $L=18$7, and Total IHR@350 $L=18$8. Removing Stage 2 collapses IHR@350 to $L=18$9 while barely changing retrieval quality; removing Stage 0 lowers IHR to $X$0; removing Stage 1 slightly reduces HR while IHR remains high (Zhang et al., 11 Jun 2026). The paper therefore argues that retrieval quality and editability are moved by near-disjoint subsets of the pipeline.

The deployment results are unusually prominent because KAE is presented as an industrial method rather than only an offline benchmark result. In an A/B test replacing only the inverted-index branch, OneRetrieval reports $X$1 order volume, $X$2 buyer count, and $X$3 item CTR. In a broader deployment replacing both inverted-index and dense vector branches, the system reports $X$4 item CTR, with order $X$5 and buyer $X$6, neither statistically significant (Zhang et al., 11 Jun 2026). The system is described as deployed at Kuaishou and serving hundreds of millions of PVs daily.

The paper also states several limitations. KAE depends on a high-quality attribute extraction pipeline and typed production dictionary; intervention behavior is measured by IHR and IAR rather than guaranteed symbolically; reserved-slot budget is finite; and OneRetrieval does not outperform OneSearch on shallow precision or MRR (Zhang et al., 11 Jun 2026). These caveats are part of the method’s definition in practice: KAE exchanges some top-rank precision for editability and relies on substantial upstream infrastructure.

6. Related alignment methods and acronym disambiguation

In current usage, Keyword-Aligned Encoding is explicitly defined in OneRetrieval (Zhang et al., 11 Jun 2026). Several other arXiv papers address alignment between keywords and learned representations, especially in open-vocabulary keyword spotting, but they do not use the term KAE.

"Matching Latent Encoding for Audio-Text based Keyword Spotting" (Nishu et al., 2023) aligns audio and text in a shared latent space by Dynamic Sequence Partitioning (DSP), which partitions the audio sequence into the same length as the word-based text sequence under monotonic alignment. "CTC-aligned Audio-Text Embedding for Streaming Open-vocabulary Keyword Spotting" (Jin et al., 2024) dynamically aligns streaming audio and enrolled keyword text on the fly using CTC and aggregates frame-level acoustic embeddings into character-, word-, or phrase-level aligned representations. "Bridging the Gap between Audio and Text using Parallel-attention for User-defined Keyword Spotting" (Kim et al., 2024) uses parallel self- and cross-attention together with a phoneme duration-based alignment loss to enforce sequential correspondence between text-side and audio-side features. "MATE: Matryoshka Audio-Text Embeddings for Open-Vocabulary Keyword Spotting" (Jung et al., 20 Jan 2026) is an utterance-level dual-encoder method that aligns nested audio and text prefixes to PCA-compressed text teachers rather than performing explicit temporal keyword localization. These methods are conceptually adjacent because they align audio and text around keyword identity, but that connection is an interpretation; the papers themselves do not define their methods as Keyword-Aligned Encoding.

A separate source of confusion is acronym collision. Several papers use KAE or phonetically similar names for unrelated methods.

Term in paper	Expansion	Domain
KALE (Campos et al., 2023)	Kullback-Leibler Alignment of Embeddings	Dense retrieval
KAE-Net (Moskvyak et al., 2020)	Keypoint-Aligned Embeddings	Image retrieval and re-identification
KAE (Shi et al., 2024)	Knowledge Graph Alignment and Extension	Knowledge graphs
KAE (Li et al., 2023)	Kernel-Elastic Autoencoder	Molecular design

The KALE paper (Campos et al., 2023) is particularly easy to confuse with KAE because it also concerns alignment, but it is a post-training KL-based method for compressing the query encoder in asymmetric dense retrieval, not Keyword-Aligned Encoding. "Keypoint-Aligned Embeddings" (Moskvyak et al., 2020) concerns pose-invariant visual representation learning, "KAE: A Property-based Method for Knowledge Graph Alignment and Extension" (Shi et al., 2024) concerns property-based KG alignment, and "Kernel-Elastic Autoencoder" (Li et al., 2023) concerns transformer-based molecular generation. The phrase “keyword-aligned encoding” does not appear in those works.

This disambiguation matters because the term KAE is narrow in its exact usage but broad in its apparent associations. A careful reading of the current literature suggests two distinct senses: a strict sense in which KAE denotes the editable semantic identifier scheme of OneRetrieval (Zhang et al., 11 Jun 2026), and a broader, inferential sense in which a family of audio-text alignment methods for keyword spotting can be viewed as KAE-like without adopting the term itself (Nishu et al., 2023, Jin et al., 2024, Kim et al., 2024, Jung et al., 20 Jan 2026).