To start using PatSnap Eureka, click the verification button in the email we sent to .
This helps keep your account secure. Haven't received it? Check your spam folder.
Patent Drafting Analysis of Adobe’s Generative AI Fine-Tuned Language Model Evaluation | US 2025/0124235 A1
Patent Drafting Analysis of Adobe’s Generative AI Fine-Tuned Language Model Evaluation | US 2025/0124235 A1
IP Drafting Analysis · US 2025/0124235 A1
Patent Drafting Analysis of Adobe's Generative AI Fine-Tuned Language Model Evaluation | US 2025/0124235 A1
A structural and strategic analysis of Adobe's patent covering claim architecture, drafting quality signals, critical gaps, and prosecution positioning for AI-driven language model evaluation methods.
US 2025/0124235 A1Filed: Oct 11, 2023Published: Apr 17, 2025G06F 40/40G06F 40/279
System architecture, component diagrams, process flows
Draft now ↗
Published byPatSnap Insights Team · · 12 min read Verified by PatSnap Eureka Data
Overview
Structural Overview
The detailed description dominates at approximately 63% of total words (~4,200 of ~6,600 substantive words), with a well-structured Definitions subsection in paragraphs [0009]–[0015] that anchors key technical terms. The claim set comprises 20 total claims with 3 independent claims spanning method (Claim 1), computer-readable medium (Claim 9), and system (Claim 15) formats, yielding a 5.67:1 dependent-to-independent ratio. Six figure sheets cover the operating environment (FIG. 1), component architecture (FIG. 2), four-step process diagrams (FIGS. 3A–3D), method flow (FIG. 4), and computing device hardware (FIG. 5), providing adequate but not exhaustive structural support.
Section Word Distribution
↗ Click bars to explore
Figure Inventory — 6 Sheets
Figure
Description
Role
FIG. 1
Depicts the operating environment 100 showing User Device 102, Network 104, Generative Language Model 106, Language Model 116, Training Data Source 112, and Language Model Fine-Tuning and Evaluation Manager 108 interconnected via network.Search in Eureka ↗
System architecture
FIG. 2
Shows an example configuration of the Language Model Fine-Tuning and Evaluation Manager 202, including Generative Language Model 204, Language Model 206, Fine-Tuning Component 208, Evaluation Component 210, Evaluation Metric 212, User Interface Component 214, Training Data 216, and Data Store 218.Search in Eureka ↗
System architecture
FIG. 3A
Illustrates Step 1 — Generation of Training and Validation Sets, showing keyword-based query and top_document data 304 fed to Generator LLM 308A (e.g., Flan-UL2) via Prompt 306 to produce conversational queries 310.Search in Eureka ↗
Flow diagram
FIG. 3B
Illustrates Step 2 — Fine-Tuning on Training and Validation Sets, showing LLM Fine-Tuning (e.g., Sentence-BERT) 314 using data 310 to produce fine-tuned embeddings 316.Search in Eureka ↗
Claim support
FIG. 3C
Illustrates Step 3 — Generation of Independent Test Set, showing a different Generator LLM 308B and different Prompt 320 generating independent conversational queries 322 from the same keyword-document pairs 304.Search in Eureka ↗
Flow diagram
FIG. 3D
Illustrates Step 4 — Robust Evaluation on the Independent Test Set, showing the independent test set 322 applied to fine-tuned embeddings 316 via Robust Evaluation 326 to yield more realistic measurements 328.Search in Eureka ↗
Claim support
FIG. 4
Process flow diagram 400 showing method steps 402–410: generate text snippets via generative LM, fine-tune language model, generate independent snippets, generate evaluation metric, and display evaluation metric.Search in Eureka ↗
Flow diagram
FIG. 5
Block diagram of example computing device 500 showing Bus 510 coupling Memory 512, Processor(s) 514, Presentation Component(s) 516, Radio(s) 524, I/O Port(s) 518, I/O Components 520, and Power Supply 522.Search in Eureka ↗
Other
Analysis powered by PatSnap Eureka. Patent text and figures publicly available from USPTO. Draft a Similar Patent
Claims
Claim Architecture Analysis
The claim set contains 3 independent claims — Claim 1 (computer-implemented method), Claim 9 (non-transitory computer-readable medium), and Claim 15 (computing system) — providing tripartite claim type coverage across the primary enforcement formats. The 17:3 dependent-to-independent ratio of approximately 5.67:1 is slightly above the typical 4–5:1 norm for the G06F software/AI IPC class, suggesting moderately good fallback layering. The tripartite structure across method, CRM, and system claims (Claims 1, 9, and 15 respectively) provides enforcement flexibility, though the system claim's use of 'trigger-generating' functional language in Claim 15 creates a stylistic divergence from the more conventional apparatus claim format.
Core inventive concept: The claims address the problem of overfitting in fine-tuned language models when evaluated using the same query variations used for training — a problem that leads to inflated performance measurements. The solution, as expressed across Claims 1, 9, and 15, is to use a generative language model to produce a first set of natural language text snippets for training, and a second 'independent' set — where 'each independent natural language text snippet being different than each corresponding natural language text snippet' — as a separate test set for evaluation, thereby generating more realistic performance measurements.
Independent Claim Dissection
Claim
Preamble
Transition
Key Body Elements
Claim 1
A computer-implemented method
comprising
generating (via generative language model) set of NL text snippets based on corresponding set of data; fine-tuning (via language model fine-tuning component) language model using text snippets and data as training data; generating (via generative language model) set of independent NL text snippets where each independent snippet differs from corresponding training snippet; generating (via evaluation component) evaluation metric based on independent snippets and corresponding dataSearch prior art ↗
Claim 9
A non-transitory computer-readable medium storing executable instructions, which when executed by a processing device, cause the processing device to perform operations
comprising
prompting (via language model fine-tuning component) generative LM to generate set of NL text snippets based on keywords and corresponding documents; fine-tuning language model using text snippets and documents as training data; prompting generative LM to generate set of independent NL text snippets where each independent snippet differs from each training snippet; generating (via evaluation component) evaluation metric of fine-tuned LM based on independent snippets and corresponding documentsSearch prior art ↗
Claim 15
A computing system
comprising
a processor; a non-transitory computer-readable medium with stored instructions causing processor to: trigger-generate (via generative LM) set of NL queries based on keywords and corresponding documents; trigger-generate (via language model fine-tuning component) fine-tuned language model from language model using queries and documents as training data; trigger-generate (via generative LM) set of independent NL queries where each independent query differs from corresponding training query; trigger-generate (via evaluation component) evaluation metric; cause display of evaluation metricSearch prior art ↗
Claim Dependency Tree
1 Computer-implemented method: generate NL text snippets via generative LM, fine-tune LM, generate independent snippets differing from training snippets, generate evaluation metricSearch Claim 1 prior art ↗
2 Adds: corresponding data comprises set of documents; generating snippets comprises receiving keywords and corresponding documents, generating each snippet based on keywords and documentsSearch in Eureka ↗
3 Adds: generating set of NL text snippets further comprises receiving a prompt comprising a set of exemplars (keyword, document, NL query), generating each snippet based on the promptSearch in Eureka ↗
4 Adds: generating set of independent NL text snippets further comprises receiving a prompt different than initial prompt and generating each independent snippet based on the different promptSearch in Eureka ↗
5 Adds: each NL text snippet and each independent NL text snippet are natural language queriesSearch in Eureka ↗
6 Adds: fine-tuning uses Sentence Bidirectional Encoder Representations from Transformers (SBERT)Search in Eureka ↗
7 Adds: evaluation metric comprising at least one of accuracy, precision, recall, Hit@K, MRR, and NDCGSearch in Eureka ↗
8 Adds: the set of independent NL text snippets and corresponding set of data is a test set of dataSearch in Eureka ↗
9 Non-transitory CRM: prompt generative LM to generate NL text snippets from keywords/documents, fine-tune LM, prompt generative LM to generate independent snippets differing from training snippets, generate evaluation metricSearch Claim 9 prior art ↗
10 Adds: prompting to generate NL text snippets further comprises generating a prompt with exemplars (keyword, document, NL query) and prompting generative LM based on promptSearch in Eureka ↗
11 Adds: prompting to generate independent NL text snippets further comprises generating a prompt different from initial prompt and prompting generative LM based on that different promptSearch in Eureka ↗
12 Adds: each NL text snippet and each independent NL text snippet are natural language queriesSearch in Eureka ↗
13 Adds: fine-tuning uses Sentence Bidirectional Encoder Representations from Transformers (SBERT)Search in Eureka ↗
14 Adds: evaluation metric comprising at least one of accuracy, precision, recall, Hit@K, MRR, and NDCGSearch in Eureka ↗
15 Computing system: processor + CRM; trigger-generate NL queries via generative LM from keywords/documents; trigger-generate fine-tuned LM; trigger-generate independent NL queries differing from training queries; trigger-generate evaluation metric; cause display of metricSearch Claim 15 prior art ↗
16 Adds: trigger-generating set of NL queries further comprises receiving prompt with exemplars (keyword, document, NL query) and generating each NL query based on promptSearch in Eureka ↗
17 Adds: trigger-generating set of independent natural language queries further comprises receiving a prompt different from initial prompt and generating each independent query based on that different promptSearch in Eureka ↗
18 Adds: fine-tuned language model is generated using SBERTSearch in Eureka ↗
19 Adds: evaluation metric comprising at least one of accuracy, precision, recall, Hit@K, MRR, and NDCGSearch in Eureka ↗
20 Adds: the set of independent natural language queries and the corresponding set of documents is a test set of dataSearch in Eureka ↗
Metric
This Application
Software / AI Industry Norm
Total claims
20
15 – 25
Independent claim count
3
2 – 4
Dependent : Independent ratio
5.67 : 1
4 – 8 : 1
Method claims present?
Yes — Claim 1
Common
System / apparatus claims?
Yes — Claim 15
Common
Analysis powered by PatSnap Eureka. Patent text and figures publicly available from USPTO. Draft a Similar Patent
Drafting Quality
Drafting Quality Signals
The claims demonstrate solid structural consistency between the specification's four-step process (FIGS. 3A–3D) and the independent claim limitations, particularly in how Claim 1's 'generating independent text snippets' limitation maps directly to the Step 3 and Step 4 process described in paragraphs [0023]–[0024]. However, the heavy reliance on functional claiming language — particularly Claim 15's repeated use of 'trigger-generating' — creates non-trivial §112(f) and §101 Alice exposure risks that a prosecution examiner is likely to raise early in examination.
✅
Antecedent Basis
The claim language maintains clean antecedent basis throughout the 20-claim set. For example, Claim 1 introduces 'a set of natural language text snippets' and subsequently refers to 'the set of natural language text snippets' and 'the corresponding set of data' consistently. Claim 9's introduction of 'a set of keywords' and 'a corresponding set of documents' in the first limitation is correctly followed by 'the set of natural language text snippets' and 'the corresponding set of documents' in subsequent limitations. No orphaned 'the' references were found across dependent claims 2–8, 10–14, or 16–20.
The specification directly supports all four primary limitations of independent Claim 1. FIG. 3A and paragraphs [0058]–[0059] support the 'generating...set of natural language text snippets' limitation; FIG. 3B and paragraphs [0037], [0075] support the 'fine-tuning...language model' limitation; FIG. 3C and paragraph [0077] support the 'generating...set of independent natural language text snippets...being different' limitation; and FIG. 3D and paragraphs [0024], [0055] support the 'generating...evaluation metric' limitation. The Definitions section (¶¶[0009]–[0015]) provides written description anchors for key terms used in the claims.
All three independent claims (Claims 1, 9, and 15) correctly use 'comprising' as the transition, preserving open-ended claim scope that permits additional, unstated elements in an accused embodiment. This is strategically optimal for a software/AI patent where the inventive process may be embedded within a larger pipeline including additional pre- and post-processing steps not enumerated in the claims. No 'consisting of' or 'consisting essentially of' language was found, which would have inappropriately narrowed the claims to only the enumerated steps.
Claim 15's repeated use of 'trigger-generating, via a generative language model' and 'trigger-generating, via a language model fine-tuning component' introduces a borderline functional claiming issue. While no explicit 'means for' language is used, the nonce word 'trigger-generating' combined with a named component ('via a generative language model') could attract an examiner's argument that the functional description invokes §112(f) treatment, requiring disclosure of specific algorithms for 'trigger-generating' in the specification. The specification describes these components in ¶¶[0049]–[0051] but does not define 'trigger-generating' as a distinct structural operation, creating a potential prosecution vulnerability.
This patent faces a significant Alice/Mayo §101 challenge because the claims at their highest level of abstraction describe the abstract idea of 'using one AI system to generate test data for evaluating another AI system' — a data processing concept with no hardware tie-in beyond generic processor/memory recitations in Claim 15. The §101 defense will rest on the argument that the claimed method provides an improvement to computer functionality (more efficient LM evaluation) as stated in ¶[0026], but examiners in AU 2160 routinely reject such efficiency arguments under Alice step two without concrete hardware anchoring. Claims 1 and 9 lack any hardware-specific element that would satisfy the 'practical application' prong of the USPTO's 2019 Revised Guidance.
The dependent claims add meaningfully distinct fallback positions across three dimensions. Claims 2/3 (method), 10 (CRM), and 16 (system) add the exemplar-based prompt structure — a structurally distinct and commercially important limitation. Claims 4/11/17 add the 'different prompt' mechanism for generating independent test queries — the core differentiator of the invention that should arguably have been in the independent claims. Claims 6/13/18 add the specific SBERT implementation, providing a technically concrete fallback. Claims 7/14/19 enumerate specific evaluation metrics (Hit@K, MRR, NDCG), creating useful prosecution history estoppel boundaries. The tripartite repetition of the same dependent claim themes across Claims 1, 9, and 15 is expected and appropriate.
The abstract describes the system components accurately but fails to highlight the key inventive distinction: that the independent natural language text snippets used for evaluation are generated via a *different prompt* than those used for training — the mechanism that prevents evaluation contamination. An examiner reading only the abstract would understand the general system but would not identify this specific independence-ensuring mechanism as the novel contribution. The abstract states 'independent natural language text snippets are generated via the generative language model based on the corresponding data' without noting that a different prompt is used, which is the structural innovation that distinguishes this from prior art evaluation methods.
The six figures provide adequate structural support for the claim limitations. FIG. 2 maps to the component-level recitations in Claims 9 and 15 (language model fine-tuning component 208, evaluation component 210). FIGS. 3A–3D provide a four-step process flow that directly supports the four operative steps of independent Claim 1. FIG. 4 provides a higher-level method flow supporting Claims 1 and 9. However, there is no figure showing the internal architecture of the generative language model (GLM 204/106) or the fine-tuning mechanism in detail, meaning the SBERT-specific limitations in Claims 6/13/18 lack dedicated figure support and rely solely on paragraph descriptions at ¶¶[0022], [0038].
Analysis powered by PatSnap Eureka. Patent text and figures publicly available from USPTO. Draft a Similar Patent
Scorecard
Strategic Intent Scorecard
Multi-dimensional assessment of this application's patent strategy quality, based on claim structure, specification depth, and prosecution positioning.
Claim Breadth
3.2
Prosecution Defensibility
3
Spec–Claim Consistency
4
Dependent Claim Coverage
3.8
Claim Type Diversity
4.5
Figure Support Quality
3.5
Key observation: Claim Type Diversity (Score 4.5) is the strongest dimension — the tripartite method/CRM/system claim structure across Claims 1, 9, and 15 ensures enforcement coverage against direct infringers, contributory infringers, and system implementers alike, with no obvious claim type gap. Prosecution Defensibility (Score 3.0) is the weakest dimension — the §101 Alice exposure on Claims 1 and 9 (which lack any hardware tie-in beyond the abstract 'generative language model') combined with Claim 15's 'trigger-generating' functional language creates twin prosecution vulnerabilities that could require multiple office action responses. Practitioners should consider filing a continuation that anchors at least one independent claim to a specific technical implementation detail — such as the SBERT embedding architecture currently relegated to dependent Claims 6, 13, and 18.
A senior-attorney lens on the three highest-priority structural weaknesses — what each exposes in prosecution and litigation, and what a stronger filing would have done differently.
GAP 01 · HIGHEST IMPACT
No Hardware-Anchored Claim to Defeat Alice Rejection
Claims 1 and 9 — the broadest independent claims — contain no hardware-specific limitation beyond generic references to 'a generative language model' and 'a language model fine-tuning component,' making them maximally vulnerable to a §101 Alice rejection under the abstract idea exception. An examiner in AU 2160 is likely to characterize Claim 1 as reciting the abstract idea of 'generating test data from a different source than training data' — a data manipulation concept — with only generic computer implementation. A stronger filing would have drafted at least one independent claim that recites a specific technical improvement (e.g., the SBERT embedding architecture, a specific cosine similarity computation step, or a concrete network architecture parameter) as a structural limitation rather than relegating all technical specificity to dependent Claims 6, 13, and 18.
GAP 02 · HIGH IMPACT
Core Distinguishing Mechanism (Different Prompt) in Dependent Claims Only
The structural mechanism that distinguishes this invention from prior art evaluation approaches — using a *different prompt* to generate the independent test set — is captured only in dependent Claims 4, 11, and 17, not in any independent claim. Independent Claims 1, 9, and 15 merely require that each independent snippet 'being different than each corresponding natural language text snippet,' which a competitor could satisfy by any method of generating different queries, including manual human annotation, without using the claimed different-prompt approach. This structural gap means a competitor can design around the broadest claims by generating independent test data through any other differentiated process. A stronger filing would have incorporated the different-prompt limitation directly into the independent claims, or filed a second independent claim chain specifically covering the different-prompt mechanism.
GAP 03 · HIGH IMPACT
No Claim Covering Downstream Deployment Decision Use Case
Unlock to read the full analysis.
🔒
3 Critical Gaps in This Claim Set
See the full attorney-level analysis of what this application leaves unprotected — and how to draft it more defensively for your own filings.
No hardware anchor for §101 defenseDifferent-prompt mechanism only in dependentsNo claim on deployment decision output use case
US 2025/0124235 A1 protects a computer-implemented method, computer-readable medium, and computing system for using a generative AI language model to evaluate fine-tuned language models. The patent addresses the problem of overfitting and unrealistic performance measurement when evaluating fine-tuned language models using the same query variations used for training. The solution uses a generative language model to produce two distinct sets of natural language text snippets from the same data: one set for fine-tuning the model and an 'independent' set — generated via a different prompt — for evaluation, thereby producing more realistic performance measurements against natural language variation.
US 2025/0124235 A1 is owned by Adobe Inc., headquartered in San Jose, California, USA. The inventors are Victor Soares Bursztyn (Mountain View, CA), Xiang Chen (Palo Alto, CA), Vaishnavi Muppala (San Jose, CA), Uttaran Bhattacharya (Sunnyvale, CA), Tong Yu (Fremont, CA), Saayan Mitra (San Jose, CA), Ryan Rossi (San Jose, CA), Manas Garg (Fremont, CA), Kenneth George Russell (Mountain View, CA), Eunyee Koh (Sunnyvale, CA), and Alexandru Ionut Hodorogea (San Francisco, CA).
Claim 1 is a computer-implemented method covering: generating natural language text snippets via a generative language model, fine-tuning a language model using those snippets as training data, generating a separate 'independent' set of text snippets (each differing from the corresponding training snippet), and generating an evaluation metric of the fine-tuned model based on the independent snippets. Claim 9 is a non-transitory computer-readable medium covering the same operational sequence but framed as executable instructions that prompt a generative language model using keyword-document pairs. Claim 15 is a computing system comprising a processor and CRM that trigger-generates natural language queries, trigger-generates a fine-tuned language model, trigger-generates independent queries differing from training queries, and causes display of an evaluation metric.
This patent covers a technology for testing how well an AI language model that has been customized ('fine-tuned') for a specific task actually performs in real-world conditions. A common problem with customized AI models is that when you test them using questions similar to those used for training, the results look artificially good — the model has essentially 'memorized' the test. Adobe's patent solves this by having a separate AI system automatically generate a different set of test questions from the same source material but phrased differently, so the evaluation measures genuine performance rather than memorization. This removes the need for expensive human labor to manually write varied test questions and produces more reliable performance measurements.
G06F 40/40 (2020.01) — Processing or generating text; Natural language processing; specifically covering analysis and interpretation of text for natural language understanding. G06F 40/279 (2020.01) — Processing or generating text; Natural language processing; specifically covering generation of language or text, including machine translation and text summarization.
Still have questions? PatSnap Eureka can answer them from patent data instantly. Search in Eureka
PatSnap Eureka
Ready to Draft Your Next Patent with AI?
PatSnap Eureka's AI drafting agent writes structured claims, flags coverage gaps, and positions your application for prosecution success.
Disclaimer: This analysis is generated by PatSnap Eureka AI based on publicly available patent data from the USPTO. It does not constitute legal advice and should not be relied upon as such. Patent data may be subject to change as prosecution progresses. Scores and assessments reflect automated analysis and may not capture all relevant legal or technical nuances. Always consult a qualified patent attorney for formal legal opinions on patentability, freedom to operate, or infringement.
Ask anything about this patent. PatSnap Eureka searches patents and data to answer instantly.