{"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/all/papers/9","list_of":"/task/all","task":"All","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":9,"pages_in_order":27,"rows_per_page":100,"rows":[801,900],"of":2646,"counts":{"archive_papers_tagged":2646,"with_a_code_link":951,"where_syntology_ran_a_sample":271,"not_listed_spam_title":0,"listed":2646,"listed_where_code_ran":271,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":232,"every_run_a_failure_of_syntologys_instrument":39,"listed_with_a_run_with_no_instrument_failure":232,"listed_every_run_a_failure_of_syntologys_instrument":39,"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/all","prev":"/task/all/papers/8","next":"/task/all/papers/10","papers":[{"url":"/paper/all-day-object-tracking-for-unmanned-aerial","slug":"all-day-object-tracking-for-unmanned-aerial","title":"All-Day Object Tracking for Unmanned Aerial Vehicle","date":"2021-01-21","arxiv_id":"2101.08446","repositories_listed":1,"syntology":null},{"url":"/paper/what-is-all-this-new-mesh-about-exploring-the","slug":"what-is-all-this-new-mesh-about-exploring-the","title":"What is all this new MeSH about? Exploring the semantic provenance of new descriptors in the MeSH thesaurus","date":"2021-01-20","arxiv_id":"2101.08293","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-variational-autoencoders-for-semi-1","slug":"multimodal-variational-autoencoders-for-semi-1","title":"Multimodal Variational Autoencoders for Semi-Supervised Learning: In Defense of Product-of-Experts","date":"2021-01-18","arxiv_id":"2101.07240","repositories_listed":1,"syntology":null},{"url":"/paper/all-snow-removed-single-image-desnowing","slug":"all-snow-removed-single-image-desnowing","title":"ALL Snow Removed: Single Image Desnowing Algorithm Using Hierarchical Dual-Tree Complex Wavelet Representation and Contradict Channel Loss","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/not-all-memories-are-created-equal-learning","slug":"not-all-memories-are-created-equal-learning","title":"Not All Memories are Created Equal: Learning to Expire","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/all-that-glitters-is-not-gold-towards-process","slug":"all-that-glitters-is-not-gold-towards-process","title":"All That Glitters Is Not Gold: Towards Process Discovery Techniques with Guarantees","date":"2020-12-23","arxiv_id":"2012.12764","repositories_listed":1,"syntology":null},{"url":"/paper/fairkit-fairkit-on-the-wall-who-s-the-fairest","slug":"fairkit-fairkit-on-the-wall-who-s-the-fairest","title":"Fairkit, Fairkit, on the Wall, Who's the Fairest of Them All? Supporting Data Scientists in Training Fair Models","date":"2020-12-17","arxiv_id":"2012.09951","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-incorporation-of-multiple-latency","slug":"efficient-incorporation-of-multiple-latency","title":"Efficient Incorporation of Multiple Latency Targets in the Once-For-All Network","date":"2020-12-12","arxiv_id":"2012.06748","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-clustering-and-zeroth-persistent","slug":"hierarchical-clustering-and-zeroth-persistent","title":"A New Non-archimedean Metric on Persistent Homology","date":"2020-12-04","arxiv_id":"2012.02655","repositories_listed":1,"syntology":null},{"url":"/paper/pv-raft-point-voxel-correlation-fields-for","slug":"pv-raft-point-voxel-correlation-fields-for","title":"PV-RAFT: Point-Voxel Correlation Fields for Scene Flow Estimation of Point Clouds","date":"2020-12-02","arxiv_id":"2012.00987","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-charge-identification-from-facts-a","slug":"automatic-charge-identification-from-facts-a","title":"Automatic Charge Identification from Facts: A Few Sentence-Level Charge Annotations is All You Need","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-suggests-that-gene-expression","slug":"deep-learning-suggests-that-gene-expression","title":"Deep learning suggests that gene expression is encoded in all parts of a co-evolving interacting gene regulatory structure","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sampling-from-a-k-dpp-without-looking-at-all-1","slug":"sampling-from-a-k-dpp-without-looking-at-all-1","title":"Sampling from a k-DPP without looking at all items","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/flowstep3d-model-unrolling-for-self","slug":"flowstep3d-model-unrolling-for-self","title":"FlowStep3D: Model Unrolling for Self-Supervised Scene Flow Estimation","date":"2020-11-19","arxiv_id":"2011.10147","repositories_listed":1,"syntology":null},{"url":"/paper/automated-large-scale-class-scheduling-in","slug":"automated-large-scale-class-scheduling-in","title":"Automated Large-scale Class Scheduling in MiniZinc","date":"2020-11-15","arxiv_id":"2011.07507","repositories_listed":1,"syntology":null},{"url":"/paper/after-all-only-the-last-neuron-matters","slug":"after-all-only-the-last-neuron-matters","title":"After All, Only The Last Neuron Matters: Comparing Multi-modal Fusion Functions for Scene Graph Generation","date":"2020-11-09","arxiv_id":"2011.04779","repositories_listed":1,"syntology":null},{"url":"/paper/it-s-all-in-the-name-a-character-based","slug":"it-s-all-in-the-name-a-character-based","title":"It's All in the Name: A Character Based Approach To Infer Religion","date":"2020-10-27","arxiv_id":"2010.14479","repositories_listed":1,"syntology":null},{"url":"/paper/one-solution-is-not-all-you-need-few-shot","slug":"one-solution-is-not-all-you-need-few-shot","title":"One Solution is Not All You Need: Few-Shot Extrapolation via Structured MaxEnt RL","date":"2020-10-27","arxiv_id":"2010.14484","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/one-solution-is-not-all-you-need-few-shot#ran","syntology_url":"https://syntology.ai/paper/2010.14484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14484"}},"official":null}},{"url":"/paper/not-all-parameters-are-born-equal-attention","slug":"not-all-parameters-are-born-equal-attention","title":"Not all parameters are born equal: Attention is mostly what you need","date":"2020-10-22","arxiv_id":"2010.11859","repositories_listed":1,"syntology":null},{"url":"/paper/once-for-all-adversarial-training-in-situ","slug":"once-for-all-adversarial-training-in-situ","title":"Once-for-All Adversarial Training: In-Situ Tradeoff between Robustness and Accuracy for Free","date":"2020-10-22","arxiv_id":"2010.11828","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/once-for-all-adversarial-training-in-situ#ran","syntology_url":"https://syntology.ai/paper/2010.11828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11828"}},"official":{"repos":["VITA-Group/Once-for-All-Adversarial-Training"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/one-model-to-reconstruct-them-all-a-novel-way","slug":"one-model-to-reconstruct-them-all-a-novel-way","title":"One Model to Reconstruct Them All: A Novel Way to Use the Stochastic Noise in StyleGAN","date":"2020-10-21","arxiv_id":"2010.11113","repositories_listed":1,"syntology":null},{"url":"/paper/against-all-odds-winning-the-defense","slug":"against-all-odds-winning-the-defense","title":"Against All Odds: Winning the Defense Challenge in an Evasion Competition with Diversification","date":"2020-10-19","arxiv_id":"2010.09569","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-similarity-and-information","slug":"learning-from-similarity-and-information","title":"Learning from similarity and information extraction from structured documents","date":"2020-10-17","arxiv_id":"2011.07964","repositories_listed":1,"syntology":null},{"url":"/paper/detect-all-abuse-toward-universal-abusive","slug":"detect-all-abuse-toward-universal-abusive","title":"Detect All Abuse! Toward Universal Abusive Language Detection Models","date":"2020-10-08","arxiv_id":"2010.03776","repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-the-value-of-information-in","slug":"characterizing-the-value-of-information-in","title":"Characterizing the Value of Information in Medical Notes","date":"2020-10-07","arxiv_id":"2010.03574","repositories_listed":1,"syntology":null},{"url":"/paper/bounding-boxes-are-all-we-need-street-view","slug":"bounding-boxes-are-all-we-need-street-view","title":"Bounding Boxes Are All We Need: Street View Image Classification via Context Encoding of Detected Buildings","date":"2020-10-03","arxiv_id":"2010.01305","repositories_listed":1,"syntology":null},{"url":"/paper/my-tweets-bring-all-the-traits-to-the-yard","slug":"my-tweets-bring-all-the-traits-to-the-yard","title":"My tweets bring all the traits to the yard: Predicting personality and relational traits in Online Social Networks","date":"2020-09-22","arxiv_id":"2009.10802","repositories_listed":1,"syntology":null},{"url":"/paper/multi-sensor-data-fusion-for-cloud-removal-in","slug":"multi-sensor-data-fusion-for-cloud-removal-in","title":"Multi-Sensor Data Fusion for Cloud Removal in Global and All-Season Sentinel-2 Imagery","date":"2020-09-16","arxiv_id":"2009.07683","repositories_listed":1,"syntology":null},{"url":"/paper/auto-classifier-a-robust-defect-detector","slug":"auto-classifier-a-robust-defect-detector","title":"Auto-Classifier: A Robust Defect Detector Based on an AutoML Head","date":"2020-09-03","arxiv_id":"2009.01573","repositories_listed":1,"syntology":null},{"url":"/paper/initial-classifier-weights-replay-for","slug":"initial-classifier-weights-replay-for","title":"Initial Classifier Weights Replay for Memoryless Class Incremental Learning","date":"2020-08-31","arxiv_id":"2008.13710","repositories_listed":1,"syntology":null},{"url":"/paper/the-adapter-bot-all-in-one-controllable","slug":"the-adapter-bot-all-in-one-controllable","title":"The Adapter-Bot: All-In-One Controllable Conversational Model","date":"2020-08-28","arxiv_id":"2008.12579","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 1 unverified","sample_list":"/paper/the-adapter-bot-all-in-one-controllable#ran","syntology_url":"https://syntology.ai/paper/2008.12579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.12579"}},"official":null}},{"url":"/paper/keywords-lie-far-from-the-mean-of-all-words","slug":"keywords-lie-far-from-the-mean-of-all-words","title":"Keywords lie far from the mean of all words in local vector space","date":"2020-08-21","arxiv_id":"2008.09513","repositories_listed":1,"syntology":null},{"url":"/paper/prototype-based-interpretation-of-the","slug":"prototype-based-interpretation-of-the","title":"Prototype-based interpretation of the functionality of neurons in winner-take-all neural networks","date":"2020-08-20","arxiv_id":"2008.08750","repositories_listed":1,"syntology":null},{"url":"/paper/adl-mvdr-all-deep-learning-mvdr-beamformer","slug":"adl-mvdr-all-deep-learning-mvdr-beamformer","title":"ADL-MVDR: All deep learning MVDR beamformer for target speech separation","date":"2020-08-16","arxiv_id":"2008.06994","repositories_listed":1,"syntology":null},{"url":"/paper/mfnets-learning-network-representations-for","slug":"mfnets-learning-network-representations-for","title":"MFNets: Data efficient all-at-once learning of multifidelity surrogates as directed networks of information sources","date":"2020-08-03","arxiv_id":"2008.02672","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-all-way-boolean-tensor","slug":"geometric-all-way-boolean-tensor","title":"Geometric All-Way Boolean Tensor Decomposition","date":"2020-07-31","arxiv_id":"2007.15821","repositories_listed":1,"syntology":null},{"url":"/paper/all-in-the-exponential-family-bregman-duality","slug":"all-in-the-exponential-family-bregman-duality","title":"All in the Exponential Family: Bregman Duality in Thermodynamic Variational Inference","date":"2020-07-01","arxiv_id":"2007.00642","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/all-in-the-exponential-family-bregman-duality#ran","syntology_url":"https://syntology.ai/paper/2007.00642","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00642"}},"official":{"repos":["vmasrani/tvo_all_in"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/breaking-through-the-80-glass-ceiling-raising","slug":"breaking-through-the-80-glass-ceiling-raising","title":"Breaking Through the 80\\% Glass Ceiling: Raising the State of the Art in Word Sense Disambiguation by Incorporating Knowledge Graph Information","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/data-movement-is-all-you-need-a-case-study-of","slug":"data-movement-is-all-you-need-a-case-study-of","title":"Data Movement Is All You Need: A Case Study on Optimizing Transformers","date":"2020-06-30","arxiv_id":"2007.00072","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/data-movement-is-all-you-need-a-case-study-of#ran","syntology_url":"https://syntology.ai/paper/2007.00072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00072"}},"official":{"repos":["spcl/substation"],"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/lipschitzness-is-all-you-need-to-tame-off","slug":"lipschitzness-is-all-you-need-to-tame-off","title":"Lipschitzness Is All You Need To Tame Off-policy Generative Adversarial Imitation Learning","date":"2020-06-28","arxiv_id":"2006.16785","repositories_listed":1,"syntology":null},{"url":"/paper/one-plot-to-show-them-all-visualization-of","slug":"one-plot-to-show-them-all-visualization-of","title":"One PLOT to Show Them All: Visualization of Efficient Sets in Multi-Objective Landscapes","date":"2020-06-20","arxiv_id":"2006.11547","repositories_listed":1,"syntology":null},{"url":"/paper/finding-all-e-good-arms-in-stochastic-bandits","slug":"finding-all-e-good-arms-in-stochastic-bandits","title":"Finding All ε-Good Arms in Stochastic Bandits","date":"2020-06-16","arxiv_id":"2006.08850","repositories_listed":1,"syntology":null},{"url":"/paper/neurocard-one-cardinality-estimator-for-all","slug":"neurocard-one-cardinality-estimator-for-all","title":"NeuroCard: One Cardinality Estimator for All Tables","date":"2020-06-15","arxiv_id":"2006.08109","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neurocard-one-cardinality-estimator-for-all#ran","syntology_url":"https://syntology.ai/paper/2006.08109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08109"}},"official":{"repos":["neurocard/neurocard"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/one-ring-to-rule-them-all-certifiably-robust","slug":"one-ring-to-rule-them-all-certifiably-robust","title":"One Ring to Rule Them All: Certifiably Robust Geometric Perception with Outliers","date":"2020-06-11","arxiv_id":"2006.06769","repositories_listed":1,"syntology":null},{"url":"/paper/all-your-loss-are-belong-to-bayes","slug":"all-your-loss-are-belong-to-bayes","title":"All your loss are belong to Bayes","date":"2020-06-08","arxiv_id":"2006.04633","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-the-cycle-colleagues-are-all-you-1","slug":"breaking-the-cycle-colleagues-are-all-you-1","title":"Breaking the Cycle - Colleagues Are All You Need","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-family-of-centrality-measures-for-graph","slug":"a-family-of-centrality-measures-for-graph","title":"A Family of Centrality Measures for Graph Data Based on Subgraphs","date":"2020-05-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/inferring-point-cloud-quality-via-graph","slug":"inferring-point-cloud-quality-via-graph","title":"Inferring Point Cloud Quality via Graph Similarity","date":"2020-05-31","arxiv_id":"2006.00497","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-monotonic-multihead-attention-for","slug":"enhancing-monotonic-multihead-attention-for","title":"Enhancing Monotonic Multihead Attention for Streaming ASR","date":"2020-05-19","arxiv_id":"2005.09394","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/enhancing-monotonic-multihead-attention-for#ran","syntology_url":"https://syntology.ai/paper/2005.09394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09394"}},"official":{"repos":["hirofumi0810/neural_sp"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/are-all-languages-created-equal-in","slug":"are-all-languages-created-equal-in","title":"Are All Languages Created Equal in Multilingual BERT?","date":"2020-05-18","arxiv_id":"2005.09093","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-base-completion-baseline-strikes","slug":"knowledge-base-completion-baseline-strikes","title":"Knowledge Base Completion: Baseline strikes back (Again)","date":"2020-05-02","arxiv_id":"2005.00804","repositories_listed":1,"syntology":null},{"url":"/paper/bert-of-all-trades-master-of-some","slug":"bert-of-all-trades-master-of-some","title":"BERT of all trades, master of some","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/once-for-all-train-one-network-and-specialize-1","slug":"once-for-all-train-one-network-and-specialize-1","title":"Once for All: Train One Network and Specialize it for Efficient Deployment","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sign-bits-are-all-you-need-for-black-box","slug":"sign-bits-are-all-you-need-for-black-box","title":"Sign Bits Are All You Need for Black-Box Attacks","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/simulated-annealing-algorithm-for-the","slug":"simulated-annealing-algorithm-for-the","title":"Simulated Annealing Algorithm for the Multiple Choice Multidimensional Knapsack Problem","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/all-word-embeddings-from-one-embedding","slug":"all-word-embeddings-from-one-embedding","title":"All Word Embeddings from One Embedding","date":"2020-04-25","arxiv_id":"2004.12073","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/all-word-embeddings-from-one-embedding#ran","syntology_url":"https://syntology.ai/paper/2004.12073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12073"}},"official":{"repos":["takase/alone_seq2seq"],"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/espnet-st-all-in-one-speech-translation","slug":"espnet-st-all-in-one-speech-translation","title":"ESPnet-ST: All-in-One Speech Translation Toolkit","date":"2020-04-21","arxiv_id":"2004.10234","repositories_listed":1,"syntology":null},{"url":"/paper/are-all-good-word-vector-spaces-isomorphic","slug":"are-all-good-word-vector-spaces-isomorphic","title":"Are All Good Word Vector Spaces Isomorphic?","date":"2020-04-08","arxiv_id":"2004.04070","repositories_listed":1,"syntology":null},{"url":"/paper/channel-attention-is-all-you-need-for-video","slug":"channel-attention-is-all-you-need-for-video","title":"Channel Attention Is All You Need for Video Frame Interpolation","date":"2020-04-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/one-neuron-to-fool-them-all","slug":"one-neuron-to-fool-them-all","title":"One Neuron to Fool Them All","date":"2020-03-20","arxiv_id":"2003.09372","repositories_listed":1,"syntology":null},{"url":"/paper/invariance-vs-robustness-of-neural-networks-1","slug":"invariance-vs-robustness-of-neural-networks-1","title":"Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks","date":"2020-02-26","arxiv_id":"2002.11318","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/invariance-vs-robustness-of-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.11318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11318"}},"official":{"repos":["ksandeshk/spatial-vs-robustness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/three-approaches-for-personalization-with","slug":"three-approaches-for-personalization-with","title":"Three Approaches for Personalization with Applications to Federated Learning","date":"2020-02-25","arxiv_id":"2002.10619","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/three-approaches-for-personalization-with#ran","syntology_url":"https://syntology.ai/paper/2002.10619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10619"}},"official":null}},{"url":"/paper/randomized-smoothing-of-all-shapes-and-sizes","slug":"randomized-smoothing-of-all-shapes-and-sizes","title":"Randomized Smoothing of All Shapes and Sizes","date":"2020-02-19","arxiv_id":"2002.08118","repositories_listed":1,"syntology":null},{"url":"/paper/robust-quantization-one-model-to-rule-them","slug":"robust-quantization-one-model-to-rule-them","title":"Robust Quantization: One Model to Rule Them All","date":"2020-02-18","arxiv_id":"2002.07686","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/robust-quantization-one-model-to-rule-them#ran","syntology_url":"https://syntology.ai/paper/2002.07686","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07686"}},"official":{"repos":["moranshkolnik/RobustQuantization"],"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/chexclusion-fairness-gaps-in-deep-chest-x-ray","slug":"chexclusion-fairness-gaps-in-deep-chest-x-ray","title":"CheXclusion: Fairness gaps in deep chest X-ray classifiers","date":"2020-02-14","arxiv_id":"2003.00827","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-multilingual-alignment-using","slug":"unsupervised-multilingual-alignment-using","title":"Unsupervised Multilingual Alignment using Wasserstein Barycenter","date":"2020-01-28","arxiv_id":"2002.00743","repositories_listed":1,"syntology":null},{"url":"/paper/nodis-neural-ordinary-differential-scene","slug":"nodis-neural-ordinary-differential-scene","title":"NODIS: Neural Ordinary Differential Scene Understanding","date":"2020-01-14","arxiv_id":"2001.04735","repositories_listed":1,"syntology":null},{"url":"/paper/stacked-debert-all-attention-in-incomplete","slug":"stacked-debert-all-attention-in-incomplete","title":"Stacked DeBERT: All Attention in Incomplete Data for Text Classification","date":"2020-01-01","arxiv_id":"2001.00137","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stacked-debert-all-attention-in-incomplete#ran","syntology_url":"https://syntology.ai/paper/2001.00137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00137"}},"official":{"repos":["gcunhase/StackedDeBERT"],"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","unlocated"]}}},{"url":"/paper/is-attention-all-what-you-need-an-empirical","slug":"is-attention-all-what-you-need-an-empirical","title":"Is Attention All What You Need? -- An Empirical Investigation on Convolution-Based Active Memory and Self-Attention","date":"2019-12-27","arxiv_id":"1912.11959","repositories_listed":1,"syntology":null},{"url":"/paper/one-framework-to-register-them-all-pointnet","slug":"one-framework-to-register-them-all-pointnet","title":"One Framework to Register Them All: PointNet Encoding for Point Cloud Alignment","date":"2019-12-12","arxiv_id":"1912.05766","repositories_listed":1,"syntology":null},{"url":"/paper/dm2c-deep-mixed-modal-clustering","slug":"dm2c-deep-mixed-modal-clustering","title":"DM2C: Deep Mixed-Modal Clustering","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/not-all-attention-is-needed-gated-attention","slug":"not-all-attention-is-needed-gated-attention","title":"Not All Attention Is Needed: Gated Attention Network for Sequence Data","date":"2019-12-01","arxiv_id":"1912.00349","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-attention-mechanism-for-handling","slug":"efficient-attention-mechanism-for-handling","title":"Efficient Attention Mechanism for Visual Dialog that can Handle All the Interactions between Multiple Inputs","date":"2019-11-26","arxiv_id":"1911.11390","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-the-cycle-colleagues-are-all-you","slug":"breaking-the-cycle-colleagues-are-all-you","title":"Breaking the cycle -- Colleagues are all you need","date":"2019-11-24","arxiv_id":"1911.10538","repositories_listed":1,"syntology":null},{"url":"/paper/volume-preserving-neural-networks-a-solution","slug":"volume-preserving-neural-networks-a-solution","title":"Volume-preserving Neural Networks","date":"2019-11-21","arxiv_id":"1911.09576","repositories_listed":1,"syntology":null},{"url":"/paper/all-it-takes-is-20-questions-a-knowledge","slug":"all-it-takes-is-20-questions-a-knowledge","title":"All It Takes is 20 Questions!: A Knowledge Graph Based Approach","date":"2019-11-12","arxiv_id":"1911.05161","repositories_listed":1,"syntology":null},{"url":"/paper/connecting-first-and-second-order-recurrent","slug":"connecting-first-and-second-order-recurrent","title":"Connecting First and Second Order Recurrent Networks with Deterministic Finite Automata","date":"2019-11-12","arxiv_id":"1911.04644","repositories_listed":1,"syntology":null},{"url":"/paper/not-all-claims-are-created-equal-choosing-the","slug":"not-all-claims-are-created-equal-choosing-the","title":"Not All Claims are Created Equal: Choosing the Right Statistical Approach to Assess Hypotheses","date":"2019-11-10","arxiv_id":"1911.03850","repositories_listed":1,"syntology":null},{"url":"/paper/should-all-cross-lingual-embeddings-speak","slug":"should-all-cross-lingual-embeddings-speak","title":"Should All Cross-Lingual Embeddings Speak English?","date":"2019-11-08","arxiv_id":"1911.03058","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-watershed-sampling-all-spanning","slug":"probabilistic-watershed-sampling-all-spanning","title":"Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning","date":"2019-11-06","arxiv_id":"1911.02921","repositories_listed":1,"syntology":null},{"url":"/paper/an-algorithm-for-routing-capsules-in-all","slug":"an-algorithm-for-routing-capsules-in-all","title":"An Algorithm for Routing Capsules in All Domains","date":"2019-11-02","arxiv_id":"1911.00792","repositories_listed":1,"syntology":null},{"url":"/paper/attention-is-all-you-need-for-chinese-word","slug":"attention-is-all-you-need-for-chinese-word","title":"Attention Is All You Need for Chinese Word Segmentation","date":"2019-10-31","arxiv_id":"1910.14537","repositories_listed":1,"syntology":null},{"url":"/paper/spatialflow-bridging-all-tasks-for-panoptic","slug":"spatialflow-bridging-all-tasks-for-panoptic","title":"SpatialFlow: Bridging All Tasks for Panoptic Segmentation","date":"2019-10-19","arxiv_id":"1910.08787","repositories_listed":1,"syntology":null},{"url":"/paper/improved-sample-complexities-for-deep","slug":"improved-sample-complexities-for-deep","title":"Improved Sample Complexities for Deep Networks and Robust Classification via an All-Layer Margin","date":"2019-10-09","arxiv_id":"1910.04284","repositories_listed":1,"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":2,"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/improved-sample-complexities-for-deep#ran","syntology_url":"https://syntology.ai/paper/1910.04284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04284"}},"official":{"repos":["cwein3/all-layer-margin-opt"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/one-size-does-not-fit-all-multi-scale","slug":"one-size-does-not-fit-all-multi-scale","title":"One Size Does Not Fit All: Multi-Scale, Cascaded RNNs for Radar Classification","date":"2019-09-06","arxiv_id":"1909.03082","repositories_listed":1,"syntology":null},{"url":"/paper/parsing-all-syntax-and-semantics-dependencies","slug":"parsing-all-syntax-and-semantics-dependencies","title":"Parsing All: Syntax and Semantics, Dependencies and Spans","date":"2019-08-30","arxiv_id":"1908.11522","repositories_listed":1,"syntology":null},{"url":"/paper/universal-policies-to-learn-them-all","slug":"universal-policies-to-learn-them-all","title":"Universal Policies to Learn Them All","date":"2019-08-24","arxiv_id":"1908.09184","repositories_listed":1,"syntology":null},{"url":"/paper/revisit-semantic-representation-and-tree","slug":"revisit-semantic-representation-and-tree","title":"Revisiting Semantic Representation and Tree Search for Similar Question Retrieval","date":"2019-08-22","arxiv_id":"1908.08326","repositories_listed":1,"syntology":null},{"url":"/paper/one-format-to-rule-them-all-the-emtsv","slug":"one-format-to-rule-them-all-the-emtsv","title":"One format to rule them all -- The emtsv pipeline for Hungarian","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-when-all-actions-are","slug":"reinforcement-learning-when-all-actions-are","title":"Reinforcement Learning When All Actions are Not Always Available","date":"2019-06-05","arxiv_id":"1906.01772","repositories_listed":1,"syntology":null},{"url":"/paper/all-in-one-underwater-image-enhancement-using","slug":"all-in-one-underwater-image-enhancement-using","title":"All-In-One Underwater Image Enhancement using Domain-Adversarial Learning","date":"2019-05-30","arxiv_id":"1905.13342","repositories_listed":1,"syntology":null},{"url":"/paper/provable-robustness-against-all-adversarial","slug":"provable-robustness-against-all-adversarial","title":"Provable robustness against all adversarial $l_p$-perturbations for $p\\geq 1$","date":"2019-05-27","arxiv_id":"1905.11213","repositories_listed":1,"syntology":null},{"url":"/paper/resisting-adversarial-attacks-by-k-winners","slug":"resisting-adversarial-attacks-by-k-winners","title":"Enhancing Adversarial Defense by k-Winners-Take-All","date":"2019-05-25","arxiv_id":"1905.10510","repositories_listed":1,"syntology":null},{"url":"/paper/not-all-features-are-equal-feature-leveling","slug":"not-all-features-are-equal-feature-leveling","title":"Not All Features Are Equal: Feature Leveling Deep Neural Networks for Better Interpretation","date":"2019-05-24","arxiv_id":"1905.10009","repositories_listed":1,"syntology":null},{"url":"/paper/reshapegan-object-reshaping-by-providing-a","slug":"reshapegan-object-reshaping-by-providing-a","title":"ReshapeGAN: Object Reshaping by Providing A Single Reference Image","date":"2019-05-16","arxiv_id":"1905.06514","repositories_listed":1,"syntology":null},{"url":"/paper/gotta-catch-em-all-using-concealed-trapdoors","slug":"gotta-catch-em-all-using-concealed-trapdoors","title":"Gotta Catch 'Em All: Using Honeypots to Catch Adversarial Attacks on Neural Networks","date":"2019-04-18","arxiv_id":"1904.08554","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-subspace-support-vector-data","slug":"multimodal-subspace-support-vector-data","title":"Multimodal Subspace Support Vector Data Description","date":"2019-04-16","arxiv_id":"1904.07698","repositories_listed":1,"syntology":null},{"url":"/paper/focus-is-all-you-need-loss-functions-for","slug":"focus-is-all-you-need-loss-functions-for","title":"Focus Is All You Need: Loss Functions For Event-based Vision","date":"2019-04-15","arxiv_id":"1904.07235","repositories_listed":1,"syntology":null},{"url":"/paper/all-about-structure-adapting-structural","slug":"all-about-structure-adapting-structural","title":"All about Structure: Adapting Structural Information across Domains for Boosting Semantic Segmentation","date":"2019-03-26","arxiv_id":"1903.12212","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-generalized-linear-models-with","slug":"accelerating-generalized-linear-models-with","title":"Accelerating Generalized Linear Models with MLWeaving: A One-Size-Fits-All System for Any-precision Learning (Technical Report)","date":"2019-03-08","arxiv_id":"1903.03404","repositories_listed":1,"syntology":null}],"record_sha256":"13efc71b52859afdc76a42b014817678ad1287d3adb4fd054ef2ef0cedfc45a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}