Cited by 0Software Engineering ResearchSoftware System Performance and ReliabilityCloud Computing and Resource Management

Debloating Machine Learning Systems

Open access
Zhang, Huaifeng·2025

Abstract

In recent decades, Machine Learning (ML) has rapidly evolved from an academic pursuit into a cornerstone of modern industries, with applications spanning manufacturing, healthcare, finance, transportation, etc.. The emergence of large language models (LLMs) has further accelerated this growth, driving unprecedented demand for ML systems capable of supporting models of widely varying scales and data modalities. Despite the growing importance of ML systems, the problem of software bloat within them remains underexplored. Software bloat usually refers to unnecessary code, files, or dependencies. It degrades performance, increases resource consumption, and introduces security risks. With the rise of containerized applications as a common deployment method for ML, the problem is further exacerbated: containers must package not only applications but also all associated libraries and dependencies, leading to significant overhead. This thesis investigates bloat in ML systems across multiple layers, from ML containers to ML shared libraries. This thesis introduces novel techniques to measure, analyze, and mitigate bloat in ML systems. The main contributions are: (A) MMLB: a framework for measuring ML bloat that quantifies container-level bloat and identifies its causes, showing that ML containers are substantially more bloated than general-purpose containers and ML shared libraries are the major source of bloat. (B) BLAFS: a bloat-aware file system that efficiently and effectively reduces file bloat in ML containers by detecting and removing unused files. (C) RTrace: a tracer that accurately identifies functions executed in shared libraries, improving the visibility of shared library execution and enabling precise detection of host-code bloat. (D) MERGESHUFFLE: a tool that removes unused code from shared libraries while preserving functionality and improving performance and security. (E) Negative-ML: This work reveals that ML shared libraries are different from generic libraries: while the latter contain only host code, ML shared libraries include both host code and device code, the latter targeting GPUs and significantly contributing to their size. Negative-ML presents a holistic debloating approach that targets both host and device code, representing the first systematic investigation of device-code bloat. This thesis thus offers both a systematic understanding of software bloat in ML systems and practical techniques to mitigate it, contributing to more efficient, secure, and sustainable deployment of ML in real-world environments.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.63959/chalmers.dt/5769

Cites

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Training efficiency can be improved by overlapping computation and communication in specific scenarios, such as GEMM and all-to-all sequence in expert parallelism, or GEMM followed by AllReduce and ReduceScatter in tensor parallelism.

    “Furthermore, training efficiency can be improved by overlapping computation and communication in specific scenarios, such as general matrix multiplication (GEMM) and all-to-all sequence in expert parallelism [159], or GEMM followed by AllReduce and ReduceScatter in tensor parallelism [149].”

    From A Survey of Large Language Models (2026) · cites this paper as [159]

    The citation to this source follows the tensor-parallelism example, so that is the part assessed. Section 7.4 discusses performance improvements from debloating shared libraries, but does not address overlapping computation and communication or GEMM followed by AllReduce and ReduceScatter. Searches for those terms and for tensor parallelism found no supporting passage in our copy. (LLM, conf=0.73)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

The citation lists haven’t been fetched yet

Research works printed but not linked: 3

  1. H.F. Zhang, M. Alhanahnah, P. Leitner, and A. Ali-Eldin "BLAFS: A Bloat Aware Container File System" Proceedings of the 16th ACM Symposium on Cloud Computing (SoCC), 2025.
  2. H.F. Zhang, and A. Ali-Eldin "RTrace: Towards Better Visibility of Shared Library Execution" Proceedings of the 33rd Network and Distributed System Security (NDSS) Symposium, 2026.
  3. H.F. Zhang, and A. Ali-Eldin "The Hidden Bloat in Machine Learning Systems" Proceedings of the 8th Conference on Machine Learning and Systems (MLSys), 2025. ix

Authors
Zhang, H.
Affiliations
Chalmers University of Technology (SE)
Corresponding author
Zhang, Huaifeng
Published
2025-10-20
OpenAlex
W4415352590
Cited by
0
References
0
Type
dissertation
Language
en
Open access
Locations
Chalmers Research (Chalmers University of Technology) (submittedVersion)
Funders
Knut och Alice Wallenbergs Stiftelse
Topics
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
  • Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
Keywords
software bloat, large language models, resource efficiency, security risks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review