{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"heinsen_attention","owner":"glassroom","isFork":false,"description":"Reference implementation of \"Softmax Attention with Constant Cost per Token\" (Heinsen, 2024)","allTopics":["attention","attention-mechanism","attention-model","heinsen-attention"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":21,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-11T13:03:08.196Z"}},{"type":"Public","name":"heinsen_position_embeddings","owner":"glassroom","isFork":false,"description":"Reference implementation of \"Encoding Position by Decaying and Updating Different Exponentiated States Differently,\" as proposed by Franz A. Heinsen in March 2024","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-03T16:16:25.809Z"}},{"type":"Public","name":"heinsen_sequence","owner":"glassroom","isFork":false,"description":"Code implementing \"Efficient Parallelization of a Ubiquitious Sequential Computation\" (Heinsen, 2023)","allTopics":["parallel-computing","pytorch","heinsen-sequence"],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":71,"forksCount":3,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,5,0,0,0,0,2,5,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-08T12:24:06.049Z"}},{"type":"Public archive","name":"heinsen_routing_2022_paper","owner":"glassroom","isFork":false,"description":"Instructions for replicating the results in \"An Algorithm for Routing Vectors in Sequences\" (Heinsen, 2022). ","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-08-29T17:02:19.306Z"}},{"type":"Public","name":"heinsen_routing","owner":"glassroom","isFork":false,"description":"Reference implementation of \"An Algorithm for Routing Vectors in Sequences\" (Heinsen, 2022) and \"An Algorithm for Routing Capsules in All Domains\" (Heinsen, 2019), for composing deep neural networks.","allTopics":["deep-learning","paper","routing-algorithm","associative-memory","capsule-network","capsules","em-routing","dense-associative-memory","society-of-mind","pytorch"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":161,"forksCount":17,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-13T03:02:32.531Z"}},{"type":"Public","name":"torch_train_test_loop","owner":"glassroom","isFork":false,"description":"Composable training/testing of PyTorch models with minimal overhead","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-24T23:15:02.238Z"}},{"type":"Public","name":"heinsen_tree","owner":"glassroom","isFork":false,"description":"Reference implementation of \"Tree Methods for Hierarchical Classification in Parallel\" (Heinsen, 2022) in PyTorch.","allTopics":["tree","paper","pytorch","wordnet","classification","hierarchical","hierarchical-classification","heinsen-tree","semantic-tree","wordnet-classification"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":14,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-12-16T16:52:45.882Z"}},{"type":"Public archive","name":"heinsen_routing_2019_paper","owner":"glassroom","isFork":true,"description":"Instructions for replicating the results in \"An Algorithm for Routing Capsules in All Domains\" (Heinsen, 2019).","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":17,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-11-16T23:03:04.356Z"}},{"type":"Public","name":"torch_lsuv_init","owner":"glassroom","isFork":false,"description":"Layer Sequential Unit Variance (LSUV) Initialization for PyTorch","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":1,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-01T00:48:08.989Z"}},{"type":"Public","name":"git-gpg","owner":"glassroom","isFork":false,"description":"Use git on an untrusted server via a GPG-encrypted repository.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":32,"forksCount":4,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-10-16T17:29:36.087Z"}}],"repositoryCount":10,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}