Paul-Philipp Manea
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Paul-Philipp Manea has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Chirag Sudarshan
PGI-14, Forschungszentrum Jülich, Jülich, Germany
2 shared publications- Chirag Sudarshan
Forschungszentrum Jülich GmbH Peter Grünberg Institute 14 Jülich Germany
2 shared publications - Jan Finkbeiner
RWTH Aachen University, Aachen, Germany
2 shared publications John Paul Strachan
PGI-14, Forschungszentrum Jülich, Jülich, Germany
2 shared publications- John Paul Strachan
Peter Grünberg Institute (PGI-14), Forschungszentrum Jülich GmbH, Jülich, Germany
2 shared publications - Nathan Leroux
PGI-15, Forschungszentrum Jülich, Jülich, Germany
2 shared publications
Latest Publications
- Open Access
- 1 March 2026
- Published by Wiley in Advanced Intelligent Systems
- Vol. 8 (5)
A Flexible and Energy‐Efficient Compute‐in‐Memory Accelerator for Kolmogorov–Arnold Networks
Emerging Kolmogorov–Arnold networks (KANs) replace the linear weights of neural networks with trainable nonlinear functions. This modification is particularly attractive for scientific computing, where KANs can match the accuracy of conventional multilayer perceptrons (MLPs) while reducing model size by up to 100×. However, this efficiency comes at the cost of computationally expensive nonlinear evaluations, unlike conventional MLPs dominated by linear matrix multiplications. We present a flexible and energy‐efficient compute‐in‐memory accelerator tailored for KANs, developed through cross‐layer optimization across algorithm, architecture, circuit, and device levels. The accelerator computes arbitrary nonlinear functions using a single‐read scheme and read‐optimized memory arrays with nonvolatile memristive devices. Our system achieves a lowest energy of 8.69 pJ per KAN function. In terms of energy‐delay product, it provides 1996× improvement over CPUs, 208× over standard MLP‐oriented compute‐in‐memory accelerators, and up to 71× over prior KAN accelerators. These results establish energy‐efficient hardware primitives for implementing advanced nonlinear networks in scientific computing.
- 1 March 2026
- Published by Wiley in Advanced Intelligent Systems
- Vol. 8 (5)
Open AccessA Flexible and Energy‐Efficient Compute‐in‐Memory Accelerator for Kolmogorov–Arnold Networks
Emerging Kolmogorov–Arnold networks (KANs) replace the linear weights of neural networks with trainable nonlinear functions. This modification is particularly attractive for scientific computing, where KANs can match the accuracy of conventional multilayer perceptrons (MLPs) while reducing model size by up to 100×. However, this efficiency comes at the cost of computationally expensive nonlinear evaluations, unlike conventional MLPs dominated by linear matrix multiplications. We present a flexible and energy‐efficient compute‐in‐memory accelerator tailored for KANs, developed through cross‐layer optimization across algorithm, architecture, circuit, and device levels. The accelerator computes arbitrary nonlinear functions using a single‐read scheme and read‐optimized memory arrays with nonvolatile memristive devices. Our system achieves a lowest energy of 8.69 pJ per KAN function. In terms of energy‐delay product, it provides 1996× improvement over CPUs, 208× over standard MLP‐oriented compute‐in‐memory accelerators, and up to 71× over prior KAN accelerators. These results establish energy‐efficient hardware primitives for implementing advanced nonlinear networks in scientific computing.
- Top Cited PapersOpen Access
- 8 September 2025
- Published by Springer Nature in Nature Computational Science
- Vol. 5 (9) , 813-824
Analog in-memory computing attention mechanism for fast and energy-efficient large language models
Transformer networks, driven by self-attention, are central to large language models. In generative transformers, self-attention uses cache memory to store token projections, avoiding recomputation at each time step. However, graphics processing unit (GPU)-stored projections must be loaded into static random-access memory for each new generation step, causing latency and energy bottlenecks. Here we present a custom self-attention in-memory computing architecture based on emerging charge-based memories called gain cells, which can be efficiently written to store new tokens during sequence generation and enable parallel analog dot-product computation required for self-attention. However, the analog gain-cell circuits introduce non-idealities and constraints preventing the direct mapping of pre-trained models. To circumvent this problem, we design an initialization algorithm achieving text-processing performance comparable to GPT-2 without training from scratch. Our architecture reduces attention latency and energy consumption by up to two and four orders of magnitude, respectively, compared with GPUs, marking a substantial step toward ultrafast, low-power generative transformers.
- 8 September 2025
- Published by Springer Nature in Nature Computational Science
- Vol. 5 (9) , 813-824
Top Cited PapersOpen AccessAnalog in-memory computing attention mechanism for fast and energy-efficient large language models
Transformer networks, driven by self-attention, are central to large language models. In generative transformers, self-attention uses cache memory to store token projections, avoiding recomputation at each time step. However, graphics processing unit (GPU)-stored projections must be loaded into static random-access memory for each new generation step, causing latency and energy bottlenecks. Here we present a custom self-attention in-memory computing architecture based on emerging charge-based memories called gain cells, which can be efficiently written to store new tokens during sequence generation and enable parallel analog dot-product computation required for self-attention. However, the analog gain-cell circuits introduce non-idealities and constraints preventing the direct mapping of pre-trained models. To circumvent this problem, we design an initialization algorithm achieving text-processing performance comparable to GPT-2 without training from scratch. Our architecture reduces attention latency and energy consumption by up to two and four orders of magnitude, respectively, compared with GPUs, marking a substantial step toward ultrafast, low-power generative transformers.
- Open Access
- 9 December 2024
- Published by Springer Nature in Research Square
Analog In-Memory Computing Attention Mechanism for Fast and Energy-Efficient Large Language Models
Transformer networks, driven by self-attention, are central to Large Language Models. In generative Transformers, self-attention uses cache memory to store token projections, avoiding recomputation at each time step. However, GPU-stored projections must be loaded into SRAM for each new generation step, causing latency and energy bottlenecks. We present a custom self-attention in-memory computing architecture based on emerging charge-based memories called gain cells, which can be efficiently written to store new tokens during sequence generation and enable parallel analog dot-product computation required for self-attention. However, the analog gain cell circuits introduce non-idealities and constraints preventing the direct mapping of pre-trained models. To circumvent this problem, we design an initialization algorithm achieving text processing performance comparable to GPT-2 without training from scratch. Our architecture respectively reduces attention latency and energy consumption by up to two and five orders of magnitude compared to GPUs, marking a significant step toward ultra-fast, low-power generative Transformers.
- 9 December 2024
- Published by Springer Nature in Research Square
Open AccessAnalog In-Memory Computing Attention Mechanism for Fast and Energy-Efficient Large Language Models
Transformer networks, driven by self-attention, are central to Large Language Models. In generative Transformers, self-attention uses cache memory to store token projections, avoiding recomputation at each time step. However, GPU-stored projections must be loaded into SRAM for each new generation step, causing latency and energy bottlenecks. We present a custom self-attention in-memory computing architecture based on emerging charge-based memories called gain cells, which can be efficiently written to store new tokens during sequence generation and enable parallel analog dot-product computation required for self-attention. However, the analog gain cell circuits introduce non-idealities and constraints preventing the direct mapping of pre-trained models. To circumvent this problem, we design an initialization algorithm achieving text processing performance comparable to GPT-2 without training from scratch. Our architecture respectively reduces attention latency and energy consumption by up to two and five orders of magnitude compared to GPUs, marking a significant step toward ultra-fast, low-power generative Transformers.
- Open Access
- 18 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Non-idealities and Design Solutions for Analog Memristor-Based Content-Addressable Memories
Memristor-based analog Content Addressable Memories (aCAMs) offer robust parallel pattern look-up capabilities, significantly enhancing the scope of In-Memory Computing applications. This paper presents challenges of these analog circuits, which may occur during the inference, and proposes solutions to overcome them. Precisely, we investigate the impact of temperature-dependent behavior, CMOS process variations and memristor telegraph read noise. We demonstrate that one challenging issue affecting memristors analog computing applications, namely telegraph read noise, is not a significant problem in aCAM. We introduce a framework that accounts for these combined distortions to define variability-aware aCAM windows and estimate the bit resolution of a CAM cell. Using this framework we estimate the bit resolution to 2 bits before applying compensating measures and to 4 bits afterwards. We study how variations affect the inference accuracy of the IRIS classification dataset using our novel torchCAM model. We introduce a streamlined aCAM design featuring a memristor comparator for simplified input-to-reference comparison and a novel cell architecture with two symmetrical memristor comparator units.
- 18 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessNon-idealities and Design Solutions for Analog Memristor-Based Content-Addressable Memories
Memristor-based analog Content Addressable Memories (aCAMs) offer robust parallel pattern look-up capabilities, significantly enhancing the scope of In-Memory Computing applications. This paper presents challenges of these analog circuits, which may occur during the inference, and proposes solutions to overcome them. Precisely, we investigate the impact of temperature-dependent behavior, CMOS process variations and memristor telegraph read noise. We demonstrate that one challenging issue affecting memristors analog computing applications, namely telegraph read noise, is not a significant problem in aCAM. We introduce a framework that accounts for these combined distortions to define variability-aware aCAM windows and estimate the bit resolution of a CAM cell. Using this framework we estimate the bit resolution to 2 bits before applying compensating measures and to 4 bits afterwards. We study how variations affect the inference accuracy of the IRIS classification dataset using our novel torchCAM model. We introduce a streamlined aCAM design featuring a memristor comparator for simplified input-to-reference comparison and a novel cell architecture with two symmetrical memristor comparator units.