Ishaan Ansari

169 posts

Ishaan Ansari banner
Ishaan Ansari

Ishaan Ansari

@iamihansari

AI • Software Engineering • Distributed Systems

Katılım Şubat 2016
1K Takip Edilen42 Takipçiler
Sabitlenmiş Tweet
Ishaan Ansari
Ishaan Ansari@iamihansari·
Learning machines!
English
0
0
0
842
ali
ali@waterloo_intern·
it took 1 intern 3 months of continuous work, but eventually, a quantization method that beat every other algo in the market, including @nvidia's official modelopt to explain why this matters, i ask for exactly 69 seconds of your attention (275 words @ avg reading speed of 238 wpm): frontier models (like glm52) are huge (~0.8T params). as released, each parameter takes 2 bytes (bf16), so overall size is about 1.6 tb a b200 has 180gb of memory. a node of 8 gives you 1.44 tb, barely fits weights, much less activations / kv cache must quantize the model (reduce the size of each individual parameters) to serve. fp8 quantization means each parameter takes 1 byte (fits in 0.8 tb), fp4 takes 1/2 a byte (fits in 0.4 tb) cutting the model to a quarter its original size is necessary for it to run a) cheap b) fast, and every lab serving models does this. but, quantization lobotomizes the model if not done correctly (this is why you see people complain about @AnthropicAI nerfing claude or @OpenAI nerfing codex) there are currently several algorithms (like Nvidia's official model-opt) that attempt to figure how to quantize a model with the least amount of damage. they find the redundant layers that can be slashed, and sensitive/important layers that need to stay in full-precision. these algo's have two drawbacks: 1) they take a long time to run 2) they quite often result in a sub-optimal configuration for the past 3 months, a research (and, as always, waterloo) intern on our model perf team (@the_joshua_hill) came up with a new quant algorithm. it consistently finds the optimal configuration: a) in less time than SOTA b) with more aggressive quant than SOTA c) scoring higher on benchmarks than SOTA achieving just one of the above is a feat on its own. all three...excited for the paper to come out this week
ali tweet mediaali tweet mediaali tweet mediaali tweet media
Joshua Hill@the_joshua_hill

Some teaser results for a new quantization method we've been cooking up🧑‍🍳 GLM 5.2 is getting even faster

English
27
62
916
70.3K
Neha Sharma
Neha Sharma@hellonehha·
New purchase. Bought “ How to build a spitfire” for hubby. I have to read for him to tell the story. “The midnight train” is from the same author of midnight library. Lady at the bookstore cash counter said - her daughter loved it. “The librarian” - because the bottom line of this book is - how joy of reading can change the life (will see)
Neha Sharma tweet mediaNeha Sharma tweet mediaNeha Sharma tweet mediaNeha Sharma tweet media
English
3
0
15
907
Ishaan Ansari
Ishaan Ansari@iamihansari·
Graph algorithms are exactly what keep me coming back to these coding puzzles.
Ishaan Ansari tweet media
English
0
0
2
20
Ishaan Ansari
Ishaan Ansari@iamihansari·
Whether you're a senior professional at 32 or an ambitious 21 year old. Same pill for all!
Shubh Jain@shubh19

DSA Preparation Roadmap (From Zero to OA Ready) 1. Sliding Window: 3, 76, 209, 424, 567, 904 2. Two Pointers: 11, 15, 16, 18, 42, 167 3. Fast/Slow Pointers (Linked List): 141, 142, 19, 876, 160, 234 4. Binary Search on Sorted Data: 33, 34, 35, 153, 162, 704 5. Binary Search on Answer: 875, 1011, 410, 774, 1283, 1482 6. Hashing / Frequency Maps: 1, 49, 128, 217, 242, 347 7. Prefix Sum / Running Sum: 303, 560, 724, 930, 974, 523 8. Difference Array / Range Updates: 370, 1094, 1109, 1893, 1943, 2381 9. Monotonic Stack: 739, 496, 503, 84, 85, 901 10. Monotonic Queue / Deque: 239, 862, 1425, 1438, 1499, 1696 11. Heap / Top K: 215, 347, 692, 703, 973, 1046 12. Intervals: 56, 57, 252, 253, 435, 452 13. Greedy Scheduling / Sorting: 45, 55, 406, 621, 763, 134 14. Linked List Manipulation: 21, 23, 24, 25, 92, 138 15. Tree DFS: 104, 112, 113, 543, 124, 226 16. Tree BFS / Level Order: 102, 103, 199, 515, 637, 116 17. BST Problems: 98, 99, 230, 235, 450, 700 18. Backtracking Basics: 46, 47, 77, 78, 90, 39 19. Backtracking with Constraints: 40, 17, 79, 131, 51, 52 20. Graph BFS / DFS: 200, 695, 733, 994, 1091, 1254 21. Topological Sort / DAG: 207, 210, 802, 1462, 1203, 2115 22. Union Find / DSU: 547, 684, 1319, 1579, 990, 1202 23. Shortest Path: 743, 787, 1514, 1631, 1334, 1976 24. MST / Graph Greedy: 1584, 1135, 1168, 1489, 778, 1102 25. Trie: 208, 211, 212, 648, 677, 1268 26. Bit Manipulation: 136, 137, 191, 338, 268, 190 27. 1D DP Basics: 70, 198, 213, 322, 279, 300 28. Knapsack / Subset DP: 416, 494, 518, 474, 1049, 879 29. Grid DP: 62, 63, 64, 221, 931, 120 30. String DP / Sequence DP: 1143, 72, 115, 583, 97, 1312 How to use this list?  - These numbers are Leetcode problem numbers - Do 3 patterns at a time, not all 30 together. - For each pattern, solve the first 2 to understand the idea, the next 2 to get repetition, and the last 2 to stretch yourself. - After every pattern, write one reusable template from memory. - Do not just “solve and move on.” Ask: what signal in the question pointed to this pattern? - If you get stuck, revisit the same pattern after 3 to 4 days. Pattern recognition is built by spacing, not cramming.

