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,742 papers · 148 categories

Trend · papers per month

3947891,1831,577 · Jun 202019922001200920172026
48 results for hyperparameter transfer learning

This paper quantifies hyperparameter transfer and finds embedding layer learning rate is key.

problem Quantifying optimal hyperparameters for large language models across scales.
method Developed three metrics to quantify hyperparameter transfer and investigated the importance of embedding layer learning rate.
result Maximal Update (μP) parameterization offers high-quality learning rate transfer compared to standard parameterization (SP).

Extends hyperparameter transfer across model sizes and modules, improving training speed.

problem Training stability and performance of large-scale models with optimal hyperparameters.
method Complete(d)^{(d)} Parameterisation, per-module hyperparameter optimisation and transfer.
result Hyperparameter transfer holds even in the per-module hyperparameter regime, improving training speed.

When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…

2018-02-06abs ↗pdf ↗

nGPT learns to transfer learning rates across model dimensions and token horizons.

problem nGPT does not transfer learning rates across model size and token horizon.
method Combining numerical experiments with alignment exponents, a novel nGPT parameterization νGPT is developed.
result νGPT exhibits learning rate transfer across width, depth, and token horizon.

Residual networks with depthwise hyperparameter scaling transfer optimal hyperparameters across width and depth.

problem The challenge of hyperparameter tuning in deep learning, especially for large models.
method Combining μμP parameterization with residual networks having a residual branch scale of 1/extdepth1/\sqrt{ ext{depth}}.
result Optimal hyperparameters transfer across width and depth in residual networks trained with this parameterization.

Transfer learning improves prediction quality in high-dimensional sparse regression.

problem Selecting hyperparameters for Lasso-based transfer learning algorithms.
method Asymptotic analysis using the replica method.
result Ignoring one type of transferred information has minimal impact on performance.

Transfer learning aims at transferring knowledge from a well-labeled domain to a similar but different domain with limited or no labels. Unfortunately, existing learning-based methods often involve intensive model selection and hyperparameter tuning to obtain good results. Moreover, cross-validation is not possible for…

2019-04-02abs ↗pdf ↗

A cost-efficient method for hyperparameter tuning using multi-fidelity Bayesian optimization.

problem Expensive hyperparameter tuning with limited knowledge transfer methods.
method Amortized Auto-Tuning (AT2) framework for multi-task, multi-fidelity Bayesian optimization.
result AT2 leads to the best hyperparameter recommendation and is more cost-efficient.

Develops hyperparameter transfer methods for Dense Associative Memories.

problem Challenges in transferring hyperparameters for DenseAMs due to unique architecture and activation functions.
method Derives explicit prescriptions for hyperparameter transfer from small to large models.
result Excellent agreement between theoretical and empirical results.

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.

A new method for hyperparameter tuning across multiple datasets and objectives.

problem Hyperparameter tuning for black-box functions, especially across different datasets and objectives.
method Quantile-based regression with Gaussian Copula distribution for semi-parametric modeling, combined with Thompson sampling and Gaussian Copula process.
result Significant improvements in hyperparameter optimization and neural architecture search over state-of-the-art methods.

Automated machine learning aims to automate the whole process of machine learning, including model configuration. In this paper, we focus on automated hyperparameter optimization (HPO) based on sequential model-based optimization (SMBO). Though conventional SMBO algorithms work well when abundant HPO trials are availab…

2019-09-07abs ↗pdf ↗

Bayesian optimisation is a popular technique for hyperparameter learning but typically requires initial exploration even in cases where similar prior tasks have been solved. We propose to transfer information across tasks using learnt representations of training datasets used in those tasks. This results in a joint Gau…

2018-10-15abs ↗pdf ↗

New method improves hyperparameter tuning efficiency across similar tasks.

problem Mismatch between evaluations in current and previous tasks.
method Nested drop-out and auto-relevance determination for learning basis functions of increasing complexity.
result Improves sample efficiency in hyperparameter tuning across different data regimes.

Trans-GCR uses GCR model for node classification, providing theoretical guarantees and superior performance.

problem Challenges in obtaining node classification labels in real-world scenarios.
method Graph Convolutional Multinomial Logistic Regression (GCR) model and transfer learning method based on GCR.
result Trans-GCR provides superior empirical performance and theoretical guarantees.

New method optimizes BO by learning search spaces from past evaluations.

problem Optimizing expensive black-box functions efficiently.
method Automatically designs BO search space from historical data.
result Significant boost in BO performance by reducing search space size.

The study analyzes deep linear networks from random initialization, capturing dynamics and hyperparameter effects.

problem Understanding training dynamics in deep linear networks from random initialization.
method Theoretical analysis of gradient descent dynamics in deep linear networks with random initialization and large data.
result Captures the 'wider is better' effect and hyperparameter transfer effects, contrasting with neural-tangent parameterization.

Develops methods to measure and set function-space learning rates in neural networks.

problem Measuring and optimizing changes in neural network output functions.
method Efficient methods to measure and set function-space learning rates, requiring minimal computational overhead.
result Demonstrates FLeRM (Function-space Learning Rate Matching) for hyperparameter transfer across model scales.

New method saves computational budget by ranking and transferring learning curves.

