Search Results for author:
Found 4 papers, 0 papers with code
Uniform Generalization Bounds for Overparameterized Neural Networks
As a byproduct of our results, we show the equivalence between the RKHS corresponding to the NT kernel and its counterpart corresponding to the Mat\'ern family of kernels, showing the NT kernels induce a very general class of models.
How to distribute data across tasks for meta-learning?
We show that: 1) If tasks are homogeneous, there is a uniform optimal allocation, whereby all tasks get the same amount of data; 2) At fixed budget, there is a trade-off between number of tasks and number of data points per task, with a unique solution for the optimum; 3) When trained separately, harder task should get more data, at the cost of a smaller number of tasks; 4) When training on a mixture of easy and hard tasks, more data should be allocated to easy tasks.
Optimal allocation of data across training tasks in meta-learning
They are tested on benchmarks with a fixed number of data-points for each training task, and this number is usually arbitrary, for example, 5 instances per class in few-shot classification.
Cyclic orthogonal convolutions for long-range integration of features
We propose a novel architecture that allows flexible information flow between features $z$ and locations $(x, y)$ across the entire image with a small number of layers.
