IP Library › Granted Patent US 12,737,590
Granted Patent B2
US 12,737,590 · App. 18/533,830 · Granted Sep 15, 2026

Routing acceleration in mixture of experts ensembles

Inventors: Julian Röttger Büchel (Zürich, CH); Irem Boybat Kara (Adliswil, CH); Abbas Rahimi (Rüschlikon, CH); Athanasios Vasilopoulos (Kilchberg, CH); Manuel Le Gallo-Bourdeau (Horgen, CH); Abu Sebastian (Adliswil, CH)
Assignee: International Business Machines Corporation
G06N3/045
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,737,590
App. No.
18/533,830
Granted
Sep 15, 2026
Kind
B2
Abstract

According to one embodiment, a method, computer system, and computer program product for routing acceleration in mixture of experts ensembles is provided. The present invention may include receiving input data at a router; generating a plurality of output vectors by applying a routing function to the input data, wherein each output vector is associated with one or more respective tiles or pairs of tiles in a plurality of MVM tiles; determining a plurality of sub-vectors in the output vectors, wherein each sub-vector in the plurality of sub-vectors is associated with a respective output vector in the plurality of output vectors, and merging the sub-vectors into an element vector; generating a probability distribution vector by applying a Softmax function to the element vector and determining the largest elements of the probability distribution; and configuring the router based on the one or more largest elements of the probability distribution.

Claims (52)

1 . A computer-implemented method for routing acceleration in mixture of experts (MoE) ensembles, the method comprising:

receiving input data at a router, wherein the router comprises a plurality of matrix-vector-multiplier (MVM) tiles;

generating a plurality of output vectors by applying a routing function to the input data, wherein each output vector in the plurality of output vectors is associated with one or more respective tiles or pairs of tiles in the plurality of MVM tiles;

determining a plurality of sub-vectors in the plurality of output vectors, wherein each sub-vector in the plurality of sub-vectors is associated with a respective output vector in the plurality of output vectors, and merging the plurality of sub-vectors into an element vector;

generating a probability distribution vector by applying a Softmax function to the element vector and determining one or more largest elements of the probability distribution; and

configuring the router based on the one or more largest elements of the probability distribution,

wherein configuring the router further comprises:

initializing the router using pre-trained weights;

retraining the router using the one or more largest elements of the probability distribution for one or more epochs to produce updated weights; and

scaling the router using the updated weights.

2 . The method of claim 1 , wherein configuring the router further comprises:

determining a mean optimal scale of the router based on a mean of the one or more largest elements of the probability distribution and one or more approximated largest element values; and

scaling the router using the mean optimal scale.

3 . The method of claim 1 , wherein the plurality of MVM tiles may comprise one or more MVM tiles in a single-layer MVM.

4 . The method of claim 1 , wherein the plurality of MVM tiles may comprise one or more pairs of MVM tiles in a multi-layer MVM.

5 . The method of claim 1 , wherein the routing function is executed using analogue in-memory computing.

6 . The method of claim 1 , wherein applying the Softmax function, determining the plurality of sub-vectors in the plurality of output vectors, merging the plurality of sub-vectors into the element vector, and determining the one or more largest elements of the probability distribution are performed using a digital circuit.

7 . A computer system for routing acceleration in mixture of experts (MoE) ensembles, the computer system comprising:

one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage medium, and program instructions stored on at least one of the one or more tangible storage medium for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising:

receiving input data at a router, wherein the router comprises a plurality of matrix-vector-multiplier (MVM) tiles;

generating a plurality of output vectors by applying a routing function to the input data, wherein each output vector in the plurality of output vectors is associated with one or more respective tiles or pairs of tiles in the plurality of MVM tiles;

determining a plurality of sub-vectors in the plurality of output vectors, wherein each sub-vector in the plurality of sub-vectors is associated with a respective output vector in the plurality of output vectors, and merging the plurality of sub-vectors into an element vector,

generating a probability distribution vector by applying a Softmax function to the element vector and determining one or more largest elements of the probability distribution; and

configuring the router based on the one or more largest elements of the probability distribution,

wherein configuring the router further comprises:

initializing the router using pre-trained weights;

retraining the router using the one or more largest elements of the probability distribution for one or more epochs to produce updated weights; and

scaling the router using the updated weights.

8 . The computer system of claim 7 , wherein configuring the router further comprises:

determining a mean optimal scale of the router based on a mean of the one or more largest elements of the probability distribution and one or more approximated largest element values; and

scaling the router using the mean optimal scale.

9 . The computer system of claim 7 , wherein the plurality of MVM tiles may comprise one or more MVM tiles in a single-layer MVM.

10 . The computer system of claim 7 , wherein the plurality of MVM tiles may comprise one or more pairs of MVM tiles in a multi-layer MVM.

11 . The computer system of claim 7 , wherein the routing function is executed using analogue in-memory computing.

12 . The computer system of claim 7 , wherein applying the Softmax function, determining the plurality of sub-vectors in the plurality of output vectors, merging the plurality of sub-vectors into the element vector, and determining the one or more largest elements of the probability distribution are performed using a digital circuit.

