Book a demo

Sparse MoE Routing Patents: Top Companies & Filing Trends 2026

Sparse MoE Routing Patents: Top Companies & Filing Trends 2026
https://www.patsnap.com/resources/blog/rd-blog/foundation-models-sparse-moe-routing-patent-landscape-patent-landscape/ · Patsnap · data cut-off 2026-07-31 · downloaded from the live page
Patent Landscape · Artificial Intelligence & Machine Learning
Sparse MoE Routing Patents: Who Leads and Where the Claim Space Is Still Open
  • 56.1% of all 619 records sit with just five assignees, with one leader alone holding 143 filings.
  • +2767% filing growth from 2021 (3 filings) to 2024 (86 filings), the most recent year that can be read as complete.
  • Filings span eight IPC subclasses from core AI computing (G06N, 34.2%) into healthcare informatics and body-fluid devices — routing logic is migrating into domain-specific hardware.
Get a prior-art report on your approach
619
Published Records
56%
Top-5 Share of All Records
+2767%
Filing Growth 2021→2024
US
Leading Jurisdiction

Filing growth compares 2021 (3 records) with 2024 (86) — a three-year span. 2024 is the most recent year we treat as complete: publication lags filing by roughly 18 months, so 2025 onwards are still filling in and any growth rate that ends there would understate the field. Top-5 share is the combined record count of the five largest assignees divided by all 619 records in scope (CR5), not by the ranked leaders only.

Published byPatsnap Research··7 min readSourced from Patsnap Eureka
Overview

What the sparse MoE routing filing record shows

Sparse mixture-of-experts routing sits at the centre of how foundation models scale compute without scaling cost proportionally. The 619 records in scope span 2015 through the mid-2026 cut-off, but the shape of the field only becomes visible after 2021: filings grew from 3 in 2021 to 86 in 2024, a run documented in this dataset at +2767% over that three-year span. That is a field moving from research curiosity to contested claim territory in the space of three filing years.

Because publication trails filing by roughly 18 months, the 2025 and 2026 figures in the trend chart are still filling in and should not be read as a slowdown. The concentration figures are the more durable signal: 56.1% of all 619 records belong to five assignees, and 68.7% belong to ten. That is a field with a defined set of incumbents rather than one still being staked out by newcomers.

Filing trend, 2017-2026
  1. 1INTEL CORP143
  2. 2SILVEBROOK KIA100
  3. 3DATADOSE LLC60
  4. 4INTERDIGITAL VC HOLDINGS INC23
  5. 5STRONG FORCE VCN PORTFOLIO 2019 LLC21
  6. 6MICROSOFT TECHNOLOGY LICENSING LLC21
  7. 7STRONG FORCE TX PORTFOLIO 2018 LLC19
  8. 8FIGURE AI INC13
  9. 9INNATERA NANOSYSTEMS BV13
  10. 10SENSORMATIC ELECTRONICS CORP12
Source: Patsnap Eureka. Assignee ranking and totals. Derived from a Patsnap search on Foundation Models: Sparse MoE Routing Patent Landscape covering 2015–2026, data cut-off 2026-07-31. Counts reflect published records only and shift as new filings publish.Run this in Eureka MCP

Let an AI agent run this analysis on your own technology

Pick a task. Every answer cites the patents behind it.

10,000 free credits to start
The data

Filing trend and technology composition

Two views of the same 619 records: how filing activity moved year over year, and which IPC subclasses the claims actually sit in.

Filings accelerated sharply after 2021

From a single filing in 2017, activity stayed low through 2020 before climbing to 3 in 2021 and 86 in 2024 — the +2767% span the hero figure reflects. 2025 shows 380 filings and 2026 shows 23 so far, but both years are still incomplete in the publication record and should be read as provisional rather than as a peak.

Filings accelerated sharply after 202101002003004001201720182019202020212022202320243802025232026Most recent year is partial — publication lag means later filings are not yet visible.

Routing claims cluster in core AI computing but reach into hardware domains

G06F (electric digital data processing) covers 38.0% of the 619 records and G06N (AI-model computing) covers 34.2%, the expected core for routing logic. But G16H (healthcare informatics, 10.3%) and A61M (body-fluid devices, 9.5%) both appear at meaningful share, showing sparse routing architectures being claimed inside domain-specific medical and imaging hardware rather than staying confined to general-purpose compute.

