<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Tannhäuser Gate</title><link>https://tannhausergate.saisur.info/</link><description>Notes on NLP, complexity theory, re-engineering, and computational search.</description><item><title>demosaic</title><link>https://tannhausergate.saisur.info/light/demosaic</link><guid>https://tannhausergate.saisur.info/light/demosaic</guid><pubDate>Sat, 05 Sep 2026 04:21:28 GMT</pubDate><description></description></item><item><title>forward</title><link>https://tannhausergate.saisur.info/light/forward</link><guid>https://tannhausergate.saisur.info/light/forward</guid><pubDate>Sat, 05 Sep 2026 04:21:28 GMT</pubDate><description></description></item><item><title>gamma</title><link>https://tannhausergate.saisur.info/light/gamma</link><guid>https://tannhausergate.saisur.info/light/gamma</guid><pubDate>Sat, 05 Sep 2026 04:21:28 GMT</pubDate><description></description></item><item><title>lumen</title><link>https://tannhausergate.saisur.info/light/lumen</link><guid>https://tannhausergate.saisur.info/light/lumen</guid><pubDate>Sat, 05 Sep 2026 04:21:28 GMT</pubDate><description></description></item><item><title>protobuff</title><link>https://tannhausergate.saisur.info/light/protobuff</link><guid>https://tannhausergate.saisur.info/light/protobuff</guid><pubDate>Sat, 05 Sep 2026 04:21:28 GMT</pubDate><description></description></item><item><title>Amazon Ads, Deeply</title><link>https://tannhausergate.saisur.info/notes/Amazon-Ads</link><guid>https://tannhausergate.saisur.info/notes/Amazon-Ads</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>Why this, why now
Amazon’s advertising business did $56.2 billion in revenue in 2024 [26] - third behind only Google and Meta, and growing faster than either. Unlike the other two, almost all of it is sold one search at a time: a shopper types “mascara for volume”, and in the few</description></item><item><title>Block 1 · The Mechanism: GSP, Reserves, and Learned Auctions</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/01-mechanism</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/01-mechanism</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 1 of 10 · ← Previous · Next →

Time budget
~90 minutes. Read Edelman-Ostrovsky-Schwarz [1] first and work the pricing formula by hand. Skim Varian [2] for the symmetric-equilibrium bounds and Lahaie-Pennock [3] for squashing. Spend a full twenty minutes on the</description></item><item><title>Block 2 · Auction Theory in the Autobidding World</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/02-autobidding-world</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/02-autobidding-world</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 2 of 10 · ← Previous · Next →

Time budget
~90 minutes. Read Aggarwal-Badanidiyuru-Mehta [1] first - it is short and everything else is a reaction to it. Then the value-vs-utility paper [2] and Liaw-Mehta-Perlroth [6] for the price-of-anarchy landscape. Skim t</description></item><item><title>Block 3 · The Prediction Stack, 2021-2026: What pCTR and pCVR Have Become</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/03-prediction-stack</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/03-prediction-stack</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 3 of 10 · ← Previous · Next →

Time budget
~90 minutes. Read the calibration section and its worked example first - it is the part that costs money. Then read SIM and HSTU for the two directions the ranker is being pulled in, and MTGR for the caution. Skim the</description></item><item><title>Block 4 · Reinforcement Learning for Bidding: From MDPs to Generative Policies</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/04-rl-bidding</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/04-rl-bidding</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 4 of 10 · ← Previous · Next →

Time budget
~90 minutes. Read Cai et al. (2017), Wu et al. (2018), and the AIGB paper (2024) in full - together they are the spine of the field. Skim USCB, SORL, and the AuctionNet paper for their formulations and headline number</description></item><item><title>Block 5 · Noam Brown&#39;s Program, and What It Says About Bidding Under Imperfect Information</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/05-brown-bridge</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/05-brown-bridge</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 5 of 10 · ← Previous: RL for bidding · Next: Learning agents in auctions →