13 . A computer program product for routing acceleration in mixture of experts ensembles (MoE), the computer program product comprising:

one or more computer-readable tangible storage medium and program instructions stored on at least one of the one or more tangible storage medium, the program instructions executable by a processor to cause the processor to perform a method comprising:

receiving input data at a router, wherein the router comprises a plurality of matrix-vector-multiplier (MVM) tiles;

generating a plurality of output vectors by applying a routing function to the input data, wherein each output vector in the plurality of output vectors is associated with one or more respective tiles or pairs of tiles in the plurality of MVM tiles;

determining a plurality of sub-vectors in the plurality of output vectors, wherein each sub-vector in the plurality of sub-vectors is associated with a respective output vector in the plurality of output vectors, and merging the plurality of sub-vectors into an element vector;

generating a probability distribution vector by applying a Softmax function to the element vector and determining one or more largest elements of the probability distribution; and

configuring the router based on the one or more largest elements of the probability distribution,

wherein configuring the router further comprises:

initializing the router using pre-trained weights;

retraining the router using the one or more largest elements of the probability distribution for one or more epochs to produce updated weights; and

scaling the router using the updated weights.

14 . The computer program product of claim 13 , wherein configuring the router further comprises:

determining a mean optimal scale of the router based on a mean of the one or more largest elements of the probability distribution and one or more approximated largest element values; and

scaling the router using the mean optimal scale.

15 . The computer program product of claim 13 , wherein the plurality of MVM tiles may comprise one or more MVM tiles in a single-layer MVM.

16 . The computer program product of claim 13 , wherein the plurality of MVM tiles may comprise one or more pairs of MVM tiles in a multi-layer MVM.

17 . The computer program product of claim 13 , wherein the routing function is executed using analogue in-memory computing and wherein applying the Softmax function, determining the plurality of sub-vectors in the plurality of output vectors, merging the plurality of sub-vectors into the element vector, and determining the one or more largest elements of the probability distribution are performed using a digital circuit.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 8, 2023
From: BÜCHEL, JULIAN RÖTTGER; BOYBAT KARA, IREM; RAHIMI, ABBAS; VASILOPOULOS, ATHANASIOS; LE GALLO-BOURDEAU, MANUEL; SEBASTIAN, ABU
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 065813/0564 →
Continuity (1)
Related Publication 20250190755A1 · Jun 12, 2025
References Cited (19)
US 12354002B1 · Weber · 2025 [cited by examiner]
US 12469318B2 · Yuan · 2025 [cited by examiner]
US 12541691B2 · Fukuda · 2026 [cited by examiner]
US 12603079B2 · Su · 2026 [cited by examiner]
US 20180046916A1 · Dally · 2018 [cited by examiner]
US 20190042538A1 · Koren · 2019 [cited by examiner]
US 20220253680A1 · Zhao · 2022 [cited by applicant]
US 20230281510A1 · Royer · 2023 [cited by examiner]
US 20240096121A1 · Yuan · 2024 [cited by examiner]
US 20240233703A1 · Su · 2024 [cited by examiner]
US 20240386256A1 · Thorp · 2024 [cited by examiner]
US 20250217641A1 · Mustafa · 2025 [cited by examiner]
Büchel, et al., “Function-Based Activation of Memory Tiers,” Application and Drawings, Filed on Sep. 13, 2022, 56 Pages, Related U.S. Appl. No. 17/943,256. [cited by applicant]
Chen, et al., “Learning to Screen for Fast Softmax Inference on Large Vocabulary Neural Networks,” CoRR, Oct. 29, 2018, 13 pages, arXiv:1810.12406v1, Retrieved from the Internet: <URL: https://arxiv.org/abs/1810.12406>. [cited by applicant]
Liang, et al., “M3ViT: Mixture-of-Experts Vision Transformer for Efficient Multi-task Learning with Model-Accelerator Co-design,” Advances in Neural Information Processing Systems, 2022, 17 pages, vol. 35, Retrieved fro… [cited by applicant]
Lu, et al., “NeuroSim Simulator for Compute-in-Memory Hardware Accelerator: Validation and Benchmark,” Frontiers in Artificial Intelligence, Jun. 2021, 10 pages, vol. 4, Article 659060, DOI: 0.3389/frai.2021.659060, Ret… [cited by applicant]
Sander, at al., “Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective,” Proceedings of the 40th International Conference on Machine Learning, 2023, 18 pages, vol. 202, Honolulu, HI, USA, Retrieved from t… [cited by applicant]
Shim, et al., “SVD-Softmax: Fast Softmax Approximation on Large Vocabulary Neural Networks,” Advances in Neural Information Processing Systems, 2017, 11 pages, vol. 30, Retrieved from the Internet: <URL: https://papers.… [cited by applicant]
Zhou, et al., “Mixture-of-Experts with Expert Choice Routing,” 36th Conference on Neural Information Processing Systems (NeurIPS 2022), Oct. 14, 2022, 14 pages, arXiv:2202.09368v2, Retrieved from the Internet: <URL: htt… [cited by applicant]