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

About data augmentation #4

Closed
guantinglin opened this issue Jun 22, 2019 · 1 comment
Closed

About data augmentation #4

guantinglin opened this issue Jun 22, 2019 · 1 comment

Comments

@guantinglin
Copy link

Hi, may I ask a question about the description in the paper?

As you mentioned in paper in the last paragraph of chapter 3.1:

"the stronger the data augmentation is, the smaller the N will be. The small neighboring region of a sample is a way to capture all near-duplicates and instances that can be obtained by data augmentation"

Shouldn't stronger data augmentation technique provide more samples of the same class(S) that makes the volume of them (N) larger?

@richardaecn
Copy link
Owner

Hi @guantinglin, "Presumably, the stronger the data augmentation is, the smaller the N will be" is a hypothesis that not verified by experiments. The intuition is that the stronger the data augmentation is, the more near-duplicate samples can be augmented, therefore the total number of unique samples N would be smaller.

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