BurbageLaw

Developments

Artificial intelligence patent developments

Developments in United States, European and Asian patent law affecting software and artificial intelligence inventions, together with the regulation and policy that shapes what clients can build and ship. Newest first. Court decisions, agency guidance, regulation, what the largest artificial intelligence companies are filing, and the economics of running a patent program. Every entry says what the item is and what it changes for someone holding or seeking patents.

Last updated 2026-10-26 Showing the 12 most recent of 171 United States, Europe & Asia RSS feed

Original data Four in ten big-company AI patent publications continue earlier applications, and most of their parents are already patents · All data editions

Reference Federal Circuit decisions on artificial intelligence patent eligibility · one table, kept current

2026-10-22 Filings

OpenAI claims the buffer that turns a reasoning model's hidden chain of thought into step summaries, and a continuation claims the timeline that displays them

United States Patent Application Publication Nos. 2026/0330193 A1 and 2026/0330194 A1, OpenAI OpCo, LLC, both titled "Visual Reasoning and Multimodal Chain-of-Thought Back-End," Application No. 19/364,606, filed October 21, 2025, claiming priority to Provisional Application No. 63/789,762 filed April 16, 2025, and its continuation, Application No. 19/389,708, filed November 14, 2025, both published October 22, 2026

Claim 1 of the first publication is a method of artificial intelligence reasoning: map an input to tokens, process them with a model that generates reasoning tokens and tool calls, perform the tool calls and queue their responses, buffer the reasoning tokens, determine when to release the buffered tokens and the queued responses to a summarization model, have that model write a step summary of the multi-step reasoning, and return the summary to an application programming interface or to the conversation thread of a user interface. The dependent claims add an ordered queue that holds an output back until its summary is finished (claim 5), a delta threshold for the release based on a difference in token count or an elapsed time (claim 6, which depends from claim 5), chunk sizes set by a latency threshold, a token-generation rate or available summarization resources (claim 3), visibility flags that mark reasoning as displayable or as protected intermediate reasoning (claim 8), and summaries that draw on earlier summaries (claim 10). The specification describes an analysis channel marked non-persistent, whose messages are discarded when the reasoning turn ends. The continuation claims the other end of the wire: a client that receives reasoning messages tagged by type, a text output, an image output, a search result or a code execution result, chooses a visual style, an animation or a display duration from the type, and renders the messages as a timeline that updates in real time, with a collapsed mode that shows only the latest step (claim 2) and search citations that arrive one at a time (claim 7). Both publications are classified only in Cooperative Patent Classification group G06N 3/0475, generative networks, and neither carries a user interface class. OpenAI wrote on September 12, 2024 that it would not show users the raw chain of thought and that the o1 series would show a model-generated summary instead; the provisional was filed April 16, 2025, the day OpenAI released o3 and o4-mini.

What it changesShowing users a model-written summary of a hidden chain of thought was public seven months before the provisional, in OpenAI's own words. Whether that post counts against OpenAI depends on the inventor's one-year grace period under Section 102(b)(1)(A) of Title 35 of the United States Code, but it counts against anyone who files on the idea now, so an application on reasoning summaries filed today has to claim how the summaries are produced, not that they are shown. That is what OpenAI did. Claim 1 recites the plumbing: a buffer, a determination of when to release it, a queue for tool results, and a summarization model that receives a subset of the reasoning tokens at each release. Upon review, I conclude that the release determination is likely where examination will turn, because claim 1 says that the system determines when to release the tokens without saying how, and I would expect the claim to end up closer to claim 6, which ties the release to a difference in token count or an elapsed time. The second lesson is in the continuation, filed twenty-four days after the parent. The server that generates a reasoning feed and the application that displays it are often built and sold by different companies, and a method claim whose steps are split between them risks having no single infringer; the parent claims the server side and the continuation the client side. When drafting for a system that splits work between a server and a client, consider an independent claim for each side.
2026-10-22 Filings

Google claims the residual block that lets a layer attend over the outputs of several earlier layers, filed in Greece one Monday and posted to arXiv the next

