Methods › Reinforcement Learning › Value Function Estimation › HOC

High-Order Consensuses

HOC

515 papers tagged archive 2025-07-28

Introduced by Zhaowei Zhu et al. in Clusterability as an Alternative to Anchor Points When Learning with Noisy Labels

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

The archive carries no description for this method.

PaperSourceSee Code · UCSC-REAL/HOC

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: post-hoc explainer; post-hoc selection; post-hoc bias scoring; N-Agent Ad Hoc Teamwork; Pre-hoc Sparsity (PrHS); post-hoc rollback method; post-hoc robustification; post-hoc pruning strategy.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 515 · with a code link: 174 · where Syntology ran a sample: 54 (44 with a run with no instrument failure, 10 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (54 of 515 tagged: 44 with a run with no instrument failure, 10 where every run was a failure of Syntology's instrument)

Page 1 of 6: papers 1 to 100 of 515, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 360 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Decision Making29
Retrieval17
BIG-bench Machine Learning14
Diversity14
Fairness13
Semantic Segmentation13
Question Answering12
reinforcement-learning12
Deep Learning11
Explainable Artificial Intelligence (XAI)11
Explainable artificial intelligence11
Language Modelling11
Reinforcement Learning (RL)11
Language Modeling10
Management10
Representation Learning10
regression10
Clustering9
Feature Importance9
Information Retrieval9

Usage over time archive 2025-07-28

Papers per year tagged with HOC: 2021 to 2025, peak 118 118 0 2021: 95 papers 2021 2022: 100 papers 2022 2023: 114 papers 2023 2024: 118 papers 2024 2025: 88 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (515 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Value Function Estimation

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections