{"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/ran/1","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,42],"of":42,"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/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/leveraging-the-two-timescale-regime-to","slug":"leveraging-the-two-timescale-regime-to","title":"Leveraging the two timescale regime to demonstrate convergence of neural networks","date":"2023-04-19","arxiv_id":"2304.09576","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/leveraging-the-two-timescale-regime-to#ran","syntology_url":"https://syntology.ai/paper/2304.09576","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.09576"}},"official":{"repos":["PierreMarion23/two-timescale-nn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/finalmlp-an-enhanced-two-stream-mlp-model-for-1","slug":"finalmlp-an-enhanced-two-stream-mlp-model-for-1","title":"FinalMLP: An Enhanced Two-Stream MLP Model for CTR Prediction","date":"2023-04-03","arxiv_id":"2304.00902","repositories_listed":4,"syntology":{"n":16,"n_ran":13,"n_constructed":4,"n_ran_checked":8,"n_instrument":5,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/finalmlp-an-enhanced-two-stream-mlp-model-for-1#ran","syntology_url":"https://syntology.ai/paper/2304.00902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00902"}},"official":{"repos":["reczoo/RecZoo"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/acr-attention-collaboration-based-regressor","slug":"acr-attention-collaboration-based-regressor","title":"ACR: Attention Collaboration-based Regressor for Arbitrary Two-Hand Reconstruction","date":"2023-03-10","arxiv_id":"2303.05938","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":4,"phrase":"12 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/acr-attention-collaboration-based-regressor#ran","syntology_url":"https://syntology.ai/paper/2303.05938","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.05938"}},"official":{"repos":["zhengdiyu/arbitrary-hands-3d-reconstruction"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/im2hands-learning-attentive-implicit","slug":"im2hands-learning-attentive-implicit","title":"Im2Hands: Learning Attentive Implicit Representation of Interacting Two-Hand Shapes","date":"2023-02-28","arxiv_id":"2302.14348","repositories_listed":1,"syntology":{"n":14,"n_ran":8,"n_constructed":7,"n_ran_checked":7,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":14,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/im2hands-learning-attentive-implicit#ran","syntology_url":"https://syntology.ai/paper/2302.14348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.14348"}},"official":{"repos":["jyunlee/im2hands"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-latency-aware-cnn-depth-compression","slug":"efficient-latency-aware-cnn-depth-compression","title":"Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming","date":"2023-01-28","arxiv_id":"2301.12187","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-latency-aware-cnn-depth-compression#ran","syntology_url":"https://syntology.ai/paper/2301.12187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12187"}},"official":{"repos":["snu-mllab/efficient-cnn-depth-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-permutation-free-kernel-two-sample-test","slug":"a-permutation-free-kernel-two-sample-test","title":"A Permutation-free Kernel Two-Sample Test","date":"2022-11-27","arxiv_id":"2211.14908","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-permutation-free-kernel-two-sample-test#ran","syntology_url":"https://syntology.ai/paper/2211.14908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14908"}},"official":null}},{"url":"/paper/zigzag-universal-sampling-free-uncertainty","slug":"zigzag-universal-sampling-free-uncertainty","title":"ZigZag: Universal Sampling-free Uncertainty Estimation Through Two-Step Inference","date":"2022-11-21","arxiv_id":"2211.11435","repositories_listed":2,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/zigzag-universal-sampling-free-uncertainty#ran","syntology_url":"https://syntology.ai/paper/2211.11435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11435"}},"official":{"repos":["cvlab-epfl/zigzag"],"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/it-takes-two-learning-to-plan-for-human-robot","slug":"it-takes-two-learning-to-plan-for-human-robot","title":"It Takes Two: Learning to Plan for Human-Robot Cooperative Carrying","date":"2022-09-26","arxiv_id":"2209.12890","repositories_listed":2,"syntology":{"n":13,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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) · 8 unverified","sample_list":"/paper/it-takes-two-learning-to-plan-for-human-robot#ran","syntology_url":"https://syntology.ai/paper/2209.12890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.12890"}},"official":{"repos":["eleyng/table-carrying-ai","eleyng/cooperative_planner"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-geometric-space-embedding-model-for-two","slug":"dual-geometric-space-embedding-model-for-two","title":"Dual-Geometric Space Embedding Model for Two-View Knowledge Graphs","date":"2022-09-19","arxiv_id":"2209.08767","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dual-geometric-space-embedding-model-for-two#ran","syntology_url":"https://syntology.ai/paper/2209.08767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08767"}},"official":{"repos":["roshnigiyer/dgs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/introspective-learning-a-two-stage-approach-1","slug":"introspective-learning-a-two-stage-approach-1","title":"Introspective Learning : A Two-Stage Approach for Inference in Neural Networks","date":"2022-09-17","arxiv_id":"2209.08425","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/introspective-learning-a-two-stage-approach-1#ran","syntology_url":"https://syntology.ai/paper/2209.08425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08425"}},"official":{"repos":["olivesgatech/introspective-learning"],"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/learning-optimal-transport-between-two","slug":"learning-optimal-transport-between-two","title":"Learning Optimal Transport Between two Empirical Distributions with Normalizing Flows","date":"2022-07-04","arxiv_id":"2207.01246","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-optimal-transport-between-two#ran","syntology_url":"https://syntology.ai/paper/2207.01246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01246"}},"official":{"repos":["florentincdx/swot-flow"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/automl-two-sample-test","slug":"automl-two-sample-test","title":"AutoML Two-Sample Test","date":"2022-06-17","arxiv_id":"2206.08843","repositories_listed":3,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":2,"n_instrument":8,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 8 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/automl-two-sample-test#ran","syntology_url":"https://syntology.ai/paper/2206.08843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08843"}},"official":{"repos":["antoninschrab/fl-mmdagg","jmkuebler/auto-tst","jmkuebler/automl-tst-paper"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/gensdf-two-stage-learning-of-generalizable","slug":"gensdf-two-stage-learning-of-generalizable","title":"GenSDF: Two-Stage Learning of Generalizable Signed Distance Functions","date":"2022-06-06","arxiv_id":"2206.02780","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/gensdf-two-stage-learning-of-generalizable#ran","syntology_url":"https://syntology.ai/paper/2206.02780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02780"}},"official":{"repos":["princeton-computational-imaging/gensdf"],"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/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/stargraph-a-coarse-to-fine-representation","slug":"stargraph-a-coarse-to-fine-representation","title":"StarGraph: Knowledge Representation Learning based on Incomplete Two-hop Subgraph","date":"2022-05-27","arxiv_id":"2205.14209","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":4,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stargraph-a-coarse-to-fine-representation#ran","syntology_url":"https://syntology.ai/paper/2205.14209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14209"}},"official":{"repos":["hzli-ucas/stargraph"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neur2sp-neural-two-stage-stochastic","slug":"neur2sp-neural-two-stage-stochastic","title":"Neur2SP: Neural Two-Stage Stochastic Programming","date":"2022-05-20","arxiv_id":"2205.12006","repositories_listed":5,"syntology":{"n":10,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"5 ran (of which 2 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) · 5 unverified","sample_list":"/paper/neur2sp-neural-two-stage-stochastic#ran","syntology_url":"https://syntology.ai/paper/2205.12006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12006"}},"official":{"repos":["khalil-research/neur2sp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"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/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/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/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/mmd-aggregated-two-sample-test","slug":"mmd-aggregated-two-sample-test","title":"MMD Aggregated Two-Sample Test","date":"2021-10-28","arxiv_id":"2110.15073","repositories_listed":3,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":11,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mmd-aggregated-two-sample-test#ran","syntology_url":"https://syntology.ai/paper/2110.15073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15073"}},"official":{"repos":["antoninschrab/mmdagg"],"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":["named_in_paper"]}}},{"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/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/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/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/proximal-causal-learning-with-kernels-two","slug":"proximal-causal-learning-with-kernels-two","title":"Proximal Causal Learning with Kernels: Two-Stage Estimation and Moment Restriction","date":"2021-05-10","arxiv_id":"2105.04544","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/proximal-causal-learning-with-kernels-two#ran","syntology_url":"https://syntology.ai/paper/2105.04544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04544"}},"official":{"repos":["afsaneh-mastouri/kpv","yuchen-zhu/kernel_proxies"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/label-leakage-and-protection-in-two-party","slug":"label-leakage-and-protection-in-two-party","title":"Label Leakage and Protection in Two-party Split Learning","date":"2021-02-17","arxiv_id":"2102.08504","repositories_listed":2,"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":0,"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/label-leakage-and-protection-in-two-party#ran","syntology_url":"https://syntology.ai/paper/2102.08504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08504"}},"official":{"repos":["bytedance/fedlearner"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"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/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/ransac-flow-generic-two-stage-image-alignment","slug":"ransac-flow-generic-two-stage-image-alignment","title":"RANSAC-Flow: generic two-stage image alignment","date":"2020-04-03","arxiv_id":"2004.01526","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ransac-flow-generic-two-stage-image-alignment#ran","syntology_url":"https://syntology.ai/paper/2004.01526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01526"}},"official":null}},{"url":"/paper/two-stage-discriminative-re-ranking-for-large","slug":"two-stage-discriminative-re-ranking-for-large","title":"Two-stage Discriminative Re-ranking for Large-scale Landmark Retrieval","date":"2020-03-25","arxiv_id":"2003.11211","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/two-stage-discriminative-re-ranking-for-large#ran","syntology_url":"https://syntology.ai/paper/2003.11211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11211"}},"official":{"repos":["cvdfoundation/google-landmark","lyakaap/Landmark2019-1st-and-3rd-Place-Solution"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fairrec-two-sided-fairness-for-personalized","slug":"fairrec-two-sided-fairness-for-personalized","title":"FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms","date":"2020-02-25","arxiv_id":"2002.10764","repositories_listed":2,"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/fairrec-two-sided-fairness-for-personalized#ran","syntology_url":"https://syntology.ai/paper/2002.10764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10764"}},"official":{"repos":["gourabkumarpatro/FairRec_www_2020"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-deep-kernels-for-non-parametric-two","slug":"learning-deep-kernels-for-non-parametric-two","title":"Learning Deep Kernels for Non-Parametric Two-Sample Tests","date":"2020-02-21","arxiv_id":"2002.09116","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/learning-deep-kernels-for-non-parametric-two#ran","syntology_url":"https://syntology.ai/paper/2002.09116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09116"}},"official":{"repos":["fengliu90/DK-for-TST"],"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/training-two-layer-relu-networks-with","slug":"training-two-layer-relu-networks-with","title":"Training Two-Layer ReLU Networks with Gradient Descent is Inconsistent","date":"2020-02-12","arxiv_id":"2002.04861","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/training-two-layer-relu-networks-with#ran","syntology_url":"https://syntology.ai/paper/2002.04861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04861"}},"official":{"repos":["dholzmueller/nn_inconsistency"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/comparing-distributions-ell_1-geometry","slug":"comparing-distributions-ell_1-geometry","title":"Comparing distributions: $\\ell_1$ geometry improves kernel two-sample testing","date":"2019-09-19","arxiv_id":"1909.09264","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/comparing-distributions-ell_1-geometry#ran","syntology_url":"https://syntology.ai/paper/1909.09264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.09264"}},"official":{"repos":["meyerscetbon/L1_test","meyerscetbon/l1_two_sample_test"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-two-view-correspondences-and","slug":"learning-two-view-correspondences-and","title":"Learning Two-View Correspondences and Geometry Using Order-Aware Network","date":"2019-08-14","arxiv_id":"1908.04964","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":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-two-view-correspondences-and#ran","syntology_url":"https://syntology.ai/paper/1908.04964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04964"}},"official":{"repos":["zjhthu/OANet"],"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/two-at-once-enhancing-learning-and","slug":"two-at-once-enhancing-learning-and","title":"Two at Once: Enhancing Learning and Generalization Capacities via IBN-Net","date":"2018-07-25","arxiv_id":"1807.09441","repositories_listed":25,"syntology":{"n":16,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/two-at-once-enhancing-learning-and#ran","syntology_url":"https://syntology.ai/paper/1807.09441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.09441"}},"official":{"repos":["XingangPan/IBN-Net"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/spell-once-summon-anywhere-a-two-level-open","slug":"spell-once-summon-anywhere-a-two-level-open","title":"Spell Once, Summon Anywhere: A Two-Level Open-Vocabulary Language Model","date":"2018-04-23","arxiv_id":"1804.08205","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/spell-once-summon-anywhere-a-two-level-open#ran","syntology_url":"https://syntology.ai/paper/1804.08205","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.08205"}},"official":{"repos":["sjmielke/spell-once"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/two-stream-convolutional-networks-for-action","slug":"two-stream-convolutional-networks-for-action","title":"Two-Stream Convolutional Networks for Action Recognition in Videos","date":"2014-06-09","arxiv_id":"1406.2199","repositories_listed":7,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/two-stream-convolutional-networks-for-action#ran","syntology_url":"https://syntology.ai/paper/1406.2199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.2199"}},"official":{"repos":["feichtenhofer/twostreamfusion"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"b401817af40b6ba61dd0bac86b7150a55e34408a8f9d50173d202135e5d612e6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}