paper-with-me

홈 › Papers

Hebbian Graph Embeddings

2019-08-21 · Shalin Shah, Venkataramana Kini

Representation learning has recently been successfully used to create vector representations of entities in language learning, recommender systems and in similarity learning. Graph embeddings exploit the locality structure of a graph and generate embeddings for nodes which could be words in a language, products of a retail website; and the nodes are connected based on a context window. In this paper, we consider graph embeddings with an error-free associative learning update rule, which models the embedding vector of node as a non-convex Gaussian mixture of the embeddings of the nodes in its immediate vicinity with some constant variance that is reduced as iterations progress. It is very easy to parallelize our algorithm without any form of shared memory, which makes it possible to use it on very large graphs with a much higher dimensionality of the embeddings. We study the efficacy of proposed method on several benchmark data sets and favorably compare with state of the art methods. Further, proposed method is applied to generate relevant recommendations for a large retailer.

📄 PDF Abstract BibTeX arXiv:1908.08037

Code (0)

등록된 구현이 없습니다.

Tasks

Recommendation SystemsRepresentation Learning

Similar Papers 제목 키워드 기반

Hebbian-Oscillatory Co-Learning

2026-02-21 · Hasi Hays arxiv

We introduce Hebbian-Oscillatory Co-Learning (HOC-L), a unified two-timescale dynamical framework for joint structural plasticity and phase synchronization in bio-inspired sparse neural architectures. HOC-L couples two r…

Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints

2026-07-17 · Patrick Inoue, Florian Röhrbein, Andreas Knoblauch arxiv

Introduction: Biological systems face anatomical and metabolic constraints, including costly synaptic maintenance and limited connectivity. These constraints favor neural codes that compress behaviorally relevant informa…

Activity-Dependent Plasticity in Morphogenetically-Grown Recurrent Networks

2026-04-03 · Sergii Medvid, Andrii Valenia, Mykola Glybovets arxiv

Developmental approaches to neural architecture search grow functional networks from compact genomes through self-organisation, but the resulting networks operate with fixed post-growth weights. We characterise Hebbian a…

Neural Architecture Search

Embedded Safety-Aligned Intelligence via Differentiable Internal Alignment Embeddings

2025-12-20 · Harsh Rathva, Ojas Srivastava, Pruthwik Mishra arxiv

We introduce Embedded Safety-Aligned Intelligence (ESAI), a theoretical framework for multi-agent reinforcement learning that embeds alignment constraints directly into agents internal representations using differentiabl…

Multi-agent Reinforcement Learning

Do Brain Networks Evolve by Maximizing their Information Flow Capacity?

2015-07-28

We propose a working hypothesis supported by numerical simulations that brain networks evolve based on the principle of the maximization of their internal information flow capacity. We find that synchronous behavior and …