activity
20212026
most citedCHAIN: Enhancing Generalization in Data-Efficient GANs via lipsCHitz continuity constrAIned Normalization

1 citations · 2 across the 10 of their papers we have counts for

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2025

Amortized Active Generation of Pareto Sets

Daniel M. Steinberg, Asiri Wijesinghe, Rafael Oliveira +3

We introduce active generation of Pareto sets (A-GPS), a new framework for online discrete black-box multi-objective optimization (MOO). A-GPS learns a generative model of the Pare…

cs.LG2024

PACE: Marrying generalization in PArameter-efficient fine-tuning with Consistency rEgularization

Yao Ni, Shan Zhang, Piotr Koniusz

Parameter-Efficient Fine-Tuning (PEFT) effectively adapts pre-trained transformers to downstream tasks. However, the optimization of tasks performance often comes at the cost of ge…

cs.LG2024★ 1 cited

CHAIN: Enhancing Generalization in Data-Efficient GANs via lipsCHitz continuity constrAIned Normalization

Yao Ni, Piotr Koniusz

Generative Adversarial Networks (GANs) significantly advanced image generation but their performance heavily depends on abundant training data. In scenarios with limited data, GANs…

cs.LG2021

Towards a Robust Differentiable Architecture Search under Label Noise

Christian Simon, Piotr Koniusz, Lars Petersson +2

Neural Architecture Search (NAS) is the game changer in designing robust neural architectures. Architectures designed by NAS outperform or compete with the best manual network desi…

cs.LG2021

On Learning the Geodesic Path for Incremental Learning

Christian Simon, Piotr Koniusz, Mehrtash Harandi

Neural networks notoriously suffer from the problem of catastrophic forgetting, the phenomenon of forgetting the past knowledge when acquiring new knowledge. Overcoming catastrophi…