{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":86,"of":86,"of_with_code":28,"tagged_in_all":86,"counts":{"archive_papers_tagged":86,"with_a_code_link":28,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":86,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/croc-cross-view-online-clustering-for-dense","slug":"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":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/croc-cross-view-online-clustering-for-dense#ran","syntology_url":"https://syntology.ai/paper/2303.13245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13245"}},"official":{"repos":["stegmuel/croc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/twin-contrastive-learning-for-online","slug":"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","slug":"contrastive-clustering","title":"Contrastive Clustering","date":"2020-09-21","arxiv_id":"2009.09687","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":2,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contrastive-clustering#ran","syntology_url":"https://syntology.ai/paper/2009.09687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.09687"}},"official":{"repos":["Yunfan-Li/Contrastive-Clustering"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/an-online-algorithm-for-constrained-face","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/neuro-inspired-efficient-map-building-via#ran","syntology_url":"https://syntology.ai/paper/2307.05793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.05793"}},"official":{"repos":["fietelab/farmap"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/dinosr-self-distillation-and-online","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/collaborating-domain-shared-and-target#ran","syntology_url":"https://syntology.ai/paper/2207.09767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09767"}},"official":{"repos":["canbaoburen/CoDT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/revisiting-gaussian-neurons-for-online","slug":"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","slug":"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","slug":"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","slug":"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":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/catastrophic-interference-in-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2109.00525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00525"}},"official":{"repos":["sweety-dm/interference-aware-deep-q-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-activity-segmentation-by-joint","slug":"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":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-activity-segmentation-by-joint#ran","syntology_url":"https://syntology.ai/paper/2105.13353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13353"}},"official":{"repos":["trquhuytin/TOT-CVPR22"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-visual-representation-learning-3","slug":"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":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-visual-representation-learning-3#ran","syntology_url":"https://syntology.ai/paper/2105.11527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11527"}},"official":{"repos":["idstcv/coke"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/group-aware-label-transfer-for-domain","slug":"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_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/group-aware-label-transfer-for-domain#ran","syntology_url":"https://syntology.ai/paper/2103.12366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12366"}},"official":{"repos":["zkcys001/UDAStrongBaseline"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-robust-clustering-by-contrastive","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-continual-learning-and-self#ran","syntology_url":"https://syntology.ai/paper/1904.02021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02021"}},"official":{"repos":["CameronTaylorFL/stam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-real-time-and-unsupervised-face-re","slug":"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","slug":"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","slug":"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},{"url":null,"slug":"reservoirtta-prolonged-test-time-adaptation","title":"ReservoirTTA: Prolonged Test-time Adaptation for Evolving and Recurring Domains","date":"2025-05-20","arxiv_id":"2505.14511","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-of-dueling-bandits","title":"Online Clustering of Dueling Bandits","date":"2025-02-04","arxiv_id":"2502.02079","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-with-bandit-information","title":"Online Clustering with Bandit Information","date":"2025-01-20","arxiv_id":"2501.11421","repositories_listed":0,"syntology":null},{"url":null,"slug":"demystifying-online-clustering-of-bandits","title":"Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts","date":"2025-01-01","arxiv_id":"2501.00891","repositories_listed":0,"syntology":null},{"url":null,"slug":"ervq-enhanced-residual-vector-quantization","title":"ERVQ: Enhanced Residual Vector Quantization with Intra-and-Inter-Codebook Optimization for Neural Audio Codecs","date":"2024-10-16","arxiv_id":"2410.12359","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-open-vocabulary-semantic-segmentation","title":"Towards Open-Vocabulary Semantic Segmentation Without Semantic Labels","date":"2024-09-30","arxiv_id":"2409.19846","repositories_listed":0,"syntology":null},{"url":"/paper/exploring-semantic-clustering-in-deep","slug":"exploring-semantic-clustering-in-deep","title":"Exploring Semantic Clustering in Deep Reinforcement Learning for Video Games","date":"2024-09-25","arxiv_id":"2409.17411","repositories_listed":0,"syntology":{"n":17,"n_ran":9,"n_constructed":6,"n_ran_checked":7,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/exploring-semantic-clustering-in-deep#ran","syntology_url":"https://syntology.ai/paper/2409.17411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17411"}},"official":null}},{"url":null,"slug":"sgc-vqgan-towards-complex-scene","title":"SGC-VQGAN: Towards Complex Scene Representation via Semantic Guided Clustering Codebook","date":"2024-09-09","arxiv_id":"2409.06105","repositories_listed":0,"syntology":null},{"url":null,"slug":"systematic-evaluation-of-online-speaker","title":"Systematic Evaluation of Online Speaker Diarization Systems Regarding their Latency","date":"2024-07-05","arxiv_id":"2407.04293","repositories_listed":0,"syntology":null},{"url":null,"slug":"bafta-backprop-free-test-time-adaptation-for","title":"BaFTA: Backprop-Free Test-Time Adaptation For Zero-Shot Vision-Language Models","date":"2024-06-17","arxiv_id":"2406.11309","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-of-known-and-emerging","title":"Online Clustering of Known and Emerging Malware Families","date":"2024-05-06","arxiv_id":"2405.03298","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolving-restricted-boltzmann-machine-kohonen","title":"Evolving Restricted Boltzmann Machine-Kohonen Network for Online Clustering","date":"2024-02-14","arxiv_id":"2402.09167","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgen-token-generation-in-sublinear-time-and","title":"SubGen: Token Generation in Sublinear Time and Memory","date":"2024-02-08","arxiv_id":"2402.06082","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedgt-federated-node-classification-with","title":"FedGT: Federated Node Classification with Scalable Graph Transformer","date":"2024-01-26","arxiv_id":"2401.15203","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-reflective-learning-through","title":"Self-supervised Reflective Learning through Self-distillation and Online Clustering for Speaker Representation Learning","date":"2024-01-03","arxiv_id":"2401.01473","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-class-discovery-meets-foundation-models","title":"Novel class discovery meets foundation models for 3D semantic segmentation","date":"2023-12-06","arxiv_id":"2312.03782","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuromorphic-online-clustering-and","title":"Neuromorphic Online Clustering and Classification","date":"2023-10-26","arxiv_id":"2310.17797","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-of-bandits-with","title":"Online Clustering of Bandits with Misspecified User Models","date":"2023-10-04","arxiv_id":"2310.02717","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-domain-incremental-learning","title":"Clustering-based Domain-Incremental Learning","date":"2023-09-21","arxiv_id":"2309.12078","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-sequence-clustering-algorithm-for","title":"Online Sequence Clustering Algorithm for Video Trajectory Analysis","date":"2023-05-15","arxiv_id":"2305.08418","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-and-online-clustering-of-zero","title":"Classification and Online Clustering of Zero-Day Malware","date":"2023-05-01","arxiv_id":"2305.00605","repositories_listed":0,"syntology":null},{"url":null,"slug":"protocon-pseudo-label-refinement-via-online","title":"ProtoCon: Pseudo-label Refinement via Online Clustering and Prototypical Consistency for Efficient Semi-supervised Learning","date":"2023-03-22","arxiv_id":"2303.13556","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-binaural-speech-separation-of-moving","title":"Online Binaural Speech Separation of Moving Speakers With a Wavesplit Network","date":"2023-03-13","arxiv_id":"2303.07458","repositories_listed":0,"syntology":null},{"url":null,"slug":"cd-tta-compound-domain-test-time-adaptation","title":"Test-time Adaptation in the Dynamic World with Compound Domain Knowledge Management","date":"2022-12-16","arxiv_id":"2212.08356","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-digital-twin-developing-a-fast","title":"Multi-scale Digital Twin: Developing a fast and physics-informed surrogate model for groundwater contamination with uncertain climate models","date":"2022-11-20","arxiv_id":"2211.10884","repositories_listed":0,"syntology":null},{"url":null,"slug":"coder-coupled-diversity-sensitive-momentum","title":"CODER: Coupled Diversity-Sensitive Momentum Contrastive Learning for Image-Text Retrieval","date":"2022-08-21","arxiv_id":"2208.09843","repositories_listed":0,"syntology":null},{"url":null,"slug":"open-world-semantic-segmentation-via","title":"Open-world Semantic Segmentation via Contrasting and Clustering Vision-Language Embedding","date":"2022-07-18","arxiv_id":"2207.08455","repositories_listed":0,"syntology":null},{"url":null,"slug":"eept-early-discovery-of-emerging-entities-in","title":"Early Discovery of Emerging Entities in Persian Twitter with Semantic Similarity","date":"2022-07-06","arxiv_id":"2207.02434","repositories_listed":0,"syntology":null},{"url":null,"slug":"interrelate-training-and-searching-a-unified","title":"Interrelate Training and Searching: A Unified Online Clustering Framework for Speaker Diarization","date":"2022-06-28","arxiv_id":"2206.13760","repositories_listed":0,"syntology":null},{"url":null,"slug":"imgcl-revisiting-graph-contrastive-learning","title":"ImGCL: Revisiting Graph Contrastive Learning on Imbalanced Node Classification","date":"2022-05-23","arxiv_id":"2205.11332","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-self-supervised-gaze-estimation","title":"Towards Self-Supervised Gaze Estimation","date":"2022-03-21","arxiv_id":"2203.10974","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-clustering-with-bandit-feedback","title":"Optimal Clustering with Bandit Feedback","date":"2022-02-09","arxiv_id":"2202.04294","repositories_listed":0,"syntology":null},{"url":null,"slug":"representing-videos-as-discriminative-sub-1","title":"Representing Videos as Discriminative Sub-graphs for Action Recognition","date":"2022-01-11","arxiv_id":"2201.04027","repositories_listed":0,"syntology":null},{"url":null,"slug":"prototype-memory-and-attention-mechanisms-for","title":"Prototype memory and attention mechanisms for few shot image generation","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-based-multi-camera-vehicle","title":"Online Clustering-based Multi-Camera Vehicle Tracking in Scenarios with overlapping FOVs","date":"2021-02-08","arxiv_id":"2102.04091","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-clustered-and-non-stationary-bandits","title":"Unifying Clustered and Non-stationary Bandits","date":"2020-09-05","arxiv_id":"2009.02463","repositories_listed":0,"syntology":null},{"url":"/paper/deep-clustering-with-concrete-k-means","slug":"deep-clustering-with-concrete-k-means","title":"Deep clustering with concrete k-means","date":"2019-10-17","arxiv_id":"1910.08031","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-k-means-clustering","title":"Online k-means Clustering","date":"2019-09-15","arxiv_id":"1909.06861","repositories_listed":0,"syntology":null},{"url":null,"slug":"unexpected-effects-of-online-k-means","title":"Unexpected Effects of Online no-Substitution k-means Clustering","date":"2019-08-09","arxiv_id":"1908.06818","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-optimization-of-piecewise-lipschitz","title":"Learning piecewise Lipschitz functions in changing environments","date":"2019-07-22","arxiv_id":"1907.09137","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-continual-learning-and-self-1","title":"Unsupervised Continual Learning and Self-Taught Associative Memory Hierarchies","date":"2019-03-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-kernel-dictionary-learning-for","title":"Multiple-Kernel Dictionary Learning for Reconstruction and Clustering of Unseen Multivariate Time-series","date":"2019-03-05","arxiv_id":"1903.01867","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-algorithm-on-online-clustering-of","title":"Improved Algorithm on Online Clustering of Bandits","date":"2019-02-25","arxiv_id":"1902.09162","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-based-dynamic-pricing-with-online","title":"Context-Based Dynamic Pricing with Online Clustering","date":"2019-02-17","arxiv_id":"1902.06199","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-by-penalized-weighted-gmm","title":"Online Clustering by Penalized Weighted GMM","date":"2019-02-07","arxiv_id":"1902.02544","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-prediction-of-negative-health","title":"Unsupervised Prediction of Negative Health Events Ahead of Time","date":"2019-01-31","arxiv_id":"1901.11168","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-greedy-dirichlet-process-filter-an-online","title":"The Greedy Dirichlet Process Filter - An Online Clustering Multi-Target Tracker","date":"2018-11-14","arxiv_id":"1811.05911","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neuro-inspired-architecture-for","title":"A neuro-inspired architecture for unsupervised continual learning based on online clustering and hierarchical predictive coding","date":"2018-10-22","arxiv_id":"1810.09391","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-meansnet-when-k-means-meets-differentiable","title":"XAI Beyond Classification: Interpretable Neural Clustering","date":"2018-08-22","arxiv_id":"1808.07292","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-of-contextual-cascading","title":"Online Clustering of Contextual Cascading Bandits","date":"2017-11-23","arxiv_id":"1711.08594","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-quasi-bayesian-perspective-to-online","title":"A Quasi-Bayesian Perspective to Online Clustering","date":"2016-02-01","arxiv_id":"1602.00522","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-online-clustering-with-randomized","title":"Fast Online Clustering with Randomized Skeleton Sets","date":"2015-06-10","arxiv_id":"1506.03425","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-do-we-use-our-hands-discovering-a-diverse","title":"How Do We Use Our Hands? Discovering a Diverse Set of Common Grasps","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"web-scale-photo-hash-clustering-on-a-single","title":"Web Scale Photo Hash Clustering on A Single Machine","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-discovery-of-time-series-shapelets","title":"Scalable Discovery of Time-Series Shapelets","date":"2015-03-11","arxiv_id":"1503.03238","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-low-complexity-sequential-inference","title":"Adaptive Low-Complexity Sequential Inference for Dirichlet Process Mixture Models","date":"2014-09-29","arxiv_id":"1409.8185","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-of-bandits","title":"Online Clustering of Bandits","date":"2014-01-31","arxiv_id":"1401.8257","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-sparse-subspace-clustering","title":"Scalable Sparse Subspace Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":10,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":8,"papers_where_code_ran_first_page":"/task/online-clustering/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/online-clustering/papers/ran/1","json":"/task/online-clustering/papers/ran/1.json","rows":8}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"ba5536228f4a5785a44bca366837d22fceb0e11513bfa4fbf35cbc67920ef9a9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}