Time budget
~75 minutes. Read the Libratus and ReBeL abstracts and the piKL paper’s Section 3 first (35 min); skim Safe and Nested Subgame Solving and Depth-Limited Solving for the def</description></item><item><title>Block 6 · Learning Agents in Auctions: Equilibria, Dynamics, and Collusion</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/06-equilibrium-learning</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/06-equilibrium-learning</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 6 of 10 · ← Previous: Noam Brown’s program · Next: Measurement →

Time budget
~60 minutes. Read Banchio &amp; Skrzypacz and Kolumbus &amp; Nisan in full (25 min); read the abstracts of NPGA, SODA, and Gaitonde et al. (15 min); skim the collusion section and keep the c</description></item><item><title>Block 7 · Measuring Anything Inside an Auction</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/07-measurement</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/07-measurement</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 7 of 10 · ← Previous · Next →

Time budget
~90 minutes. Read Lewis &amp; Rao and Blake &amp; Coey first - together they say the signal is tiny and the naive experiment is biased. Then Li-Zhao-Johari-Weintraub for which way to be wrong instead, and the off-policy secti</description></item><item><title>Block 8 · Amazon in Practice: Controls, Disclosures, and the FTC Case</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/08-amazon-in-practice</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/08-amazon-in-practice</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 8 of 10 · ← Previous · Next →

Time budget
~75 minutes. Read Amazon’s auction help page and the placement-adjustment page first (10 minutes; they are short and load-bearing). Then read the FTC press release and Amazon’s response side by side. Skim the Amazon S</description></item><item><title>Looped Transformers, Deeply</title><link>https://tannhausergate.saisur.info/notes/Looped-Transformers</link><guid>https://tannhausergate.saisur.info/notes/Looped-Transformers</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>
The idea in one minute
A looped transformer reuses the same block of layers to refine a hidden state. More iterations buy more computation without adding model weights. The useful question is whether that extra computation improves the answer, and how to train it without storing</description></item><item><title>Open Problems and a Research Agenda</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/10-open-problems</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/10-open-problems</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 10 of 10 · ← Previous · Back to the day index →
The day ends where the literature does. Everything before this page is settled enough to teach; everything on it is a place where two careful papers disagree, where the theory has a guarantee the practice cannot </description></item><item><title>The Annotated Bibliography: ~300 Papers, Ordered Two Ways</title><link>https://tannhausergate.saisur.info/reading/amazon-ads/09-bibliography</link><guid>https://tannhausergate.saisur.info/reading/amazon-ads/09-bibliography</guid><pubDate>Wed, 02 Sep 2026 00:00:00 GMT</pubDate><description>← Day index · Block 9 of 10 · ← Previous · Next →
This is the card catalogue for the day. Every paper mentioned across the ten blocks appears once, filed under the theme where it does the most work, with a one-line idea and a one-line reason it matters for a Sponsored Products bi</description></item><item><title>First contact</title><link>https://tannhausergate.saisur.info/notes/firstcontact</link><guid>https://tannhausergate.saisur.info/notes/firstcontact</guid><pubDate>Tue, 18 Feb 2025 00:00:00 GMT</pubDate><description>
The first contact of intelligence with the objective intelligible world is its encounter with its own underlying structure. By rendering intelligible this structure, intelligence enables itself to intervene in its own structure and, in doing so, not only to transform itself but </description></item><item><title>Weaponizing SAEs</title><link>https://tannhausergate.saisur.info/notes/weaponizesae</link><guid>https://tannhausergate.saisur.info/notes/weaponizesae</guid><pubDate>Fri, 11 Oct 2024 00:00:00 GMT</pubDate><description>
Welcome to the age of turbo maya-induced schizoprenia
-sponsored by golden-gate adtech

Couple of months ago you might have noticed Golden Gate claude. Researchers effectively found that there appears to be a some features which are highly abstract, multilingual and multimodal.
</description></item><item><title>Program Synthesis</title><link>https://tannhausergate.saisur.info/notes/codesearch</link><guid>https://tannhausergate.saisur.info/notes/codesearch</guid><pubDate>Fri, 21 Jun 2024 00:00:00 GMT</pubDate><description>Program Synthesis is the task of automatically finding programs from the underlying programming language that satisfy user intent expressed in some form of constraints. This is very different from the traditional typical compiler which takes in high-level code and converts it to </description></item><item><title>Fetisization of the prime intellect</title><link>https://tannhausergate.saisur.info/notes/fetesize</link><guid>https://tannhausergate.saisur.info/notes/fetesize</guid><pubDate>Tue, 18 Jun 2024 00:00:00 GMT</pubDate><description>
superficial blurring the lines between intution and intellect, among us and machine, between the real and the virtual.