United States Patent Application Publication No. 2026/0330219 A1, Google LLC, "Attention Neural Networks With Generalized Residual Attention Blocks," Application No. 19/468,910, filed February 3, 2026, claiming priority to Greek Application No. 20250100075 filed February 3, 2025, published October 22, 2026

Claim 1 is a system running an attention neural network whose stack contains generalized residual attention blocks. Each one takes as its input the outputs of two or more preceding blocks rather than only the one just before it, generates a query vector from that input through a query generalized residual block with one or more sets of weights, and applies attention over the input using that query. The dependent claims give the key and value paths the same treatment (claims 8 and 9); spell out the block as layer normalization, a product with a first set of weights shared across the preceding blocks, a sum with a second set that has a subset per preceding block, and a ReLU activation (claims 3 through 6); name multi-head depth-wise cross-attention (claim 12); and let the input grow in dimensionality deeper in the stack (claim 16). The specification reports up to three times fewer training steps to reach comparable perplexity on language and image modeling, and says the first set of weights can start at zero so the block begins as an ordinary residual network. The six inventors posted "DeepCrossAttention: Supercharging Transformer Residual Connections" to arXiv on February 10, 2025, seven days after the Greek filing. As published, claim 2 depends from "the method of claim 1" although claim 1 is a system, and claim 7, which depends from claim 1, refers to "the combination," "the transformed product" and "the second set of weights"; the last two first appear in claims 2 and 3, and no claim in claim 7's chain introduces a combination.

What it changesUpon review, I conclude that the timing of the Greek application, a first filing in Greece by a Mountain View company with inventors in New Jersey, New York and California, one Monday before the preprint went up the next, points to a filing made to put a date in front of the paper. That date matters most outside the United States, where the European Patent Office and China's office have no grace period for a preprint an inventor posts; in the United States the paper was forgiven either way. The lesson for a research group is the one Google's scaling application taught on this page earlier this month: the first filing, normally a United States provisional, goes in before the paper is posted. The other lesson concerns clearance. This claim did not appear in a United States publication until October 22, 2026, twenty months after the paper, so a clearance search run in that interval found the paper and not the claim. Consider whether you should rely on a clearance search on a transformer architecture feature first described in a recent paper. When performing a clearance search now, search by class, not by keywords alone: the paper calls the architecture DeepCrossAttention, and that name appears nowhere in the application, which sits in G06N 3/08 and G06N 3/048. The antecedent problems in claims 2 and 7 are likely to draw a rejection under Section 112(b) of Title 35 of the United States Code, which Google can cure by amendment.
2026-10-19 Supreme Court

Supreme Court declines to review the Office's settled-expectations denials, in a year when 36 percent of electrical and computer petitions were instituted

Google LLC v. VirtaMove, Corp., No. 25-1230 (U.S. Oct. 19, 2026) (petition for a writ of certiorari denied), leaving in place In re Google LLC, No. 2026-111 (Fed. Cir. Jan. 27, 2026) (nonprecedential) (mandamus denied); United States Patent and Trademark Office, Patent Trial and Appeal Board Trial Statistics, fiscal year 2026 (October 1, 2025 through September 30, 2026)

Google asked whether the Office lacks statutory authority to deny institution of inter partes review on "settled expectations" when the statute allows review at any time in a patent's life, and whether courts may review a denial that rests on a ground contrary to statute. The Office had refused to institute IPR2025-00487 and IPR2025-00488 against VirtaMove because the patent had been in force for more than fourteen years, and the Federal Circuit denied mandamus on January 27, 2026, following its orders in In re Cambridge Industries and In re SanDisk. The Court requested a response, the Solicitor General filed it on September 11, 2026 after two extensions, and the petition was denied on the October 19 order list without comment. The Office's trial statistics for the fiscal year that ended September 30, 2026 show 500 petitions filed, 452 of them for inter partes review, and, of 931 institution decisions, 379 instituted and 552 denied, a rate of 41 percent; in electrical and computer technology, the field in which, by my reading, most artificial intelligence and software patents are challenged, 212 of 586 decided petitions were instituted, 36 percent, the lowest of the five technology fields. Across all fields, 782 petitions reached the Director's discretionary stage, where 438 were denied and 344 referred on, and of 493 decided on the merits or other considerations, 379 were granted.

