A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
FAST improves fast and stable task adaptation in DNNs.
DANCE improves prediction set efficiency for deep learning models.
A new method prunes neural networks faster and more efficiently.
Handling previously unseen tasks after given only a few training examples continues to be a tough challenge in machine learning. We propose TapNets, neural networks augmented with task-adaptive projection for improved few-shot learning. Here, employing a meta-learning strategy with episode-based training, a network and…
While recent continual learning methods largely alleviate the catastrophic problem on toy-sized datasets, some issues remain to be tackled to apply them to real-world problem domains. First, a continual learning model should effectively handle catastrophic forgetting and be efficient to train even with a large number o…
Task-adaptive clustering improves few-shot learning with unlabeled data.
Representation learning promises to unlock deep learning for the long tail of vision tasks without expensive labelled datasets. Yet, the absence of a unified evaluation for general visual representations hinders progress. Popular protocols are often too constrained (linear classification), limited in diversity (ImageNe…
A new meta-learning BO approach that bypasses surrogate models and directly learns task utility.
Multi-task learning (MTL) is a common paradigm that seeks to improve the generalization performance of task learning by training related tasks simultaneously. However, it is still a challenging problem to search the flexible and accurate architecture that can be shared among multiple tasks. In this paper, we propose a …
ACL improves DRL by adapting task difficulty to agent's capabilities.
We show that several popular few-shot learning benchmarks can be solved with varying degrees of success without using support set Labels at Test-time (LT). To this end, we introduce a new baseline called Centroid Networks, a modification of Prototypical Networks in which the support set labels are hidden from the metho…
We propose a new architecture called Memory-Augmented Encoder-Solver (MAES) that enables transfer learning to solve complex working memory tasks adapted from cognitive psychology. It uses dual recurrent neural network controllers, inside the encoder and solver, respectively, that interface with a shared memory module a…
How can deep learning systems flexibly reuse their knowledge? Toward this goal, we propose a new class of challenges, and a class of architectures that can solve them. The challenges are meta-mappings, which involve systematically transforming task behaviors to adapt to new tasks zero-shot. The key to achieving these c…
Adversarial weighting improves regression task adaptation.
Online learning with streaming data in a distributed and collaborative manner can be useful in a wide range of applications. This topic has been receiving considerable attention in recent years with emphasis on both single-task and multitask scenarios. In single-task adaptation, agents cooperate to track an objective o…
Improves meta-learning efficiency with mixed-mode differentiation.
Deep neural networks are traditionally trained using human-designed stochastic optimization algorithms, such as SGD and Adam. Recently, the approach of learning to optimize network parameters has emerged as a promising research topic. However, these learned black-box optimizers sometimes do not fully utilize the experi…
New method improves meta-learning performance by task-specific initialization.
New method optimizes MRI sampling patterns for faster scans.
Few-shot learning is a challenging problem where the goal is to achieve generalization from only few examples. Model-agnostic meta-learning (MAML) tackles the problem by formulating prior knowledge as a common initialization across tasks, which is then used to quickly adapt to unseen tasks. However, forcibly sharing an…
Plan2Explore learns new tasks efficiently through self-supervised planning.
New method encodes function preferences into neural nets for better generalization.
This paper tackles continuous domain adaptation with a new approach.
AdaPTS adapts univariate FMs for multivariate time series forecasting.
The paper quantifies uncertainty in aggregated machine learning metrics.
While tasks could come with varying the number of instances and classes in realistic settings, the existing meta-learning approaches for few-shot classification assume that the number of instances per task and class is fixed. Due to such restriction, they learn to equally utilize the meta-knowledge across all the tasks…
Meta-learning has received a tremendous recent attention as a possible approach for mimicking human intelligence, i.e., acquiring new knowledge and skills with little or even no demonstration. Most of the existing meta-learning methods are proposed to tackle few-shot learning problems such as image and text, in rather …
Novel regularization for Vision Transformers improves model generalization and sparsity.
Paper presents a Bayesian-decision-theory framework for long-tailed classification.
Adaptive kernels from neural networks improve model performance.
MAGDiff detects data shifts in neural networks without retraining.
Ensemble pre-trained models for low data transfer learning.
The recent progress in neural architecture search (NAS) has allowed scaling the automated design of neural architectures to real-world domains, such as object detection and semantic segmentation. However, one prerequisite for the application of NAS are large amounts of labeled data and compute resources. This renders i…
A tensor model for meta-learning adapts to task-specific features.
Gradient-based meta-RL fails with incorrect task distributions, leading to instability and poor performance.
While domain adaptation has been actively researched in recent years, most theoretical results and algorithms focus on the single-source-single-target adaptation setting. Naive application of such algorithms on multiple source domain adaptation problem may lead to suboptimal solutions. As a step toward bridging the gap…
M-L2O adapts fast to new tasks by self-adapting during test-time.
New method learns robust meta-representations for fast task adaptation.
Learning an efficient update rule from data that promotes rapid learning of new tasks from the same distribution remains an open problem in meta-learning. Typically, previous works have approached this issue either by attempting to train a neural network that directly produces updates or by attempting to learn better i…
The paper tackles learning from similar but not identical linear representations, improving performance over single-task learning.
Framework adapts to new tasks based on prior knowledge.
The study examines how language models learn to represent the world, identifying conditions for ecological veridicality.
New asynchronous SGD algorithms achieve optimal performance in distributed learning.
Deep neural networks have shown promising results for various clinical prediction tasks. However, training deep networks such as those based on Recurrent Neural Networks (RNNs) requires large labeled data, significant hyper-parameter tuning effort and expertise, and high computational resources. In this work, we invest…
This paper bridges MTL and meta-learning, showing their shared structure and efficiency.