Point-Approximate Matrix Multiplication (PAMM)

• PAMM is a research framework that approximates matrix products by ensuring per-entry or bilinear error bounds through pointwise guarantees.
• It leverages techniques like random projections, nonuniform sampling, and threshold screening to manage approximation accuracy at various granularities.
• PAMM distinguishes itself by merging operator-norm and entrywise methods, while contrasting with hierarchical blockwise approaches such as SpAMM.

Searching arXiv for recent and foundational papers relevant to approximate and pointwise matrix multiplication. Point-Approximate Matrix Multiplication (PAMM) denotes a family of approximate matrix multiplication formulations in which the objective is not merely to compress or sketch operands, but to approximate the product $C=AB$ with control that is meaningful at the level of specific output points, bilinear forms, or entrywise interactions. Across the literature, however, the term is not standardized. Some papers directly support a pointwise interpretation through entrywise additive or max-norm guarantees; others are better understood as PAMM-adjacent because they approximate the full product in operator or Frobenius norm, which then induces control on entries or bilinear queries. A second nearby line of work replaces pointwise screening by hierarchical blockwise screening in the $(i,j,k)$ product space, most prominently Sparse Approximate Matrix Multiply (SpAMM), which is closely related in spirit but differs in granularity (Magen et al., 2010, Challacombe et al., 2010, Artemov, 2019, Kowaluk et al., 20 Apr 2025).

1. Definitional scope and terminology

PAMM does not appear in the surveyed papers as a universally adopted formal label. The literature instead splits across several approximation notions.

One strand studies operator-norm approximate matrix multiplication for a fixed pair of matrices. For $A\in\mathbb R^{n\times m}$ and $B\in\mathbb R^{n\times p}$, the goal is to construct sketches $\widetilde A,\widetilde B$ such that

$$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$

with high probability (Magen et al., 2010). This is highly relevant to PAMM because it is a fixed-instance guarantee and, in the random-projection case, even yields a bilinear-form statement uniform in $x,y$: $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$ for all $x,y$ (Magen et al., 2010).

A closely related strand studies spectral-norm AMM via Gaussian projection in the form

$XY \approx XG^\top GY,$

with guarantee

$(i,j,k)$0

where the sketch dimension depends on the nuclear ranks of $(i,j,k)$1 and $(i,j,k)$2, rather than ambient dimension (Kyrillidis et al., 2014). This is not entrywise PAMM in the narrow sense, but it implies additive control of every bilinear query $(i,j,k)$3 (Kyrillidis et al., 2014).

A different strand is genuinely entrywise or coordinatewise. For arithmetic $(i,j,k)$4-$(i,j,k)$5 matrix multiplication $(i,j,k)$6, with

$(i,j,k)$7

the paper on Hamming-distance reductions proves that one can compute an approximation $(i,j,k)$8 such that, with high probability, every entry satisfies

$(i,j,k)$9

(Kowaluk et al., 20 Apr 2025). This is the clearest direct PAMM result in the provided corpus.

A further line concerns entrywise max-norm guarantees in coded distributed multiplication. In the coded setting with $A\in\mathbb R^{n\times m}$0, the approximate recovery threshold is defined through the requirement

$A\in\mathbb R^{n\times m}$1

for all valid worker sets $A\in\mathbb R^{n\times m}$2 of size at least $A\in\mathbb R^{n\times m}$3 (Jeong et al., 2021). This is again pointwise, but in a distributed coding model.

By contrast, SpAMM and related methods are best described as hierarchical blockwise approximate multiplication, not pointwise in the scalar sense. They decide whether a whole submatrix product should be omitted according to a norm test in the product space (Challacombe et al., 2010, Bock et al., 2012, Artemov, 2019, Liu et al., 2021). This suggests a useful distinction: PAMM in the narrow sense is scalar- or query-oriented; SpAMM is a block-hierarchical analogue.

2. Operator-norm and bilinear-form PAMM

The paper on low-rank matrix-valued Chernoff bounds gives an early intrinsic-dimension-dependent theory for approximate multiplication in spectral norm (Magen et al., 2010). Its target product is $A\in\mathbb R^{n\times m}$4, with $A\in\mathbb R^{n\times m}$5, $A\in\mathbb R^{n\times m}$6, and the objective is to produce sketches $A\in\mathbb R^{n\times m}$7 such that

$A\in\mathbb R^{n\times m}$8

Two mechanisms are analyzed.

The first uses a random sign matrix $A\in\mathbb R^{n\times m}$9, scaled by $B\in\mathbb R^{n\times p}$0, and sets

