Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

53105158210 · Jun 202019922001200920172026
48 results for fast transfer

New framework explains fast transfer of hyperparameters across model scales.

problem Understanding and optimizing hyperparameters for large-scale models.
method Developed a conceptual framework for HP transfer across scale, showing fast transfer is equivalent to useful transfer for compute-optimal grid search.
result Fast transfer of hyperparameters is equivalent to useful transfer for compute-optimal grid search, offering asymptotic computational advantage.

Abstract MDPs enable strategic exploration and fast reward transfer in complex environments.

problem Challenging to learn accurate MDPs for high-dimensional states.
method Learn an abstract MDP over low-dimensional coarse states, using an abstraction function.
result Achieves superhuman performance on Pitfall! and higher reward with fewer samples.

Arbitrary style transfer is an important problem in computer vision that aims to transfer style patterns from an arbitrary style image to a given content image. However, current methods either rely on slow iterative optimization or fast pre-determined feature transformation, but at the cost of compromised visual qualit…

2019-09-27abs ↗pdf ↗

Transfer learning has recently attracted significant research attention, as it simultaneously learns from different source domains, which have plenty of labeled data, and transfers the relevant knowledge to the target domain with limited labeled data to improve the prediction performance. We propose a Bayesian transfer…

2018-01-02abs ↗pdf ↗

Adversarial examples are of wide concern due to their impact on the reliability of contemporary machine learning systems. Effective adversarial examples are mostly found via white-box attacks. However, in some cases they can be transferred across models, thus enabling them to attack black-box models. In this work we ev…

2019-07-14abs ↗pdf ↗

A new method improves EEG classification across subjects efficiently.

problem Challenges in adapting and retaining knowledge for EEG classifiers across different subjects.
method Meta UPdate Strategy (MUPS-EEG) for continuous EEG classification.
result Outperforms current state-of-the-art methods in adapting to new subjects and retaining knowledge of learned subjects.

Symmetric nonnegative matrix factorization (NMF), a special but important class of the general NMF, is demonstrated to be useful for data analysis and in particular for various clustering tasks. Unfortunately, designing fast algorithms for Symmetric NMF is not as easy as for the nonsymmetric counterpart, the latter adm…

2018-11-14abs ↗pdf ↗

In this report, we present a new reinforcement learning (RL) benchmark based on the Sonic the Hedgehog (TM) video game franchise. This benchmark is intended to measure the performance of transfer learning and few-shot learning algorithms in the RL domain. We also present and evaluate some baseline algorithms on the new…

2018-04-10abs ↗pdf ↗

The increasing volume of short texts generated on social media sites, such as Twitter or Facebook, creates a great demand for effective and efficient topic modeling approaches. While latent Dirichlet allocation (LDA) can be applied, it is not optimal due to its weakness in handling short texts with fast-changing topics…

2013-01-24abs ↗pdf ↗

The successful application of general reinforcement learning algorithms to real-world robotics applications is often limited by their high data requirements. We introduce Regularized Hierarchical Policy Optimization (RHPO) to improve data-efficiency for domains with multiple dominant tasks and ultimately reduce require…

2019-06-26abs ↗pdf ↗

This paper presents a novel method for the reconstruction of a neural network connectivity using calcium fluorescence data. We introduce a fast unsupervised method to integrate different networks that reconstructs structural connectivity from neuron activity. Our method improves the state-of-the-art reconstruction meth…

2015-05-30abs ↗pdf ↗

Linearized neural networks provide a fast and interpretable way to adapt models to new settings.

problem Difficulty in understanding and adapting inductive biases of trained neural networks.
method Linearization of neural networks and embedding these biases into Gaussian processes through a kernel designed from the Jacobian.
result Domain adaptation becomes interpretable posterior inference with analytic and scalable computational speed-ups.

Meta-learning, or learning-to-learn, seeks to design algorithms that can utilize previous experience to rapidly learn new skills or adapt to new environments. Representation learning -- a key tool for performing meta-learning -- learns a data representation that can transfer knowledge across multiple tasks, which is es…

2020-02-26abs ↗pdf ↗

The study uses pre-trained neural networks to adjust for confounding in non-tabular data.

