17 citations · 26 across the 6 of their papers we have counts for
8 papers
Scalable Meta-Learning with Gaussian Processes
Petru Tighineanu, Lukas Grossberger, Paul Baireuther +4
Meta-learning is a powerful approach that exploits historical data to quickly solve new tasks from the same distribution. In the low-data regime, methods based on the closed-form p…
Transfer Learning with Gaussian Processes for Bayesian Optimization
Petru Tighineanu, Kathrin Skubch, Paul Baireuther +3
Bayesian optimization is a powerful paradigm to optimize black-box functions based on scarce and noisy data. Its data efficiency can be further improved by transfer learning from r…
Multi-Class Multi-Instance Count Conditioned Adversarial Image Generation
Amrutha Saseendran, Kathrin Skubch, Margret Keuper
Image generation has rapidly evolved in recent years. Modern architectures for adversarial training allow to generate even high resolution images with remarkable quality. At the sa…
Core forging and local limit theorems for the k-core of random graphs
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
We establish a multivariate local limit theorem for the order and size as well as several other parameters of the k-core of the Erdos-Renyi graph. The proof is based on a novel app…
Limits of discrete distributions and Gibbs measures on random graphs
Amin Coja-Oghlan, Will Perkins, Kathrin Skubch
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we constru…
The core in random hypergraphs and local weak convergence
Kathrin Skubch
The degree of a vertex in a hypergraph is defined as the number of edges incident to it. In this paper we study the -core, defined as the maximal induced subhypergraph of minimu…
The minimum bisection in the planted bisection model
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
In the planted bisection model a random graph with vertices is created by partitioning the vertices randomly into two classes of equal size (up to ). Any…
How does the core sit inside the mantle?
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
The -core, defined as the largest subgraph of minimum degree , of the random graph has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [JCT…