Accelerated linearized Laplace approximation for Bayesian deep learning

Z Deng, F Zhou, J Zhu - Advances in Neural Information …, 2022 - proceedings.neurips.cc
Laplace approximation (LA) and its linearized variant (LLA) enable effortless adaptation of
pretrained deep neural networks to Bayesian neural networks. The generalized Gauss …

Learning neural eigenfunctions for unsupervised semantic segmentation

Z Deng, Y Luo - Proceedings of the IEEE/CVF International …, 2023 - openaccess.thecvf.com
Unsupervised semantic segmentation is a long-standing challenge in computer vision with
great significance. Spectral clustering is a theoretically grounded solution to it where the …

Uni-fusion: Universal continuous mapping

Y Yuan, A Nüchter - IEEE Transactions on Robotics, 2024 - ieeexplore.ieee.org
We present Uni-Fusion, a universal continuous mapping framework for surfaces, surface
properties (color, infrared, etc.) and more (latent features in contrastive language-image …

Improved operator learning by orthogonal attention

Z Xiao, Z Hao, B Lin, Z Deng, H Su - arXiv preprint arXiv:2310.12487, 2023 - arxiv.org
Neural operators, as an efficient surrogate model for learning the solutions of PDEs, have
received extensive attention in the field of scientific machine learning. Among them, attention …

Contrastive learning can find an optimal basis for approximately view-invariant functions

DD Johnson, A El Hanchi… - The Eleventh International …, 2022 - openreview.net
Contrastive learning is a powerful framework for learning self-supervised representations
that generalize well to downstream supervised tasks. We show that multiple existing …

Representations and exploration for deep reinforcement learning using singular value decomposition

Y Chandak, S Thakoor, ZD Guo… - International …, 2023 - proceedings.mlr.press
Abstract Representation learning and exploration are among the key challenges for any
deep reinforcement learning agent. In this work, we provide a singular value decomposition …

A novel stochastic gradient descent algorithm for learning principal subspaces

C Le Lan, J Greaves, J Farebrother… - International …, 2023 - proceedings.mlr.press
Many machine learning problems encode their data as a matrix with a possibly very large
number of rows and columns. In several applications like neuroscience, image compression …

Incorporating prior knowledge into neural networks through an implicit composite kernel

Z Jiang, T Zheng, Y Liu, D Carlson - arXiv preprint arXiv:2205.07384, 2022 - arxiv.org
It is challenging to guide neural network (NN) learning with prior knowledge. In contrast,
many known properties, such as spatial smoothness or seasonality, are straightforward to …

Contrastive Learning as Kernel Approximation

KC Tsiolis - arXiv preprint arXiv:2309.02651, 2023 - arxiv.org
In standard supervised machine learning, it is necessary to provide a label for every input in
the data. While raw data in many application domains is easily obtainable on the Internet …

Spectral representation learning for conditional moment models

Z Wang, Y Luo, Y Li, J Zhu, B Schölkopf - arXiv preprint arXiv:2210.16525, 2022 - arxiv.org
Many problems in causal inference and economics can be formulated in the framework of
conditional moment models, which characterize the target function through a collection of …