{"url":"/task/online-clustering","name":"Online Clustering","slug":"online-clustering","description_markdown":"Models that learn to label each image (i.e. cluster the dataset into its ground truth classes) without seeing the ground truth labels. Under the online scenario, data is in the form of streams, i.e., the whole dataset could not be accessed at the same time and the model should be able to make cluster assignments for new data without accessing the former data.\r\n\r\nImage Credit: [Online Clustering by Penalized Weighted GMM](https://arxiv.org/pdf/1902.02544v1.pdf)","categories":[{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":86,"papers_with_code":28,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/online-clustering-on-cifar10","slug":"online-clustering-on-cifar10","dataset":"cifar10","dataset_url":"/dataset/cifar-10","rows_in_archive":3,"metrics":["online NMI","online ACC","online ARI"],"first_row_in_archive_order":{"model":"OHC","paper_title":"Hard Regularization to Prevent Deep Online Clustering Collapse without Data Augmentation","paper_url":"/paper/hard-regularization-to-prevent-collapse-in","paper_date":"2023-03-29","arxiv_id":"2303.16521","code_links":[{"title":"lou1sm/online_hard_clustering","url":"https://github.com/lou1sm/online_hard_clustering"}],"syntology":null}}],"datasets":[{"url":"/dataset/cifar-10","name":"CIFAR-10","full_name":"CIFAR-10","num_papers_in_archive":16145}],"subtasks":[],"parent_tasks":[{"url":"/task/image-clustering","name":"Image Clustering"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":28,"of":28,"tagged_in_all":86,"items":[{"url":"/paper/croc-cross-view-online-clustering-for-dense","title":"CrOC: Cross-View Online Clustering for Dense Visual Representation Learning","date":"2023-03-23","arxiv_id":"2303.13245","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/twin-contrastive-learning-for-online","title":"Twin Contrastive Learning for Online Clustering","date":"2022-10-21","arxiv_id":"2210.11680","repositories_listed":2,"syntology":null},{"url":"/paper/contrastive-clustering","title":"Contrastive Clustering","date":"2020-09-21","arxiv_id":"2009.09687","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/an-online-algorithm-for-constrained-face","title":"AN ONLINE ALGORITHM FOR CONSTRAINED FACE CLUSTERING IN VIDEOS","date":"2018-09-06","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/leave-no-one-behind-online-self-supervised","title":"Leave No One Behind: Online Self-Supervised Self-Distillation for Sequential Recommendation","date":"2024-03-22","arxiv_id":"2404.07219","repositories_listed":1,"syntology":null},{"url":"/paper/minimizing-return-gaps-with-discrete","title":"RGMComm: Return Gap Minimization via Discrete Communications in Multi-Agent Reinforcement Learning","date":"2023-08-07","arxiv_id":"2308.03358","repositories_listed":1,"syntology":null},{"url":"/paper/boundary-refined-prototype-generation-a","title":"Boundary-Refined Prototype Generation: A General End-to-End Paradigm for Semi-Supervised Semantic Segmentation","date":"2023-07-19","arxiv_id":"2307.10097","repositories_listed":1,"syntology":null},{"url":"/paper/neuro-inspired-efficient-map-building-via","title":"Grid Cell-Inspired Fragmentation and Recall for Efficient Map Building","date":"2023-07-11","arxiv_id":"2307.05793","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/dinosr-self-distillation-and-online","title":"DinoSR: Self-Distillation and Online Clustering for Self-supervised Speech Representation Learning","date":"2023-05-17","arxiv_id":"2305.10005","repositories_listed":1,"syntology":null},{"url":"/paper/hard-regularization-to-prevent-collapse-in","title":"Hard Regularization to Prevent Deep Online Clustering Collapse without Data Augmentation","date":"2023-03-29","arxiv_id":"2303.16521","repositories_listed":1,"syntology":null},{"url":"/paper/novel-class-discovery-for-3d-point-cloud","title":"Novel Class Discovery for 3D Point Cloud Semantic Segmentation","date":"2023-03-21","arxiv_id":"2303.11610","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-back-ends-for-online-speaker","title":"Probabilistic Back-ends for Online Speaker Recognition and Clustering","date":"2023-02-19","arxiv_id":"2302.09523","repositories_listed":1,"syntology":null},{"url":"/paper/online-arbitrary-shaped-clustering-through","title":"Online Arbitrary Shaped Clustering through Correlated Gaussian Functions","date":"2023-02-13","arxiv_id":"2302.06335","repositories_listed":1,"syntology":null},{"url":"/paper/federated-online-clustering-of-bandits","title":"Federated Online Clustering of Bandits","date":"2022-08-31","arxiv_id":"2208.14865","repositories_listed":1,"syntology":null},{"url":"/paper/collaborating-domain-shared-and-target","title":"Collaborating Domain-shared and Target-specific Feature Clustering for Cross-domain 3D Action Recognition","date":"2022-07-20","arxiv_id":"2207.09767","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/revisiting-gaussian-neurons-for-online","title":"Revisiting Gaussian Neurons for Online Clustering with Unknown Number of Clusters","date":"2022-05-02","arxiv_id":"2205.00920","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-deep-embedded-subspace-clustering","title":"Efficient Deep Embedded Subspace Clustering","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-hyperspectral-image-clustering","title":"Large-Scale Hyperspectral Image Clustering Using Contrastive Learning","date":"2021-11-15","arxiv_id":"2111.07945","repositories_listed":1,"syntology":null},{"url":"/paper/catastrophic-interference-in-reinforcement","title":"Catastrophic Interference in Reinforcement Learning: A Solution Based on Context Division and Knowledge Distillation","date":"2021-09-01","arxiv_id":"2109.00525","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/unsupervised-activity-segmentation-by-joint","title":"Unsupervised Action Segmentation by Joint Representation Learning and Online Clustering","date":"2021-05-27","arxiv_id":"2105.13353","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/unsupervised-visual-representation-learning-3","title":"Unsupervised Visual Representation Learning by Online Constrained K-Means","date":"2021-05-24","arxiv_id":"2105.11527","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/group-aware-label-transfer-for-domain","title":"Group-aware Label Transfer for Domain Adaptive Person Re-identification","date":"2021-03-23","arxiv_id":"2103.12366","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}},{"url":"/paper/deep-robust-clustering-by-contrastive","title":"Deep Robust Clustering by Contrastive Learning","date":"2020-08-07","arxiv_id":"2008.03030","repositories_listed":1,"syntology":null},{"url":"/paper/memory-efficient-episodic-control","title":"Memory-Efficient Episodic Control Reinforcement Learning with Dynamic Online k-means","date":"2019-11-21","arxiv_id":"1911.09560","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-continual-learning-and-self","title":"Unsupervised Progressive Learning and the STAM Architecture","date":"2019-04-03","arxiv_id":"1904.02021","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/a-real-time-and-unsupervised-face-re","title":"A real-time and unsupervised face Re-Identification system for Human-Robot Interaction","date":"2018-04-10","arxiv_id":"1804.03547","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-representation-selection-in","title":"Contextual Bandit with Adaptive Feature Extraction","date":"2018-02-03","arxiv_id":"1802.00981","repositories_listed":1,"syntology":null},{"url":"/paper/links-a-high-dimensional-online-clustering","title":"Links: A High-Dimensional Online Clustering Method","date":"2018-01-30","arxiv_id":"1801.10123","repositories_listed":1,"syntology":null}],"syntology_records":9,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}