Fetching the paper…
Reading the bibliography…
In this paper we present a new algorithm for online (sequential) inference in Bayesian neural networks, and show its suitability for tackling contextual bandit problems.
“On Multi-Armed Bandit Designs for Dose-Finding Clinical Trials”
Maryam Aziz, Emilie Kaufmann and Marie-Karelle Riviere · 1903
Earlier work this paper cites.
“Introduction to Multi-Armed Bandits”
Aleksandrs Slivkins · 1904
Earlier work this paper cites.
“What Can ResNet Learn Efficiently, Going Beyond Kernels?”
Zeyuan Allen-Zhu and Yuanzhi Li · 1905
Earlier work this paper cites.
“Practical Deep Learning with Bayesian Principles”
Kazuki Osawa et al · 1906
Earlier work this paper cites.
“Subspace Inference for Bayesian Deep Learning”
Pavel Izmailov, Wesley Maddox, Polina Kirichenko, Timur Garipov, Dmitry Vetrov and Andrew Wilson · 1907
Earlier work this paper cites.
“Training Multilayer Perceptrons with the Extended Kalman Algorithm”
Sharad Singhal and Lance Wu · 1988
Earlier work this paper cites.
“Decoupled extended Kalman filter training of feedforward layered networks”
G Puskorius and L Feldkamp · 1991
Earlier work this paper cites.
“A Practical Bayesian Framework for Backpropagation Networks”
David J MacKay · 1992
Earlier work this paper cites.
“Probable networks and plausible predictions — a review of practical Bayesian methods for supervised neural networks”
D. MacKay · 1995
Earlier work this paper cites.
“Bayesian Learning for Neural Networks”, 1995
Radford Neal · 1995
Earlier work this paper cites.
“Catastrophic Forgetting, Rehearsal and Pseudorehearsal”
Anthony Robins · 1995
Earlier work this paper cites.
“Bayesian forecasting and dynamic models”
Mike West and Jeff Harrison · 1997
Earlier work this paper cites.
“Gradient-Based Learning Applied to Document Recognition”
Y. LeCun, L. Bottou, Y. Bengio and P. Haffner · 1998
Earlier work this paper cites.
“Catastrophic forgetting in connectionist networks”
R.. French · 1999
Earlier work this paper cites.
“Hierarchical Bayesian models for regularisation in sequential learning”
N. de Freitas, M. Niranjan and A. Gee · 2000
Earlier work this paper cites.
“The Case for Bayesian Deep Learning”, 2020
Andrew Wilson · 2001
Earlier work this paper cites.
“Bayesian Deep Learning and a Probabilistic Perspective of Generalization”
Andrew Wilson and Pavel Izmailov · 2002
Earlier work this paper cites.
“Parameter-based Kalman filter training: Theory and implementation”
Gintaras Puskorius and Lee Feldkamp · 2003
Earlier work this paper cites.
“Weighted low-rank approximations”
N. Srebro and T. Jaakkola · 2003
Earlier work this paper cites.
“When Do Neural Networks Outperform Kernel Methods?”, 2020
Behrooz Ghorbani, Song Mei, Theodor Misiakiewicz and Andrea Montanari · 2006
Earlier work this paper cites.
“Lessons from the Netflix Prize Challenge”
Robert Bell and Yehuda Koren · 2007
Cited alongside, same era.
“Deep Bayesian Bandits: Exploring in Online Personalized Recommendations”
Dalin Guo, Sofia Ktena, Ferenc Huszar, Pranay Myana, Wenzhe Shi and Alykhan Tejani · 2008
Cited alongside, same era.
“Bayesian Deep Learning via Subnetwork Inference”
Erik Daxberger, Eric Nalisnick, James Allingham, Javier Antor\’an and Jos\’e Hern\’andez-Lobato · 2010
Cited alongside, same era.
“Parametric bandits: The generalized linear case”
Sarah Filippi, Olivier Ltci, Ltci Telecom Paris Cnrs and Telecom Paris Cnrs · 2010
Cited alongside, same era.
“A contextual-bandit approach to personalized news article recommendation”
L. Li, W. Chu, J. Langford and R.. Schapire · 2010
Cited alongside, same era.
“Averaging Weights Leads to Wider Optima and Better Generalization”
Pavel Izmailov, Dmitrii Podoprikhin, Timur Garipov, Dmitry Vetrov and Andrew Wilson · 2018
Later among the works it cites.
“Neural Tangent Kernel: Convergence and Generalization in Neural Networks”
Arthur Jacot, Franck Gabriel and Cl\’ement Hongler · 2018
Later among the works it cites.
“Measuring the Intrinsic Dimension of Objective Landscapes”
Chunyuan Li, Heerad Farkhoor, Rosanne Liu and Jason Yosinski · 2018
Later among the works it cites.
“Variational Continual Learning”
Cuong Nguyen, Yingzhen Li, Thang Bui and Richard Turner · 2018
Later among the works it cites.
“Online natural gradient as a Kalman filter”
Yann Ollivier · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Umang Bhatt et al · 2011
Cited alongside, same era.
“Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions”
Nathan Halko, Per-Gunnar Martinsson and Joel Tropp · 2011
Cited alongside, same era.
“Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms”
L. Li, W. Chu, J. Langford and X. Wang · 2011
Cited alongside, same era.
“Exploration in Online Advertising Systems with Deep Uncertainty-Aware Learning”
Chao Du et al · 2012
Cited alongside, same era.
“Assumed Density Filtering Methods for Learning Bayesian Neural Networks”
Soumya Ghosh, Francesco Delle and Jonathan Yedidia · 2012
Cited alongside, same era.
“On Bayesian Upper Confidence Bounds for Bandit Problems”
Emilie Kaufmann, Olivier Cappe and Aurelien Garivier · 2012
Cited alongside, same era.
“Thompson Sampling for Contextual Bandits with Linear Payoffs”
Shipra Agrawal and Navin Goyal · 2013
Cited alongside, same era.
“Online Structured Laplace Approximations for Overcoming Catastrophic Forgetting”
Hippolyt Ritter, Aleksandar Botev and David Barber · 2018
Later among the works it cites.
Carlos Riquelme, George Tucker and Jasper Snoek · 2018
Later among the works it cites.
“A Tutorial on Thompson Sampling”
Daniel Russo, Benjamin Van, Abbas Kazerouni, Ian Osband and Zheng Wen · 2018
Later among the works it cites.
“Bandit Algorithms”
Tor Lattimore and Csaba Szepesvari · 2019
Later among the works it cites.
“Thompson sampling with approximate inference”
My Phan, Yasin Abbasi-Yadkori and Justin Domke · 2019
Later among the works it cites.
“Deep learning with Bayesian principles”, NeurIPS tutorial, 2020
Mohammad Khan · 2020
Later among the works it cites.
“Recommender systems and their ethical challenges”
Silvia Milano, Mariarosaria Taddeo and Luciano Floridi · 2020
Later among the works it cites.
“Neural Contextual Bandits with UCB-based Exploration”
Dongruo Zhou, Lihong Li and Quanquan Gu · 2020
Later among the works it cites.
“Laplace Redux–Effortless Bayesian Deep Learning”
Erik Daxberger, Agustinus Kristiadi, Alexander Immer, Runa Eschenhagen, Matthias Bauer and Philipp Hennig · 2021
Closest in time.
“What Are Bayesian Neural Network Posteriors Really Like?”
Pavel Izmailov, Sharad Vikram, Matthew Hoffman and Andrew Wilson · 2021
Closest in time.
“Study of the Neural Thompson Sampling algorithm”, 2021
Etienne Levecque and Rony Abecidan · 2021
Closest in time.
“How many degrees of freedom do we need to train deep networks: a loss landscape perspective”, 2021
Brett Larsen, Stanislav Fort, Nic Becker and Surya Ganguli · 2021
Closest in time.
“Online Limited Memory Neural-Linear Bandits with Likelihood Matching”
Ofir Nabati, Tom Zahavy and Shie Mannor · 2021
Closest in time.
“Neural Thompson Sampling”
Weitong Zhang, Dongruo Zhou, Lihong Li and Quanquan Gu · 2021
Closest in time.