What it changesThe Court has declined, for now, to review the Director's use of a patent's age as a reason to refuse review. For the holder of an older artificial intelligence or software patent, the Office's practice, which the denial leaves in place, bears on the maintenance-fee decision: a claim that still reads on current systems is harder to challenge at the Board than it was two years ago, when the Office instituted 68 percent of petitions in all fields against 41 percent this year, which is a reason to pay the fee on it rather than let it lapse. For a company already accused of infringing such a patent, the Board is no longer the default venue, with just over a third of electrical and computer petitions instituted, and the realistic alternatives are an ex parte reexamination request, which turns on a substantial new question of patentability rather than on the patent's age, and the district court. Upon review, I conclude that the discretionary stage is where petitions now fail: across all fields, four of every five denials came at that stage, and 77 percent of the petitions decided at the merits stage were instituted. The Office's figures do not break that stage out by technology, so the same split cannot be confirmed for electrical and computer petitions alone.
2026-10-19 Costs

The Board closed fiscal year 2026 with its smallest appeal inventory in fifteen years and a 38 percent reversal rate in the software technology center

United States Patent and Trademark Office, Patent Trial and Appeal Board, Appeal Statistics as of September 30, 2026, ex parte appeal receipts and dispositions, fiscal year 2026 (October 1, 2025 through September 30, 2026); percentages computed by Burbage Law, PC from the Office's table

The Board decided 4,829 ex parte appeals in fiscal year 2026 against 3,684 filed, and its inventory of pending appeals fell from 3,125 at the start of the year to 1,977 at the end, a drop of 1,148, or 36.7 percent; the Office's chart of year-end inventories since fiscal year 2012, which starts at 26,570, has no lower value. Across the Board, 2,886 appeals were affirmed, or 59.8 percent, 387 affirmed in part, or 8.0 percent, and 1,521 reversed, or 31.5 percent. Technology Center 2100, which examines computer architecture, software and artificial intelligence subject matter, decided 526 appeals and reversed 202, a reversal rate of 38.4 percent, and affirmed in part 36 more, so 45.2 percent of its appellants had at least one rejection reversed. Technology Center 2400 reversed 36.0 percent and Technology Center 2600 reversed 35.9 percent, while Technology Center 3600, which holds the business method art units, decided 996 and reversed 224, or 22.5 percent, with 71.6 percent affirmed outright. Single months swing: in September 2026 alone Technology Center 2100 reversed 6 of 29. The source is the Office's fiscal-year-to-date table; each row was checked so that affirmed, affirmed in part, reversed, remanded and dismissed sum to the appeals decided, every row passed, and the percentages are those counts divided by that row's decided total. The same document reports that appeals decided in July through September 2026 took longer from receipt to decision than those decided a year earlier in nearly every technology center, which is consistent with a Board working through its oldest appeals. The Office does not report outcomes by type of rejection, so there is still no official reversal rate for eligibility rejections.

What it changesThe queue an appeal enters today is a third shorter than the one it entered a year ago, and the Board is deciding 131 appeals for every 100 filed; the pendency figures in the same document run the other way, which is what deciding old appeals does to the measure, so the right reading is that an appeal filed this quarter joins a shorter line, not that the Board has become fast. For an artificial intelligence application in Technology Center 2100 carrying a rejection the examiner would not drop after an interview, the numbers favor the appeal over a second request for continued examination: a 45 percent chance that at least one rejection is reversed, against a continued examination fee that buys another round with the same examiner. In Technology Center 3600 the same rejection is a 28 percent chance, which is why the classification an application receives at filing is worth arguing about, and why a claim drafted to the computing improvement rather than to the transaction it serves is a budget decision as much as an eligibility one. Anyone quoting a reversal rate for eligibility rejections in particular is quoting a private analysis of Office data, and that caveat belongs next to the number when it is used to justify an appeal budget.
2026-10-19 In-House