problem Expensive automated machine learning methods for hyperparameter and neural architecture optimization.
method Tackles as a ranking and transfer learning problem, optimizing a pairwise ranking loss and leveraging learning curves from other datasets.
result Accelerates neural architecture search by a factor of up to 100 without significant performance degradation.

Simplifies transfer learning with deep neural networks using ridge regression.

problem High computational cost of finetuning deep models for transfer learning.
method Leverage the low-rank property of deep neural networks' feature vectors in kernel ridge regression.
result Successful on supervised and semi-supervised transfer learning tasks.

Agents trained with deep reinforcement learning algorithms are capable of performing highly complex tasks including locomotion in continuous environments. We investigate transferring the learning acquired in one task to a set of previously unseen tasks. Generalization and overfitting in deep reinforcement learning are …

2019-09-03abs ↗pdf ↗

Learning from small amounts of labeled data is a challenge in the area of deep learning. This is currently addressed by Transfer Learning where one learns the small data set as a transfer task from a larger source dataset. Transfer Learning can deliver higher accuracy if the hyperparameters and source dataset are chose…

2018-07-30abs ↗pdf ↗

Meta-learning improves neural networks by adapting learning algorithms.

problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.

A new method learns priors for Bayesian optimisation to improve performance.

problem Bayesian optimisation tasks often assume strong similarity, which is violated in many cases.
method Replace strong similarity assumption with shape similarity, learn priors for hyperparameters.
result PLeBO and prior transfer find good inputs in fewer evaluations.

PowerGossip compresses model differences for decentralized deep learning with low-rank linear compressors.

problem Communication bottleneck in decentralized deep learning models.
method Low-rank linear compressors applied on model differences using power iteration steps.
result Asymptotically independent of network and compression, faster convergence, and comparable performance to tuned compression algorithms.

New method μP2μP^2 improves neural network training by scaling perturbations layerwise.

problem Improving neural network performance as models scale up.
method Layerwise perturbation scaling in the infinite-width limit of neural networks.
result Layerwise perturbation scaling ensures all layers are effectively perturbed in the limit.

Automates RL with sample-efficient hyperparameter optimization.

problem Challenges in applying deep RL due to hyperparameter sensitivity and inefficiency.
method Population-based AutoRL framework for meta-optimizing RL algorithms and architectures.
result Reduces the number of environment interactions needed for meta-optimization by up to an order of magnitude.

Proposes learning regularization strength directly from data.

problem Computational expense and data reduction in grid search for deep learning hyperparameters.
method Modified Evidence Lower Bound (ELBo) objective for model selection on full training set.
result Comparable heldout accuracy to grid search with less compute time.

Randomized Geometric Algebra for Convex Neural Networks Optimizes Transfer Learning.

problem Training neural networks to global optimality via convex optimization.
method Randomized algorithms in Clifford's Geometric Algebra for hypercomplex vector spaces.
result Convex optimization and geometric algebra improve LLMs' robustness and reliability in transfer learning.

The paper proposes a method to learn hyperparameters without validation sets, improving efficiency and accuracy.

problem Training large models on limited data to avoid overfitting and reduce validation set usage.
method Gradient-based learning of hyperparameters via a data-emphasized evidence lower bound (ELBO) objective.
result The data-emphasized ELBO reduces hyperparameter search time from 88+ hours to under 3 hours while maintaining comparable accuracy.

Optimal scaling found to depend on operator norm across large models and datasets.

problem Lack of unifying principle for optimal hyperparameter scaling across models and datasets.
method Discovered that optimal scaling is conditioned on the operator norm of the output layer.
result The optimal learning rate/batch size pair (η,B)(η^{\ast}, B^{\ast}) consistently has the same operator norm value.

This work presents an approach to automatically induction for non-greedy decision trees constructed from neural network architecture. This construction can be used to transfer weights when growing or pruning a decision tree, allowing non-greedy decision tree algorithms to automatically learn and adapt to the ideal arch…

2018-11-26abs ↗pdf ↗

A RL-enhanced quantum-inspired algorithm solves combinatorial optimization problems.

problem Optimizing quantum-inspired algorithms for combinatorial problems.
method Reinforcement learning agent tunes hyperparameters of a quantum-inspired algorithm.
result The RL-enhanced algorithm samples high-quality solutions to the Ising problem.

We present an efficient block-diagonal ap- proximation to the Gauss-Newton matrix for feedforward neural networks. Our result- ing algorithm is competitive against state- of-the-art first order optimisation methods, with sometimes significant improvement in optimisation performance. Unlike first-order methods, for whic…

2017-06-12abs ↗pdf ↗

MetaPerturb learns to improve generalization across different tasks and architectures.

problem Improving generalization on unseen data for diverse tasks and architectures.
method MetaPerturb is a meta-learned set-based perturbation function that improves generalization performance across heterogeneous tasks and architectures.
result MetaPerturb significantly outperforms baselines on most tasks and architectures with minimal increase in parameter size and no hyperparameters to tune.

RaNNDy uses randomized neural networks to learn transfer operators efficiently.

problem Efficiently learning transfer operators from data.
method Randomized neural network approach with randomly initialized hidden layers and trained output layer.
result Significant reduction in training time and resources with improved stability.