Pith. sign in

REVIEW 3 cited by

What is the Relationship between Tensor Factorizations and Circuits (and How Can We Exploit it)?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.07953 v2 pith:4FK7DXDN submitted 2024-09-12 cs.LG

classification cs.LG
keywords circuittensorfactorizationsfactorizationarchitecturesconnectionframeworkhighlight
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper establishes a rigorous connection between circuit representations and tensor factorizations, two seemingly distinct yet fundamentally related areas. By connecting these fields, we highlight a series of opportunities that can benefit both communities. Our work generalizes popular tensor factorizations within the circuit language, and unifies various circuit learning algorithms under a single, generalized hierarchical factorization framework. Specifically, we introduce a modular "Lego block" approach to build tensorized circuit architectures. This, in turn, allows us to systematically construct and explore various circuit and tensor factorization models while maintaining tractability. This connection not only clarifies similarities and differences in existing models, but also enables the development of a comprehensive pipeline for building and optimizing new circuit/tensor factorization architectures. We show the effectiveness of our framework through extensive empirical evaluations, and highlight new research opportunities for tensor factorizations in probabilistic modeling.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Restructuring Tractable Probabilistic Circuits

    cs.AI 2024-11 conditional novelty 8.0 of 10

    A restructuring algorithm converts structured probabilistic circuits between different variable-order trees in polynomial time for contiguous circuits, enabling tractable multiplication of differently structured circu...

  2. On Faster Marginalization with Squared Circuits via Orthonormalization

    cs.LG 2024-12 conditional novelty 7.0 of 10

    Squared circuits whose input layers are orthonormal and whose sum layers are semi-unitary are automatically normalized and admit a faster marginalization algorithm.

  3. Scaling Probabilistic Circuits via Monarch Matrices

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Structured Monarch matrices, derived from circuit multiplication, let probabilistic circuits scale to larger hidden sizes and beat prior tractable models at lower FLOP cost.

Pith tools