search

enoche / BM3

Pytorch implementation for "Bootstrap Latent Representations for Multi-modal Recommendation"-WWW'23
GNU General Public License v3.0
50 stars 9 forks source link

Issue on the calculation of time complexity in the Table1 #6

Closed weiwei1206 closed 1 year ago

weiwei1206 commented 1 year ago

Thank you very much for your excellent work. I have some confusion about the calculation of time complexity in your paper.

Can you explain how the time complexity of "Graph Convolution" and "Feature Transform" of GRCN is calculated?

How do you obtain the time complexity of the "Feature Transform" of LATTICE, as shown in Table 1？

enoche commented 1 year ago

Hi, @weiwei1206 Thanks for your feedback. Both "Graph Convolution" and "Feature Transform" are calculated following their published papers or source codes. May I know you have any concerns, for detailed analysis on time complexity of an algorithm, pls refer book: Introduction to Algorithms