<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Ivan Ilin — Updates</title><description>New blog posts, publications, and projects from Ivan Ilin.</description><link>https://ivanilin.org/</link><item><title>I passed my PhD proposal defense</title><link>https://ivanilin.org/blog/phd-proposal-defense/</link><guid isPermaLink="true">https://ivanilin.org/blog/phd-proposal-defense/</guid><description>My proposal connects LLM pruning, sparse fine-tuning, and pipeline-parallel optimization into one research program.</description><pubDate>Wed, 22 Jul 2026 00:00:00 GMT</pubDate><language>en</language><category>Blog post</category><category>Research</category><category>Milestone</category><category>KAUST</category></item><item><title>Our TRACE project received a KAUST sTRG</title><link>https://ivanilin.org/blog/trace-strg-award/</link><guid isPermaLink="true">https://ivanilin.org/blog/trace-strg-award/</guid><description>A USD 100,000 Small Translational Research Grant will support TRACE, a project for turning textbooks into verified, interactive courses.</description><pubDate>Mon, 01 Jun 2026 00:00:00 GMT</pubDate><language>en</language><category>Blog post</category><category>Projects</category><category>Grant</category><category>KAUST</category></item><item><title>Demystifying Pipeline Parallelism: First Theory for PipeDream</title><link>https://ivanilin.org/publications/#demystifying-pipeline-parallelism</link><guid isPermaLink="true">https://ivanilin.org/publications/#demystifying-pipeline-parallelism</guid><description>Publication — Analyzes PipeDream, a way to train models by splitting their layers across multiple devices. It proves when this pipeline approach converges and shows how outdated updates worsen as more stages are added, clarifying when pipeline parallelism will scale well.</description><language>en</language><category>Publication</category><category>Preprint</category><category>Pipeline parallelism</category><category>Distributed optimization</category><category>Delayed updates</category></item><item><title>First Theory for PipeDream</title><link>https://ivanilin.org/projects/pipeline-parallelism-theory/</link><guid isPermaLink="true">https://ivanilin.org/projects/pipeline-parallelism-theory/</guid><description>Project — Randomized PipeDream captures PipeDream&apos;s stale-weight behavior in an analyzable block-SGD model, revealing how pipeline depth affects convergence.</description><language>en</language><category>Project</category><category>Research / Distributed Optimization</category><category>Pipeline parallelism</category><category>Distributed optimization</category><category>Delayed updates</category></item><item><title>Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method</title><link>https://ivanilin.org/publications/#ringmaster-lmo</link><guid isPermaLink="true">https://ivanilin.org/publications/#ringmaster-lmo</guid><description>Publication — Adapts Muon-style momentum, a promising neural-network optimizer, to distributed systems where workers run at different speeds. By discarding updates that arrive too late, Ringmaster LMO avoids waiting for stragglers while retaining convergence guarantees and strong training performance.</description><language>en</language><category>Publication</category><category>Preprint</category><category>Asynchronous optimization</category><category>Momentum</category><category>Linear minimization oracle</category></item><item><title>Super-Tuning for LLMs</title><link>https://ivanilin.org/projects/sparse-fine-tuning/</link><guid isPermaLink="true">https://ivanilin.org/projects/sparse-fine-tuning/</guid><description>Project — We introduce Super, which selects a sparse trainable support using activation-aware pruning scores, and Supra, a matched-budget sparse-plus-LoRA adapter.</description><language>en</language><category>Project</category><category>Research / Efficient Adaptation</category><category>Sparse fine-tuning</category><category>Efficient adaptation</category><category>LLM pruning</category></item><item><title>Super-Tuning: From Activation-Aware Pruning to Sparse Fine-Tuning</title><link>https://ivanilin.org/publications/#super-tuning</link><guid isPermaLink="true">https://ivanilin.org/publications/#super-tuning</guid><description>Publication — Repurposes activation-aware pruning scores to choose a small, fixed set of LLM weights for fine-tuning. A hybrid version adds LoRA without increasing the trainable-parameter budget, offering a memory-efficient adaptation strategy that performed strongly on arithmetic tasks.</description><language>en</language><category>Publication</category><category>Preprint</category><category>Sparse fine-tuning</category><category>LLM pruning</category><category>Efficient adaptation</category></item><item><title>Starting as a TA for CS 260 at KAUST</title><link>https://ivanilin.org/blog/teaching-cs-260/</link><guid isPermaLink="true">https://ivanilin.org/blog/teaching-cs-260/</guid><description>This fall I am supporting Design and Analysis of Algorithms through office hours, assignments, grading, and exams.</description><pubDate>Sun, 14 Sep 2025 00:00:00 GMT</pubDate><language>en</language><category>Blog post</category><category>Teaching</category><category>Algorithms</category><category>KAUST</category></item><item><title>Efficient LLM pruning at the KAUST Graduate Seminar</title><link>https://ivanilin.org/blog/kaust-graduate-seminar/</link><guid isPermaLink="true">https://ivanilin.org/blog/kaust-graduate-seminar/</guid><description>A recording of my department-wide Computer Science Graduate Seminar talk on efficient pruning of large language models.</description><pubDate>Thu, 17 Apr 2025 00:00:00 GMT</pubDate><language>en</language><category>Blog post</category><category>Talks</category><category>LLM pruning</category><category>KAUST</category></item><item><title>Presenting Thanos at KAUST Rising Stars in AI</title><link>https://ivanilin.org/blog/rising-stars-ai-symposium/</link><guid isPermaLink="true">https://ivanilin.org/blog/rising-stars-ai-symposium/</guid><description>I presented a poster on block-wise LLM pruning at the 2025 KAUST Rising Stars in AI Symposium.</description><pubDate>Thu, 10 Apr 2025 00:00:00 GMT</pubDate><language>en</language><category>Blog post</category><category>Talks</category><category>LLM pruning</category><category>KAUST</category></item><item><title>Hessian of Perplexity for Large Language Models by PyTorch autograd (Open Source)</title><link>https://ivanilin.org/publications/#hessian-of-perplexity</link><guid isPermaLink="true">https://ivanilin.org/publications/#hessian-of-perplexity</guid><description>Publication — Shows how to use PyTorch&apos;s automatic differentiation to compute selected pieces of an LLM&apos;s Hessian—the matrix describing local curvature—and estimate its full diagonal. The open-source implementation makes second-order analysis practical without storing the impossibly large full matrix.</description><language>en</language><category>Publication</category><category>Technical report</category><category>LLM Hessian</category><category>PyTorch autograd</category><category>Second-order methods</category></item><item><title>HIGGS: Pushing the Limits of Large Language Model Quantization via the Linearity Theorem</title><link>https://ivanilin.org/publications/#higgs</link><guid isPermaLink="true">https://ivanilin.org/publications/#higgs</guid><description>Publication — Shows how errors from compressing each LLM layer increase perplexity, a measure of prediction quality. This result enables HIGGS, a quantization method needing no calibration data, and an optimal way to distribute bit widths across layers under a fixed budget.</description><language>en</language><category>Publication</category><category>Conference paper</category><category>Quantization</category><category>LLM compression</category><category>Linearity theorem</category></item><item><title>Pruning LLMs with Thanos</title><link>https://ivanilin.org/projects/thanos/</link><guid isPermaLink="true">https://ivanilin.org/projects/thanos/</guid><description>Project — A block-wise algorithm for pruning large language models using second-order information and coordinated weight compensation.</description><language>en</language><category>Project</category><category>Research / LLM Pruning</category><category>LLM pruning</category><category>Second-order optimization</category><category>Structured sparsity</category></item><item><title>Thanos: A Block-wise Pruning Algorithm for Efficient Large Language Model Compression</title><link>https://ivanilin.org/publications/#thanos</link><guid isPermaLink="true">https://ivanilin.org/publications/#thanos</guid><description>Publication — Prunes LLM weights in blocks, using second-order information about how weights interact to compensate for removals and adaptive masks to revise earlier choices. It supports flexible and hardware-friendly sparsity patterns, reducing model size while preserving accuracy.</description><language>en</language><category>Publication</category><category>Preprint</category><category>LLM pruning</category><category>Second-order optimization</category><category>Structured sparsity</category></item><item><title>From my KAUST master’s thesis to a SANDS seminar</title><link>https://ivanilin.org/blog/kaust-masters-thesis-and-sands/</link><guid isPermaLink="true">https://ivanilin.org/blog/kaust-masters-thesis-and-sands/</guid><description>I completed my master’s work on efficient LLM pruning and presented the Thanos project at the KAUST SANDS seminar.</description><pubDate>Tue, 26 Nov 2024 00:00:00 GMT</pubDate><language>en</language><category>Blog post</category><category>Research</category><category>LLM pruning</category><category>KAUST</category></item><item><title>PV-Tuning: Beyond Straight-Through Estimation for Extreme LLM Compression</title><link>https://ivanilin.org/publications/#pv-tuning</link><guid isPermaLink="true">https://ivanilin.org/publications/#pv-tuning</guid><description>Publication — Studies how to fine-tune LLMs compressed to only one or two bits per parameter. PV-Tuning moves beyond the commonly used straight-through estimator through a more general optimization framework, improving compressed Llama and Mistral models for memory-limited devices.</description><language>en</language><category>Publication</category><category>Conference paper</category><category>Quantization</category><category>LLM compression</category><category>Optimization</category></item><item><title>Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity</title><link>https://ivanilin.org/publications/#shadowheart-sgd</link><guid isPermaLink="true">https://ivanilin.org/publications/#shadowheart-sgd</guid><description>Publication — Designs an asynchronous training method for systems whose workers differ in both computation and communication speed. Shadowheart compresses updates and avoids waiting for slow workers, with proofs that no comparable centralized compressed method can achieve a better overall training time.</description><language>en</language><category>Publication</category><category>Conference paper</category><category>Distributed optimization</category><category>Asynchronous SGD</category><category>Heterogeneity</category></item><item><title>Kimad: Adaptive Gradient Compression with Bandwidth Awareness</title><link>https://ivanilin.org/publications/#kimad</link><guid isPermaLink="true">https://ivanilin.org/publications/#kimad</guid><description>Publication — Monitors changing network bandwidth during distributed training and adjusts each worker&apos;s overall gradient-compression budget, then distributes that budget across neural-network layers to minimize compression error. This reduces communication time while retaining the convergence behavior of fixed-ratio compression.</description><language>en</language><category>Publication</category><category>Workshop paper</category><category>Gradient compression</category><category>Distributed optimization</category><category>Bandwidth awareness</category></item><item><title>3Dzavr: A 3D Engine from Scratch</title><link>https://ivanilin.org/projects/3d-engine/</link><guid isPermaLink="true">https://ivanilin.org/projects/3d-engine/</guid><description>Project — A custom CPU-rendering experiment that grew from a C++ course project into a lightweight game engine and a downloadable online FPS.</description><language>en</language><category>Project</category><category>Engineering / Computer Graphics</category><category>Computer graphics</category><category>Game engine</category><category>C++</category><category>Multiplayer</category></item><item><title>Vectozavr Academy</title><link>https://ivanilin.org/projects/vectozavr-academy/</link><guid isPermaLink="true">https://ivanilin.org/projects/vectozavr-academy/</guid><description>Project — A visual mathematics school that became my first successful business—and then a long-running experiment in AI-assisted education.</description><language>en</language><category>Project</category><category>Education / AI</category><category>Online education</category><category>AI-assisted learning</category><category>Course authoring</category><category>Product development</category></item><item><title>Building a Game Boy with Arduino</title><link>https://ivanilin.org/projects/arduino-gameboy/</link><guid isPermaLink="true">https://ivanilin.org/projects/arduino-gameboy/</guid><description>Project — A pocket console with one joystick, a 128×64 OLED, a homemade PCB, and three games—including a tiny ray-cast 3D engine.</description><pubDate>Thu, 19 Nov 2020 00:00:00 GMT</pubDate><language>en</language><category>Project</category><category>Hardware</category><category>Arduino</category><category>Embedded systems</category><category>Game development</category><category>PCB fabrication</category></item><item><title>A Pseudo-3D Shooter from Scratch</title><link>https://ivanilin.org/projects/pseudo-3d-shooter/</link><guid isPermaLink="true">https://ivanilin.org/projects/pseudo-3d-shooter/</guid><description>Project — A custom C++ ray-casting engine that turned a 2D map into a textured online FPS—with recursive mirrors, reflected gunfire, OBJ maps, and genetic-algorithm bots.</description><pubDate>Mon, 24 Feb 2020 00:00:00 GMT</pubDate><language>en</language><category>Project</category><category>Game Engine / Computer Graphics</category><category>C++</category><category>Ray casting</category><category>Game development</category><category>Multiplayer</category></item><item><title>A 4-Bit Adder Built from 93 Transistors</title><link>https://ivanilin.org/projects/four-bit-adder/</link><guid isPermaLink="true">https://ivanilin.org/projects/four-bit-adder/</guid><description>Project — A hand-soldered binary calculator built from discrete transistors—from Boolean logic and a faulty one-bit prototype to a working four-bit PCB.</description><pubDate>Wed, 14 Aug 2019 00:00:00 GMT</pubDate><language>en</language><category>Project</category><category>Hardware</category><category>Digital logic</category><category>Electronics</category><category>PCB design</category><category>Transistors</category></item><item><title>Vectozavr YouTube Channel</title><link>https://ivanilin.org/projects/vectozavr-youtube/</link><guid isPermaLink="true">https://ivanilin.org/projects/vectozavr-youtube/</guid><description>Project — How a student science blog grew into a Russian-language channel built around one rule: make the project first, then explain what it taught me.</description><language>en</language><category>Project</category><category>Science communication</category><category>Science communication</category><category>Project-based learning</category><category>Mathematics</category><category>Programming</category><category>Electronics</category></item><item><title>ilinblog.ru: A Science Blog Built from Scratch</title><link>https://ivanilin.org/projects/ilinblog/</link><guid isPermaLink="true">https://ivanilin.org/projects/ilinblog/</guid><description>Project — A hand-built 2017 PHP and MySQL science blog that became a workshop for physics, programming, electronics, and learning in public—now preserved as a static archive.</description><language>en</language><category>Project</category><category>Education / Web Development</category><category>Web development</category><category>Science communication</category><category>Educational publishing</category></item><item><title>VoiceCut</title><link>https://ivanilin.org/projects/voicecut/</link><guid isPermaLink="true">https://ivanilin.org/projects/voicecut/</guid><description>Project — An open-source, local-first tool that turns retake-heavy narration into a clean audio or video edit while preserving the speaker&apos;s real voice.</description><language>en</language><category>Project</category><category>Open Source / Audio Processing</category><category>Audio processing</category><category>Speech editing</category><category>Open source</category></item></channel></rss>