This work is inspired by works of Sarvepalli Radhakrishnan, François Chollet, Stanford Encyclopedia of Philosophy, works of Reza Negarestani and my inner confl</description></item><item><title>Information Indexing</title><link>https://tannhausergate.saisur.info/notes/informationarch</link><guid>https://tannhausergate.saisur.info/notes/informationarch</guid><pubDate>Sun, 09 Jun 2024 00:00:00 GMT</pubDate><description>
Looking for good content in a world where machines can mass produce content

In this page, i have some disparate notes on information indexing and how smarter LMs break the traditional search engine paradigm. I have recently been puzzled how would search look in a world where in</description></item><item><title>Random quotes</title><link>https://tannhausergate.saisur.info/notes/quotes_random</link><guid>https://tannhausergate.saisur.info/notes/quotes_random</guid><pubDate>Sun, 09 Jun 2024 00:00:00 GMT</pubDate><description>Language, as the domain of the intelligible, is presented as an intrinsically computational process of syntactic structuring and semantic ascent</description></item><item><title>Brotli Compression</title><link>https://tannhausergate.saisur.info/notes/brottl</link><guid>https://tannhausergate.saisur.info/notes/brottl</guid><pubDate>Thu, 09 May 2024 00:00:00 GMT</pubDate><description>Parts of the paper

