tokenbender tokenbender

rl reward hunter

129 followers · 4 following

LLM post training specialisation
@tokenbender
https://tokenbender.github.io/kautuhal/

View GitHub Profile

Recently created

Least recently created

Recently updated

Least recently updated

tokenbender / normcore-llm.md

Created February 11, 2024 14:36 — forked from veekaybee/normcore-llm.md

Normcore LLM Reads

Anti-hype LLM reading list

Goals: Add links that are reasonable and good explanations of how stuff works. No hype and no vendor content if possible. Practical first-hand accounts of models in prod eagerly sought.

Foundational Concepts

Pre-Transformer Models

tokenbender / graph_101.cpp

Created November 22, 2017 15:08 — forked from abrarShariar/graph_101.cpp

Graph implementation using C++

	/*
	Graph implementation following tutorial http://www.geeksforgeeks.org/graph-and-its-representations/
	*/
	#include<iostream>
	#include<cstdlib>
	using namespace std;

	//struct for an adjacency list node
	struct AdjListNode{
	int data;

tokenbender / AVL Tree.cpp

Created November 22, 2017 15:08 — forked from harish-r/AVL Tree.cpp

AVL Tree Implementation in C++. Self Balancing Tree

	/* AVL Tree Implementation in C++ */
	/* Harish R */


	#include<iostream>

	using namespace std;

	class BST
	{

tokenbender / binary-search-tree.cpp

Last active November 24, 2017 21:01 — forked from mgechev/binary-search-tree-cpp.cpp

Simple implementation of binary search tree in C++.

	#include <iostream>
	#include <math.h>
	using namespace std;

	template <class T>
	struct Node {
	T value;
	Node *left;
	Node *right;

tokenbender / btree.cpp

Created November 22, 2017 15:01 — forked from toboqus/btree.cpp

Binary tree implementation in c++

	#include <iostream>

	using namespace std;


	struct node{
	int value;
	node *left;
	node *right;
	};

tokenbender / disjoint_set_union.h

Created November 22, 2017 15:01 — forked from fyquah/disjoint_set_union.h

Disjoint Set Union Implementation in C++

	#include <cstring>

	class Disjoint_Union
	{
	public:
	Disjoint_Union(const int & n);
	int create();
	void merge(int i , int j);
	int find(const int & i);
	int size(){