problem Neglecting non-tabular data sources can lead to biased ATE estimates.
method Leverages latent features from pre-trained neural networks to adjust for confounding.
result Neural networks can achieve fast convergence rates for ATE estimation with latent features.

Curriculum learning has been successfully used in reinforcement learning to accelerate the learning process, through knowledge transfer between tasks of increasing complexity. Critical tasks, in which suboptimal exploratory actions must be minimized, can benefit from curriculum learning, and its ability to shape explor…

2019-06-13abs ↗pdf ↗

Develops deep learning for fast, accurate option pricing models.

problem Computational efficiency and accuracy in option pricing models.
method Neural network generators solving backward Kolmogorov equations for TPDFs.
result Ultra-fast, highly accurate option pricing models for various asset models.

This thesis advances algorithms and software for QMC, GP, and sciML.

problem Efficient high-dimensional integration, interpolation, and PDE modeling.
method Developed new algorithms and software for QMC, GP, and sciML.
result Efficient and accurate methods for high-dimensional problems.

We develop DTs for PDE models using KL-NN and TL, analyzing TL's moment equations and one-shot learning for exactness.

problem Creating accurate digital twins for systems governed by PDEs under changing conditions.
method We use KL-NN surrogate models and transfer learning to construct DTs, analyzing the moment equations and proposing one-shot and few-shot learning methods.
result For linear PDEs, one-shot TL is exact; for nonlinear PDEs, some parameters can be transferred with minimal error.

Model-Agnostic Meta-Learning (MAML) and its variants have achieved success in meta-learning tasks on many datasets and settings. On the other hand, we have just started to understand and analyze how they are able to adapt fast to new tasks. For example, one popular hypothesis is that the algorithms learn good represent…

2019-10-30abs ↗pdf ↗

Adversarial examples are perturbed inputs designed to fool machine learning models. Adversarial training injects such examples into training data to increase robustness. To scale this technique to large datasets, perturbations are crafted using fast single-step methods that maximize a linear approximation of the model'…

2017-05-19abs ↗pdf ↗

Generative AI improves surrogate models by blending LF and HF data.

problem Data scarcity between high-fidelity and low-fidelity simulations.
method Probabilistic multi-fidelity surrogate framework using generative transfer learning.
result The model achieves HF accuracy with fewer HF evaluations.

ClimART dataset benchmarks ML emulators for atmospheric RT in climate models.

problem Lack of a comprehensive dataset and standardized practices for ML benchmarking in climate models.
method Builds ClimART, a large dataset with over 10 million samples, and presents novel baselines.
result Indicates shortcomings of prior datasets and network architectures.

Curriculum learning in reinforcement learning is a training methodology that seeks to speed up learning of a difficult target task, by first training on a series of simpler tasks and transferring the knowledge acquired to the target task. Automatically choosing a sequence of such tasks (i.e. a curriculum) is an open pr…

2018-12-01abs ↗pdf ↗

In this work, we propose a novel meta-learning approach for few-shot classification, which learns transferable prior knowledge across tasks and directly produces network parameters for similar unseen tasks with training samples. Our approach, called LGM-Net, includes two key modules, namely, TargetNet and MetaNet. The …

2019-05-15abs ↗pdf ↗

Meta-learning has been proposed as a framework to address the challenging few-shot learning setting. The key idea is to leverage a large number of similar few-shot tasks in order to learn how to adapt a base-learner to a new task for which only a few labeled samples are available. As deep neural networks (DNNs) tend to…

2019-10-07abs ↗pdf ↗

Improved neural network models predict molecular and material properties efficiently.

problem Training neural networks for accurate interatomic potentials is computationally expensive.
method Gaussian moment-based neural networks with improved architecture and active learning.
result The new models achieve high accuracy and reduced training times.

This paper presents a general graph representation learning framework called DeepGL for learning deep node and edge representations from large (attributed) graphs. In particular, DeepGL begins by deriving a set of base features (e.g., graphlet features) and automatically learns a multi-layered hierarchical graph repres…

2017-04-28abs ↗pdf ↗

Meta-learning approach improves object detection on new classes.

problem Deterioration of object detection performance on old classes in incremental settings.
method Meta-learning to reshape model gradients for optimal task adaptation.
result Meta-learning approach outperforms state-of-the-art methods in incremental object detection.