Home Projects GradCache
GradCache
Python

GradCache

Run Effective Large Batch Contrastive Learning Beyond GPU/TPU Memory Constraint

by luyug · GitHub
Stars
Forks
Trending
License
Created
Last commit
Language
contrastive-learningdeep-learningembeddingApache-2.0Python
View on GitHub
In plain words

Train machine learning models with large batches without needing expensive hardware, using a single GPU instead.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
GradCache — GitHub preview card
📈 Star history
446443
2026-07-202026-08-31
📈 Track GradCache

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

Run Effective Large Batch Contrastive Learning Beyond GPU/TPU Memory Constraint

GradCache has 446 stars on GitHub. It has been forked 29 times. GradCache is written mainly in Python. It has been in active development since 2021. GradCache is available under the Apache-2.0 license. Its main topics are contrastive-learning, deep-learning, embedding, flax.

Frequently asked questions

What is GradCache?

Run Effective Large Batch Contrastive Learning Beyond GPU/TPU Memory Constraint

Is GradCache open source?

GradCache is an open-source project. It is released under the Apache-2.0 license.

Is GradCache free?

Yes. GradCache is free and open source — you can use, modify and self-host it.

What license does GradCache use?

GradCache is available under the Apache-2.0 license.

What language is GradCache written in?

GradCache is written mainly in Python.

🏅 Maintainer of this project?
olud.ai badge — GradCache

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=luyug-gradcache)](https://olud.ai/project/luyug-gradcache.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.