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

too much time for "corest sampling" #35

Open
Classmate-Huang opened this issue Dec 24, 2021 · 4 comments
Open

too much time for "corest sampling" #35

Classmate-Huang opened this issue Dec 24, 2021 · 4 comments

Comments

@Classmate-Huang
Copy link

Thank you for your work!!

I found that the training time is very long, especially during the "corest subsampling" step.

When you are training, how long does it take for a category?

image

It's been almost an hour without any progress...

@haobo827
Copy link

Hi my chengdu's friends!
I got the same problem with you: wait 'calculating distances...' long time, when I use kCenterGreedy(SamplingMethodf).
Do you know why? and have solved it?
Much appreciate!

@haobo827
Copy link

Thank you for your work!!

I found that the training time is very long, especially during the "corest subsampling" step.

When you are training, how long does it take for a category?

image

It's been almost an hour without any progress...

Hi my chengdu's friends!
I got the same problem with you, like...

@ZwkAlex
Copy link

ZwkAlex commented Apr 21, 2022

Hi my chengdu's friends! I got the same problem with you: wait 'calculating distances...' long time, when I use kCenterGreedy(SamplingMethodf). Do you know why? and have solved it? Much appreciate!

I guess maybe because it's calculating minimum distance using cpu, it's about one and half hour on my cpu, and
lower coreset_sampling_ratio will reduce computation time, but it also reduce performance.

@haobo827
Copy link

you are right. and it's hard to avoid

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

3 participants