$B\in\mathbb R^{n\times p}$1

If both matrices have rank at most $B\in\mathbb R^{n\times p}$2, then $B\in\mathbb R^{n\times p}$3 suffices for the stronger bilinear guarantee

$B\in\mathbb R^{n\times p}$4

for all $B\in\mathbb R^{n\times p}$5, with probability at least $B\in\mathbb R^{n\times p}$6 (Magen et al., 2010). If instead the stable ranks are at most $B\in\mathbb R^{n\times p}$7, then $B\in\mathbb R^{n\times p}$8 suffices for the operator-norm guarantee with probability at least $B\in\mathbb R^{n\times p}$9 (Magen et al., 2010).

The second mechanism uses nonuniform row sampling with

$\widetilde A,\widetilde B$0

Sampling $\widetilde A,\widetilde B$1 i.i.d. rows and rescaling them yields

$\widetilde A,\widetilde B$2

with probability $\widetilde A,\widetilde B$3 (Magen et al., 2010). The significance is that the sketch size depends on rank or stable rank rather than the ambient dimensions $\widetilde A,\widetilde B$4.

A closely related result replaces stable rank by nuclear rank in the Gaussian projection model (Kyrillidis et al., 2014). There, for $\widetilde A,\widetilde B$5, $\widetilde A,\widetilde B$6, and Gaussian $\widetilde A,\widetilde B$7 with $\widetilde A,\widetilde B$8, one sets

$\widetilde A,\widetilde B$9

and obtains

$$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$0

with probability at least $$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$1, provided

$$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$2

where

$$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$3

(Kyrillidis et al., 2014). Since a spectral-norm bound controls all bilinear forms, this gives uniform additive point-query control, even though the theorem is global rather than entrywise.

A plausible implication is that operator-norm AMM papers provide a broad PAMM foundation whenever the end task is access to bilinear forms, Gram entries, or matrix-vector queries, rather than strict per-entry relative error.

3. Direct entrywise PAMM for arithmetic $$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$4-$$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$5 multiplication

The most explicit point-approximate formulation in the surveyed material arises from the reduction between arithmetic $$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$6-$$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$7 matrix multiplication and all-pairs Hamming distances (Kowaluk et al., 20 Apr 2025).

For

$$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$8

the arithmetic product is

$$\|\widetilde A^\top \widetilde B - A^\top B\| \le \varepsilon \|A\|\,\|B\|$$9

The paper proves a reverse linear-time reduction from all row-column Hamming distances to arithmetic $x,y$0-$x,y$1 multiplication. For binary vectors $x,y$2,

$x,y$3

and therefore

$x,y$4

(Kowaluk et al., 20 Apr 2025). Given all row-column Hamming distances, the exact product can thus be recovered in

$x,y$5

time (Kowaluk et al., 20 Apr 2025).

The approximation enters through a randomized algorithm for all-pairs Hamming distances. For $x,y$6, it computes $x,y$7-approximations of all distances $x,y$8 in time

$x,y$9

with high probability (Kowaluk et al., 20 Apr 2025). The algorithm is multiscale: for thresholds $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$0, it constructs a randomized map

$$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$1

where each entry of the random matrix $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$2 is $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$3 independently with probability $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$4 (Kowaluk et al., 20 Apr 2025). Threshold tests on projected Hamming distances distinguish whether $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$5 or $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$6.

To sharpen the product bound, the paper also approximates

$$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$7

where $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$8 is the bitwise complement of $$|x^\top(\widetilde A^\top \widetilde B-A^\top B)y| \le \varepsilon \|Ax\|\,\|By\|$$9 (Kowaluk et al., 20 Apr 2025). This yields two candidate estimators,

$x,y$0

where $x,y$1 and $x,y$2 approximate $x,y$3 and $x,y$4, respectively (Kowaluk et al., 20 Apr 2025).

The final theorem states that one can compute an approximation $x,y$5 such that, with high probability, for all $x,y$6,

$x,y$7

in time

$x,y$8

(Kowaluk et al., 20 Apr 2025). This is a genuine PAMM theorem: the guarantee is per entry, not merely in a global matrix norm.

A limitation is equally clear from the statement. The error is additive and geometry-dependent; if both $x,y$9 and $XY \approx XG^\top GY,$0 are large, the bound can be weak. The method is also specific to arithmetic multiplication of binary matrices.

4. Pointwise estimators and max-norm recovery in randomized and coded settings

The 2025 mean-estimation perspective on randomized and quantum AMM is not framed as PAMM, but it contains explicit coordinatewise estimators that are directly reusable for pointwise approximation (Apers et al., 9 Oct 2025).