The invention record that survives a priority fight is the native file with its metadata, not the copy the inventor exported

Practice note, Burbage Law, PC, October 19, 2026, on Google LLC v. Valtrus Innovations Ltd., No. 2024-1945 (Fed. Cir. Oct. 19, 2026) (precedential) (Cunningham, J., joined by Hughes, J., and Burroughs, D.J., sitting by designation), affirming the Patent Trial and Appeal Board in IPR2022-01545

Google petitioned for inter partes review of United States Patent No. 6,728,704, which claims merging the result lists returned by several search engines, on grounds built around a reference called Bushee that was filed five weeks before the patent's August 27, 2001 application. Valtrus antedated Bushee under the pre-America Invents Act version of Section 102(e) of Title 35 of the United States Code with a declaration from co-inventor Tsaparas, the original invention disclosure documents, and the Microsoft Word metadata of those documents. Google argued on appeal that documents and metadata under the inventor's own control cannot corroborate his testimony. The Federal Circuit disagreed: assuming without deciding that the metadata was authentic, metadata that Word generates automatically was not authored by the inventor, so it is independent corroboration and the Board's finding was supported by substantial evidence, following Global Health Solutions LLC v. Selner, 148 F.4th 1363 (Fed. Cir. 2025), and unlike the unwitnessed laboratory notebooks and unwitnessed emails that cannot corroborate on their own; Google's counsel acknowledged at argument that a human is not a required element of corroboration. The court also upheld the finding of reasonably continuous diligence over the roughly eleven business days between August 8 and August 27, 2001, which were spent getting a signed declaration back by mail from an inventor in Ontario and finishing the application at the law firm.

What it changesAntedating a reference ended for applications filed on or after March 16, 2013, but the question this case decides, what proves when an inventor conceived, still decides derivation proceedings, inventorship disputes and the question of who contributed what when a machine learning tool took part in the work, so an in-house program should keep its invention records in the form that proved itself here. Keep the disclosure in the system that created it, with the authorship and timestamp metadata that system writes without anyone asking, and treat the step where someone exports the document to a portable format or retypes it into an intake form as the step that turns independent evidence back into the inventor's own say-so. The same rule covers the prompts, model outputs and session logs of an engineer who used a code assistant or a model to get to the invention: the system's own timestamps are the metadata, and they are the first thing an opponent will ask for when inventorship is contested. The diligence holding is the smaller lesson, and it cuts the other way: Valtrus won because it could account for the entire period with timestamped evidence, so the program should docket the signature chase and the drafting hand-offs the way it dockets a statutory deadline, because the record of a routine three weeks is what the Board was asked to read.
2026-10-16 China

China's draft export catalogue would restrict or ban the export of twenty-three artificial intelligence technologies, and assigning or licensing a patent abroad is an export

Ministry of Commerce and Ministry of Science and Technology of the People's Republic of China, Announcement No. 48 of 2026, public consultation on the revision of the Catalogue of Technologies Prohibited or Restricted from Export and interim registration of related technology exports, October 16, 2026, comments due November 15, 2026

The two ministries published a draft revision of the catalogue adding forty technologies in three fields: twenty-three in artificial intelligence, covering large models, agents, computing clusters and information processing, five in biomedicine and twelve in photovoltaics. The notice states that technology that has already entered the public domain through open-source release or academic publication is outside the scope of control. Baker McKenzie's October 18 summary of the proposal reports that the restricted large models include one meeting any of these tests: training compute of ten to the twenty-sixth power floating-point operations, two trillion parameters, or globally advanced capabilities, for example a top-ten ranking on public benchmarks; it also reports a numeric threshold for computing clusters and none for agents. From October 16, 2026 until the revised catalogue takes effect, the notice requires anyone exporting a listed technology to register first on the Ministry of Commerce's technology trade platform, including exports already begun but not completed, and it lists what counts: transfer of ownership of technology abroad, giving intellectual property assignment as the example; licensing domestic technology for use abroad, giving intellectual property licensing as the example; a change that places a domestic technology's owner or controller abroad; and anything else the ministry designates. That tracks Article 2 of the Regulations on Technology Import and Export Administration, in force since 2002, which define technology export to include assignment of a patent right, assignment of the right to apply for a patent, and patent licensing.

