Attila Barta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Attila Barta has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- István Fazekas
Faculty of Informatics, University of Debrecen, Debrecen, Hungary
4 shared publications László Fórián
Univ Debrecen, Fac Informat, Debrecen, Hungary
2 shared publications- Csaba Noszály
Faculty of Informatics University of Debrecen P.O. Box 12 4010 Debrecen Hungary
1 shared publication
Latest Publications
- 1 January 2023
- Published by Infocommunications Journal in Infocommunications journal
- Vol. 15 (Special ) , 9-12
Deep Learning from Noisy Labels with Some Adjustments of a Recent Method
In this paper we have used JoCoR, a fairly recent method for learning with label noise, that makes use of two neural networks with a joint loss function using an additional contrastive loss to increase the agreement between them. This method can be extended to more than two networks in a straightforward way. We have carried out experiments on the CIFAR-10 and CIFAR-100 datasets (contaminated by synthetic label noise) with this kind of extension using several contrastive losses. We have concluded that it makes a significant improvement if we use a third network, especially when we use Kullback-Leibler terms for all possible pairs of softmax outputs. Further extension also means some kind of improvement, but in the case of the CIFAR datasets, those were not so significant, maybe except the cases with lower ratio of label noise.
- 1 January 2023
- Published by Infocommunications Journal in Infocommunications journal
- Vol. 15 (Special ) , 9-12
Deep Learning from Noisy Labels with Some Adjustments of a Recent Method
In this paper we have used JoCoR, a fairly recent method for learning with label noise, that makes use of two neural networks with a joint loss function using an additional contrastive loss to increase the agreement between them. This method can be extended to more than two networks in a straightforward way. We have carried out experiments on the CIFAR-10 and CIFAR-100 datasets (contaminated by synthetic label noise) with this kind of extension using several contrastive losses. We have concluded that it makes a significant improvement if we use a third network, especially when we use Kullback-Leibler terms for all possible pairs of softmax outputs. Further extension also means some kind of improvement, but in the case of the CIFAR datasets, those were not so significant, maybe except the cases with lower ratio of label noise.
- Open Access
- 6 December 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (23) , 3143
A Continuous-Time Network Evolution Model Describing 2- and 3-Interactions
A continuous-time network evolution model is considered. The evolution of the network is based on 2- and 3-interactions. 2-interactions are described by edges, and 3-interactions are described by triangles. The evolution of the edges and triangles is governed by a multi-type continuous-time branching process. The limiting behaviour of the network is studied by mathematical methods. We prove that the number of triangles and edges have the same magnitude on the event of non-extinction, and it is , where is the Malthusian parameter. The probability of the extinction and the degree process of a fixed vertex are also studied. The results are illustrated by simulations.- 6 December 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (23) , 3143
Open AccessA Continuous-Time Network Evolution Model Describing 2- and 3-Interactions
A continuous-time network evolution model is considered. The evolution of the network is based on 2- and 3-interactions. 2-interactions are described by edges, and 3-interactions are described by triangles. The evolution of the edges and triangles is governed by a multi-type continuous-time branching process. The limiting behaviour of the network is studied by mathematical methods. We prove that the number of triangles and edges have the same magnitude on the event of non-extinction, and it is , where is the Malthusian parameter. The probability of the extinction and the degree process of a fixed vertex are also studied. The results are illustrated by simulations. - 19 May 2021
- Published by Annales Mathematicae et Informaticae - AMI in Annales Mathematicae et Informaticae
- Vol. 53, 125-137
Ensemble noisy label detection on MNIST
- 19 May 2021
- Published by Annales Mathematicae et Informaticae - AMI in Annales Mathematicae et Informaticae
- Vol. 53, 125-137
Ensemble noisy label detection on MNIST
- 23 July 2020
- Published by Annales Mathematicae et Informaticae - AMI in Annales Mathematicae et Informaticae
- Vol. 51, 7-15
Simulation results on a triangle-based network evolution model
- 23 July 2020
- Published by Annales Mathematicae et Informaticae - AMI in Annales Mathematicae et Informaticae
- Vol. 51, 7-15
Simulation results on a triangle-based network evolution model