数値パフォーマンス向上のための NumPy の 3 つの技

**

# Introduction

The Python scientific computing and machine learning ecosystem relies heavily on NumPy. It acts as the performance engine behind libraries like Pandas, Scikit-Learn, SciPy, and PyTorch. NumPy's speed comes from its underlying implementation in optimized C, where contiguous blocks of memory are manipulated without the overhead of Python's object model and dynamic interpreter.

Unfortunately, many data scientists and developers write NumPy code that fails to leverage this power. By carrying over standard Python loops or writing naive calculations that force unnecessary memory allocations and array copies, performance bottlenecks are suffered. When working with large datasets, these inefficiencies lead to bloated RAM usage, cache misses, and slow execution times. To write high-performance numerical code, you must understand how NumPy manages computation, memory allocation, and data layouts under the hood.

In this article, we will cover three essential NumPy tricks to optimize your code:

• vectorization and broadcasting

• in-place operations using the out parameter

• leveraging memory views instead of copies

# 1. Vectorization & Broadcasting Over Explicit Loops

Explicit Python for loops are the greatest speed killer in numerical computing. Iterating over a data structure element-by-element forces the Python interpreter to perform type checking and method lookups at every single step.

A common pitfall is using np.vectorize. Many developers assume that wrapping a standard Python function with np.vectorize converts it into optimized C code. In reality, np.vectorize is merely a convenience wrapper that runs a slow, standard Python loop behind a cleaner API, providing zero performance benefits.

To optimize, you must write code using native universal functions (ufuncs) and broadcasting. Broadcasting allows NumPy to perform operations on arrays of different shapes without copying data, processing operations directly in compiled C.

This naive approach iterates through a 2D array row-by-row and column-by-column to perform column-wise standardization (subtracting the column mean and dividing by the column standard deviation):

import numpy as np
import time

# Create a sample matrix (50000 rows, 1000 columns)
matrix = np.random.rand(50000, 1000)

start_time = time.time()

# Naive loop-based column normalization
res = matrix.copy()
for col in range(matrix.shape[1]):
    col_mean = np.mean(matrix[:, col])
    col_std = np.std(matrix[:, col])
    for row in range(matrix.shape[0]):
        res[row, col] = (matrix[row, col] - col_mean) / col_std

duration_loop = time.time() - start_time

print(f"Nested loop processed matrix in: {duration_loop:.4f} seconds")

Output:

Nested loop processed matrix in: 10.9986 seconds

Instead of looping, we compute the mean and standard deviation along the vertical axis (axis=0). NumPy automatically aligns these 1D summary statistics with the 2D matrix rows using broadcasting:

import numpy as np
import time

# Create a sample matrix (50000 rows, 1000 columns)
matrix = np.random.rand(50000, 1000)

start_time = time.time()

# Compute means and standard deviations along axis 0 in compiled C
means = np.mean(matrix, axis=0)
stds = np.std(matrix, axis=0)

# Let broadcasting automatically expand the shapes and compute in one line
res_vectorized = (matrix - means) / stds

duration_vectorized = time.time() - start_time
print(f"Vectorized broadcasting processed matrix in: {duration_vectorized:.4f} seconds")

Output:

Vectorized broadcasting processed matrix in: 0.1972 seconds

That's a ~56x speedup!

In the vectorized implementation, the operations matrix - means and the subsequent division by stds are executed using NumPy's broadcasting rules. Because matrix has shape (50000, 1000) and means has shape (1000,), NumPy conceptually stretches the means array to match the shape of the matrix. Under the hood, this expansion happens instantly in memory without duplicating data, and the calculations are pushed down to SIMD (Single Instruction, Multiple Data) CPU instructions, yielding a massive 50x+ speedup.

# 2. In-place Operations & the out Parameter

When you write expressions like y = 2 * x + 3, you might expect it to run efficiently. However, under the hood, NumPy evaluates this expression step-by-step:

• It allocates a temporary array in memory to store the result of 2 * x
• It allocates another array to store the result of adding 3 to the temporary array
• It finally binds this second temporary array to the variable name y

When working with very large arrays (e.g. millions of entries), allocating and garbage-collecting these temporary intermediate arrays creates substantial overhead. It thrashes the CPU caches and saturates memory bus bandwidth.

We can prevent this overhead by performing in-place calculations using operators like *= and +=, or by utilizing the out parameter built into almost all NumPy universal functions.

This naive method performs a basic linear scaling on a massive array, causing multiple temporary allocations:

import numpy as np
import time

# Create a large 1D array of 10 million elements
x = np.random.rand(10000000)
scale = 2.5
offset = 1.2

start_time = time.time()

# Standard chained math creates temporary intermediate arrays
y_naive = scale * x + offset

duration_naive = time.time() - start_time
print(f"Chained expression executed in: {duration_naive:.4f} seconds")

