had my first on-site interview in gurugram for a (so-called) tech role.
the hiring manager looked at my resume & written assessment, then said, "you're too much for this role. decide wisely. this isn't a complete tech company."
i took the advice. rejected myself and walked away
built a prompt compression engine that reduces llm prompts by up to 70% while preserving semantic meaning.
it uses textrank + bart for compression, minilm for similarity scoring, and tiktoken to measure token and api cost savings.
one interesting result from the regularization
increasing Ξ³ aggressively reduced tree complexity.
Ξ³ = 0 β ~6 leaves/tree
Ξ³ = 1 β ~3 leaves/tree
Ξ³ = 5 β ~1.5 leaves/tree
yet auc remained around 0.992β0.994.