paper-with-me

Papers

Learning Hyperparameters via a Data-Emphasized Variational Objective

2025-02-03 · Ethan Harvey, Mikhail Petrov, Michael C. Hughes

When training large flexible models, practitioners often rely on grid search to select hyperparameters that control over-fitting. This grid search has several disadvantages: the search is computationally expensive, requires carving out a validation set that reduces the available data for training, and requires users to specify candidate values. In this paper, we propose an alternative: directly learning regularization hyperparameters on the full training set via the evidence lower bound ("ELBo") objective from variational methods. For deep neural networks with millions of parameters, we recommend a modified ELBo that upweights the influence of the data likelihood relative to the prior. Our proposed technique overcomes all three disadvantages of grid search. In a case study on transfer learning of image classifiers, we show how our method reduces the 88+ hour grid search of past work to under 3 hours while delivering comparable accuracy. We further demonstrate how our approach enables efficient yet accurate approximations of Gaussian processes with learnable length-scale kernels.

📄 PDF Abstract BibTeX arXiv:2502.01861

Code (1)

tufts-ml/data-emphasized-ELBo 공식 구현 pytorch

Tasks

Gaussian ProcessesImage ClassificationTransfer Learning

Similar Papers 제목 키워드 기반

Learning the Regularization Strength for Deep Fine-Tuning via a Data-Emphasized Variational Objective

2024-10-25 · Ethan Harvey, Mikhail Petrov, Michael C. Hughes

A number of popular transfer learning methods rely on grid search to select regularization hyperparameters that control over-fitting. This grid search requirement has several key disadvantages: the search is computationa…

image-classificationImage ClassificationModel SelectionTransfer Learning+1

How do Variational Autoencoders Learn? Insights from Representational Similarity

2022-05-17 · Lisa Bonheme, Marek Grzes

The ability of Variational Autoencoders (VAEs) to learn disentangled representations has made them popular for practical applications. However, their behaviour is not yet fully understood. For example, the questions of w…

Robust Bayesian Compressed sensing

2016-10-10 · Qian Wan, Huiping Duan, Jun Fang, Hongbin Li

We consider the problem of robust compressed sensing whose objective is to recover a high-dimensional sparse signal from compressed measurements corrupted by outliers. A new sparse Bayesian learning method is developed f…

compressed sensing

Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020

2021-04-20 · Ryan Turner, David Eriksson, Michael McCourt, Juha Kiili 외

This paper presents the results and insights from the black-box optimization (BBO) challenge at NeurIPS 2020 which ran from July-October, 2020. The challenge emphasized the importance of evaluating derivative-free optimi…

Bayesian OptimizationBIG-bench Machine Learning

Isolating Sources of Disentanglement in Variational Autoencoders

2018-02-14 · NeurIPS 2018 12 · Ricky T. Q. Chen, Xuechen Li, Roger Grosse, David Duvenaud

We decompose the evidence lower bound to show the existence of a term measuring the total correlation between latent variables. We use this to motivate our $\beta$-TCVAE (Total Correlation Variational Autoencoder), a ref…

Disentanglement