Showing 3 open source projects for "compression algorithm"

View related business solutions
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Start Free
  • 1
    Torch Pruning

    Torch Pruning

    DepGraph: Towards Any Structural Pruning

    ...The toolkit supports a wide variety of architectures used in computer vision and large language models, making it a flexible solution for model compression tasks.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    FedLab

    FedLab

    A flexible Federated Learning Framework based on PyTorch

    A Python-based framework for federated learning simulation, emphasizing modularity, communication efficiency, and algorithmic flexibility. Supports both server- and client-side customization for research and development purposes.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Bolt ML

    Bolt ML

    10x faster matrix and vector operations

    Bolt is an open-source research project focused on accelerating machine learning and data mining workloads through efficient vector compression and approximate computation techniques. The core idea behind Bolt is to compress large collections of dense numeric vectors and perform mathematical operations directly on the compressed representations instead of decompressing them first. This approach significantly reduces both memory usage and computational overhead when working with...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next