paper-with-me

Papers

Learning to Adapt by Minimizing Discrepancy

2017-11-30 · Alexander G. Ororbia II, Patrick Haffner, David Reitter, C. Lee Giles

We explore whether useful temporal neural generative models can be learned from sequential data without back-propagation through time. We investigate the viability of a more neurocognitively-grounded approach in the context of unsupervised generative modeling of sequences. Specifically, we build on the concept of predictive coding, which has gained influence in cognitive science, in a neural framework. To do so we develop a novel architecture, the Temporal Neural Coding Network, and its learning algorithm, Discrepancy Reduction. The underlying directed generative model is fully recurrent, meaning that it employs structural feedback connections and temporal feedback connections, yielding information propagation cycles that create local learning signals. This facilitates a unified bottom-up and top-down approach for information transfer inside the architecture. Our proposed algorithm shows promise on the bouncing balls generative modeling problem. Further experiments could be conducted to explore the strengths and weaknesses of our approach.

📄 PDF Abstract BibTeX arXiv:1711.11542

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Deep Hashing via Discrepancy Minimization

2018-06-01 · CVPR 2018 6 · Zhixiang Chen, Xin Yuan, Jiwen Lu, Qi Tian 외

This paper presents a discrepancy minimizing model to address the discrete optimization problem in hashing learning. The discrete optimization introduced by binary constraint is an NP-hard mixed integer programming prob…

Deep Hashing

Domain Adaptation: Learning Bounds and Algorithms

2009-02-19 · Yishay Mansour, Mehryar Mohri, Afshin Rostamizadeh

This paper addresses the general problem of domain adaptation which arises in a variety of applications where the distribution of the labeled sample available somewhat differs from that of the test data. Building on prev…

Domain AdaptationGeneralization Bounds

How does the Combined Risk Affect the Performance of Unsupervised Domain Adaptation Approaches?

2020-12-30 · Li Zhong, Zhen Fang, Feng Liu, Jie Lu 외

Unsupervised domain adaptation (UDA) aims to train a target classifier with labeled samples from the source domain and unlabeled samples from the target domain. Classical UDA learning bounds show that target risk is uppe…

Domain AdaptationUnsupervised Domain Adaptation

Manifold Criterion Guided Transfer Learning via Intermediate Domain Generation

2019-03-25 · Lei Zhang, Shan-Shan Wang, Guang-Bin Huang, WangMeng Zuo 외

In many practical transfer learning scenarios, the feature distribution is different across the source and target domains (i.e. non-i.i.d.). Maximum mean discrepancy (MMD), as a domain discrepancy metric, has achieved pr…

Domain AdaptationTransfer LearningUnsupervised Domain Adaptation

Stein Discrepancy for Unsupervised Domain Adaptation

2025-02-05 · Anneke von Seeger, Dongmian Zou, Gilad Lerman

Unsupervised domain adaptation (UDA) leverages information from a labeled source dataset to improve accuracy on a related but unlabeled target dataset. A common approach to UDA is aligning representations from the source…

Domain AdaptationUnsupervised Domain Adaptation