{"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":"/method/pgm","slug":"pgm","name":"PGM","full_name":"Probability Guided Maxout","full_name_withheld":false,"description_markdown":"A regularization criterion that, differently from [dropout](https://paperswithcode.com/method/dropout) and its variants, is deterministic rather than random. It grounds on the empirical evidence that feature descriptors with larger L2-norm and highly-active nodes are strongly correlated to confident class predictions. Thus, the criterion guides towards dropping a percentage of the most active nodes of the descriptors, proportionally to the estimated class probability","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":"https://github.com/clferrari/probability-guided-maxout","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Regularization","url":"/methods/category/regularization","pwc_aliases":[]}],"n_papers_tagged":63,"archive_num_papers":63,"papers_newest_first":[{"paper":"/paper/partition-generative-modeling-masked-modeling","slug":"partition-generative-modeling-masked-modeling","title":"Partition Generative Modeling: Masked Modeling Without Masks","date":"2025-05-24","arxiv_id":"2505.18883","n_code_links":1,"syntology":{"ran":13,"of":14,"n_ran_checked":2,"n_instrument":11,"unverified":1,"pointer_only":12,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 11 where Syntology's instrument failed) · 1 unverified","official":{"repos":["kuleshov-group/mdlm"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"smooth-optimization-algorithms-for-global-and","title":"Smooth optimization algorithms for global and locally low-rank regularizers","date":"2025-05-09","arxiv_id":"2505.06073","n_code_links":0,"syntology":null},{"paper":null,"slug":"knowledge-aided-semantic-communication","title":"Knowledge-Aided Semantic Communication Leveraging Probabilistic Graphical Modeling","date":"2024-08-08","arxiv_id":"2408.04499","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-predictive-simulation-using-structured","title":"Model Predictive Simulation Using Structured Graphical Models and Transformers","date":"2024-06-28","arxiv_id":"2406.19635","n_code_links":0,"syntology":null},{"paper":null,"slug":"digital-twinning-of-a-pressurized-water","title":"Digital Twinning of a Pressurized Water Reactor Startup Operation and Partial Computational Offloading in In-network Computing-Assisted Multiaccess Edge Computing","date":"2024-06-24","arxiv_id":"2407.12011","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalization-and-knowledge-transfer-in","title":"A-I-RAVEN and I-RAVEN-Mesh: Two New Benchmarks for Abstract Visual Reasoning","date":"2024-06-16","arxiv_id":"2406.11061","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentiable-proximal-graph-matching","title":"Differentiable Proximal Graph Matching","date":"2024-05-26","arxiv_id":"2405.16479","n_code_links":0,"syntology":null},{"paper":"/paper/fast-pgm-fast-probabilistic-graphical-model","slug":"fast-pgm-fast-probabilistic-graphical-model","title":"Fast-PGM: Fast Probabilistic Graphical Model Learning and Inference","date":"2024-05-24","arxiv_id":"2405.15605","n_code_links":1,"syntology":null},{"paper":"/paper/prompt-customization-for-continual-learning","slug":"prompt-customization-for-continual-learning","title":"Prompt Customization for Continual Learning","date":"2024-04-28","arxiv_id":"2404.18060","n_code_links":1,"syntology":null},{"paper":null,"slug":"solving-the-bongard-logo-problem-by-modeling","title":"Solving the Clustering Reasoning Problems by Modeling a Deep-Learning-Based Probabilistic Model","date":"2024-03-05","arxiv_id":"2403.03173","n_code_links":0,"syntology":null},{"paper":"/paper/magic-benchmarking-large-language-model","slug":"magic-benchmarking-large-language-model","title":"MAgIC: Investigation of Large Language Model Powered Multi-Agent in Cognition, Adaptability, Rationality and Collaboration","date":"2023-11-14","arxiv_id":"2311.08562","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"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","official":{"repos":["cathyxl/magic"],"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"]}}},{"paper":null,"slug":"assessment-of-differentially-private","title":"Assessment of Differentially Private Synthetic Data for Utility and Fairness in End-to-End Machine Learning Pipelines for Tabular Data","date":"2023-10-30","arxiv_id":"2310.19250","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximate-implication-for-probabilistic","title":"Approximate Implication for Probabilistic Graphical Models","date":"2023-10-21","arxiv_id":"2310.13942","n_code_links":0,"syntology":null},{"paper":null,"slug":"probabilistic-modeling-of-human-teams-to","title":"Probabilistic Modeling of Human Teams to Infer False Beliefs","date":"2023-10-19","arxiv_id":"2310.12929","n_code_links":0,"syntology":null},{"paper":"/paper/delta-ai-local-objectives-for-amortized","slug":"delta-ai-local-objectives-for-amortized","title":"Delta-AI: Local objectives for amortized inference in sparse graphical models","date":"2023-10-03","arxiv_id":"2310.02423","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["gfnorg/delta-ai"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"control-as-probabilistic-inference-as-an","title":"Control as Probabilistic Inference as an Emergent Communication Mechanism in Multi-Agent Reinforcement Learning","date":"2023-07-11","arxiv_id":"2307.05004","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximate-inference-of-marginals-using-the","title":"Approximate inference of marginals using the IBIA framework","date":"2023-06-01","arxiv_id":"2306.00335","n_code_links":0,"syntology":null},{"paper":"/paper/on-neural-networks-as-infinite-tree","slug":"on-neural-networks-as-infinite-tree","title":"On Neural Networks as Infinite Tree-Structured Probabilistic Graphical Models","date":"2023-05-27","arxiv_id":"2305.17583","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":5,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["engelhard-lab/dnn_treepgm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"plotting-behind-the-scenes-towards-learnable","title":"Promptable Game Models: Text-Guided Game Simulation via Masked Diffusion Models","date":"2023-03-23","arxiv_id":"2303.13472","n_code_links":0,"syntology":null},{"paper":"/paper/neural-graph-revealers","slug":"neural-graph-revealers","title":"Neural Graph Revealers","date":"2023-02-27","arxiv_id":"2302.13582","n_code_links":1,"syntology":null},{"paper":null,"slug":"structure-learning-and-parameter-estimation","title":"Structure Learning and Parameter Estimation for Graphical Models via Penalized Maximum Likelihood Methods","date":"2023-01-30","arxiv_id":"2301.13269","n_code_links":0,"syntology":null},{"paper":"/paper/unsupervised-visible-infrared-person-re","slug":"unsupervised-visible-infrared-person-re","title":"Unsupervised Visible-Infrared Person Re-Identification via Progressive Graph Matching and Alternate Learning","date":"2023-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"partitioned-gradient-matching-based-data","title":"Partitioned Gradient Matching-based Data Subset Selection for Compute-Efficient Robust ASR Training","date":"2022-10-30","arxiv_id":"2210.16892","n_code_links":0,"syntology":null},{"paper":null,"slug":"policy-gradient-methods-for-designing-dynamic","title":"Policy Gradient Methods for Designing Dynamic Output Feedback Controllers","date":"2022-10-18","arxiv_id":"2210.09735","n_code_links":0,"syntology":null},{"paper":null,"slug":"brain-inspired-probabilistic-generative-model","title":"Brain-inspired probabilistic generative model for double articulation analysis of spoken language","date":"2022-07-06","arxiv_id":"2207.02457","n_code_links":0,"syntology":null},{"paper":"/paper/savir-t-spatially-attentive-visual-reasoning","slug":"savir-t-spatially-attentive-visual-reasoning","title":"SAViR-T: Spatially Attentive Visual Reasoning with Transformers","date":"2022-06-18","arxiv_id":"2206.09265","n_code_links":1,"syntology":null},{"paper":"/paper/effective-abstract-reasoning-with-dual-1","slug":"effective-abstract-reasoning-with-dual-1","title":"Effective Abstract Reasoning with Dual-Contrast Network","date":"2022-05-27","arxiv_id":"2205.13720","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":3,"n_instrument":2,"unverified":2,"pointer_only":7,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["visiontao/dcnet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/emergent-communication-through-metropolis","slug":"emergent-communication-through-metropolis","title":"Emergent Communication through Metropolis-Hastings Naming Game with Deep Generative Models","date":"2022-05-24","arxiv_id":"2205.12392","n_code_links":1,"syntology":null},{"paper":"/paper/approximating-permutations-with-neural","slug":"approximating-permutations-with-neural","title":"Approximating Permutations with Neural Network Components for Travelling Photographer Problem","date":"2022-04-30","arxiv_id":"2205.00242","n_code_links":0,"syntology":null},{"paper":null,"slug":"incremental-inference-on-higher-order","title":"Incremental Inference on Higher-Order Probabilistic Graphical Models Applied to Constraint Satisfaction Problems","date":"2022-02-25","arxiv_id":"2202.12916","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-probabilistic-graphical-model-approach-to","title":"A Probabilistic Graphical Model Approach to the Structure-and-Motion Problem","date":"2021-10-07","arxiv_id":"2110.03792","n_code_links":0,"syntology":null},{"paper":"/paper/strengthening-probabilistic-graphical-models","slug":"strengthening-probabilistic-graphical-models","title":"Strengthening Probabilistic Graphical Models: The Purge-and-merge Algorithm","date":"2021-09-30","arxiv_id":"2110.00091","n_code_links":1,"syntology":null},{"paper":null,"slug":"bayesian-transfer-learning-an-overview-of","title":"Bayesian Transfer Learning: An Overview of Probabilistic Graphical Models for Transfer Learning","date":"2021-09-27","arxiv_id":"2109.13233","n_code_links":0,"syntology":null},{"paper":null,"slug":"auto-parsing-network-for-image-captioning-and","title":"Auto-Parsing Network for Image Captioning and Visual Question Answering","date":"2021-08-24","arxiv_id":"2108.10568","n_code_links":0,"syntology":null},{"paper":null,"slug":"probabilistic-graphical-models-and-tensor","title":"Probabilistic Graphical Models and Tensor Networks: A Hybrid Framework","date":"2021-06-29","arxiv_id":"2106.15666","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximate-implication-with-d-separation","title":"Approximate Implication with d-Separation","date":"2021-05-30","arxiv_id":"2105.14463","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-probabilistic-graphical-modeling","title":"Deep Probabilistic Graphical Modeling","date":"2021-04-25","arxiv_id":"2104.12053","n_code_links":0,"syntology":null},{"paper":null,"slug":"whole-brain-probabilistic-generative-model","title":"A Whole Brain Probabilistic Generative Model: Toward Realizing Cognitive Architectures for Developmental Robots","date":"2021-03-15","arxiv_id":"2103.08183","n_code_links":0,"syntology":null},{"paper":null,"slug":"hippocampal-formation-inspired-probabilistic","title":"Hippocampal formation-inspired probabilistic generative model","date":"2021-03-12","arxiv_id":"2103.07356","n_code_links":0,"syntology":null},{"paper":"/paper/pgm-explainer-probabilistic-graphical-model","slug":"pgm-explainer-probabilistic-graphical-model","title":"PGM-Explainer: Probabilistic Graphical Model Explanations for Graph Neural Networks","date":"2020-10-12","arxiv_id":"2010.05788","n_code_links":1,"syntology":null},{"paper":null,"slug":"modeling-global-body-configurations-in","title":"Modeling Global Body Configurations in American Sign Language","date":"2020-09-03","arxiv_id":"2009.01468","n_code_links":0,"syntology":null},{"paper":"/paper/a-closer-look-at-generalisation-in-raven","slug":"a-closer-look-at-generalisation-in-raven","title":"A Closer Look at Generalisation in RAVEN","date":"2020-08-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/the-scattering-compositional-learner","slug":"the-scattering-compositional-learner","title":"The Scattering Compositional Learner: Discovering Objects, Attributes, Relationships in Analogical Reasoning","date":"2020-07-08","arxiv_id":"2007.04212","n_code_links":3,"syntology":{"ran":5,"of":5,"n_ran_checked":4,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["dhh1995/SCL"],"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":["listed","official"]}}},{"paper":null,"slug":"ginns-graph-informed-neural-networks-for","title":"GINNs: Graph-Informed Neural Networks for Multiscale Physics","date":"2020-06-26","arxiv_id":"2006.14807","n_code_links":0,"syntology":null},{"paper":null,"slug":"abstract-diagrammatic-reasoning-with-1","title":"Abstract Diagrammatic Reasoning with Multiplex Graph Networks","date":"2020-06-19","arxiv_id":"2006.11197","n_code_links":0,"syntology":null},{"paper":"/paper/query-training-learning-and-inference-for","slug":"query-training-learning-and-inference-for","title":"Query Training: Learning a Worse Model to Infer Better Marginals in Undirected Graphical Models with Hidden Variables","date":"2020-06-11","arxiv_id":"2006.06803","n_code_links":1,"syntology":{"ran":8,"of":9,"n_ran_checked":8,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["vicariousinc/query_training"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/hierarchical-rule-induction-network-for","slug":"hierarchical-rule-induction-network-for","title":"Stratified Rule-Aware Network for Abstract Visual Reasoning","date":"2020-02-17","arxiv_id":"2002.06838","n_code_links":2,"syntology":null},{"paper":null,"slug":"eggs-a-flexible-approach-to-relational","title":"EGGS: A Flexible Approach to Relational Modeling of Social Network Spam","date":"2020-01-14","arxiv_id":"2001.04909","n_code_links":0,"syntology":null},{"paper":"/paper/abstract-reasoning-with-distracting-features-1","slug":"abstract-reasoning-with-distracting-features-1","title":"Abstract Reasoning with Distracting Features","date":"2019-12-02","arxiv_id":"1912.00569","n_code_links":1,"syntology":null},{"paper":null,"slug":"scalable-and-transferable-learning-of","title":"Learning NP-Hard Multi-Agent Assignment Planning using GNN: Inference on a Random Graph and Provable Auction-Fitted Q-learning","date":"2019-05-29","arxiv_id":"1905.12204","n_code_links":0,"syntology":null},{"paper":null,"slug":"multiple-kernel-learning-from-u-statistics-of","title":"A Distributionally Robust Optimization Method for Adversarial Multiple Kernel Learning","date":"2019-02-27","arxiv_id":"1902.10365","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-resampling-vs-adjusting-probabilistic","title":"On resampling vs. adjusting probabilistic graphical models in estimation of distribution algorithms","date":"2019-02-15","arxiv_id":"1902.05946","n_code_links":0,"syntology":null},{"paper":null,"slug":"end-to-end-multi-modal-sensors-fusion-system","title":"End-To-End multi-modal sensors fusion system for urban automated driving","date":"2018-10-10","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-a-fatality-aware-benchmark-of","title":"Towards a Fatality-Aware Benchmark of Probabilistic Reaction Prediction in Highly Interactive Driving Scenarios","date":"2018-09-10","arxiv_id":"1809.03478","n_code_links":0,"syntology":null},{"paper":null,"slug":"probabilistic-graphical-modeling-approach-to","title":"Probabilistic Graphical Modeling approach to dynamic PET direct parametric map estimation and image reconstruction","date":"2018-08-24","arxiv_id":"1808.08286","n_code_links":0,"syntology":null},{"paper":"/paper/coarse-to-fine-lifted-map-inference-in","slug":"coarse-to-fine-lifted-map-inference-in","title":"Coarse-to-Fine Lifted MAP Inference in Computer Vision","date":"2017-07-22","arxiv_id":"1707.07165","n_code_links":1,"syntology":null},{"paper":null,"slug":"probabilistic-graphical-model-based-approach","title":"Probabilistic graphical model based approach for water mapping using GaoFen-2 (GF-2) high resolution imagery and Landsat 8 time series","date":"2016-12-22","arxiv_id":"1612.07801","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-probabilistic-graphical-model-approach-in","title":"A probabilistic graphical model approach in 30 m land cover mapping with multiple data sources","date":"2016-12-11","arxiv_id":"1612.03373","n_code_links":0,"syntology":null},{"paper":null,"slug":"laplacian-lrr-on-product-grassmann-manifolds","title":"Laplacian LRR on Product Grassmann Manifolds for Human Activity Clustering in Multi-Camera Video Surveillance","date":"2016-06-13","arxiv_id":"1606.03838","n_code_links":0,"syntology":null},{"paper":null,"slug":"sequential-monte-carlo-for-graphical-models","title":"Sequential Monte Carlo for Graphical Models","date":"2014-02-03","arxiv_id":"1402.0330","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-linear-convergence-of-the-proximal","title":"On the Linear Convergence of the Proximal Gradient Method for Trace Norm Regularization","date":"2013-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-blocking-and-collapsing-for-gibbs","title":"Dynamic Blocking and Collapsing for Gibbs Sampling","date":"2013-09-26","arxiv_id":"1309.6870","n_code_links":0,"syntology":null},{"paper":null,"slug":"bayesian-test-of-significance-for-conditional","title":"Bayesian test of significance for conditional independence: The multinomial model","date":"2013-06-16","arxiv_id":"1306.3627","n_code_links":0,"syntology":null}],"papers_shown":63,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":63,"with_a_code_link":19,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":63,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"papers_where_code_ran":7,"papers_where_code_ran_first_page":"/method/pgm/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/pgm/papers/ran/1","json":"/method/pgm/papers/ran/1.json","rows":7}],"tasks":[{"task":"/task/decision-making","name":"Decision Making","papers":4},{"task":"/task/visual-reasoning","name":"Visual Reasoning","papers":4},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":3},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":3},{"task":"/task/bayesian-inference","name":"Bayesian Inference","papers":2},{"task":"/task/graph-matching","name":"Graph Matching","papers":2},{"task":"/task/language-modeling","name":"Language Modeling","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/minecraft","name":"Minecraft","papers":2},{"task":"/task/time-series","name":"Time Series Analysis","papers":2},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":2},{"task":"/task/ai-agent","name":"AI Agent","papers":1},{"task":"/task/activity-recognition","name":"Activity Recognition","papers":1},{"task":"/task/anatomy","name":"Anatomy","papers":1},{"task":"/task/attribute","name":"Attribute","papers":1},{"task":"/task/autonomous-vehicles","name":"Autonomous Vehicles","papers":1},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/bayesian-optimisation","name":"Bayesian Optimisation","papers":1},{"task":"/task/benchmarking","name":"Benchmarking","papers":1},{"task":"/task/blocking","name":"Blocking","papers":1}],"tasks_shown":20,"n_tasks":72,"usage_by_year":[{"year":"2013","papers":3},{"year":"2014","papers":1},{"year":"2016","papers":3},{"year":"2017","papers":1},{"year":"2018","papers":3},{"year":"2019","papers":4},{"year":"2020","papers":9},{"year":"2021","papers":9},{"year":"2022","papers":8},{"year":"2023","papers":12},{"year":"2024","papers":8},{"year":"2025","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/pgm"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=PGM","read_at":"2026-10-05T01:00:15+00:00","query":"PGM","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"2210.09022","title":"Distilling Object Detectors with Global Knowledge","citations":12,"named_by":["acronym_expansion"],"bearer_name":"Prototype Generation Module (PGM)","ask_with":"have('2210.09022')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'PGM' by name, but 2 thing(s) here DECLARE that name -- most cited: 'Prototype Generation Module (PGM)', a method in 'Distilling Object Detectors with Global Knowledge' (arXiv:2210.09022, 12 citations). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is “Prototype Generation Module (PGM)”, a method in the paper “Distilling Object Detectors with Global Knowledge” (arXiv:2210.09022, 12 citations). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","near_matches":["SG-PGM","Prototype Generation Module (PGM)","Proximal-Based Generative Modeling (PGM)"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"e99ac82277ebd9294224b3ffce41b6d9e7e0309fc2ad8888d504b976d2b655ad","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}