Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

请求解答一个文章中的疑惑 #26

Open
ithok opened this issue Apr 12, 2022 · 2 comments
Open

请求解答一个文章中的疑惑 #26

ithok opened this issue Apr 12, 2022 · 2 comments

Comments

@ithok
Copy link

ithok commented Apr 12, 2022

是关于自监督损失的复杂度方面的,文中给出的推导过程是
在一个批次的计算中,分子部分:O(Bd) + 分母部分O(BMd)
-> 一个批次的总复杂度为 O(|E|d(2+|V|))

关于这个推导不是很理解,目前暂时还没有看源码,所以也不清楚具体的实现是怎么样,我自己的推导过程是
one epoch: user = bd+bmd=b(m+1)d item = bd+bid+b(i+1)d
user+item = b(m+2+i)d -> O(bd(2+|V|)) 区别就在 bd(2+|V|) 还是 |E|d(2+|V|)
因为我本人刚入门,可能问题有点蠢,还望您能够解答,文章的其他部分还是能读下来的

@wujcan
Copy link
Owner

wujcan commented Apr 14, 2022

你这边算的是一个mini-batch的计算量,而一个epoch里面有|E|/B个mini-batch,所以总计算量是|E|d(2+|V|)

@ithok
Copy link
Author

ithok commented Apr 14, 2022

不好意思搞混了,谢谢!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants