{"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/two/papers/2","list_of":"/task/two","task":"Vocal Bursts Valence Prediction","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":12,"rows_per_page":100,"rows":[101,200],"of":1164,"counts":{"archive_papers_tagged":1164,"with_a_code_link":265,"where_syntology_ran_a_sample":42,"not_listed_spam_title":0,"listed":1164,"listed_where_code_ran":42,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":8,"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"},"first_page":"/task/two","prev":"/task/two","next":"/task/two/papers/3","papers":[{"url":"/paper/fairness-in-the-first-stage-of-two-stage","slug":"fairness-in-the-first-stage-of-two-stage","title":"Uncertainty Quantification for Fairness in Two-Stage Recommender Systems","date":"2022-05-30","arxiv_id":"2205.15436","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-in-the-first-stage-of-two-stage#ran","syntology_url":"https://syntology.ai/paper/2205.15436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15436"}},"official":{"repos":["lequnwang/fair-two-stage-recommender"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/optimality-conditions-and-algorithms-for-top","slug":"optimality-conditions-and-algorithms-for-top","title":"Information-Directed Selection for Top-Two Algorithms","date":"2022-05-24","arxiv_id":"2205.12086","repositories_listed":1,"syntology":null},{"url":"/paper/two-step-question-retrieval-for-open-domain-1","slug":"two-step-question-retrieval-for-open-domain-1","title":"Two-Step Question Retrieval for Open-Domain QA","date":"2022-05-19","arxiv_id":"2205.09393","repositories_listed":1,"syntology":null},{"url":"/paper/logiformer-a-two-branch-graph-transformer","slug":"logiformer-a-two-branch-graph-transformer","title":"Logiformer: A Two-Branch Graph Transformer Network for Interpretable Logical Reasoning","date":"2022-05-02","arxiv_id":"2205.00731","repositories_listed":1,"syntology":null},{"url":"/paper/uniform-manifold-approximation-with-two-phase-1","slug":"uniform-manifold-approximation-with-two-phase-1","title":"Uniform Manifold Approximation with Two-phase Optimization","date":"2022-05-01","arxiv_id":"2205.00420","repositories_listed":1,"syntology":null},{"url":"/paper/two-new-datasets-for-italian-language","slug":"two-new-datasets-for-italian-language","title":"Two New Datasets for Italian-Language Abstractive Text Summarization","date":"2022-04-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-practical-two-stage-ranking-framework-for","slug":"a-practical-two-stage-ranking-framework-for","title":"A Practical Two-stage Ranking Framework for Cross-market Recommendation","date":"2022-04-27","arxiv_id":"2204.12682","repositories_listed":1,"syntology":null},{"url":"/paper/a-tale-of-two-models-constructing-evasive","slug":"a-tale-of-two-models-constructing-evasive","title":"A Tale of Two Models: Constructing Evasive Attacks on Edge Models","date":"2022-04-22","arxiv_id":"2204.10933","repositories_listed":1,"syntology":null},{"url":"/paper/two-stream-graph-convolutional-network-for","slug":"two-stream-graph-convolutional-network-for","title":"Two-Stream Graph Convolutional Network for Intra-oral Scanner Image Segmentation","date":"2022-04-19","arxiv_id":"2204.08797","repositories_listed":1,"syntology":null},{"url":"/paper/interacting-attention-graph-for-single-image","slug":"interacting-attention-graph-for-single-image","title":"Interacting Attention Graph for Single Image Two-Hand Reconstruction","date":"2022-03-17","arxiv_id":"2203.09364","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/interacting-attention-graph-for-single-image#ran","syntology_url":"https://syntology.ai/paper/2203.09364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09364"}},"official":{"repos":["dw1010/intaghand"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/comparing-two-samples-through-stochastic","slug":"comparing-two-samples-through-stochastic","title":"Comparing Two Samples Through Stochastic Dominance: A Graphical Approach","date":"2022-03-15","arxiv_id":"2203.07889","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-bigraphical-lasso-two-way-sparse","slug":"scalable-bigraphical-lasso-two-way-sparse","title":"Scalable Bigraphical Lasso: Two-way Sparse Network Inference for Count Data","date":"2022-03-15","arxiv_id":"2203.07912","repositories_listed":1,"syntology":null},{"url":"/paper/recasnet-improving-consistency-within-the-two","slug":"recasnet-improving-consistency-within-the-two","title":"ReCasNet: Improving consistency within the two-stage mitosis detection framework","date":"2022-02-28","arxiv_id":"2202.13912","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-and-defense-for-non","slug":"adversarial-attacks-and-defense-for-non","title":"Adversarial Attack and Defense for Non-Parametric Two-Sample Tests","date":"2022-02-07","arxiv_id":"2202.03077","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/adversarial-attacks-and-defense-for-non#ran","syntology_url":"https://syntology.ai/paper/2202.03077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03077"}},"official":{"repos":["godxuxilie/robust-tst"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/two-sample-testing-in-reinforcement-learning","slug":"two-sample-testing-in-reinforcement-learning","title":"Addressing Maximization Bias in Reinforcement Learning with Two-Sample Testing","date":"2022-01-20","arxiv_id":"2201.08078","repositories_listed":1,"syntology":null},{"url":"/paper/towards-fair-recommendation-in-two-sided","slug":"towards-fair-recommendation-in-two-sided","title":"Towards Fair Recommendation in Two-Sided Platforms","date":"2021-12-26","arxiv_id":"2201.01180","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-fair-recommendation-in-two-sided#ran","syntology_url":"https://syntology.ai/paper/2201.01180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.01180"}},"official":null}},{"url":"/paper/two-view-graph-neural-networks-for-knowledge","slug":"two-view-graph-neural-networks-for-knowledge","title":"Two-view Graph Neural Networks for Knowledge Graph Completion","date":"2021-12-16","arxiv_id":"2112.09231","repositories_listed":1,"syntology":null},{"url":"/paper/two-contrasting-data-annotation-paradigms-for","slug":"two-contrasting-data-annotation-paradigms-for","title":"Two Contrasting Data Annotation Paradigms for Subjective NLP Tasks","date":"2021-12-14","arxiv_id":"2112.07475","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-the-two-stage-framework-for","slug":"rethinking-the-two-stage-framework-for","title":"Rethinking the Two-Stage Framework for Grounded Situation Recognition","date":"2021-12-10","arxiv_id":"2112.05375","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":12,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rethinking-the-two-stage-framework-for#ran","syntology_url":"https://syntology.ai/paper/2112.05375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.05375"}},"official":{"repos":["kellyiss/situformer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/transformaly-two-feature-spaces-are-better","slug":"transformaly-two-feature-spaces-are-better","title":"Transformaly -- Two (Feature Spaces) Are Better Than One","date":"2021-12-08","arxiv_id":"2112.04185","repositories_listed":1,"syntology":null},{"url":"/paper/neural-auto-curricula-in-two-player-zero-sum","slug":"neural-auto-curricula-in-two-player-zero-sum","title":"Neural Auto-Curricula in Two-Player Zero-Sum Games","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/eagan-efficient-two-stage-evolutionary","slug":"eagan-efficient-two-stage-evolutionary","title":"EAGAN: Efficient Two-stage Evolutionary Architecture Search for GANs","date":"2021-11-30","arxiv_id":"2111.15097","repositories_listed":1,"syntology":null},{"url":"/paper/kuielab-mdx-net-a-two-stream-neural-network","slug":"kuielab-mdx-net-a-two-stream-neural-network","title":"KUIELab-MDX-Net: A Two-Stream Neural Network for Music Demixing","date":"2021-11-24","arxiv_id":"2111.12203","repositories_listed":1,"syntology":null},{"url":"/paper/affirmative-action-in-two-dimensions-a-multi","slug":"affirmative-action-in-two-dimensions-a-multi","title":"Affirmative Action's Cumulative Fractional Assignments","date":"2021-11-23","arxiv_id":"2111.11963","repositories_listed":1,"syntology":null},{"url":"/paper/label-efficient-two-sample-test","slug":"label-efficient-two-sample-test","title":"A label-efficient two-sample test","date":"2021-11-17","arxiv_id":"2111.08861","repositories_listed":1,"syntology":null},{"url":"/paper/improving-word-translation-via-two-stage","slug":"improving-word-translation-via-two-stage","title":"Improving Word Translation via Two-Stage Contrastive Learning","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/two-steps-to-risk-sensitivity","slug":"two-steps-to-risk-sensitivity","title":"Two steps to risk sensitivity","date":"2021-11-12","arxiv_id":"2111.06803","repositories_listed":1,"syntology":null},{"url":"/paper/the-complex-valued-correlation-coefficient","slug":"the-complex-valued-correlation-coefficient","title":"A hemispheric two-channel code accounts for binaural unmasking in humans","date":"2021-11-08","arxiv_id":"2111.04637","repositories_listed":1,"syntology":null},{"url":"/paper/event-based-motion-segmentation-by-cascaded","slug":"event-based-motion-segmentation-by-cascaded","title":"Event-based Motion Segmentation by Cascaded Two-Level Multi-Model Fitting","date":"2021-11-05","arxiv_id":"2111.03483","repositories_listed":1,"syntology":null},{"url":"/paper/textual-backdoor-attacks-can-be-more-harmful","slug":"textual-backdoor-attacks-can-be-more-harmful","title":"Textual Backdoor Attacks Can Be More Harmful via Two Simple Tricks","date":"2021-10-15","arxiv_id":"2110.08247","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-in-two-player-zero-sum","slug":"reinforcement-learning-in-two-player-zero-sum","title":"Reinforcement Learning In Two Player Zero Sum Simultaneous Action Games","date":"2021-10-10","arxiv_id":"2110.04835","repositories_listed":1,"syntology":null},{"url":"/paper/two-stage-visual-cues-enhancement-network-for","slug":"two-stage-visual-cues-enhancement-network-for","title":"Two-stage Visual Cues Enhancement Network for Referring Image Segmentation","date":"2021-10-09","arxiv_id":"2110.04435","repositories_listed":1,"syntology":null},{"url":"/paper/an-approximate-expectation-maximization-for","slug":"an-approximate-expectation-maximization-for","title":"An approximate expectation-maximization for two-dimensional multi-target detection","date":"2021-10-05","arxiv_id":"2110.02289","repositories_listed":1,"syntology":null},{"url":"/paper/one-source-two-targets-challenges-and-rewards","slug":"one-source-two-targets-challenges-and-rewards","title":"One Source, Two Targets: Challenges and Rewards of Dual Decoding","date":"2021-09-21","arxiv_id":"2109.10197","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/one-source-two-targets-challenges-and-rewards#ran","syntology_url":"https://syntology.ai/paper/2109.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.10197"}},"official":{"repos":["jitao-xu/dual-decoding"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/did2s-two-stage-difference-in-differences","slug":"did2s-two-stage-difference-in-differences","title":"{did2s}: Two-Stage Difference-in-Differences","date":"2021-09-10","arxiv_id":"2109.05913","repositories_listed":1,"syntology":null},{"url":"/paper/mining-the-benefits-of-two-stage-and-one","slug":"mining-the-benefits-of-two-stage-and-one","title":"Mining the Benefits of Two-stage and One-stage HOI Detection","date":"2021-08-11","arxiv_id":"2108.05077","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mining-the-benefits-of-two-stage-and-one#ran","syntology_url":"https://syntology.ai/paper/2108.05077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05077"}},"official":{"repos":["YueLiao/CDN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-tale-of-two-long-tails","slug":"a-tale-of-two-long-tails","title":"A Tale Of Two Long Tails","date":"2021-07-27","arxiv_id":"2107.13098","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/a-tale-of-two-long-tails#ran","syntology_url":"https://syntology.ai/paper/2107.13098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.13098"}},"official":{"repos":["dsouzadaniel/long_tail"],"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/ttan-two-stage-temporal-alignment-network-for","slug":"ttan-two-stage-temporal-alignment-network-for","title":"TA2N: Two-Stage Action Alignment Network for Few-shot Action Recognition","date":"2021-07-10","arxiv_id":"2107.04782","repositories_listed":1,"syntology":null},{"url":"/paper/mshap-shap-values-for-two-part-models","slug":"mshap-shap-values-for-two-part-models","title":"mSHAP: SHAP Values for Two-Part Models","date":"2021-06-16","arxiv_id":"2106.08990","repositories_listed":1,"syntology":null},{"url":"/paper/meta-two-sample-testing-learning-kernels-for","slug":"meta-two-sample-testing-learning-kernels-for","title":"Meta Two-Sample Testing: Learning Kernels for Testing with Limited Data","date":"2021-06-14","arxiv_id":"2106.07636","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-two-sample-testing-learning-kernels-for#ran","syntology_url":"https://syntology.ai/paper/2106.07636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07636"}},"official":{"repos":["fengliu90/MetaTesting"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/it-takes-two-to-tango-mixup-for-deep-metric","slug":"it-takes-two-to-tango-mixup-for-deep-metric","title":"It Takes Two to Tango: Mixup for Deep Metric Learning","date":"2021-06-09","arxiv_id":"2106.04990","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/it-takes-two-to-tango-mixup-for-deep-metric#ran","syntology_url":"https://syntology.ai/paper/2106.04990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04990"}},"official":{"repos":["billpsomas/Metrix_ICLR22"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inverse-design-of-two-dimensional-materials","slug":"inverse-design-of-two-dimensional-materials","title":"Inverse design of two-dimensional materials with invertible neural networks","date":"2021-06-06","arxiv_id":"2106.03013","repositories_listed":1,"syntology":null},{"url":"/paper/subgroup-fairness-in-two-sided-markets","slug":"subgroup-fairness-in-two-sided-markets","title":"Subgroup Fairness in Two-Sided Markets","date":"2021-06-04","arxiv_id":"2106.02702","repositories_listed":1,"syntology":null},{"url":"/paper/consistent-two-flow-network-for-tele","slug":"consistent-two-flow-network-for-tele","title":"Consistent Two-Flow Network for Tele-Registration of Point Clouds","date":"2021-06-01","arxiv_id":"2106.00329","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-training-with-rectified-rejection","slug":"adversarial-training-with-rectified-rejection","title":"Two Coupled Rejection Metrics Can Tell Adversarial Examples Apart","date":"2021-05-31","arxiv_id":"2105.14785","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/adversarial-training-with-rectified-rejection#ran","syntology_url":"https://syntology.ai/paper/2105.14785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14785"}},"official":{"repos":["P2333/Rectified-Rejection"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/exploration-and-exploitation-two-ways-to","slug":"exploration-and-exploitation-two-ways-to","title":"Exploration and Exploitation: Two Ways to Improve Chinese Spelling Correction Models","date":"2021-05-31","arxiv_id":"2105.14813","repositories_listed":1,"syntology":null},{"url":"/paper/two-dimensional-multi-target-detection","slug":"two-dimensional-multi-target-detection","title":"Two-dimensional multi-target detection: an autocorrelation analysis approach","date":"2021-05-14","arxiv_id":"2105.06765","repositories_listed":1,"syntology":null},{"url":"/paper/kernel-mmd-two-sample-tests-for-manifold-data","slug":"kernel-mmd-two-sample-tests-for-manifold-data","title":"Kernel Two-Sample Tests for Manifold Data","date":"2021-05-07","arxiv_id":"2105.03425","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-two-step-networks-for-temporal","slug":"efficient-two-step-networks-for-temporal","title":"Efficient Two-Step Networks for Temporal Action Segmentation","date":"2021-04-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-two-stage-high-resolution-image","slug":"deep-two-stage-high-resolution-image","title":"Deep Two-Stage High-Resolution Image Inpainting","date":"2021-04-27","arxiv_id":"2104.13464","repositories_listed":1,"syntology":null},{"url":"/paper/a-two-stage-attentive-network-for-single","slug":"a-two-stage-attentive-network-for-single","title":"A Two-Stage Attentive Network for Single Image Super-Resolution","date":"2021-04-21","arxiv_id":"2104.10488","repositories_listed":1,"syntology":null},{"url":"/paper/noisycur-an-algorithm-for-two-cost-budgeted","slug":"noisycur-an-algorithm-for-two-cost-budgeted","title":"NoisyCUR: An algorithm for two-cost budgeted matrix completion","date":"2021-04-16","arxiv_id":"2104.08026","repositories_listed":1,"syntology":null},{"url":"/paper/tsnat-two-step-non-autoregressvie-transformer","slug":"tsnat-two-step-non-autoregressvie-transformer","title":"TSNAT: Two-Step Non-Autoregressvie Transformer Models for Speech Recognition","date":"2021-04-04","arxiv_id":"2104.01522","repositories_listed":1,"syntology":null},{"url":"/paper/deep-two-view-structure-from-motion-revisited","slug":"deep-two-view-structure-from-motion-revisited","title":"Deep Two-View Structure-from-Motion Revisited","date":"2021-04-01","arxiv_id":"2104.00556","repositories_listed":1,"syntology":{"n":21,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":2,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-two-view-structure-from-motion-revisited#ran","syntology_url":"https://syntology.ai/paper/2104.00556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00556"}},"official":{"repos":["jytime/Deep-SfM-Revisited"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/lessons-from-chasing-few-shot-learning","slug":"lessons-from-chasing-few-shot-learning","title":"Two Sides of Meta-Learning Evaluation: In vs. Out of Distribution","date":"2021-02-23","arxiv_id":"2102.11503","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-two-stream-network-for-violence","slug":"efficient-two-stream-network-for-violence","title":"Efficient Two-Stream Network for Violence Detection Using Separable Convolutional LSTM","date":"2021-02-21","arxiv_id":"2102.10590","repositories_listed":1,"syntology":null},{"url":"/paper/segmenting-two-dimensional-structures-with","slug":"segmenting-two-dimensional-structures-with","title":"Segmenting two-dimensional structures with strided tensor networks","date":"2021-02-13","arxiv_id":"2102.06900","repositories_listed":1,"syntology":null},{"url":"/paper/two-training-strategies-for-improving","slug":"two-training-strategies-for-improving","title":"Two Training Strategies for Improving Relation Extraction over Universal Graph","date":"2021-02-12","arxiv_id":"2102.06540","repositories_listed":1,"syntology":null},{"url":"/paper/an-optimal-witness-function-for-two-sample","slug":"an-optimal-witness-function-for-two-sample","title":"A Witness Two-Sample Test","date":"2021-02-10","arxiv_id":"2102.05573","repositories_listed":1,"syntology":null},{"url":"/paper/two-novel-performance-improvements-for","slug":"two-novel-performance-improvements-for","title":"Two Novel Performance Improvements for Evolving CNN Topologies","date":"2021-02-10","arxiv_id":"2102.05451","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-two-stage-approach-to-computing","slug":"a-scalable-two-stage-approach-to-computing","title":"A Scalable Two Stage Approach to Computing Optimal Decision Sets","date":"2021-02-03","arxiv_id":"2102.01904","repositories_listed":1,"syntology":null},{"url":"/paper/two-demonstrations-of-the-machine-translation","slug":"two-demonstrations-of-the-machine-translation","title":"Two Demonstrations of the Machine Translation Applications to Historical Documents","date":"2021-02-02","arxiv_id":"2102.01417","repositories_listed":1,"syntology":null},{"url":"/paper/origamiset1-0-two-new-datasets-for-origami","slug":"origamiset1-0-two-new-datasets-for-origami","title":"OrigamiSet1.0: Two New Datasets for Origami Classification and Difficulty Estimation","date":"2021-01-14","arxiv_id":"2101.05470","repositories_listed":1,"syntology":null},{"url":"/paper/cobbo-coordinate-backoff-bayesian","slug":"cobbo-coordinate-backoff-bayesian","title":"CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels","date":"2021-01-13","arxiv_id":"2101.05147","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-segment-rigid-motions-from-two","slug":"learning-to-segment-rigid-motions-from-two","title":"Learning to Segment Rigid Motions from Two Frames","date":"2021-01-11","arxiv_id":"2101.03694","repositories_listed":1,"syntology":null},{"url":"/paper/t-net-effective-permutation-equivariant","slug":"t-net-effective-permutation-equivariant","title":"T-Net: Effective Permutation-Equivariant Network for Two-View Correspondence Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-in-two-player-games-between","slug":"learning-in-two-player-games-between","title":"Learning in two-player games between transparent opponents","date":"2020-12-04","arxiv_id":"2012.02671","repositories_listed":1,"syntology":null},{"url":"/paper/two-stage-single-image-reflection-removal","slug":"two-stage-single-image-reflection-removal","title":"Two-Stage Single Image Reflection Removal with Reflection-Aware Guidance","date":"2020-12-02","arxiv_id":"2012.00945","repositories_listed":1,"syntology":null},{"url":"/paper/a-two-step-approach-for-automatic-ocr-post","slug":"a-two-step-approach-for-automatic-ocr-post","title":"A Two-Step Approach for Automatic OCR Post-Correction","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ego2hands-a-dataset-for-egocentric-two-hand","slug":"ego2hands-a-dataset-for-egocentric-two-hand","title":"Ego2Hands: A Dataset for Egocentric Two-hand Segmentation and Detection","date":"2020-11-14","arxiv_id":"2011.07252","repositories_listed":1,"syntology":null},{"url":"/paper/two-sided-fairness-in-non-personalised","slug":"two-sided-fairness-in-non-personalised","title":"Two-Sided Fairness in Non-Personalised Recommendations","date":"2020-11-10","arxiv_id":"2011.05287","repositories_listed":1,"syntology":null},{"url":"/paper/two-stage-training-of-graph-neural-networks","slug":"two-stage-training-of-graph-neural-networks","title":"Two-stage Training of Graph Neural Networks for Graph Classification","date":"2020-11-10","arxiv_id":"2011.05097","repositories_listed":1,"syntology":null},{"url":"/paper/comparing-the-market-microstructure-between","slug":"comparing-the-market-microstructure-between","title":"Comparing the market microstructure between two South African exchanges","date":"2020-11-09","arxiv_id":"2011.04367","repositories_listed":1,"syntology":null},{"url":"/paper/a-two-stage-approach-to-device-robust","slug":"a-two-stage-approach-to-device-robust","title":"A Two-Stage Approach to Device-Robust Acoustic Scene Classification","date":"2020-11-03","arxiv_id":"2011.01447","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-two-stage-approach-to-device-robust#ran","syntology_url":"https://syntology.ai/paper/2011.01447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01447"}},"official":{"repos":["MihawkHu/DCASE2020_task1"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/two-level-k-fac-preconditioning-for-deep","slug":"two-level-k-fac-preconditioning-for-deep","title":"Two-Level K-FAC Preconditioning for Deep Learning","date":"2020-11-01","arxiv_id":"2011.00573","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-bilingual-lexicon-induction","slug":"semi-supervised-bilingual-lexicon-induction","title":"Semi-Supervised Bilingual Lexicon Induction with Two-way Interaction","date":"2020-10-14","arxiv_id":"2010.07101","repositories_listed":1,"syntology":null},{"url":"/paper/two-stream-encoder-decoder-network-for","slug":"two-stream-encoder-decoder-network-for","title":"Two-stream Encoder-Decoder Network for Localizing Image Forgeries","date":"2020-09-27","arxiv_id":"2009.12881","repositories_listed":1,"syntology":null},{"url":"/paper/factor-driven-two-regime-regression","slug":"factor-driven-two-regime-regression","title":"Factor-Driven Two-Regime Regression","date":"2020-09-10","arxiv_id":"1810.11109","repositories_listed":1,"syntology":null},{"url":"/paper/ref-nms-breaking-proposal-bottlenecks-in-two","slug":"ref-nms-breaking-proposal-bottlenecks-in-two","title":"Ref-NMS: Breaking Proposal Bottlenecks in Two-Stage Referring Expression Grounding","date":"2020-09-03","arxiv_id":"2009.01449","repositories_listed":1,"syntology":null},{"url":"/paper/a-kernel-two-sample-test-for-functional-data","slug":"a-kernel-two-sample-test-for-functional-data","title":"A Kernel Two-Sample Test for Functional Data","date":"2020-08-25","arxiv_id":"2008.11095","repositories_listed":1,"syntology":null},{"url":"/paper/learning-two-layer-residual-networks-with","slug":"learning-two-layer-residual-networks-with","title":"Nonparametric Learning of Two-Layer ReLU Residual Units","date":"2020-08-17","arxiv_id":"2008.07648","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-training-and-provable-robustness","slug":"adversarial-training-and-provable-robustness","title":"Adversarial Training and Provable Robustness: A Tale of Two Objectives","date":"2020-08-13","arxiv_id":"2008.06081","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 1 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-training-and-provable-robustness#ran","syntology_url":"https://syntology.ai/paper/2008.06081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06081"}},"official":{"repos":["JmfanBU/AdvIBP"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/asymmetric-two-stream-architecture-for","slug":"asymmetric-two-stream-architecture-for","title":"Asymmetric Two-Stream Architecture for Accurate RGB-D Saliency Detection","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/corner-proposal-network-for-anchor-free-two","slug":"corner-proposal-network-for-anchor-free-two","title":"Corner Proposal Network for Anchor-free, Two-stage Object Detection","date":"2020-07-27","arxiv_id":"2007.13816","repositories_listed":1,"syntology":null},{"url":"/paper/image-classification-by-reinforcement","slug":"image-classification-by-reinforcement","title":"Image Classification by Reinforcement Learning with Two-State Q-Learning","date":"2020-06-28","arxiv_id":"2007.01298","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-baroque-two-part-counterpoint-with","slug":"modeling-baroque-two-part-counterpoint-with","title":"Modeling Baroque Two-Part Counterpoint with Neural Machine Translation","date":"2020-06-25","arxiv_id":"2006.14221","repositories_listed":1,"syntology":null},{"url":"/paper/condensing-two-stage-detection-with-automatic","slug":"condensing-two-stage-detection-with-automatic","title":"Condensing Two-stage Detection with Automatic Object Key Part Discovery","date":"2020-06-10","arxiv_id":"2006.05597","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-discretization-by-two","slug":"unsupervised-discretization-by-two","title":"Unsupervised Discretization by Two-dimensional MDL-based Histogram","date":"2020-06-02","arxiv_id":"2006.01893","repositories_listed":1,"syntology":null},{"url":"/paper/interactive-two-stream-decoder-for-accurate","slug":"interactive-two-stream-decoder-for-accurate","title":"Interactive Two-Stream Decoder for Accurate and Fast Saliency Detection","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-dual-paraphrasing-for-two-stage","slug":"unsupervised-dual-paraphrasing-for-two-stage","title":"Unsupervised Dual Paraphrasing for Two-stage Semantic Parsing","date":"2020-05-27","arxiv_id":"2005.13485","repositories_listed":1,"syntology":null},{"url":"/paper/a-two-stage-masked-lm-method-for-term-set","slug":"a-two-stage-masked-lm-method-for-term-set","title":"A Two-Stage Masked LM Method for Term Set Expansion","date":"2020-05-03","arxiv_id":"2005.01063","repositories_listed":1,"syntology":null},{"url":"/paper/the-two-kinds-of-free-energy-and-the-bayesian","slug":"the-two-kinds-of-free-energy-and-the-bayesian","title":"The Two Kinds of Free Energy and the Bayesian Revolution","date":"2020-04-24","arxiv_id":"2004.11763","repositories_listed":1,"syntology":null},{"url":"/paper/tuigan-learning-versatile-image-to-image","slug":"tuigan-learning-versatile-image-to-image","title":"TuiGAN: Learning Versatile Image-to-Image Translation with Two Unpaired Images","date":"2020-04-09","arxiv_id":"2004.04634","repositories_listed":1,"syntology":null},{"url":"/paper/two-halves-of-a-meaningful-text-are","slug":"two-halves-of-a-meaningful-text-are","title":"Two halves of a meaningful text are statistically different","date":"2020-04-09","arxiv_id":"2004.06474","repositories_listed":1,"syntology":null},{"url":"/paper/dualsdf-semantic-shape-manipulation-using-a","slug":"dualsdf-semantic-shape-manipulation-using-a","title":"DualSDF: Semantic Shape Manipulation using a Two-Level Representation","date":"2020-04-06","arxiv_id":"2004.02869","repositories_listed":1,"syntology":null},{"url":"/paper/two-stream-amtnet-for-action-detection","slug":"two-stream-amtnet-for-action-detection","title":"Two-Stream AMTnet for Action Detection","date":"2020-04-03","arxiv_id":"2004.01494","repositories_listed":1,"syntology":null},{"url":"/paper/packingsolver-a-solver-for-packing-problems","slug":"packingsolver-a-solver-for-packing-problems","title":"An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems","date":"2020-04-02","arxiv_id":"2004.02603","repositories_listed":1,"syntology":null},{"url":"/paper/two-shot-spatially-varying-brdf-and-shape","slug":"two-shot-spatially-varying-brdf-and-shape","title":"Two-shot Spatially-varying BRDF and Shape Estimation","date":"2020-04-01","arxiv_id":"2004.00403","repositories_listed":1,"syntology":null},{"url":"/paper/deformation-flow-based-two-stream-network-for","slug":"deformation-flow-based-two-stream-network-for","title":"Deformation Flow Based Two-Stream Network for Lip Reading","date":"2020-03-12","arxiv_id":"2003.05709","repositories_listed":1,"syntology":null},{"url":"/paper/attention-aware-fusion-rgb-d-face-recognition","slug":"attention-aware-fusion-rgb-d-face-recognition","title":"Two-Level Attention-based Fusion Learning for RGB-D Face Recognition","date":"2020-02-29","arxiv_id":"2003.00168","repositories_listed":1,"syntology":null}],"record_sha256":"3b0edfc323befdb4677d56c64b435f3e1f57d4da399cf0bf10604d6a7582b9d5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}