Class Balanced Sampling for the Training in GANs

2021 ◽  
Author(s):  
Sanghun Kim ◽  
Seungkyu Lee
Keyword(s):  
Author(s):  
Roberto Benedetti ◽  
Maria Michela Dickson ◽  
Giuseppe Espa ◽  
Francesco Pantalone ◽  
Federica Piersimoni

AbstractBalanced sampling is a random method for sample selection, the use of which is preferable when auxiliary information is available for all units of a population. However, implementing balanced sampling can be a challenging task, and this is due in part to the computational efforts required and the necessity to respect balancing constraints and inclusion probabilities. In the present paper, a new algorithm for selecting balanced samples is proposed. This method is inspired by simulated annealing algorithms, as a balanced sample selection can be interpreted as an optimization problem. A set of simulation experiments and an example using real data shows the efficiency and the accuracy of the proposed algorithm.


Author(s):  
Claire Kermorvant ◽  
Frank D’Amico ◽  
Noëlle Bru ◽  
Nathalie Caill-Milly ◽  
Blair Robertson

2019 ◽  
Vol 55 (24) ◽  
pp. 1273-1275 ◽  
Author(s):  
J.E. Kim ◽  
T. Yoo ◽  
K.‐H. Baek ◽  
T.T.‐H. Kim

1982 ◽  
Vol 31 (3-4) ◽  
pp. 165-184
Author(s):  
S. Sengupta

The problem considered in this paper is that of construcHng fixed size sampling designs having constant inclusion probabilities of first two orders. Some such sampling designs are developed in situations where the population units are subject to classification in one or more ways eliminating the chance of selection of samples for which the units have too lopsided a distribution over the classes.


2011 ◽  
Vol 141 (2) ◽  
pp. 984-994 ◽  
Author(s):  
G. Chauvet ◽  
D. Bonnéry ◽  
J.-C. Deville

Sign in / Sign up

Export Citation Format

Share Document