For column-sampling AMM, if $XY \approx XG^\top GY,$1, $XY \approx XG^\top GY,$2, and $XY \approx XG^\top GY,$3 is sampled with probability $XY \approx XG^\top GY,$4, then

$XY \approx XG^\top GY,$5

The paper gives the corresponding variance formula

$XY \approx XG^\top GY,$6

(Apers et al., 9 Oct 2025). This is a direct scalar PAMM estimator, even though the paper uses it to control the full matrix in max norm or Frobenius norm.

For the random-walk estimator for $XY \approx XG^\top GY,$7, the paper constructs a matrix-valued random variable $XY \approx XG^\top GY,$8 with

$XY \approx XG^\top GY,$9

and proves

$(i,j,k)$00

(Apers et al., 9 Oct 2025). Again, that is essentially a pointwise statement, though the theorems target full-matrix max-norm and Frobenius error.

The coded distributed setting goes further by making the formal guarantee itself entrywise. In $(i,j,k)$01-approximate coded matrix multiplication, $(i,j,k)$02 satisfy

$(i,j,k)$03

each worker stores a $(i,j,k)$04 fraction of each multiplicand, and the approximate recovery threshold is defined as the smallest $(i,j,k)$05 such that for all subsets $(i,j,k)$06 with $(i,j,k)$07,

$(i,j,k)$08

for all entries $(i,j,k)$09 (Jeong et al., 2021).

The main theorem states that

$(i,j,k)$10

whereas exact recovery requires $(i,j,k)$11 workers (Jeong et al., 2021). Achievability is obtained through approximate MatDot codes: if evaluation points satisfy

$(i,j,k)$12

then recovery threshold $(i,j,k)$13 is achievable (Jeong et al., 2021). The converse shows $(i,j,k)$14 for $(i,j,k)$15, so the threshold is optimal in that regime (Jeong et al., 2021).

This is PAMM in a strong distributed sense: the approximation is full-matrix, but the metric is coordinatewise max norm. A common misconception is that approximation in coded multiplication merely relaxes average accuracy. Here the theorem is deterministic and per-entry under bounded Frobenius norms (Jeong et al., 2021).

5. Product-space PAMM and the SpAMM lineage

SpAMM is not scalar-pointwise PAMM, but it is one of the clearest realizations of approximate multiplication by screening insignificant contributions during the multiplication itself (Challacombe et al., 2010, Bock et al., 2012). Its target setting is matrices with decay, such as

$(i,j,k)$16

or

$(i,j,k)$17

where entries become small away from a locality structure (Challacombe et al., 2010, Bock et al., 2012).

Matrices are stored recursively as quadtrees. At each level,

$(i,j,k)$18

and candidate subproducts are screened using the Frobenius norm. The defining SpAMM rule is

$(i,j,k)$19

(Challacombe et al., 2010). In the optimized formulation at finer granularity,

$(i,j,k)$20

(Bock et al., 2012).

The approximation therefore occurs in the product space rather than by first sparsifying $(i,j,k)$21 and $(i,j,k)$22. This matters conceptually for PAMM because it is the same basic philosophy—neglect small contributions $(i,j,k)$23—but at block granularity rather than scalar granularity. The 2010 SpAMM paper explicitly contrasts this with matrix-space truncation and reports that, for matched application-level error in electronic energy, SpAMM requires fewer to far fewer floating point operations than dropping on tested quantum chemical matrices (Challacombe et al., 2010).

The 2019 distributed recursive framework compares three methods for matrices with exponential decay: input truncation, SpAMM-style sub-matrix-product truncation, and a hybrid of both (Artemov, 2019). For all three methods, it proves

$(i,j,k)$24

and

$(i,j,k)$25

It also reports that the hybrid method reduces communication by a factor of about $(i,j,k)$26 on matrices from chemical systems with about $(i,j,k)$27 atoms (Artemov, 2019).

The GPU implementation, cuSpAMM, replaces recursion by tiled kernels while preserving the block-norm admissibility test

$(i,j,k)$28

as the criterion for executing a tile product (Liu et al., 2021). It introduces a valid-ratio metric,

$(i,j,k)$29

measuring the fraction of candidate block products that survive pruning (Liu et al., 2021). This suggests a systems-level analogue of PAMM granularity control: approximation decisions must be coarse enough to amortize control overhead on modern hardware.

A plausible implication is that SpAMM should be regarded as a hierarchical, blockwise PAMM relative rather than a direct pointwise method. The approximation acts on recursively defined submatrix products, but the underlying criterion is still significance screening within $(i,j,k)$30 interactions.

