We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Contrastive unsupervised representation learning (CURL) is the state-of-the-art technique to learn representations (as a set of features) from unlabelled data. While CURL has collected several empirical successes recently, theoretical understanding of its performance was still missing. In a recent work, Arora et al. (2019) provide the first generalisation bounds for CURL, relying on a Rademacher complexity. We extend their framework to the flexible PAC-Bayes setting, allowing us to deal with the non-iid setting. We present PAC-Bayesian generalisation bounds for CURL, which are then used to derive a new representation learning algorithm. Numerical experiments on real-life datasets illustrate that our algorithm achieves competitive accuracy, and yields non-vacuous generalisation bounds.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.04464")
get_code_for_paper("1910.04464")
have("1910.04464")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.04464.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.04464)
Connect an agent — have() is free.