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

Question about paper #8

Open
diaodeyi opened this issue Apr 13, 2022 · 4 comments
Open

Question about paper #8

diaodeyi opened this issue Apr 13, 2022 · 4 comments

Comments

@diaodeyi
Copy link

diaodeyi commented Apr 13, 2022

As the paper says in appendix:
"For example, for long videos or high-resolution frames with large h, w, s, usually (e^h)(e^w)(e^s)< (h + w + s)"
Is there any situation that (e^h)(e^w)(e*s)< (h + w + s)?

@diaodeyi
Copy link
Author

diaodeyi commented Apr 13, 2022

By the way, i want to konw why does the equation 7 in paper use e^x not just use x for the difinition?
in this way the complexity of 3DNA is (hws)(h+w+s)
截屏2022-04-13 上午10 43 01

@diaodeyi
Copy link
Author

这里的HWS是范围吧,那e的HWS次方不是早就超出attention的范围了?

@woctezuma
Copy link

woctezuma commented Apr 13, 2022

Table

Picture

Indeed, this is a weird statement. By rewriting the product of exponential factors as a single exponential of the variable x=h+w+s:

(e^h)(e^w)(e^s) = e^(h+w+s)

We are on a classical inequality between x and e^x, and it is easy to prove or verify that x < e^x for every x.

@diaodeyi
Copy link
Author

yeah,so how it would be x > e^x. (h+w+s)> e^h* e^w *e^s. like the paper said.

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