Output:

Chained expression executed in: 0.0393 seconds

Here, we pre-allocate the target output array once, and reuse its buffer for all subsequent mathematical operations, bypassing temporary allocations:

import numpy as np
import time

# Create a large 1D array of 10 million elements
x = np.random.rand(10000000)
scale = 2.5
offset = 1.2

start_time = time.time()

# Pre-allocate the final array
y_optimized = np.empty_like(x)

# Perform math directly into the target buffer without intermediate variables
np.multiply(x, scale, out=y_optimized)
np.add(y_optimized, offset, out=y_optimized)

duration_optimized = time.time() - start_time

print(f"Optimized in-place expression executed in: {duration_optimized:.4f} seconds")
print(f"Speedup: {duration_naive / duration_optimized:.2f}x faster!")

Output:

Optimized in-place expression executed in: 0.0133 seconds

In the optimized example, we use np.multiply(x, scale, out=y_optimized) to write the result of the multiplication directly into our pre-allocated y_optimized array. Then, np.add(y_optimized, offset, out=y_optimized) adds the offset and writes the result back into the same buffer. This completely avoids allocating and garbage-collecting temporary buffers, saving system memory, keeping data in the CPU cache, and boosting execution speed.

# 3. Memory Views vs. Memory Copies (Slicing vs. Advanced Indexing)

Understanding when NumPy returns a *view* of an array versus a *copy* is one of the most critical topics in numerical programming:

• A view is a new array object that points to the exact same underlying data buffer as the original array. Creating a view is a zero-copy operation that runs in $O(1)$ constant time and space.

• A copy allocates a brand-new data buffer and duplicates the data. This runs in $O(N)$ linear time and space.

Basic slicing (using start, stop, and step indices, e.g. arr[0:10:2]) always returns a view. In contrast, advanced indexing (using lists of indices or boolean masks, e.g. arr[[0, 2, 4]]) always returns a copy.

If you only need to read or update sub-segments of an array, using advanced indexing triggers massive, unnecessary memory allocations.

Here, we attempt to sub-sample a massive 2D matrix (every second row and column) by passing lists of indices. This forces NumPy to allocate a large new array and copy all the elements:

import numpy as np
import time

# Create a matrix of 10,000 x 10,000 elements
matrix = np.random.rand(10000, 10000)

start_time = time.time()

# Advanced indexing using integer arrays forces a physical copy of data
rows = np.arange(0, matrix.shape[0], 2)
cols = np.arange(0, matrix.shape[1], 2)
sub_matrix_copy = matrix[rows[:, None], cols]

duration_copy = time.time() - start_time
print(f"Advanced indexing copy completed in: {duration_copy:.4f} seconds")

Output:

Advanced indexing copy completed in: 0.1575 seconds

Now let's perform the same operation, but use basic slicing. Instead of copying data, NumPy adjusts the stride metadata to point to the same buffer instantly:

import numpy as np
import time

# Create a matrix of 10,000 x 10,000 elements
matrix = np.random.rand(10000, 10000)

start_time = time.time()

# Basic slicing returns a zero-copy view instantly
sub_matrix_view = matrix[::2, ::2]

duration_view = time.time() - start_time
print(f"Basic slicing view completed in: {duration_view:.8f} seconds")

Output:

Basic slicing view completed in: 0.00001001 seconds

When you slice an array using matrix[::2, ::2], NumPy does not touch the underlying data buffer. It simply creates a new array header with modified metadata: a different shape and new *strides* (the number of bytes to step in each dimension to find the next element). This operation runs in less than a microsecond, regardless of how large the matrix is.

However, be aware of the trade-off: because the view shares the same memory buffer, mutating sub_matrix_view will modify the original matrix as well. If you must avoid modifying the original array, you must explicitly call .copy().

# Wrapping Up

Writing clean, performant NumPy code requires changing how you think about loops, memory allocations, and data structures. By avoiding standard Python concepts in favor of native NumPy mechanics, you can eliminate computational bottlenecks.

To recap:

• Ditch Python loops and np.vectorize and let vectorized broadcasting push calculations down to optimized C
• Use in-place operations and the out parameter to bypass the allocator, preventing cache thrashing and reducing RAM usage
• Master views vs. copies to leverage instant, zero-copy slicing instead of expensive advanced indexing copies

Integrating these three performance design patterns will keep your data processing pipelines lean, fast, and scalable for production workloads.

Matthew Mayo** (@mattmayo13) holds a master's degree in computer science and a graduate diploma in data mining. As managing editor of KDnuggets & Statology, and contributing editor at Machine Learning Mastery, Matthew aims to make complex data science concepts accessible. His professional interests include natural language processing, language models, machine learning algorithms, and exploring emerging AI. He is driven by a mission to democratize knowledge in the data science community. Matthew has been coding since he was 6 years old.