Broadcast Product: Redefining Shape-aligned Element-wise Multiplication and Beyond
Not on the map. Why?
Abstract (arXiv)
Broadcast operations are widely used in scientific computing libraries, yet their mathematical formulation is often implicit and inconsistently represented in machine learning literature. This problem frequently leads to invalid equations when element-wise products are written despite mismatched tensor shapes. In this paper, we formalize such operations by introducing the broadcast product boxdot, which explicitly extends the Hadamard product through shape-aligned element duplication. We provide a rigorous definition of the broadcast product, analyze its algebraic properties, and show how it can be expressed using standard linear algebra. Building on this framework, we formulate least-squares problems and sketch a proof-of-concept broadcast decomposition. As a preliminary illustration, we show that the formalism enables a new family of decompositions with distinct structural properties from conventional tensor decompositions. This work establishes a mathematical foundation for broadcast-aware tensor operations, connecting practical implementations with rigorous tensor analysis.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 48 references that are in the map. First posted on arXiv 26 Sep 2024.
Builds on
17 of 48 references.
References · 17
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2016Layer Normalizationcited by 5,579
- 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,286
- 2017Arbitrary Style Transfer in Real-time with Adaptive Instance Normalizationcited by 1,998
- 2018Group Normalizationcited by 1,514
- 2016Instance Normalization: The Missing Ingredient for Fast Stylizationcited by 1,187
- 2022DynIBaR: Neural Dynamic Image-Based Renderingcited by 224
- 2020Real-Time High-Resolution Background Mattingcited by 172
- 2016TensorLy: Tensor Learning in Pythoncited by 104
- 2015Exact tensor completion using t-SVDcited by 70
- 2022Formal Algorithms for Transformerscited by 70
- 2014Novel methods for multilinear data completion and de-noising based on tensor-SVDcited by 56
5 more
- 2017Tensor Networks for Dimensionality Reduction and Large-Scale Optimizations. Part 2 Applications and Future Perspectivescited by 53
- 2023Alternating Local Enumeration (TnALE): Solving Tensor Network Structure Search with Fewer Evaluationscited by 12
- 2021Named Tensor Notationcited by 11
- 2024An introduction to graphical tensor notation for mechanistic interpretabilitycited by 7
- 2023Efficient ConvBN Blocks for Transfer Learning and Beyondcited by 2
Built on by
Citing papers per year: 2024: 1.
1 paper.