paper-with-me

홈 › Papers

Bayesian Convolutional Deep Sets with Task-Dependent Stationary Prior

2022-10-22 · Yohan Jung, Jinkyoo Park

Convolutional deep sets are the architecture of a deep neural network (DNN) that can model stationary stochastic process. This architecture uses the kernel smoother and the DNN to construct the translation equivariant functional representations, and thus reflects the inductive bias of the stationarity into DNN. However, since this architecture employs the kernel smoother known as the non-parametric model, it may produce ambiguous representations when the number of data points is not given sufficiently. To remedy this issue, we introduce Bayesian convolutional deep sets that construct the random translation equivariant functional representations with stationary prior. Furthermore, we present how to impose the task-dependent prior for each dataset because a wrongly imposed prior forms an even worse representation than that of the kernel smoother. We validate the proposed architecture and its training on various experiments with time-series and image datasets.

📄 PDF Abstract BibTeX arXiv:2210.12363

Code (0)

등록된 구현이 없습니다.

Tasks

Inductive BiasTime SeriesTime Series AnalysisTranslation

Methods 이 논문이 사용한 방법론

Deep Sets 설명 없음

Similar Papers 제목 키워드 기반

Convolutional Spectral Kernel Learning

2020-02-28 · Jian Li, Yong liu, Weiping Wang

Recently, non-stationary spectral kernels have drawn much attention, owing to its powerful feature representation ability in revealing long-range correlations and input-dependent characteristics. However, non-stationary …

BOF-UCB: A Bayesian-Optimistic Frequentist Algorithm for Non-Stationary Contextual Bandits

2023-07-07 · Nicklas Werge, Abdullah Akgül, Melih Kandemir

We propose a novel Bayesian-Optimistic Frequentist Upper Confidence Bound (BOF-UCB) algorithm for stochastic contextual linear bandits in non-stationary environments. This unique combination of Bayesian and frequentist p…

Decision MakingMulti-Armed BanditsSequential Decision Making

Sequential Monte Carlo Bandits

2018-08-08 · Iñigo Urteaga, Chris H. Wiggins

We extend Bayesian multi-armed bandit (MAB) algorithms beyond their original setting by making use of sequential Monte Carlo (SMC) methods. A MAB is a sequential decision making problem where the goal is to learn a polic…

Decision MakingSequential Decision MakingThompson Sampling

A Mutually-Dependent Hadamard Kernel for Modelling Latent Variable Couplings

2017-02-27 · Sami Remes, Markus Heinonen, Samuel Kaski

We introduce a novel kernel that models input-dependent couplings across multiple latent processes. The pairwise joint kernel measures covariance along inputs and across different latent signals in a mutually-dependent f…

Bayesian InferenceClassificationEEGElectroencephalogram (EEG)+1

Bayesian Optimization with Informative Covariance

2022-08-04 · Afonso Eduardo, Michael U. Gutmann

Bayesian optimization is a methodology for global optimization of unknown and expensive objectives. It combines a surrogate Bayesian regression model with an acquisition function to decide where to evaluate the objective…

Bayesian OptimizationGaussian Processesglobal-optimizationregression