{"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/pisa","slug":"pisa","name":"PISA","full_name":"PrIme Sample Attention","full_name_withheld":false,"description_markdown":"**PrIme Sample Attention (PISA)** directs the training of object detection frameworks towards prime samples. These are samples that play a key role in driving the detection performance. The authors define Hierarchical Local Rank (HLR) as a metric of importance. Specifically, they use IoU-HLR to rank positive samples and ScoreHLR to rank negative samples in each mini-batch. This ranking strategy places the positive samples with highest IoUs around each object and the negative samples with highest scores in each cluster to the top of the ranked list and directs the focus of the training process to them via a simple re-weighting scheme. The authors also devise a classification-aware regression loss to jointly optimize the classification and regression branches. Particularly, this loss would suppress those samples with large regression loss, thus reinforcing the attention to prime samples.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Prime Sample Attention in Object Detection","paper":"/paper/prime-sample-attention-in-object-detection","first_author":"Yuhang Cao","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/prime-sample-attention-in-object-detection"},"source":{"url":"https://arxiv.org/abs/1904.04821v2","title":"Prime Sample Attention in Object Detection","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Prioritized Sampling","url":"/methods/category/prioritized-sampling","pwc_aliases":[]}],"n_papers_tagged":17,"archive_num_papers":17,"papers_newest_first":[{"paper":null,"slug":"large-language-models-don-t-make-sense-of","title":"Large Language Models Don't Make Sense of Word Problems. A Scoping Review from a Mathematics Education Perspective","date":"2025-06-30","arxiv_id":"2506.24006","n_code_links":0,"syntology":null},{"paper":null,"slug":"preconditioned-inexact-stochastic-admm-for","title":"Preconditioned Inexact Stochastic ADMM for Deep Model","date":"2025-02-15","arxiv_id":"2502.10784","n_code_links":0,"syntology":null},{"paper":"/paper/transformers-meet-act-r-repeat-aware-and","slug":"transformers-meet-act-r-repeat-aware-and","title":"Transformers Meet ACT-R: Repeat-Aware and Sequential Listening Session Recommendation","date":"2024-08-29","arxiv_id":"2408.16578","n_code_links":1,"syntology":null},{"paper":"/paper/path-specific-causal-reasoning-for-fairness","slug":"path-specific-causal-reasoning-for-fairness","title":"Path-Specific Causal Reasoning for Fairness-aware Cognitive Diagnosis","date":"2024-06-05","arxiv_id":"2406.03064","n_code_links":1,"syntology":null},{"paper":"/paper/proving-theorems-recursively","slug":"proving-theorems-recursively","title":"Proving Theorems Recursively","date":"2024-05-23","arxiv_id":"2405.14414","n_code_links":1,"syntology":null},{"paper":"/paper/scalable-learning-of-item-response-theory","slug":"scalable-learning-of-item-response-theory","title":"Scalable Learning of Item Response Theory Models","date":"2024-03-01","arxiv_id":"2403.00680","n_code_links":1,"syntology":{"ran":13,"of":13,"n_ran_checked":6,"n_instrument":7,"unverified":0,"pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified","official":{"repos":["tim907/irt"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"csranks-an-r-package-for-estimation-and","title":"csranks: An R Package for Estimation and Inference Involving Ranks","date":"2024-01-26","arxiv_id":"2401.15205","n_code_links":0,"syntology":null},{"paper":null,"slug":"testing-and-correcting-sample-selection-in","title":"Correcting Selection Bias in Standardized Test Comparisons","date":"2023-09-19","arxiv_id":"2309.10642","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-systematic-study-of-the-foreground","title":"A systematic study of the foreground-background imbalance problem in deep learning for object detection","date":"2023-06-28","arxiv_id":"2306.16539","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-heterogeneous-collaborative-linear","title":"Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity","date":"2023-06-09","arxiv_id":"2306.06291","n_code_links":0,"syntology":null},{"paper":null,"slug":"magnushammer-a-transformer-based-approach-to","title":"Magnushammer: A Transformer-Based Approach to Premise Selection","date":"2023-03-08","arxiv_id":"2303.04488","n_code_links":0,"syntology":null},{"paper":"/paper/permutation-invariant-set-autoencoders-with","slug":"permutation-invariant-set-autoencoders-with","title":"Permutation-Invariant Set Autoencoders with Fixed-Size Embeddings for Multi-Agent Learning","date":"2023-02-24","arxiv_id":"2302.12826","n_code_links":2,"syntology":null},{"paper":"/paper/prompt-based-time-series-forecasting-a-new","slug":"prompt-based-time-series-forecasting-a-new","title":"PromptCast: A New Prompt-based Learning Paradigm for Time Series Forecasting","date":"2022-09-20","arxiv_id":"2210.08964","n_code_links":2,"syntology":null},{"paper":"/paper/thor-wielding-hammers-to-integrate-language","slug":"thor-wielding-hammers-to-integrate-language","title":"Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers","date":"2022-05-22","arxiv_id":"2205.10893","n_code_links":0,"syntology":null},{"paper":"/paper/supporting-interoperability-between-open","slug":"supporting-interoperability-between-open","title":"Supporting Interoperability Between Open-Source Search Engines with the Common Index File Format","date":"2020-03-18","arxiv_id":"2003.08276","n_code_links":2,"syntology":null},{"paper":null,"slug":"new-item-consumption-prediction-using-deep","title":"New Item Consumption Prediction Using Deep Learning","date":"2019-05-05","arxiv_id":"1905.01686","n_code_links":0,"syntology":null},{"paper":"/paper/prime-sample-attention-in-object-detection","slug":"prime-sample-attention-in-object-detection","title":"Prime Sample Attention in Object Detection","date":"2019-04-09","arxiv_id":"1904.04821","n_code_links":1,"syntology":null}],"papers_shown":17,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":17,"with_a_code_link":8,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":17,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"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":1,"papers_where_code_ran_first_page":"/method/pisa/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/pisa/papers/ran/1","json":"/method/pisa/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/automated-theorem-proving","name":"Automated Theorem Proving","papers":3},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/object","name":"Object","papers":2},{"task":"/task/object-detection","name":"Object Detection","papers":2},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":2},{"task":"/task/object-detection-1","name":"object-detection","papers":2},{"task":"/task/attribute","name":"Attribute","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/fairness","name":"Fairness","papers":1},{"task":"/task/language-modeling","name":"Language Modeling","papers":1},{"task":"/task/mathematical-reasoning","name":"Mathematical Reasoning","papers":1},{"task":"/task/multi-armed-bandits","name":"Multi-Armed Bandits","papers":1},{"task":"/task/music-recommendation","name":"Music Recommendation","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1},{"task":"/task/representation-learning","name":"Representation Learning","papers":1},{"task":"/task/retrieval","name":"Retrieval","papers":1},{"task":"/task/selection-bias","name":"Selection bias","papers":1},{"task":"/task/sentence","name":"Sentence","papers":1},{"task":"/task/sequential-recommendation","name":"Sequential Recommendation","papers":1},{"task":"/task/text-generation","name":"Text Generation","papers":1}],"tasks_shown":20,"n_tasks":29,"usage_by_year":[{"year":"2019","papers":2},{"year":"2020","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":5},{"year":"2024","papers":5},{"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/pisa"},"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=PISA","read_at":"2026-10-05T01:00:18+00:00","query":"PISA","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"PISA","origin_arxiv_id":"openreview_DG7S1hhwUL"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":"1904.04821","repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":false,"bearers_found":8,"served":{"arxiv_id":"openreview_DG7S1hhwUL","citations":null},"leading_other_bearer":{"arxiv_id":"2602.01077","title":"PISA: Piecewise Sparse Attention Is Wiser for Efficient Diffusion Transformers","citations":13,"named_by":["title_prefix"],"bearer_name":"PISA: Piecewise Sparse Attention Is Wiser for Efficient Diffusion Transformers","ask_with":"have('2602.01077')"},"n_other_bearers_listed":5,"note":"'PISA' is ALSO the name of the paper 'PISA: Piecewise Sparse Attention Is Wiser for Efficient Diffusion Transformers' (arXiv:2602.01077, 13 citations), which is cited more than the paper this answer is about (citations not recorded). The margin is narrow, so this is not a claim that the other one is what you meant -- check `served.arxiv_id` against the paper you had in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"openreview_DG7S1hhwUL","page":null,"syntology_url":null,"in_graph_layer":false,"samples":0},"line":"no code under this exact name (no_code; paper_only). The archive credits no paper with an arXiv id for this method, so whether this answer (about the paper Syntology's graph keys as openreview_DG7S1hhwUL) is about this method is not checked; it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"93789de65c3871ab0ab49dc0ecf487cb7be1901977e0d1bbf4bbdfdf9eb2591a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}