{"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/open-question/papers/2","list_of":"/task/open-question","task":"Open-Ended Question Answering","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":8,"rows_per_page":100,"rows":[101,200],"of":796,"counts":{"archive_papers_tagged":796,"with_a_code_link":228,"where_syntology_ran_a_sample":70,"not_listed_spam_title":0,"listed":796,"listed_where_code_ran":70,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":11,"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/open-question","prev":"/task/open-question","next":"/task/open-question/papers/3","papers":[{"url":"/paper/legal-case-document-summarization-extractive","slug":"legal-case-document-summarization-extractive","title":"Legal Case Document Summarization: Extractive and Abstractive Methods and their Evaluation","date":"2022-10-14","arxiv_id":"2210.07544","repositories_listed":1,"syntology":null},{"url":"/paper/double-bubble-toil-and-trouble-enhancing","slug":"double-bubble-toil-and-trouble-enhancing","title":"Double Bubble, Toil and Trouble: Enhancing Certified Robustness through Transitivity","date":"2022-10-12","arxiv_id":"2210.06077","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/double-bubble-toil-and-trouble-enhancing#ran","syntology_url":"https://syntology.ai/paper/2210.06077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06077"}},"official":{"repos":["andrew-cullen/doublebubble"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/opencqa-open-ended-question-answering-with","slug":"opencqa-open-ended-question-answering-with","title":"OpenCQA: Open-ended Question Answering with Charts","date":"2022-10-12","arxiv_id":"2210.06628","repositories_listed":1,"syntology":null},{"url":"/paper/kalm-knowledge-aware-integration-of-local","slug":"kalm-knowledge-aware-integration-of-local","title":"KALM: Knowledge-Aware Integration of Local, Document, and Global Contexts for Long Document Understanding","date":"2022-10-08","arxiv_id":"2210.04105","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/kalm-knowledge-aware-integration-of-local#ran","syntology_url":"https://syntology.ai/paper/2210.04105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.04105"}},"official":{"repos":["bunsenfeng/kalm"],"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/are-representations-built-from-the-ground-up","slug":"are-representations-built-from-the-ground-up","title":"Are Representations Built from the Ground Up? An Empirical Examination of Local Composition in Language Models","date":"2022-10-07","arxiv_id":"2210.03575","repositories_listed":1,"syntology":null},{"url":"/paper/artificial-replay-a-meta-algorithm-for","slug":"artificial-replay-a-meta-algorithm-for","title":"Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits","date":"2022-09-30","arxiv_id":"2210.00025","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/artificial-replay-a-meta-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2210.00025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00025"}},"official":{"repos":["lily-x/artificial-replay"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vip-towards-universal-visual-reward-and","slug":"vip-towards-universal-visual-reward-and","title":"VIP: Towards Universal Visual Reward and Representation via Value-Implicit Pre-Training","date":"2022-09-30","arxiv_id":"2210.00030","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/vip-towards-universal-visual-reward-and#ran","syntology_url":"https://syntology.ai/paper/2210.00030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00030"}},"official":{"repos":["facebookresearch/vip"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-transductions-to-test-systematic","slug":"learning-transductions-to-test-systematic","title":"Benchmarking Compositionality with Formal Languages","date":"2022-08-17","arxiv_id":"2208.08195","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":2,"n_ran_checked":6,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-transductions-to-test-systematic#ran","syntology_url":"https://syntology.ai/paper/2208.08195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.08195"}},"official":{"repos":["valvoda/neuraltransducer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semantic-communications-with-discrete-time","slug":"semantic-communications-with-discrete-time","title":"Semantic Communications with Discrete-time Analog Transmission: A PAPR Perspective","date":"2022-08-17","arxiv_id":"2208.08342","repositories_listed":1,"syntology":null},{"url":"/paper/action-recognition-based-on-cross-situational","slug":"action-recognition-based-on-cross-situational","title":"Action Recognition based on Cross-Situational Action-object Statistics","date":"2022-08-15","arxiv_id":"2208.07344","repositories_listed":1,"syntology":null},{"url":"/paper/neuro-symbolic-computing-with-spiking-neural","slug":"neuro-symbolic-computing-with-spiking-neural","title":"Neuro-symbolic computing with spiking neural networks","date":"2022-08-04","arxiv_id":"2208.02576","repositories_listed":1,"syntology":null},{"url":"/paper/homomorphism-autoencoder-learning-group","slug":"homomorphism-autoencoder-learning-group","title":"Homomorphism Autoencoder -- Learning Group Structured Representations from Observed Transitions","date":"2022-07-25","arxiv_id":"2207.12067","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/homomorphism-autoencoder-learning-group#ran","syntology_url":"https://syntology.ai/paper/2207.12067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.12067"}},"official":{"repos":["hamzakeurti/homomorphismvae"],"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/leveraging-natural-supervision-for-language","slug":"leveraging-natural-supervision-for-language","title":"Leveraging Natural Supervision for Language Representation Learning and Generation","date":"2022-07-21","arxiv_id":"2207.10617","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-centering-theory-into-neural","slug":"incorporating-centering-theory-into-neural","title":"Incorporating Centering Theory into Neural Coreference Resolution","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-video-prediction-via-video-frame-1","slug":"optimizing-video-prediction-via-video-frame-1","title":"Optimizing Video Prediction via Video Frame Interpolation","date":"2022-06-27","arxiv_id":"2206.13454","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-rationales-for-explainable","slug":"learning-to-rank-rationales-for-explainable","title":"Learning to Rank Rationales for Explainable Recommendation","date":"2022-06-10","arxiv_id":"2206.05368","repositories_listed":1,"syntology":null},{"url":"/paper/is-mapping-necessary-for-realistic-pointgoal","slug":"is-mapping-necessary-for-realistic-pointgoal","title":"Is Mapping Necessary for Realistic PointGoal Navigation?","date":"2022-06-02","arxiv_id":"2206.00997","repositories_listed":1,"syntology":null},{"url":"/paper/split-kl-and-pac-bayes-split-kl-inequalities","slug":"split-kl-and-pac-bayes-split-kl-inequalities","title":"Split-kl and PAC-Bayes-split-kl Inequalities for Ternary Random Variables","date":"2022-06-01","arxiv_id":"2206.00706","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/split-kl-and-pac-bayes-split-kl-inequalities#ran","syntology_url":"https://syntology.ai/paper/2206.00706","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.00706"}},"official":{"repos":["stephanlorenzen/majorityvotebounds"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/nearest-neighbor-zero-shot-inference","slug":"nearest-neighbor-zero-shot-inference","title":"kNN-Prompt: Nearest Neighbor Zero-Shot Inference","date":"2022-05-27","arxiv_id":"2205.13792","repositories_listed":1,"syntology":null},{"url":"/paper/self-paced-multi-agent-reinforcement-learning","slug":"self-paced-multi-agent-reinforcement-learning","title":"Learning Progress Driven Multi-Agent Curriculum","date":"2022-05-20","arxiv_id":"2205.10016","repositories_listed":1,"syntology":null},{"url":"/paper/towards-biologically-plausible-dreaming-and","slug":"towards-biologically-plausible-dreaming-and","title":"Towards biologically plausible Dreaming and Planning in recurrent spiking networks","date":"2022-05-20","arxiv_id":"2205.10044","repositories_listed":1,"syntology":null},{"url":"/paper/the-first-optimal-acceleration-of-high-order","slug":"the-first-optimal-acceleration-of-high-order","title":"The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization","date":"2022-05-19","arxiv_id":"2205.09647","repositories_listed":1,"syntology":null},{"url":"/paper/language-models-can-see-plugging-visual","slug":"language-models-can-see-plugging-visual","title":"Language Models Can See: Plugging Visual Controls in Text Generation","date":"2022-05-05","arxiv_id":"2205.02655","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":2,"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/language-models-can-see-plugging-visual#ran","syntology_url":"https://syntology.ai/paper/2205.02655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02655"}},"official":{"repos":["yxuansu/magic"],"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/improving-passage-retrieval-with-zero-shot","slug":"improving-passage-retrieval-with-zero-shot","title":"Improving Passage Retrieval with Zero-Shot Question Generation","date":"2022-04-15","arxiv_id":"2204.07496","repositories_listed":1,"syntology":{"n":14,"n_ran":8,"n_constructed":4,"n_ran_checked":5,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"8 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/improving-passage-retrieval-with-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2204.07496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07496"}},"official":{"repos":["DevSinghSachan/unsupervised-passage-reranking"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comparative-study-of-pre-trained-encoders-1","slug":"a-comparative-study-of-pre-trained-encoders-1","title":"A Comparative Study of Pre-trained Encoders for Low-Resource Named Entity Recognition","date":"2022-04-11","arxiv_id":"2204.04980","repositories_listed":1,"syntology":null},{"url":"/paper/data-centric-green-ai-an-exploratory","slug":"data-centric-green-ai-an-exploratory","title":"Data-Centric Green AI: An Exploratory Empirical Study","date":"2022-04-06","arxiv_id":"2204.02766","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-traffic-prediction-with-graph","slug":"few-shot-traffic-prediction-with-graph","title":"Few-Sample Traffic Prediction with Graph Networks using Locale as Relational Inductive Biases","date":"2022-03-08","arxiv_id":"2203.03965","repositories_listed":1,"syntology":null},{"url":"/paper/m2i-from-factored-marginal-trajectory","slug":"m2i-from-factored-marginal-trajectory","title":"M2I: From Factored Marginal Trajectory Prediction to Interactive Prediction","date":"2022-02-24","arxiv_id":"2202.11884","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/m2i-from-factored-marginal-trajectory#ran","syntology_url":"https://syntology.ai/paper/2202.11884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11884"}},"official":null}},{"url":"/paper/overcoming-a-theoretical-limitation-of-self-1","slug":"overcoming-a-theoretical-limitation-of-self-1","title":"Overcoming a Theoretical Limitation of Self-Attention","date":"2022-02-24","arxiv_id":"2202.12172","repositories_listed":1,"syntology":null},{"url":"/paper/dissecting-graph-measure-performance-for-node","slug":"dissecting-graph-measure-performance-for-node","title":"Dissecting graph measure performance for node clustering in LFR parameter space","date":"2022-02-20","arxiv_id":"2202.09827","repositories_listed":1,"syntology":null},{"url":"/paper/maximizing-communication-efficiency-for-large","slug":"maximizing-communication-efficiency-for-large","title":"Maximizing Communication Efficiency for Large-scale Training via 0/1 Adam","date":"2022-02-12","arxiv_id":"2202.06009","repositories_listed":1,"syntology":null},{"url":"/paper/machine-explanations-and-human-understanding","slug":"machine-explanations-and-human-understanding","title":"Machine Explanations and Human Understanding","date":"2022-02-08","arxiv_id":"2202.04092","repositories_listed":1,"syntology":null},{"url":"/paper/weisfeiler-and-leman-go-infinite-spectral-and","slug":"weisfeiler-and-leman-go-infinite-spectral-and","title":"Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings","date":"2022-01-31","arxiv_id":"2201.13410","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":2,"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/weisfeiler-and-leman-go-infinite-spectral-and#ran","syntology_url":"https://syntology.ai/paper/2201.13410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.13410"}},"official":{"repos":["tpfi22/spectral-and-combinatorial"],"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/pcl-peer-contrastive-learning-with-diverse","slug":"pcl-peer-contrastive-learning-with-diverse","title":"PCL: Peer-Contrastive Learning with Diverse Augmentations for Unsupervised Sentence Embeddings","date":"2022-01-28","arxiv_id":"2201.12093","repositories_listed":1,"syntology":null},{"url":"/paper/an-analysis-on-ensemble-learning-optimized","slug":"an-analysis-on-ensemble-learning-optimized","title":"An Analysis on Ensemble Learning optimized Medical Image Classification with Deep Convolutional Neural Networks","date":"2022-01-27","arxiv_id":"2201.11440","repositories_listed":1,"syntology":null},{"url":"/paper/greaselm-graph-reasoning-enhanced-language-1","slug":"greaselm-graph-reasoning-enhanced-language-1","title":"GreaseLM: Graph REASoning Enhanced Language Models for Question Answering","date":"2022-01-21","arxiv_id":"2201.08860","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":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/greaselm-graph-reasoning-enhanced-language-1#ran","syntology_url":"https://syntology.ai/paper/2201.08860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08860"}},"official":{"repos":["snap-stanford/greaselm"],"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/pwm2vec-an-efficient-embedding-approach-for","slug":"pwm2vec-an-efficient-embedding-approach-for","title":"PWM2Vec: An Efficient Embedding Approach for Viral Host Specification from Coronavirus Spike Sequences","date":"2022-01-06","arxiv_id":"2201.02273","repositories_listed":1,"syntology":null},{"url":"/paper/evidentiality-guided-generation-for-knowledge","slug":"evidentiality-guided-generation-for-knowledge","title":"Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks","date":"2021-12-16","arxiv_id":"2112.08688","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/evidentiality-guided-generation-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2112.08688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.08688"}},"official":{"repos":["akariasai/evidentiality_qa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/think-big-teach-small-do-language-models","slug":"think-big-teach-small-do-language-models","title":"Think Big, Teach Small: Do Language Models Distil Occam’s Razor?","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/simple-stochastic-and-online-gradient","slug":"simple-stochastic-and-online-gradient","title":"Simple Stochastic and Online Gradient DescentAlgorithms for Pairwise Learning","date":"2021-11-23","arxiv_id":"2111.12050","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":2,"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/simple-stochastic-and-online-gradient#ran","syntology_url":"https://syntology.ai/paper/2111.12050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12050"}},"official":{"repos":["zhenhuan-yang/simple-pairwise"],"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/ubi-sleepnet-advanced-multimodal-fusion","slug":"ubi-sleepnet-advanced-multimodal-fusion","title":"Ubi-SleepNet: Advanced Multimodal Fusion Techniques for Three-stage Sleep Classification Using Ubiquitous Sensing","date":"2021-11-19","arxiv_id":"2111.10245","repositories_listed":1,"syntology":null},{"url":"/paper/quasi-potential-theory-for-escape-problem-1","slug":"quasi-potential-theory-for-escape-problem-1","title":"Exponential escape efficiency of SGD from sharp minima in non-stationary regime","date":"2021-11-07","arxiv_id":"2111.04004","repositories_listed":1,"syntology":null},{"url":"/paper/test-harder-than-you-train-probing-with","slug":"test-harder-than-you-train-probing-with","title":"Test Harder than You Train: Probing with Extrapolation Splits","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-hyperparameter-free-policy-selection","slug":"towards-hyperparameter-free-policy-selection","title":"Towards Hyperparameter-free Policy Selection for Offline Reinforcement Learning","date":"2021-10-26","arxiv_id":"2110.14000","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/towards-hyperparameter-free-policy-selection#ran","syntology_url":"https://syntology.ai/paper/2110.14000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14000"}},"official":{"repos":["jasonzhang929/BVFT_empirical_experiments"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/quantum-boosting-using-domain-partitioning","slug":"quantum-boosting-using-domain-partitioning","title":"Quantum Boosting using Domain-Partitioning Hypotheses","date":"2021-10-25","arxiv_id":"2110.12793","repositories_listed":1,"syntology":null},{"url":"/paper/real-m-towards-speech-separation-on-real","slug":"real-m-towards-speech-separation-on-real","title":"REAL-M: Towards Speech Separation on Real Mixtures","date":"2021-10-20","arxiv_id":"2110.10812","repositories_listed":1,"syntology":null},{"url":"/paper/result-diversification-by-multi-objective","slug":"result-diversification-by-multi-objective","title":"Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees","date":"2021-10-18","arxiv_id":"2110.09332","repositories_listed":1,"syntology":null},{"url":"/paper/open-domain-question-answering-over-virtual","slug":"open-domain-question-answering-over-virtual","title":"Open Domain Question Answering with A Unified Knowledge Interface","date":"2021-10-16","arxiv_id":"2110.08417","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-the-faithfulness-of-importance","slug":"evaluating-the-faithfulness-of-importance","title":"Evaluating the Faithfulness of Importance Measures in NLP by Recursively Masking Allegedly Important Tokens and Retraining","date":"2021-10-15","arxiv_id":"2110.08412","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluating-the-faithfulness-of-importance#ran","syntology_url":"https://syntology.ai/paper/2110.08412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08412"}},"official":{"repos":["AndreasMadsen/nlp-roar-interpretability"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generated-knowledge-prompting-for-commonsense","slug":"generated-knowledge-prompting-for-commonsense","title":"Generated Knowledge Prompting for Commonsense Reasoning","date":"2021-10-15","arxiv_id":"2110.08387","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generated-knowledge-prompting-for-commonsense#ran","syntology_url":"https://syntology.ai/paper/2110.08387","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08387"}},"official":{"repos":["liujch1998/gkp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sogcn-second-order-graph-convolutional-1","slug":"sogcn-second-order-graph-convolutional-1","title":"SoGCN: Second-Order Graph Convolutional Networks","date":"2021-10-14","arxiv_id":"2110.07141","repositories_listed":1,"syntology":null},{"url":"/paper/a-few-more-examples-may-be-worth-billions-of","slug":"a-few-more-examples-may-be-worth-billions-of","title":"A Few More Examples May Be Worth Billions of Parameters","date":"2021-10-08","arxiv_id":"2110.04374","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":6,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 2 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-few-more-examples-may-be-worth-billions-of#ran","syntology_url":"https://syntology.ai/paper/2110.04374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04374"}},"official":{"repos":["yuvalkirstain/lm-evaluation-harness"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lexglue-a-benchmark-dataset-for-legal","slug":"lexglue-a-benchmark-dataset-for-legal","title":"LexGLUE: A Benchmark Dataset for Legal Language Understanding in English","date":"2021-10-03","arxiv_id":"2110.00976","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/lexglue-a-benchmark-dataset-for-legal#ran","syntology_url":"https://syntology.ai/paper/2110.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.00976"}},"official":{"repos":["coastalcph/lex-glue"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/local-augmentation-for-graph-neural-networks","slug":"local-augmentation-for-graph-neural-networks","title":"Local Augmentation for Graph Neural Networks","date":"2021-09-08","arxiv_id":"2109.03856","repositories_listed":1,"syntology":null},{"url":"/paper/is-machine-learning-ready-for-traffic","slug":"is-machine-learning-ready-for-traffic","title":"Is Machine Learning Ready for Traffic Engineering Optimization?","date":"2021-09-03","arxiv_id":"2109.01445","repositories_listed":1,"syntology":null},{"url":"/paper/what-do-pre-trained-code-models-know-about","slug":"what-do-pre-trained-code-models-know-about","title":"What do pre-trained code models know about code?","date":"2021-08-25","arxiv_id":"2108.11308","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-transport-for-unsupervised","slug":"optimal-transport-for-unsupervised","title":"Optimal Transport for Unsupervised Denoising Learning","date":"2021-08-04","arxiv_id":"2108.02574","repositories_listed":1,"syntology":null},{"url":"/paper/learned-sorted-table-search-and-static","slug":"learned-sorted-table-search-and-static","title":"Learned Sorted Table Search and Static Indexes in Small Model Space","date":"2021-07-19","arxiv_id":"2107.09480","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-vs-discrete-optimization-of-deep","slug":"continuous-vs-discrete-optimization-of-deep","title":"Continuous vs. Discrete Optimization of Deep Neural Networks","date":"2021-07-14","arxiv_id":"2107.06608","repositories_listed":1,"syntology":null},{"url":"/paper/nonparametric-estimation-of-continuous-dpps","slug":"nonparametric-estimation-of-continuous-dpps","title":"Nonparametric estimation of continuous DPPs with kernel methods","date":"2021-06-27","arxiv_id":"2106.14210","repositories_listed":1,"syntology":null},{"url":"/paper/sparsistent-model-discovery","slug":"sparsistent-model-discovery","title":"Sparsistent Model Discovery","date":"2021-06-22","arxiv_id":"2106.11936","repositories_listed":1,"syntology":null},{"url":"/paper/doro-distributional-and-outlier-robust","slug":"doro-distributional-and-outlier-robust","title":"DORO: Distributional and Outlier Robust Optimization","date":"2021-06-11","arxiv_id":"2106.06142","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/doro-distributional-and-outlier-robust#ran","syntology_url":"https://syntology.ai/paper/2106.06142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06142"}},"official":{"repos":["RuntianZ/doro"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-nonlinear-observability-analysis-of-ambient","slug":"a-nonlinear-observability-analysis-of-ambient","title":"A Nonlinear Observability Analysis of Ambient Wind Estimation with Uncalibrated Sensors, Inspired by Insect Neural Encoding","date":"2021-06-07","arxiv_id":"2106.03974","repositories_listed":1,"syntology":null},{"url":"/paper/extreme-sparsity-gives-rise-to-functional","slug":"extreme-sparsity-gives-rise-to-functional","title":"Dynamics of specialization in neural modules under resource constraints","date":"2021-06-04","arxiv_id":"2106.02626","repositories_listed":1,"syntology":null},{"url":"/paper/gooaq-open-question-answering-with-diverse","slug":"gooaq-open-question-answering-with-diverse","title":"GooAQ: Open Question Answering with Diverse Answer Types","date":"2021-04-18","arxiv_id":"2104.08727","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/gooaq-open-question-answering-with-diverse#ran","syntology_url":"https://syntology.ai/paper/2104.08727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08727"}},"official":{"repos":["allenai/gooaq"],"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/improving-the-efficiency-and-robustness-of-1","slug":"improving-the-efficiency-and-robustness-of-1","title":"Improving the Efficiency and Robustness of Deepfakes Detection through Precise Geometric Features","date":"2021-04-09","arxiv_id":"2104.04480","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/improving-the-efficiency-and-robustness-of-1#ran","syntology_url":"https://syntology.ai/paper/2104.04480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04480"}},"official":{"repos":["frederickszk/LRNet"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/bossnas-exploring-hybrid-cnn-transformers","slug":"bossnas-exploring-hybrid-cnn-transformers","title":"BossNAS: Exploring Hybrid CNN-transformers with Block-wisely Self-supervised Neural Architecture Search","date":"2021-03-23","arxiv_id":"2103.12424","repositories_listed":1,"syntology":null},{"url":"/paper/using-latent-space-regression-to-analyze-and-1","slug":"using-latent-space-regression-to-analyze-and-1","title":"Using latent space regression to analyze and leverage compositionality in GANs","date":"2021-03-18","arxiv_id":"2103.10426","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-method-for-the-classification-of","slug":"an-efficient-method-for-the-classification-of","title":"An Efficient Method for the Classification of Croplands in Scarce-Label Regions","date":"2021-03-17","arxiv_id":"2103.09588","repositories_listed":1,"syntology":null},{"url":"/paper/modularity-maximisation-for-graphons","slug":"modularity-maximisation-for-graphons","title":"Modularity maximisation for graphons","date":"2021-01-02","arxiv_id":"2101.00503","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-cost-sensitive-and-neyman-pearson","slug":"bridging-cost-sensitive-and-neyman-pearson","title":"Bridging Cost-sensitive and Neyman-Pearson Paradigms for Asymmetric Binary Classification","date":"2020-12-29","arxiv_id":"2012.14951","repositories_listed":1,"syntology":null},{"url":"/paper/ultra-fast-low-storage-highly-effective","slug":"ultra-fast-low-storage-highly-effective","title":"Ultra-Fast, Low-Storage, Highly Effective Coarse-grained Selection in Retrieval-based Chatbot by Using Deep Semantic Hashing","date":"2020-12-17","arxiv_id":"2012.09647","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-spiking-networks-through-convex","slug":"understanding-spiking-networks-through-convex","title":"Understanding spiking networks through convex optimization","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-study-of-representation-learning","slug":"an-empirical-study-of-representation-learning","title":"An Empirical Study of Representation Learning for Reinforcement Learning in Healthcare","date":"2020-11-23","arxiv_id":"2011.11235","repositories_listed":1,"syntology":null},{"url":"/paper/results-of-a-single-blind-literary-taste-test","slug":"results-of-a-single-blind-literary-taste-test","title":"Results of a Single Blind Literary Taste Test with Short Anonymized Novel Fragments","date":"2020-11-03","arxiv_id":"2011.01624","repositories_listed":1,"syntology":null},{"url":"/paper/open-question-answering-over-tables-and-text-1","slug":"open-question-answering-over-tables-and-text-1","title":"Open Question Answering over Tables and Text","date":"2020-10-20","arxiv_id":"2010.10439","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/open-question-answering-over-tables-and-text-1#ran","syntology_url":"https://syntology.ai/paper/2010.10439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.10439"}},"official":{"repos":["wenhuchen/OTT-QA"],"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","unlocated"]}}},{"url":"/paper/finding-physical-adversarial-examples-for-1","slug":"finding-physical-adversarial-examples-for-1","title":"Finding Physical Adversarial Examples for Autonomous Driving with Fast and Differentiable Image Compositing","date":"2020-10-17","arxiv_id":"2010.08844","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-and-characterizing-human","slug":"evaluating-and-characterizing-human","title":"Evaluating and Characterizing Human Rationales","date":"2020-10-09","arxiv_id":"2010.04736","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":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/evaluating-and-characterizing-human#ran","syntology_url":"https://syntology.ai/paper/2010.04736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04736"}},"official":{"repos":["BoulderDS/evaluating-human-rationales"],"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/shallow-to-deep-training-for-neural-machine","slug":"shallow-to-deep-training-for-neural-machine","title":"Shallow-to-Deep Training for Neural Machine Translation","date":"2020-10-08","arxiv_id":"2010.03737","repositories_listed":1,"syntology":null},{"url":"/paper/tackling-unsupervised-multi-source-domain","slug":"tackling-unsupervised-multi-source-domain","title":"Tackling unsupervised multi-source domain adaptation with optimism and consistency","date":"2020-09-29","arxiv_id":"2009.13939","repositories_listed":1,"syntology":null},{"url":"/paper/the-effects-of-skin-lesion-segmentation-on","slug":"the-effects-of-skin-lesion-segmentation-on","title":"The Effects of Skin Lesion Segmentation on the Performance of Dermatoscopic Image Classification","date":"2020-08-28","arxiv_id":"2008.12602","repositories_listed":1,"syntology":null},{"url":"/paper/obtaining-adjustable-regularization-for-free","slug":"obtaining-adjustable-regularization-for-free","title":"Obtaining Adjustable Regularization for Free via Iterate Averaging","date":"2020-08-15","arxiv_id":"2008.06736","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/obtaining-adjustable-regularization-for-free#ran","syntology_url":"https://syntology.ai/paper/2008.06736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06736"}},"official":{"repos":["uuujf/IterAvg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-stein-discrepancies","slug":"stochastic-stein-discrepancies","title":"Stochastic Stein Discrepancies","date":"2020-07-06","arxiv_id":"2007.02857","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-combine-top-down-and-bottom-up","slug":"learning-to-combine-top-down-and-bottom-up","title":"Learning to Combine Top-Down and Bottom-Up Signals in Recurrent Neural Networks with Attention over Modules","date":"2020-06-30","arxiv_id":"2006.16981","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/learning-to-combine-top-down-and-bottom-up#ran","syntology_url":"https://syntology.ai/paper/2006.16981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16981"}},"official":{"repos":["sarthmit/BRIMs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/boxhed-boosted-exact-hazard-estimator-with","slug":"boxhed-boosted-exact-hazard-estimator-with","title":"BoXHED: Boosted eXact Hazard Estimator with Dynamic covariates","date":"2020-06-25","arxiv_id":"2006.14218","repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-evaluation-framework-for-ground","slug":"a-bayesian-evaluation-framework-for-ground","title":"A Bayesian Evaluation Framework for Subjectively Annotated Visual Recognition Tasks","date":"2020-06-20","arxiv_id":"2007.06711","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-alignment-in-deep-neural-networks","slug":"gradient-alignment-in-deep-neural-networks","title":"Rethinking the Role of Gradient-Based Attribution Methods for Model Interpretability","date":"2020-06-16","arxiv_id":"2006.09128","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/gradient-alignment-in-deep-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.09128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09128"}},"official":{"repos":["idiap/rethinking-saliency"],"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/on-the-predictive-power-of-neural-language","slug":"on-the-predictive-power-of-neural-language","title":"On the Predictive Power of Neural Language Models for Human Real-Time Comprehension Behavior","date":"2020-06-02","arxiv_id":"2006.01912","repositories_listed":1,"syntology":null},{"url":"/paper/background-data-resampling-for-outlier-aware","slug":"background-data-resampling-for-outlier-aware","title":"Background Data Resampling for Outlier-Aware Classification","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-the-impossibility-of-global-convergence-in","slug":"on-the-impossibility-of-global-convergence-in","title":"On the Impossibility of Global Convergence in Multi-Loss Optimization","date":"2020-05-26","arxiv_id":"2005.12649","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-regularization-in-deep-learning-may","slug":"implicit-regularization-in-deep-learning-may","title":"Implicit Regularization in Deep Learning May Not Be Explainable by Norms","date":"2020-05-13","arxiv_id":"2005.06398","repositories_listed":1,"syntology":null},{"url":"/paper/self-paced-deep-reinforcement-learning","slug":"self-paced-deep-reinforcement-learning","title":"Self-Paced Deep Reinforcement Learning","date":"2020-04-24","arxiv_id":"2004.11812","repositories_listed":1,"syntology":null},{"url":"/paper/distinguishing-cell-phenotype-using-cell","slug":"distinguishing-cell-phenotype-using-cell","title":"Distinguishing Cell Phenotype Using Cell Epigenotype","date":"2020-03-20","arxiv_id":"2003.09432","repositories_listed":1,"syntology":null},{"url":"/paper/g-vae-a-continuously-variable-rate-deep-image","slug":"g-vae-a-continuously-variable-rate-deep-image","title":"Asymmetric Gained Deep Image Compression With Continuous Rate Adaptation","date":"2020-03-04","arxiv_id":"2003.02012","repositories_listed":1,"syntology":null},{"url":"/paper/think-global-act-local-relating-dnn","slug":"think-global-act-local-relating-dnn","title":"Think Global, Act Local: Relating DNN generalisation and node-level SNR","date":"2020-02-11","arxiv_id":"2002.04687","repositories_listed":1,"syntology":null},{"url":"/paper/imvotenet-boosting-3d-object-detection-in","slug":"imvotenet-boosting-3d-object-detection-in","title":"ImVoteNet: Boosting 3D Object Detection in Point Clouds with Image Votes","date":"2020-01-29","arxiv_id":"2001.10692","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":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/imvotenet-boosting-3d-object-detection-in#ran","syntology_url":"https://syntology.ai/paper/2001.10692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.10692"}},"official":{"repos":["facebookresearch/imvotenet"],"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/unifying-and-generalizing-models-of-neural","slug":"unifying-and-generalizing-models-of-neural","title":"Unifying and generalizing models of neural dynamics during decision-making","date":"2020-01-13","arxiv_id":"2001.04571","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/unifying-and-generalizing-models-of-neural#ran","syntology_url":"https://syntology.ai/paper/2001.04571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04571"}},"official":{"repos":["davidzoltowski/ssmdm"],"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/capacity-bandwidth-and-compositionality-in","slug":"capacity-bandwidth-and-compositionality-in","title":"Capacity, Bandwidth, and Compositionality in Emergent Language Learning","date":"2019-10-24","arxiv_id":"1910.11424","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/capacity-bandwidth-and-compositionality-in#ran","syntology_url":"https://syntology.ai/paper/1910.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11424"}},"official":{"repos":["backpropper/cbc-emecom"],"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/gradslam-dense-slam-meets-automatic","slug":"gradslam-dense-slam-meets-automatic","title":"gradSLAM: Automagically differentiable SLAM","date":"2019-10-23","arxiv_id":"1910.10672","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gradslam-dense-slam-meets-automatic#ran","syntology_url":"https://syntology.ai/paper/1910.10672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10672"}},"official":{"repos":["gradslam/gradslam"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-examples-for-deep-learning-cyber","slug":"adversarial-examples-for-deep-learning-cyber","title":"FENCE: Feasible Evasion Attacks on Neural Networks in Constrained Environments","date":"2019-09-23","arxiv_id":"1909.10480","repositories_listed":1,"syntology":null}],"record_sha256":"196a1151916ad67b9a489d54d5961d59961d05b61957685846f08997d782eb22","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}