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.

Sign up for GitHub

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

Jump to bottom

About sample complexity #1

Open
Lupin123123 opened this issue Dec 15, 2024 · 0 comments
Open

About sample complexity #1

Lupin123123 opened this issue Dec 15, 2024 · 0 comments

Comments

@Lupin123123
Copy link

Hi!
I was confused about "A limitation of NERD, BA, and our method is that they tend to converge to a rate estimate of at most log(n)". Could you please give some insight on it? Can I declare that the problem does not exit when I estimate the upper bound by ResNet VAE for an arbitary source?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Lupin123123