REVIEW 1 cited by
Higher-Order Factorization Machines
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
read the original abstract
Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional. Unfortunately, despite increasing interest in FMs, there exists to date no efficient training algorithm for higher-order FMs (HOFMs). In this paper, we present the first generic yet efficient algorithms for training arbitrary-order HOFMs. We also present new variants of HOFMs with shared parameters, which greatly reduce model size and prediction times while maintaining similar accuracy. We demonstrate the proposed approaches on four different link prediction tasks.
Forward citations
Cited by 1 Pith paper
-
Optimizing adsorption configurations on alloy surfaces using Tensor Train Optimizer
Using a tensor train optimizer on a third-order binary optimization formulation, the authors find low-energy CO and NO adsorption configurations on alloy surfaces and high-entropy alloy nanoparticles without specializ...
Discussion (0). Continue with ORCID to comment.