paper-with-me

Papers

Putting An End to End-to-End: Gradient-Isolated Learning of Representations

2019-05-28 · NeurIPS 2019 12 · Sindy Löwe, Peter O'Connor, Bastiaan S. Veeling

We propose a novel deep learning method for local self-supervised representation learning that does not require labels nor end-to-end backpropagation but exploits the natural order in data instead. Inspired by the observation that biological neural networks appear to learn without backpropagating a global error signal, we split a deep neural network into a stack of gradient-isolated modules. Each module is trained to maximally preserve the information of its inputs using the InfoNCE bound from Oord et al. [2018]. Despite this greedy training, we demonstrate that each module improves upon the output of its predecessor, and that the representations created by the top module yield highly competitive results on downstream classification tasks in the audio and visual domain. The proposal enables optimizing modules asynchronously, allowing large-scale distributed training of very deep neural networks on unlabelled datasets.

📄 PDF Abstract BibTeX arXiv:1905.11786

Code (1)

loeweX/Greedy_InfoMax 공식 구현 pytorch

Tasks

Representation LearningSelf-Supervised Audio ClassificationSelf-Supervised Image ClassificationSelf-Supervised Learning

Methods 이 논문이 사용한 방법론

1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Feedforward Network A Feedforward Network, or a Multilayer Perceptron (MLP), is a neural network with solely densely connected layers. This is the classic neural network architecture of the…
Bottleneck Residual Block A Bottleneck Residual Block is a variant of the residual block that utilises 1x1 convolutions to create a bottleneck. The…
Bitcoin Customer Service Number +1-833-534-1729 설명 없음
Residual Connection 설명 없음
Residual Block Residual Blocks are skip-connection blocks that learn residual functions with reference to the layer inputs, instead of learning unreferenced functions. They were introduced…
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…

Similar Papers 제목 키워드 기반

Breaking Speech Recognizers to Imagine Lyrics

2019-12-15 · Jon Gillick, David Bamman

We introduce a new method for generating text, and in particular song lyrics, based on the speech-like acoustic qualities of a given audio file. We repurpose a vocal source separation algorithm and an acoustic model trai…

BHN: A Brain-like Heterogeneous Network

2020-05-26 · Tao Liu

The human brain works in an unsupervised way, and more than one brain region is essential for lighting up intelligence. Inspired by this, we propose a brain-like heterogeneous network (BHN), which can cooperatively learn…

Decoding speech perception from non-invasive brain recordings

2022-08-25 · Alexandre Défossez, Charlotte Caucheteux, Jérémy Rapin, Ori Kabeli 외

Decoding speech from brain activity is a long-awaited goal in both healthcare and neuroscience. Invasive devices have recently led to major milestones in that regard: deep learning algorithms trained on intracranial reco…

Contrastive LearningEEGElectroencephalogram (EEG)

Global Convergence of Policy Gradient Methods in Reinforcement Learning, Games and Control

2023-10-08 · Shicong Cen, Yuejie Chi

Policy gradient methods, where one searches for the policy of interest by maximizing the value functions using first-order information, become increasingly popular for sequential decision making in reinforcement learning…

Decision MakingPolicy Gradient Methodsreinforcement-learningSequential Decision Making

Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions

2016-05-02 · Ioannis Panageas, Georgios Piliouras

Given a non-convex twice differentiable cost function f, we prove that the set of initial conditions so that gradient descent converges to saddle points where \nabla^2 f has at least one strictly negative eigenvalue has …

Open-Ended Question Answering