Tensors allow for negative indexing, which is a method used to select elements based on their relative distance from the end of an axis. For instance, using an index of $$-1$$ retrieves the final element along that particular dimension, while $$-2$$ retrieves the second-to-last element.

Claude

Like elements in standard Python lists, the individual elements within a tensor can be accessed using indexing. Tensor indexing is zero-based, meaning the first element along any given axis is located at index $$0$$. It is important to contrast this programmatic convention with formal linear algebra, where vectors typically utilize one-based indexing (starting at subscript $$1$$).

Tensor Indexing

Dive into Deep Learning

Negative Tensor Indexing

When a single index or slice is provided for a $$k^{	extrm{th}}$$-order tensor (where $$k > 1$$), the selection operation defaults to being applied along axis $$0$$. For example, applying the index [-1] to a matrix returns its last row, while the slice [1:3] returns its second and third rows.

Default Axis for Tensor Indexing

Specific elements or contiguous ranges within a tensor can be modified in-place by specifying their indices and assigning new values. By positioning indexing or slicing operations on the left-hand side of an assignment operator, data can be written directly to those specific locations within the tensor.

Learn Before

Related