Patents by Inventor Juergen Bross

Juergen Bross has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 12675406
    Abstract: One or more systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to caching key-value vectors for fixed prefixes according to a caching policy. A system can comprise a memory that can store computer-executable components. The system can further comprise a processor that can execute the computer-executable components stored in the memory, wherein the computer-executable components can comprise an accessing component that can access a request comprising a fixed prefix and variable data. The system can further comprise a storage component that can selectively store in a cache, one or more key-value vectors generated via processing of the fixed prefix by a large language model (LLM), based on a temporal moving average of the fixed prefix being greater than a first defined threshold, according to a smart encoding policy.
    Type: Grant
    Filed: March 18, 2024
    Date of Patent: July 7, 2026
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Haode Qi, Gengyu Wang, Juergen Bross, Ladislav Kunc, Nicholas James Hill
  • Publication number: 20250384243
    Abstract: Embodiments of the invention provide a computer-implemented method that includes executing, using a generative language model, generative language model operations operable to generate an output sequence responsive to an original input sequence. The generative language model operations include token pruning operations that include performing a base set of token pruning operations on intermediate versions of the original input sequence; and performing token pruning (TP) constraint evaluations. The base set of token pruning operations identify pruning candidate tokens in the intermediate versions of the original input sequence. The TP constraint evaluations determine that at least one of the pruning candidate tokens will be pruned from an associated intermediate version of the original input sequence.
    Type: Application
    Filed: June 13, 2024
    Publication date: December 18, 2025
    Inventors: Haode Qi, Cheng Qian, Gengyu Wang, Sneha Srinivasan, Pratyush Singh, Ladislav Kunc, Juergen Bross, Jian Ni, Radu Florian
  • Publication number: 20250291722
    Abstract: One or more systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to caching key-value vectors for fixed prefixes according to a caching policy. A system can comprise a memory that can store computer-executable components. The system can further comprise a processor that can execute the computer-executable components stored in the memory, wherein the computer-executable components can comprise an accessing component that can access a request comprising a fixed prefix and variable data. The system can further comprise a storage component that can selectively store in a cache, one or more key-value vectors generated via processing of the fixed prefix by a large language model (LLM), based on a temporal moving average of the fixed prefix being greater than a first defined threshold, according to a smart encoding policy.
    Type: Application
    Filed: March 18, 2024
    Publication date: September 18, 2025
    Inventors: Haode Qi, Gengyu Wang, Juergen Bross, Ladislav Kunc, Nicholas James Hill