This choice is motivated by the fact that the distribution of the frequency of a symbol is strongly influenced by its kind (whether it is a length, a distance, or a literal), its context (i.e., its neighboring symbols), and its position in the text. Briefly (s</description></item><item><title>GPT2 Implementation</title><link>https://tannhausergate.saisur.info/notes/gpt2code</link><guid>https://tannhausergate.saisur.info/notes/gpt2code</guid><pubDate>Thu, 02 May 2024 00:00:00 GMT</pubDate><description>Layer Norm Code
class LayerNorm(nn.Module):
    def __init__(self, cfg):
        super().__init__()
        self.cfg = cfg
        self.w = nn.Parameter(t.ones(cfg.d_model))
        self.b = nn.Parameter(t.zeros(cfg.d_model))

    def forward(self, residual):
        # residual: </description></item><item><title>Condition Number</title><link>https://tannhausergate.saisur.info/notes/conditionnumber</link><guid>https://tannhausergate.saisur.info/notes/conditionnumber</guid><pubDate>Sat, 20 Apr 2024 00:00:00 GMT</pubDate><description>Gradient converges exponentially fast to a the global minimum with the rate controlled by the condition number of the function.
The condition number (k_f) is the ratio of the largest  eigenvalue of the Hessian matrix(H) and the smallest eigenvalue of the tangent kernel (K) of the</description></item><item><title>Gradient Descent and optimizers</title><link>https://tannhausergate.saisur.info/notes/optimizers</link><guid>https://tannhausergate.saisur.info/notes/optimizers</guid><pubDate>Sat, 20 Apr 2024 00:00:00 GMT</pubDate><description>Gradient Descent
If wee initialize the parameters at some w_0 \in \mathbb{R}^d, the gradient descent algorithm updates the parameters as follows:
w_{t+1} = w_t - \eta \nabla L(w_t)
where \eta is the learning rate and \nabla L(w_t) is the gradient of the loss function L at w_t.
It</description></item><item><title>Tangent Kernels</title><link>https://tannhausergate.saisur.info/notes/tangentkernel</link><guid>https://tannhausergate.saisur.info/notes/tangentkernel</guid><pubDate>Fri, 19 Apr 2024 00:00:00 GMT</pubDate><description>A tangent kernel for a function F(w)=y, where w \in \mathbb{R}^m and y \in \mathbb{R}^n. A tanget kernel is a matrix K \in \mathbb{R}^{n \times n} is:
K(w)  = \nabla F(w) \cdot \nabla F(w)^T
Essential, it is gradient of the function F at w multiplied with its transpose.
One impor</description></item><item><title>Batch Normalization</title><link>https://tannhausergate.saisur.info/notes/batchnorm</link><guid>https://tannhausergate.saisur.info/notes/batchnorm</guid><pubDate>Sun, 14 Apr 2024 00:00:00 GMT</pubDate><description>Batch normalization is a technique used to normalize the inputs of each layer in such a way that they have a mean of zero and a standard deviation of one.
The algorithm is relatively simple to implement:

Values of x over a mini-batch B = \{x_1, x_2, \ldots, x_m\}
Outputs: \{y_i=</description></item><item><title>Code chunks</title><link>https://tannhausergate.saisur.info/notes/codechunks</link><guid>https://tannhausergate.saisur.info/notes/codechunks</guid><pubDate>Sun, 14 Apr 2024 00:00:00 GMT</pubDate><description>UMT code snippet
import torch
import torch.nn as nn
import torch.optim as optim
from sklearn.model_selection import train_test_split
from torch.utils.data import TensorDataset, DataLoader

# Set the random seed for reproducibility
torch.manual_seed(42)

# Generate sample data fro</description></item><item><title>Math terms i have no idea about</title><link>https://tannhausergate.saisur.info/notes/mathterms</link><guid>https://tannhausergate.saisur.info/notes/mathterms</guid><pubDate>Sun, 14 Apr 2024 00:00:00 GMT</pubDate><description>In this page, we will be discussing some math terms that are used in machine learning and deep learning that i have no idea about.
Lipschitz continuity
Given two metric spaces (X, d_X) and (Y, d_Y), a function f: X \rightarrow Y is said to be Lipschitz continuous if there exists </description></item><item><title>My backlog</title><link>https://tannhausergate.saisur.info/notes/backlog</link><guid>https://tannhausergate.saisur.info/notes/backlog</guid><pubDate>Sun, 14 Apr 2024 00:00:00 GMT</pubDate><description>Reading Backlog
Read but not summarized:

Intelligence and Spirit by Reza Negarestani.

Combines philosophy, mathematics, logic, and computer science


Fanged Noumena by Nick Land

A collection of essays on philosophy, cybernetics, and accelerationism


Neuroplasticity by Moheb C</description></item><item><title>Neural networks</title><link>https://tannhausergate.saisur.info/notes/ff</link><guid>https://tannhausergate.saisur.info/notes/ff</guid><pubDate>Fri, 12 Apr 2024 00:00:00 GMT</pubDate><description>Deep Neural Networks (DNNs) form the backbone of modern machine learning. One of the strength of DNNs is its high expressivity power. This capability to capture any flexible data representation allows deep neural networks to have widespread use from biology or weather prediction.</description></item><item><title>Compression</title><link>https://tannhausergate.saisur.info/notes/compression</link><guid>https://tannhausergate.saisur.info/notes/compression</guid><pubDate>Thu, 11 Apr 2024 00:00:00 GMT</pubDate><description>
My 🥰 favorite part of information theory 🥰

The main engineering goal of compression is to represent a given any sequence x_i, x_2, \ldots, x_n with fewer bits than the original sequence. The main idea is to remove redundancy in the data. Reducing the number of bits is general</description></item><item><title>Curves in Machine Learning</title><link>https://tannhausergate.saisur.info/notes/curves</link><guid>https://tannhausergate.saisur.info/notes/curves</guid><pubDate>Thu, 11 Apr 2024 00:00:00 GMT</pubDate><description>Precision and Recall
Risk and Complexity
Vapnik–Chervonenkis dimension
Bias-Variance Tradeoff</description></item><item><title>Information theory basics</title><link>https://tannhausergate.saisur.info/notes/inftheory</link><guid>https://tannhausergate.saisur.info/notes/inftheory</guid><pubDate>Mon, 08 Apr 2024 00:00:00 GMT</pubDate><description>In this webpage, we will be talking about the basics behind information theory. Before you start, you need to have basic understanding of probability theory and distributions. This page is crucious to understand the basics of how any neural network can model any distribution.
Ent</description></item><item><title>Distributions summarized</title><link>https://tannhausergate.saisur.info/notes/distribution</link><guid>https://tannhausergate.saisur.info/notes/distribution</guid><pubDate>Sun, 07 Apr 2024 00:00:00 GMT</pubDate><description>Bernoulli distribution
The Bernoulli distribution is a discrete probability distribution for a random variable which takes the value 1 with probability p and the value 0 with probability q = 1 - p.
f(k;p) = p^k(1-p)^{1-k} \text{ for } k \in \{0,1\}
Which is basiically, at k=1 (su</description></item><item><title>Loss Functions in detail</title><link>https://tannhausergate.saisur.info/notes/lossfunc</link><guid>https://tannhausergate.saisur.info/notes/lossfunc</guid><pubDate>Sun, 07 Apr 2024 00:00:00 GMT</pubDate><description>Cross-Entropy
Cross-entropy measures the average number of bits needed to encode data from one distribution (the true distribution) using the wrong distribution (the model distribution). It’s used frequently in machine learning to quantify the difference between the true distribu</description></item><item><title>Part 1 Layer</title><link>https://tannhausergate.saisur.info/notes/layerexplain</link><guid>https://tannhausergate.saisur.info/notes/layerexplain</guid><pubDate>Sun, 07 Apr 2024 00:00:00 GMT</pubDate><description>Layer code
Basically represent the equation: Wx+b where W is the weight matrix and b is the bias.
class Layer:
    
    def __init__(M,N):
        self.weight = self.random.random((M,N))
        self.bias = np.zeros(M)
    
    def __forward(x):
        return np.inner(W,x) + sel</description></item><item><title>Transformers from first principles</title><link>https://tannhausergate.saisur.info/notes/transformerdeep</link><guid>https://tannhausergate.saisur.info/notes/transformerdeep</guid><pubDate>Sun, 07 Apr 2024 00:00:00 GMT</pubDate><description>In this page, we will implement Attention is all you need, from scratch. This is a very simple implementation and is not optimized for speed. The goal is to understand the architecture of the transformer. If you are a basic understanding of linear algrebra and python, you should </description></item><item><title>Distance Metrics</title><link>https://tannhausergate.saisur.info/notes/distanemetrics</link><guid>https://tannhausergate.saisur.info/notes/distanemetrics</guid><pubDate>Sat, 06 Apr 2024 00:00:00 GMT</pubDate><description>Hellinger Distance
The Hellinger distance is a measure of the similarity between two probability distributions. It is defined as:
H^2(P,Q) = \frac{1}{2} \sum_{i=1}^{n} (\sqrt{p_i} - \sqrt{q_i})^2
where P and Q are two probability distributions over the same set of n events.
In th</description></item><item><title>Geometry of Meaning by Peter Gardenfors</title><link>https://tannhausergate.saisur.info/notes/geometrymeaning</link><guid>https://tannhausergate.saisur.info/notes/geometrymeaning</guid><pubDate>Sat, 06 Apr 2024 00:00:00 GMT</pubDate><description>
    

In this book, we will be covering the main points of the book. We will be drawing parallels between the cognitive interpretation and computational representation of language models. My aim here is to better understand representation learning in language models but from a c</description></item><item><title>Joint Probability Density Function (JPDF) for Random Matrices</title><link>https://tannhausergate.saisur.info/notes/jpdf</link><guid>https://tannhausergate.saisur.info/notes/jpdf</guid><pubDate>Sat, 06 Apr 2024 00:00:00 GMT</pubDate><description>The Joint Probability Density Function (JPDF) is a fundamental concept in the study of random matrices, particularly in understanding the statistical properties of their eigenvalues. It describes how likely it is to find the eigenvalues of a random matrix within a particular rang</description></item><item><title>Linear Algebra study</title><link>https://tannhausergate.saisur.info/notes/linearalg</link><guid>https://tannhausergate.saisur.info/notes/linearalg</guid><pubDate>Sat, 06 Apr 2024 00:00:00 GMT</pubDate><description>Linear Algebra study
In this webpage, i will be writing notes about my linear algebra study.
Introduction of Random Matrix Theory
Random matrix theory is a branch of mathematical physics that studies the statistical properties of matrices. The theory is motivated by the observati</description></item><item><title>Quaternion</title><link>https://tannhausergate.saisur.info/notes/quaterion</link><guid>https://tannhausergate.saisur.info/notes/quaterion</guid><pubDate>Sat, 06 Apr 2024 00:00:00 GMT</pubDate><description>Quaternion
A quaternion is a type of hypercomplex number that extends complex numbers. It is typically represented as:
q = a + bi + cj + dk
where:

a, b, c, and d are real numbers,
i, j, and k are the fundamental quaternion units.

Quaternions have properties that make them usefu</description></item><item><title>Wigner’s surmise</title><link>https://tannhausergate.saisur.info/notes/wigersurmise</link><guid>https://tannhausergate.saisur.info/notes/wigersurmise</guid><pubDate>Sat, 06 Apr 2024 00:00:00 GMT</pubDate><description>Consider a 2 x 2 GOE matrix  H_s = \left( \begin{array}{cc}
x_1 &amp; x_3 \\
x_3 &amp; x_2 \\
\end{array}\right)  with x_1, x_2 \sim \mathcal{N}(0, 1) and x_3 \sim \mathcal{N}(0, 1/2). What is the pdf  \rho(s)  of the spacing s = \lambda_2 - \lambda_1 between its two eigenvalues (\lambda</description></item><item><title>10Bit</title><link>https://tannhausergate.saisur.info/light/10bit</link><guid>https://tannhausergate.saisur.info/light/10bit</guid><pubDate>Sun, 17 Mar 2024 00:00:00 GMT</pubDate><description>A 10-bit image refers to the bit depth of an image, which is a measure of the number of bits used to represent the color of a single pixel. In a 10-bit image, each color channel of a pixel is represented with 10 bits of data. This means that for a standard RGB (Red, Green, Blue) </description></item><item><title>Bayer JPEG</title><link>https://tannhausergate.saisur.info/light/bayer</link><guid>https://tannhausergate.saisur.info/light/bayer</guid><pubDate>Sun, 17 Mar 2024 00:00:00 GMT</pubDate><description>All of these investigations are from @gennyble, Please go say hi!
The BayerJPEG is a strange format used by the Light L16… sometimes. We don’t yet know when it switches from it’s normal packed 10-bit raw format to this, or why.
BayerJPEG Header



































</description></item><item><title>Light L16 Re-engineering</title><link>https://tannhausergate.saisur.info/lighl16</link><guid>https://tannhausergate.saisur.info/lighl16</guid><pubDate>Sun, 17 Mar 2024 00:00:00 GMT</pubDate><description>In early 2018, Light.co released a groundbreaking camera. It was claimed to be engineering marvel. It takes 16 different images and using computational photogrammetry combines the 16 different images into one. Unfortunately the cameras software was badly executed. In this blog po</description></item><item><title>LRI File</title><link>https://tannhausergate.saisur.info/light/lri</link><guid>https://tannhausergate.saisur.info/light/lri</guid><pubDate>Sun, 17 Mar 2024 00:00:00 GMT</pubDate><description>All of these investigations are from @gennyble, Please go say hi!
Anatomy of an LRI
The file is made up of many blocks, usually 10 or 11 but cases of 40 have occurred.
Blocks start with a header and contain some data. There is always a protobuf message within that data, and somet</description></item><item><title>Ransac</title><link>https://tannhausergate.saisur.info/light/ransac</link><guid>https://tannhausergate.saisur.info/light/ransac</guid><pubDate>Sun, 17 Mar 2024 00:00:00 GMT</pubDate><description>The RANSAC (Random Sample Consensus) algorithm is a robust estimation method used to fit a mathematical model to a dataset that contains outliers. It is widely used in computer vision for tasks such as estimating the fundamental matrix in stereo vision, finding homographies betwe</description></item><item><title>SIFT</title><link>https://tannhausergate.saisur.info/light/sift</link><guid>https://tannhausergate.saisur.info/light/sift</guid><pubDate>Sun, 17 Mar 2024 00:00:00 GMT</pubDate><description>The SIFT (Scale-Invariant Feature Transform) algorithm in OpenCV is a feature detection algorithm used in computer vision tasks to detect and describe local features in images. It’s useful for tasks like object recognition, image stitching, and tracking because it’s invariant to </description></item><item><title>ToF Calibration</title><link>https://tannhausergate.saisur.info/light/tof</link><guid>https://tannhausergate.saisur.info/light/tof</guid><pubDate>Sun, 17 Mar 2024 00:00:00 GMT</pubDate><description>Time-of-Flight Calibration, relates to the calibration process for Time-of-Flight (ToF) cameras or sensors. ToF technology measures the time it takes for light to travel from the sensor to the subject and back, allowing the device to accurately map the distance or depth of object</description></item><item><title>Vignetting</title><link>https://tannhausergate.saisur.info/light/vignetting</link><guid>https://tannhausergate.saisur.info/light/vignetting</guid><pubDate>Sun, 17 Mar 2024 00:00:00 GMT</pubDate><description>Vignetting characterization refers to the process of identifying and measuring vignetting, which is a reduction in image brightness or saturation at the periphery compared to the image center. Vignetting is a common optical phenomenon that can occur for various reasons, such as t</description></item><item><title>Eternal Horizons</title><link>https://tannhausergate.saisur.info/</link><guid>https://tannhausergate.saisur.info/</guid><pubDate>Sun, 10 Mar 2024 00:00:00 GMT</pubDate><description>
A fault in the space-time continuum where two normally distant points of space touch one another


    

Welcome to my blog, I will mainly talk about the NLP, Complexity theory, re-engineering products, lack of meaning in a world approaching AGI and computational search problems</description></item><item><title>Gallery</title><link>https://tannhausergate.saisur.info/gallery</link><guid>https://tannhausergate.saisur.info/gallery</guid><pubDate>Sun, 10 Mar 2024 00:00:00 GMT</pubDate><description>Collection of my favorite pictures

    


Ong-Ard Satrabhandhu is a Thai architect whose work is known for its masterful combination of classical principles and traditional Thai qualities


    


Puppies, by Maruyama Ōkyo, ca. 1790


    


Elephant Family, by Marc Allante


  </description></item><item><title>Startups to Follow</title><link>https://tannhausergate.saisur.info/notes/Startups-to-Follow</link><guid>https://tannhausergate.saisur.info/notes/Startups-to-Follow</guid><pubDate>Sat, 27 Jan 2024 00:00:00 GMT</pubDate><description>Borrowed from Ishan’s blog post
Foundation Models

OpenAI


Anthropic
Adept AI
Cohere
Sakana
xAI

Robotics

Figure
1X
Clone
Prosper
Reason

Open Models

Nous Research
Mistral
ggml
Skunkworks

Alignment

Conjecture
Apollo Research

Finetuning

Glaive

Hardware

Atomic Semi
Etched
</description></item><item><title>Research Whitepapers</title><link>https://tannhausergate.saisur.info/notes/Research</link><guid>https://tannhausergate.saisur.info/notes/Research</guid><pubDate>Tue, 12 Dec 2023 00:00:00 GMT</pubDate><description>




































































TitleLinkDynamoLinkMapReduceLinkTAOLinkThe Google File SystemLinkBigtableLinkCAP TheoremLinkKafkaLinkChubbyLinkLSM TreeLinkSpannerLinkConsistent HashingLinkOut of the Tar PitLinkRaft ConsensusLinkScaling Memcach</description></item><item><title>Systems Whitepapers</title><link>https://tannhausergate.saisur.info/notes/Systems-Whitepapers</link><guid>https://tannhausergate.saisur.info/notes/Systems-Whitepapers</guid><pubDate>Tue, 12 Dec 2023 00:00:00 GMT</pubDate><description>




































































TitleLinkDynamoLinkMapReduceLinkTAOLinkThe Google File SystemLinkBigtableLinkCAP TheoremLinkKafkaLinkChubbyLinkLSM TreeLinkSpannerLinkConsistent HashingLinkOut of the Tar PitLinkRaft ConsensusLinkScaling Memcach</description></item><item><title>Podcasts</title><link>https://tannhausergate.saisur.info/notes/Podcasts</link><guid>https://tannhausergate.saisur.info/notes/Podcasts</guid><pubDate>Mon, 30 Oct 2023 00:00:00 GMT</pubDate><description>
Stanford MLSys Seminar
</description></item><item><title>Productivity Stack</title><link>https://tannhausergate.saisur.info/notes/Productivity-Stack</link><guid>https://tannhausergate.saisur.info/notes/Productivity-Stack</guid><pubDate>Mon, 30 Oct 2023 00:00:00 GMT</pubDate><description>My current productivity stack:

Roam Research
</description></item><item><title>Textbooks</title><link>https://tannhausergate.saisur.info/notes/Textbooks</link><guid>https://tannhausergate.saisur.info/notes/Textbooks</guid><pubDate>Mon, 30 Oct 2023 00:00:00 GMT</pubDate><description>
Elements of Statistical Learning
</description></item><item><title>Sci-Fi Books</title><link>https://tannhausergate.saisur.info/notes/Books</link><guid>https://tannhausergate.saisur.info/notes/Books</guid><pubDate>Sat, 28 Oct 2023 00:00:00 GMT</pubDate><description>Some pages of books

Geometry of Meaning by Peter Gardenfors

</description></item><item><title>Fun blogs</title><link>https://tannhausergate.saisur.info/notes/Internet-Gems</link><guid>https://tannhausergate.saisur.info/notes/Internet-Gems</guid><pubDate>Mon, 23 Oct 2023 00:00:00 GMT</pubDate><description>Hardware

https://siboehm.com/
https://leimao.github.io/
https://highscalability.com/

Software

https://kipp.ly/

Life lessons

https://www.benkuhn.net/
</description></item><item><title>Manifesto</title><link>https://tannhausergate.saisur.info/notes/Manifesto</link><guid>https://tannhausergate.saisur.info/notes/Manifesto</guid><pubDate>Fri, 20 Oct 2023 00:00:00 GMT</pubDate><description>WORK IN PROGRESS
My whole phil:

Complex systems penalizes massive step functions
Most changes around you have increase in variance but mode stays the same
Complexity increases with time but not due to the mean but due to the variance
Computational beats analytical solutions
Neve</description></item><item><title>Library</title><link>https://tannhausergate.saisur.info/notes/Library</link><guid>https://tannhausergate.saisur.info/notes/Library</guid><pubDate>Fri, 06 Oct 2023 00:00:00 GMT</pubDate><description>Have a nice read, hope you find something you like :)
Recs

Podcasts

Programming

Cool Tools

Studying

Textbooks
Courses
</description></item><item><title>Topics to Explore</title><link>https://tannhausergate.saisur.info/notes/Topics-to-Explore</link><guid>https://tannhausergate.saisur.info/notes/Topics-to-Explore</guid><pubDate>Fri, 06 Oct 2023 00:00:00 GMT</pubDate><description>
Terreance Tao Blog
Dominic Cumming substack
Grey Mirror ( haven’t read in a year)
</description></item><item><title>Transformers</title><link>https://tannhausergate.saisur.info/notes/Transformers</link><guid>https://tannhausergate.saisur.info/notes/Transformers</guid><pubDate>Fri, 06 Oct 2023 00:00:00 GMT</pubDate><description>Transformers have been all the rage in the NLP community ever since GPT-3 was released and have recently become more well-known to the public after ChatGPT was released. I’m going to keep track of my favorite ways to learn about the Transformer architecture here.
Papers

Attentio</description></item><item><title>Idea List</title><link>https://tannhausergate.saisur.info/notes/Idea-List</link><guid>https://tannhausergate.saisur.info/notes/Idea-List</guid><pubDate>Wed, 04 Oct 2023 00:00:00 GMT</pubDate><description>Open ideas, if you would want to collaborate on any of these, please let me know. I have done some progress in them but not detailed enoughs

Light L16 stiching algorithm

Replace the method of laplacian blending with a more advanced method. Specifically try Alpha blending and cy</description></item></channel></rss>