English
0
0
1
53
Ishaan Ansari
Ishaan Ansari@iamihansari·
@mayukh_panja So what do you suggest shall some go for master’s or wait for the right opportunity to relocate?
English
0
0
0
23
Ishaan Ansari
Ishaan Ansari@iamihansari·
Unpopular opinion: If you're an ambitious professional, your obsession with "reading more" is a trap. We are constantly sold a lie that reading more is the ultimate habit for successful people. Yet, in the rush to consume volume, you often end up collecting titles rather than acquiring wisdom. The fact of the matter is that your mind only retains a fraction of the knowledge by the time you reach the last page of any book. This isn't for people who read to be entertained. This is for people who read to act upon it consciously. When you stop obsessing over book counts and start re-reading the same high-impact texts, something shifts. You stop forgetting, and you start articulating ideas without missing the essence of what the author was trying to convey. You start taking action on autopilot because the wisdom is finally hardwired into your brain. Don't map out a massive reading list. You don't need a complete path. Just take the first step: Pick the ONE book that solves your biggest current problem, or that you think aligns with your future self, and commit to reading it a second time.
English
0
0
1
65
Ishaan Ansari
Ishaan Ansari@iamihansari·
~ Two Cents - Understanding the scale of the system is also crucial here to make a feasible retrieval system. As your corpus grows, the infra. cost of storing, indexing, and updating those vectors goes up significantly. The trade-off extends beyond retrieval metrics into system constraints, especially with memory-intensive indices like HNSW. - Implementing preprocessing filters like MinHash/LSH for deduplication, semantic outlier removal, and document structure normalization preserves index sparsity, stabilizes query latency, and ensures that the computational cost of vector maintenance scales predictably with actual information gain.
Prateek Chhikara@pckraftwerk

One lesson from building retrieval systems - adding more documents doesn't always improve performance. If your corpus contains duplicates, outdated information, noisy chunks, or inconsistent formatting, retrieval quality can actually get worse. Relevant documents get pushed lower in the rankings, hurting metrics like MRR and Recall@k. Sometimes the best way to improve a retrieval system isn't adding more data, rather cleaning the data you already have.

English
0
0
1
86
Ishaan Ansari
Ishaan Ansari@iamihansari·
- Students who are looking to build open-source contributions credentials are encouraged to open an issue to detail their approach before implementing a feature - Follow the constraints outlined in CONTRIBUTING.md and start here: github.com/Ishaan-Ansari/…
English
0
0
1
24
Ishaan Ansari
Ishaan Ansari@iamihansari·
Although not a big fan of Vibe coding, I still decided to quench my curiosity with @emergentlabs - Just shipped Stride, which delivers your day's exercises like a daily mission briefing. Mon–Sat workouts, Sunday rest, streak tracking that respects rest days, and a 12-week activity heatmap Features - Streak Algorithm: Walks backwards from today to calculate streaks. Protected rest days (Sundays) are skipped - Automated Drops: An APScheduler cron job runs at 06:30 server time, triggering the @resend to deliver the day's payload as a styled HTML email -Data Visualization: Incorporates a 12-week GitHub-style heatmap that renders complete, partial, missed, and rest cells Roadmap - Dynamic scheduler honoring reminder_time setting - Per-exercise weight tracking + progress graphs - Telegram bot integration for daily plan sharing - Pre-built program templates (PPL, 5x5, Upper/Lower) - Personal record (PR) tracker - Rest timer - Export progress to CSV/PDF - Multi-user auth Open Source & Developer Contributions - The project is fully open source. Now inviting developers to contribute and optimize the build. - To set up your local environment, review the container configurations, schema validations, and PR workflows outlined directly within README.md and CONTRIBUTING.md. - Fork the repository, test your endpoints end-to-end via Swagger or curl, and ship tight code!
Ishaan Ansari tweet media
English
1
0
1
97
Poojan Shah @ ICML 2026 🇰🇷
Poojan Shah @ ICML 2026 🇰🇷@PoojanShah6380·
Hi Everyone, introducing myself here : - Joining @MistralAI as an AI Scientist - Just graduated from @cseiitd, where I worked on large-scale clustering algorithms with provable theoretical guarantees, published @icmlconf 2026 - Also worked on quantum and quantum-inspired algorithms for clustering, published @iclr_conf 2025 - Much of my work explores how structural assumptions can break through worst-case computational barriers - Had a great time exploring stuff: training vaes for SSL @WadhwaniAI and designing quantum crypto primitives @quantumlah - Outside research I play tabla, try to pick up languages and read about anthropology, science, history and social history - In highschool I did lots of physics - Check out my website: poojancshah.github.io, feedback appreciated Planning to share random technical and non-technical stuff here. Always happy to talk about research !
English
19
11
645
40.3K
Ishaan Ansari retweetledi
Nick
Nick@nickcammarata·
intelligence is the second most interesting thing about the brain and it’s a very distant second
English
46
37
1.6K
177.7K
Ishaan Ansari
Ishaan Ansari@iamihansari·
The goal is to increase the "SIGNAL" and reduce the "NOISE"
English
0
0
2
130