What it changesFor a company whose model work is done partly in China, the patent file is now an export file. An assignment from a Chinese subsidiary to a United States parent of a patent or application on a listed technology is a transfer of ownership abroad that must be registered from October 16, and once the catalogue is final a restricted item will need a license, while a prohibited item cannot be exported at all. When an assignment or license from a Chinese entity is being prepared, consider whether it covers a technology on the draft list, because the registration requirement reaches transfers that have begun but are not finished. The draft is open for comment until November 15, 2026, and the final list may differ, but the registration requirement applies now.
2026-10-15 Filings

OpenAI claims the control in the prompt box that sets how many tokens the model may spend on an answer, and the Office allowed it before it published

United States Patent Application Publication No. 2026/0319862 A1, OpenAI OpCo, LLC, "Adaptive Compute Allocation Display for Generative Response" (the title as printed on the publication; the Office's application record reads "Adaptive Compute Allocation Display for Generative Response Engines"), Application No. 19/194,991, filed April 30, 2025, claiming priority to Provisional Application No. 63/786,668 filed April 10, 2025, published October 15, 2026

Claim 1 is a method in which the front end to a generative response engine shows, in the prompt composer, an indicator that opens a compute allocation interface with a selector object manipulated by a pointer device, offering a default setting and at least one greater or lesser setting; the setting controls the relative amount of tokens the engine may generate for the response, the engine receives the prompt and the setting together, and the greater setting makes it use more tokens than the default while the lesser setting makes it use fewer. Dependent claims add a trained model that predicts how long the prompt will take at the default setting and shows that estimate in the interface (claims 2 and 3), the same model choosing which version of the engine to use and preferring the more efficient one until the prompt calls for a more capable one (claims 4 through 6), keeping the setting for the rest of the conversation thread (claim 12), sending the setting to a data center load balancer (claim 15), and, in claims 23, 24 and 26, defining the setting as a maximum token budget, as an amount of time the engine may spend reasoning, and as counting the tokens generated during reasoning. The published set is an amended one: twenty-two claims numbered 1 through 27, with claims 9 through 11, 20 and 21 absent and claim 25 marked canceled. The Office's Open Data Portal file history shows a Track One request granted May 23, 2025, non-final rejections mailed July 9, 2025 and February 6, 2026, a final rejection mailed October 23, 2025, three applicant-initiated examiner interviews, a request for continued examination on January 15, 2026, a notice of allowance mailed June 5, 2026, a second request for continued examination filed July 9, 2026 with an information disclosure statement, a second notice of allowance mailed August 25, 2026, and an amendment after allowance filed October 1, 2026; as of October 11, 2026 the issue fee had not been paid. The application published at eighteen months from the provisional, on the first publication Thursday after the October 10, 2026 date, after it had already been allowed twice.

What it changesThe prior art that matters is not OpenAI's own: o3-mini shipped on January 31, 2025 with low, medium and high reasoning effort options in the application programming interface and a higher-effort model in the ChatGPT picker, which the one-year grace period covers if the disclosure came from these inventors, but Anthropic announced Claude 3.7 Sonnet on February 24, 2025 with a developer-set thinking budget of up to N tokens and a user's choice in the applications between answering normally and thinking longer, forty-five days before the provisional, and the exception for a third party's disclosure that follows the inventor's own reaches only the subject matter the inventors had themselves disclosed first. That is why the claim lives in the composer: the selector object moved by a pointer device, the greater and lesser settings around a default, and, in claims 2 and 7, the duration estimate shown beside them, which is also why a developer who sets a token budget through an application programming interface is outside claim 1 as published and a consumer product with a thinking-effort control in its own prompt box is not. Compare the shipped interface to the published claim now rather than at grant, because the allowance has already happened and the next event is a patent number. The file is the second lesson: Track One and three interviews bought a first allowance in thirteen months, and the request for continued examination filed after that allowance, with an information disclosure statement, is the price of art that surfaced late; a program that finishes its own search before paying for Track One does not buy that second cycle.
2026-10-15 Filings

Google claims the procedure for sizing a model's depth and width to a compute budget, filed five days before its authors posted the paper

United States Patent Application Publication No. 2026/0320392 A1, Google LLC, "Scaling Neural Network Architectures to Computational Resource Constraints," Application No. 19/485,257, the national stage, entered November 17, 2025, of PCT/US2023/029718 filed August 8, 2023, claiming priority to Provisional Application No. 63/502,790 filed May 17, 2023, published October 15, 2026

Claim 1 is a method for choosing a neural network architecture for a given compute constraint in three steps. For each architecture dimension to be adjusted, it fits a power law relating a performance metric to that dimension and to compute, from evaluations of networks identical except in that dimension, and takes a scaling exponent from the fit. It then picks a base architecture from candidate networks of different shapes, chosen by grid search in claim 13 and trained under a smaller compute budget, taking the best of them on performance against compute in claim 5. Finally it modifies the base architecture's dimensions using the exponents, the base architecture's compute use and the target constraint, in claim 6 by raising the ratio of target to base compute to a power set by the exponent. The dependent claims name depth and width (claim 17), the width of the multi-layer perceptron in a Transformer block (claim 18), image processing as the task (claims 21 and 23), and training a network of the output shape (claim 22); claims 25 and 26 repeat the method as a system and a storage medium. The four inventors posted "Getting ViT in Shape: Scaling Laws for Compute-Optimal Model Design" to arXiv on May 22, 2023, five days after the provisional, and reported the SoViT-400m/14 model that the method produced. The file history shows a request for immediate examination under Section 371(f) and docketing to an examiner on July 16, 2026, with no office action yet.

What it changesFive days is the whole margin: the United States grace period would have forgiven the paper, but the European Patent Office and China's office have no grace period for an inventor's own paper, so without the May 17 provisional the paper would have been prior art against the counterparts in the two largest markets outside the United States, and a research group that files the provisional on the way to the arXiv submission button, as this one did, keeps those rights for the cost of a form. On the United States claim as published I would expect a subject matter eligibility rejection: claim 1 fits curves, takes exponents and ends in an architecture, which is a set of numbers describing a model no one has yet trained, and the eligibility decisions that have favored machine learning claims, Ex parte Desjardins among them, involved claims that train or run a model, not a calculation whose output is a design. The repair is in the application already, which is to move claim 22's training step, or claim 23's processing of image data with the resulting network, into claim 1. Detection is the other problem with a design-time method: it is practiced inside a lab, and the only evidence that a competitor used it is the competitor's own paper, so a claim like this earns its budget as the thing that stops a published recipe from being free for everyone, and the family should add a claim to the model shape that the recipe produced.
2026-10-08 Filings

OpenAI claims loading a narrative memory of the user, written offline from past chats, into the context window before the first prompt

United States Patent Application Publication No. 2026/0310729 A1, OpenAI OpCo, LLC, "Memory Platform for Generative Response Engines," Application No. 19/195,022, filed April 30, 2025, claiming priority to Provisional Application No. 63/784,739 filed April 7, 2025, published October 8, 2026

Claim 1 is a method in which a system server receives a prompt starting a conversation thread with a user account, inserts a personalized memory state into the context window before inference begins, and sends the prompt and the memory state together to a language model generative response engine. The memory state must contain two things: curated facts in natural language about the user account, and synthesized memories, which the claim defines as natural-language narrative descriptions of the user account generated by a language model that periodically analyzes past conversation threads in an asynchronous offline process before the prompt arrives, each summarizing conceptual connections across multiple threads and stored in a persistent user profile. The dependent claims add reasoning over which parts of the memory are relevant (claim 2), searching an archive of past interactions (claim 3), a short-term memory of recent threads (claim 4), a specialized model instance trained to decide what to synthesize (claim 6), demoting a stale summary to the archive (claim 7), keeping separate memory sets for two distinct usage profiles of one account (claim 8), trimming or summarizing the memory to free room in the context window (claim 10), and a personalization notepad the model writes to (claim 11). The published claim set shows claim 21 canceled and claims 22 and 23 added, so at least one amendment preceded publication; claim 1 as published also recites an "interference operation" where an inference operation is plainly meant. The provisional application was filed April 7, 2025, and OpenAI announced on April 10, 2025 that ChatGPT memory would draw on chat history as well as saved memories.

What it changesThe February 2024 version of ChatGPT memory, which stored facts the user asked it to keep, is more than one year older than the April 7, 2025 provisional, so it is OpenAI's own prior art under Section 102(a)(1) of Title 35 of the United States Code with no grace period, and Nvidia's Publication No. 2026/0288790 A1 on this page carries a 2022 priority date for storing what the user said and applying it later. That is why the claim puts its weight on the synthesized memories: narrative descriptions written offline by a model, summarizing connections across threads, and loaded before the first prompt. Anyone building assistant memory should compare their design to those limitations, because a product that stores only extracted facts, or that writes its summaries at inference time rather than in a background job, is outside claim 1 as published. The three-day gap between the provisional and the launch is the cadence an in-house program should copy: the provisional goes in when the launch date is set, not after the press coverage, because the launch starts the one-year clock in the United States and ends novelty everywhere else.
2026-10-08 Filings

Google claims the attention layer that compresses the whole context into a fixed-size memory by an optimization step per token, filed the day before the paper was posted

United States Patent Application Publication No. 2026/0310945 A1, Google LLC, "Generative Neural Networks With Compressive Attention Layers," Application No. 19/641,299, filed April 7, 2026, claiming priority to Provisional Application No. 63/784,960 filed April 7, 2025, published October 8, 2026

Claim 1 is a method of generating an output sequence token by token with a generative neural network that contains a compressive attention layer. For that layer, at each output position, the method identifies the layer's memory state, derives a query vector, a key vector and a value vector from the layer input token, performs one or more optimization steps on a compression objective using the key and value vectors to update the memory state, and then applies the updated memory state to the query vector to produce the layer output. The specification describes the memory as a fixed number of slots that replaces the key-value cache, whose size grows with every token in a standard transformer and which the specification identifies as the limit on context length and batch size in high-bandwidth memory. The dependent claims narrow to a single gradient descent step per token (claims 2 and 3), a compression objective that measures the difference between the memory applied to the key and the value, by L2 norm or cosine similarity (claims 4 through 6), a column-normalized memory (claim 7), and projecting each memory column onto the unit sphere after the update (claim 11). The two named inventors, with Razvan Pascanu, posted the paper "Lattice: Learning to Efficiently Compress the Memory" to arXiv on April 8, 2025, one day after the provisional was filed.

What it changesClaim 1 is written at the level of the mechanism, a learned update of a fixed-size state under an explicit objective, rather than at the level of the result, a bounded cache, and that makes it both enforceable and exposed: it reads on any architecture that updates a memory matrix by optimizing a reconstruction loss at inference time, which now describes a family of published test-time-training and linear-attention designs, including Google's own Titans paper (arXiv 2501.00663) and the test-time-training layers of July 2024 (arXiv 2407.04620), so the examiner will have to sort out which of those disclose the specific key-to-value objective. For anyone shipping long-context or on-device models, the dependent claims are the ones to check against the implementation, since a single gradient step with an L2 objective on a column-normalized state is a design choice an engineer either made or did not. The one-day gap between the provisional and the arXiv posting is the standard the research groups at the large companies hold themselves to, and an in-house program that lets its researchers post first has given away every jurisdiction without a grace period.
2026-10-08 Filings

Google claims training an agent with a second model that grades each tool call for whether it advances the goal, on a July 2023 priority date

United States Patent Application Publication No. 2026/0311065 A1, Google LLC, "Reinforcement Learning With Information Retrieval Feedback," Application No. 19/711,492, filed June 17, 2026 as a continuation of Application No. 18/348,687 filed July 7, 2023, published October 8, 2026

Claim 1 is a method of training a machine-learned agent model by reinforcement learning to improve tool use. The system obtains an output of the agent that contains an action feature, generated from a sequence of preceding states, specifying a function call to a tool external to the agent; a machine-learned reward model processes that output together with the preceding states to produce a quality indicator of whether the action advances the goal of the sequence; and the quality indicator goes to a model trainer running a reinforcement learning algorithm that updates the agent's parameters. The dependent claims let the reward model make its own tool call to fetch reference data before grading (claim 2), define the action as a token sequence with start-of-action and end-of-action tokens around a function identifier and parameters (claim 3), execute the call and append the action and its result to the state sequence for the next iteration until a finish token is generated (claims 4 through 6), name search, database lookup, calculation and internal reasoning as the tools (claim 7), and add a cost term that penalizes the number of tool calls (claims 8 and 9). The specification describes training the reward model from a larger supervisor model that has access to reference sources, so that the reward model can be small and run beside the agent.

What it changesA reward computed per tool call, rather than per final answer, is the step-level supervision that agent training converged on in 2024 and 2025, and this claim puts a July 7, 2023 priority date on it, which is earlier than most of that work. ReAct (arXiv 2210.03629) and Toolformer (arXiv 2302.04761) were public before July 2023, but neither trained a separate learned reward model to grade each call against the goal, so the obviousness question is whether putting a reward model on the intermediate action was a predictable combination, and anyone training agents with step-level rewards on tool use should get an opinion on that question rather than assume the answer. The continuation filed in June 2026 means Google is keeping the family open and can draft further claims to whatever the agent market ships next. The claim 9 penalty on the number of tool calls is the kind of narrow, engineering-specific limitation that tends to survive both eligibility and prior art, and a defensive filing in this area should claim its own reward design at that level of detail.
2026-10-06 In-House

The patent budget is defended at the abandonment review, not at the filing decision

Practice note, Burbage Law, PC, October 6, 2026

Most in-house programs have a filing committee and almost none have an abandonment committee, which is backwards, because the filing decision commits a small fraction of what a patent family will eventually cost. The rest is committed later, one decision at a time: the foreign filing decision at twelve months, the national phase decision at thirty months, the decision to answer each office action rather than let the application go, the issue fee and the continuation that goes with it, and the maintenance fees and foreign annuities that run for the life of the patent. In most programs those later decisions are made by default, by a docketing system that generates a reminder and a paralegal who pays the fee, so the budget fills with payments nobody chose to make on applications nobody has reread since they were filed. The programs that hold their budgets treat each of those dates as a decision with an owner, and the question asked at each one is the same: do the claims as they now stand read on something we ship, something a competitor ships, or something still on the roadmap. In two decades of prosecuting for companies from startups to Google and Toyota, the single change that did the most for a budget was reversing the default, so that at each date the application is abandoned unless someone states on the record why it should be paid for.

What it changesFor an artificial intelligence program the review matters more than elsewhere because the technology turns over faster than the patent process runs: an application drafted to a 2022 training method reaches its first office action after the team has moved on, and its foreign filing deadline arrives before anyone knows whether the feature survived. Put the three expensive dates, foreign filing, national phase and the response to the first office action, on the roadmap owner's calendar rather than the attorney's alone, and require a one-paragraph written reason to proceed, naming the product or competitor the claims read on. Keep continuations only in families still mapped to the roadmap, and let the rest issue or lapse. When the budget is challenged, the list of what the program chose not to pay for, with the reasons, is a better defense than the count of what it filed, because it shows the spending is being managed rather than accumulated.

Search every entry, back to 2021 →

These summaries are general information about published decisions, agency guidance and legislation. They are not legal advice and do not create an attorney-client relationship. Items concerning offices outside the United States are reported for information only and are not counsel on the law of those countries. Whether any of this applies to a particular application depends on facts not described here.