Routing claims cluster in core AI computing but reach into hardware domainsG06F · Electric digital data processi…23538.0%G06N · Computing based on AI models21234.2%G06T · Image data processing & genera…12720.5%G16H · Healthcare informatics6410.3%A61M · Devices for body fluids599.5%H04N · Pictorial communication (video…426.8%G06V · Image/video recognition416.6%G06Q · Business, commerce & admin dat…376.0%Other28245.6%

Shares are the percentage of the 619 records in scope. A patent can carry several IPC classes, so the shares add up to more than 100%.

Source: Patsnap Eureka. Filing trend and technology composition. Derived from a Patsnap search on Foundation Models: Sparse MoE Routing Patent Landscape covering 2015–2026, data cut-off 2026-07-31. Counts reflect published records only and shift as new filings publish.

Go deeper on Foundation Models: Sparse MoE Routing Patent Landscape with Eureka

This page is one run against one query. Ask Eureka your own question about foundation models: sparse moe routing patent landscape and every answer comes back with the patent numbers behind it.

Try Eureka
Key patents

A representative filing and the most-cited prior art

Representative filing
US20240086719A12024-03-14

Sparse encoding and decoding at mixture-of-experts layer

MICROSOFT TECHNOLOGY LICENSING, LLC

A computing system executes a Mixture-of-Experts (MoE) layer by receiving an input tensor of input tokens, computing a gating function output vector from that tensor, and computing a sparse encoding of the tensor and gating output. The sparse encoding identifies one or more destination expert sub-models. The system dispatches the input tensor to those destination experts for processing and computes an expert output in response.Filed by Microsoft Technology Licensing, published 2024-03-14. This is the clearest single claim in the dataset to the routing step itself — the gating computation plus sparse-encoding dispatch — rather than to a downstream application of MoE.

US20240086719A1 — patent drawing 1US20240086719A1 — patent drawing 2
View full filing
Most-cited records in this search
#Publication no.Patent titleCitations
1US20200067861A1SCAM evaluation system475
2US20140310243A1Heart beacon cycle337
3US20250259085A1Convergent Intelligence Fabric for Multi-Domain Orchestration of Distributed Agents with Hierarchical Memory …213
4WO2021220008A1Image compression and decoding, video compression and decoding: methods and systems97
5WO2024155584A1Systems, methods, devices, and platforms for industrial internet of things95
6US20230154055A1Image compression and decoding, video compression and decoding: methods and systems78
7US20260046317A1AI-Optimized Memory Fabric for Large Contexts and Multimodal Workloads67
8US20130135008A1Method and system for a run-time reconfigurable computer architecture67
9WO2024226801A2Systems, methods, kits, and apparatuses for generative artificial intelligence, graphical neural networks, tr…66
10US20250259041A1Ai agent decision platform with deontic reasoning62

Citation counts favour older, earlier-filed documents inside this corpus — read them as a measure of influence on later filings, not as a signal of which patents matter most today.

Each row carries its publication number; clicking a row searches Eureka by that number.

Source: Patsnap Eureka. Citation counts and representative records. Derived from a Patsnap search on Foundation Models: Sparse MoE Routing Patent Landscape covering 2015–2026, data cut-off 2026-07-31. Counts reflect published records only and shift as new filings publish.Run this in Eureka MCP
Run it yourself

Put your own technology through the same analysis

 
Where to run it
Fastest

Eureka on the web

When you want the answer in the next five minutes.

The agent works the prompt against patents and technical literature, citing every source.

Run your analysis now →
For builders

MCP server & REST API

When it has to run inside your own pipeline.

Patent search, landscape analysis and assignee resolution as MCP tools. Drop them into any agent framework, or call REST directly.

Browse MCP servers →
Insights

What the numbers mean for a filing decision

Three read-throughs of the concentration, growth and classification figures above, aimed at where a new filing would actually land.

Concentration
56.1% of 619 records
held by five assignees

The core routing claim space is already staked out

Five assignees hold 347 of the 619 records in scope, with the leader alone accounting for 143. A new entrant filing on core gating-and-dispatch mechanics is filing into dense prior art held by a small number of parties, not into open ground.

Top 5 combined, 619-record base
Growth
+2767%
2021 to 2024 filings

The field only became a filing priority in the last three complete years

Filings sat at single digits through 2020 and only reached 3 in 2021. By 2024 that had grown to 86 — the sharpest sustained climb in the dataset. Anyone benchmarking against older MoE literature is comparing against a much thinner prior-art base than exists today.

2021 = 3 filings, 2024 = 86 filings
Classification
10.3% and 9.5%
G16H and A61M share of 619 records

Routing logic is leaking into domain hardware, not staying in general compute

G16H (healthcare informatics) and A61M (body-fluid devices) together touch roughly a fifth of the records, alongside the expected G06F/G06N core. That is a sign that sparse routing is being claimed as a component inside medical and sensing systems, a track separate from the foundation-model core.

Shares of the 619-record base; a record can carry multiple IPC classes
Eureka AI Agent
Looking for what nobody has claimed yet?

Eureka can read the same corpus for gaps instead of for coverage: under-claimed branches adjacent to foundation models: sparse moe routing patent landscape, with the prior art for and against each one.

Find the white space →
Source: Patsnap Eureka. Co-assignee relationships and derived observations. Derived from a Patsnap search on Foundation Models: Sparse MoE Routing Patent Landscape covering 2015–2026, data cut-off 2026-07-31. Counts reflect published records only and shift as new filings publish.Run this in Eureka MCP
Players

Who is filing, and where the activity is thinning out

The ranking behind this page covers 100 companies, counted in records — not a top-50 or top-100 filtered list, but the full set the data endpoint returns for this search.

Leader
143 records
single-assignee filings

One assignee holds close to a quarter of all records

The leading assignee's 143 filings sit well above the fifth-place figure of 21, meaning the gap between first and the rest of the leaderboard is wide rather than gradual.

Leader vs. fifth place: 143 vs. 21
Mid-table
12 records
tenth-place filings

The drop-off from top five to top ten is steep

Tenth place holds 12 records against the fifth-place figure of 21, and the top ten combined reach 68.7% of all 619 records. Past that point the ranking thins quickly into a long tail of smaller filers.

Top 10 combined: 425 of 619 records (68.7%)
Momentum
-85% YoY
one active filer's latest-year change

Even active recent filers are showing sharp swings, not steady growth

One of the more recently active assignees moved from a stronger prior year to 8 filings in the latest year, an 85% year-on-year drop. Several other assignees in the recent-momentum data show filings falling to zero. Read these latest-year figures cautiously given the 18-month publication lag.

Recent-year momentum by assignee
🔍
Under-claimed sub-areas worth checking before filing
Branches where the IPC composition and citation record suggest thinner coverage than the core routing claims
expert-capacity load balancing under hardware constraintscross-domain gating for multi-modal token routingsparse routing fault-tolerance and expert fallbackquantisation-aware expert dispatchrouting auditability and interpretability claims
Rank all filers by momentum →
Recent-year filing momentum by assignee
AssigneeRecent yearYoY
DATADOSE LLC8-85%
Microsoft Technology Licensing, LLC1
Innatera Nanosystems B.V.10%
Intel Corporation0-100%
SILVEBROOK KIA0-100%
Dipu Rende Technology0-100%
Strong Force VCN Portfolio 2019, LLC0-100%
STRONG FORCE TX PORTFOLIO 2018 LLC0-100%
Source: Patsnap Eureka. Assignee-level momentum. Derived from a Patsnap search on Foundation Models: Sparse MoE Routing Patent Landscape covering 2015–2026, data cut-off 2026-07-31. Counts reflect published records only and shift as new filings publish.Run this in Eureka MCP
What's next

Where to take this next

The figures above describe the field as filed. Turning that into a filing or freedom-to-operate decision means going claim by claim.

Map your own architecture against the leader's claim set

With 143 records from a single assignee, a new gating-and-dispatch filing needs a clause-level comparison against that portfolio before drafting, not just a keyword search.

Run a claim comparison in Eureka

Check the under-claimed branches before committing scope

Fault-tolerant routing and cross-modal gating show thinner coverage in this dataset than core dispatch mechanics — worth confirming with a fresh search before scoping a new application.

Explore white space in Eureka
Source: Patsnap Eureka. Forward-looking reading of the same dataset. Derived from a Patsnap search on Foundation Models: Sparse MoE Routing Patent Landscape covering 2015–2026, data cut-off 2026-07-31. Counts reflect published records only and shift as new filings publish.Run this in Eureka MCP
FAQ

Common questions about sparse MoE routing patents

Answers are grounded in the same dataset. Derived from a Patsnap search on Foundation Models: Sparse MoE Routing Patent Landscape covering 2015–2026, data cut-off 2026-07-31. Counts reflect published records only and shift as new filings publish.Run this in Eureka MCP

Research Foundation Models: Sparse MoE Routing Patent Landscape in depth with Eureka

Go past this page: query the whole foundation models: sparse moe routing patent landscape corpus yourself, in your own scope.
Every answer comes back with patent numbers you can open.

Try Eureka

Disclaimer. This page is generated from Patsnap Eureka data drawn from a limited snapshot of global patent and scientific-literature records, and is provided for general information and reference only.

Patent data carries inherent limitations: recent filings (typically the most recent 18–24 months) are under-counted due to standard publication lag; counts may be reported at either a patent-family or a patent-record basis and are not always directly comparable; classification, applicant-name, and citation data may contain errors, duplicates, or omissions; and the underlying search query defines and constrains the scope shown. As a result, the analysis may be incomplete or inaccurate and may not reflect the full technology landscape.

Nothing on this page constitutes an exhaustive prior-art, novelty, freedom-to-operate, or validity search, nor does it constitute legal, financial, investment, or professional advice, and it should not be relied upon as such. Any patent, commercial, or strategic decision should be verified independently and reviewed with qualified patent, legal, and domain professionals. Patsnap makes no warranties, express or implied, as to the accuracy, completeness, or fitness for any particular purpose of the information presented.

Machine translation. Assignee and organisation names originally recorded in Chinese, Japanese or Korean have been rendered into English by an AI translation step so that the tables stay readable. These renderings are best-effort and may not match a company’s registered English name; the original name is what the underlying patent record carries, and it is what any Eureka query launched from this page uses.

Help us improve this page

Found incorrect or outdated information? Let us know and we'll get it fixed.