6. Global AMM frameworks often cited in PAMM contexts

Several additional AMM frameworks are relevant to PAMM mainly by contrast.

The deterministic linear-system approach returns $(i,j,k)$31 with

$(i,j,k)$32

in

$(i,j,k)$33

time, for bounded-entry $(i,j,k)$34 matrices (Manne et al., 2014). Its guarantee is global Frobenius absolute error, not pointwise control, so it is better classified as norm-approximate matrix multiplication than PAMM.

OverSketch computes

$(i,j,k)$35

with CountSketch-style blocks and shows that if

$(i,j,k)$36

then

$(i,j,k)$37

even while ignoring $(i,j,k)$38 stragglers among any $(i,j,k)$39 workers (Gupta et al., 2018). The guarantee is for-each Frobenius-norm AMM, not entrywise PAMM.

The coded CR-sampling literature constructs unbiased estimators of the full product from sampled block outer products. In approximate weighted $(i,j,k)$40 coded multiplication, blocks are sampled with probabilities

$(i,j,k)$41

yielding an unbiased estimator whose expected squared Frobenius error scales like

$(i,j,k)$42

(Charalambides et al., 2020). The distributed coded version based on MatDot reduces recovery threshold from $(i,j,k)$43 to $(i,j,k)$44 under compression by $(i,j,k)$45 (Charalambides et al., 2020). Likewise, coded random sampling with MatDot recovers an unbiased approximation from any $(i,j,k)$46 workers, with expected error

$(i,j,k)$47

for independent sampling (Chang et al., 2019). These are globally normed AMM estimators, though their summand-wise structure is often PAMM-adjacent.

Finally, decomposition-based approximate multiplication via TSVD, circulant decomposition, Fourier sparsification, and cycle decomposition uses the first-order expansion

$(i,j,k)$48

with reported $(i,j,k)$49 arithmetic complexity for $(i,j,k)$50 matrices at usable relative error around $(i,j,k)$51 (Kar et al., 27 Apr 2025). This is again global Frobenius-style AMM, not pointwise PAMM, but the exact residual identity is structurally useful.

7. Conceptual distinctions, misconceptions, and open directions

A recurring misconception is that “approximate matrix multiplication” is a single notion. The literature instead separates at least four distinct regimes.

Regime	Typical guarantee	Representative papers
Entrywise / max-norm	$(i,j,k)$52 or geometry-dependent per-entry error	(Kowaluk et al., 20 Apr 2025, Jeong et al., 2021)
Bilinear / operator norm	$(i,j,k)$53	(Magen et al., 2010, Kyrillidis et al., 2014)
Frobenius AMM	$(i,j,k)$54 or expected squared Frobenius error	(Manne et al., 2014, Charalambides et al., 2020, Gupta et al., 2018, Chang et al., 2019)
Product-space hierarchical	norm-screened omission of submatrix products	(Challacombe et al., 2010, Bock et al., 2012, Artemov, 2019, Liu et al., 2021)

A second misconception is that blockwise methods such as SpAMM are merely input-sparsification schemes. They are not: the defining approximation mechanism is omission of subproducts based on

$(i,j,k)$55

which acts directly in the multiplication process (Artemov, 2019).

A third misconception is that approximate coded multiplication only yields average or probabilistic output error. In fact, the approximate MatDot framework proves deterministic coordinatewise recovery guarantees under norm-bounded inputs (Jeong et al., 2021).

The surveyed corpus also reveals several open directions. The 2010 and 2019 SpAMM papers explicitly treat rigorous worst-case global bounds and asymptotic behavior for slow decay as unresolved or only partially resolved (Challacombe et al., 2010, Artemov, 2019). The binary Hamming-distance reduction suggests a precise path to PAMM for discrete domains, but this does not automatically extend to general real matrices (Kowaluk et al., 20 Apr 2025). The mean-estimation perspective suggests that many full-matrix AMM estimators can be specialized entrywise, but those specializations are usually not developed as standalone point-query algorithms (Apers et al., 9 Oct 2025). This suggests that a unifying modern PAMM theory would likely need to formalize the relationship between coordinatewise estimators, global norm guarantees, and hierarchical product-space screening.

In that sense, PAMM is best understood not as a single established algorithm, but as a technically coherent research direction spanning entrywise additive approximation, max-norm recovery, fixed-instance bilinear control, and hierarchical significance screening inside matrix multiplication itself (Magen et al., 2010, Kowaluk et al., 20 Apr 2025).