{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/hoc/papers/5","list_of":"/method/hoc","method":"HOC","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":5,"pages_in_order":6,"rows_per_page":100,"rows":[401,500],"of":515,"counts":{"archive_papers_tagged":515,"with_a_code_link":174,"where_syntology_ran_a_sample":54,"not_listed_spam_title":0,"listed":515,"listed_where_code_ran":54,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":45,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":45,"listed_every_run_a_failure_of_syntologys_instrument":9,"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":"/method/hoc","prev":"/method/hoc/papers/4","next":"/method/hoc/papers/6","papers":[{"paper":"/paper/ethical-and-fairness-implications-of-model","slug":"ethical-and-fairness-implications-of-model","title":"Cross-model Fairness: Empirical Study of Fairness and Ethics Under Model Multiplicity","date":"2022-03-14","arxiv_id":"2203.07139","n_code_links":2,"syntology":null},{"paper":"/paper/algorithmic-recourse-in-the-face-of-noisy","slug":"algorithmic-recourse-in-the-face-of-noisy","title":"Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recourse","date":"2022-03-13","arxiv_id":"2203.06768","n_code_links":1,"syntology":{"ran":2,"of":8,"n_ran_checked":2,"n_instrument":0,"unverified":6,"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) · 6 unverified","official":{"repos":["MartinPawel/ProbabilisticallyRobustRecourse"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"explainable-machine-learning-for-predicting","title":"Explainable Machine Learning for Predicting Homicide Clearance in the United States","date":"2022-03-09","arxiv_id":"2203.04768","n_code_links":0,"syntology":null},{"paper":null,"slug":"improvements-to-gradient-descent-methods-for","title":"Improvements to Gradient Descent Methods for Quantum Tensor Network Machine Learning","date":"2022-03-03","arxiv_id":"2203.03366","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-query-answering-under-uncertainty-to","title":"Scalable Query Answering under Uncertainty to Neuroscientific Ontological Knowledge: The NeuroLang Approach","date":"2022-02-23","arxiv_id":"2202.11333","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-survey-of-ad-hoc-teamwork-definitions","title":"A Survey of Ad Hoc Teamwork Research","date":"2022-02-16","arxiv_id":"2202.10450","n_code_links":0,"syntology":null},{"paper":null,"slug":"private-quantiles-estimation-in-the-presence","title":"Private Quantiles Estimation in the Presence of Atoms","date":"2022-02-15","arxiv_id":"2202.08969","n_code_links":0,"syntology":null},{"paper":"/paper/a-lightweight-efficient-and-explainable-by","slug":"a-lightweight-efficient-and-explainable-by","title":"A Lightweight, Efficient and Explainable-by-Design Convolutional Neural Network for Internet Traffic Classification","date":"2022-02-11","arxiv_id":"2202.05535","n_code_links":1,"syntology":null},{"paper":null,"slug":"human-rights-democracy-and-the-rule-of-law","title":"Human rights, democracy, and the rule of law assurance framework for AI systems: A proposal","date":"2022-02-06","arxiv_id":"2202.02776","n_code_links":0,"syntology":null},{"paper":"/paper/backpropagation-neural-tree","slug":"backpropagation-neural-tree","title":"Backpropagation Neural Tree","date":"2022-02-04","arxiv_id":"2202.02248","n_code_links":1,"syntology":null},{"paper":"/paper/the-disagreement-problem-in-explainable","slug":"the-disagreement-problem-in-explainable","title":"The Disagreement Problem in Explainable Machine Learning: A Practitioner's Perspective","date":"2022-02-03","arxiv_id":"2202.01602","n_code_links":1,"syntology":null},{"paper":"/paper/learning-proximal-operators-to-discover","slug":"learning-proximal-operators-to-discover","title":"Learning Proximal Operators to Discover Multiple Optima","date":"2022-01-28","arxiv_id":"2201.11945","n_code_links":1,"syntology":{"ran":11,"of":11,"n_ran_checked":11,"n_instrument":0,"unverified":0,"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) · 0 unverified","official":{"repos":["lingxiaoli94/pol"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"can-old-trec-collections-reliably-evaluate","title":"Can Old TREC Collections Reliably Evaluate Modern Neural Retrieval Models?","date":"2022-01-26","arxiv_id":"2201.11086","n_code_links":0,"syntology":null},{"paper":"/paper/hc4-a-new-suite-of-test-collections-for-ad","slug":"hc4-a-new-suite-of-test-collections-for-ad","title":"HC4: A New Suite of Test Collections for Ad Hoc CLIR","date":"2022-01-24","arxiv_id":"2201.09992","n_code_links":1,"syntology":null},{"paper":null,"slug":"picknet-real-time-channel-selection-for-ad","title":"PickNet: Real-Time Channel Selection for Ad Hoc Microphone Arrays","date":"2022-01-24","arxiv_id":"2201.09586","n_code_links":0,"syntology":null},{"paper":"/paper/transfer-learning-approaches-for-building","slug":"transfer-learning-approaches-for-building","title":"Transfer Learning Approaches for Building Cross-Language Dense Retrieval Models","date":"2022-01-20","arxiv_id":"2201.08471","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["hltcoe/colbert-x"],"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"]}}},{"paper":"/paper/pde-based-optimal-strategy-for-unconstrained","slug":"pde-based-optimal-strategy-for-unconstrained","title":"PDE-Based Optimal Strategy for Unconstrained Online Learning","date":"2022-01-19","arxiv_id":"2201.07877","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"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","official":{"repos":["zhiyuzz/icml2022-pde-potential"],"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"]}}},{"paper":null,"slug":"reproducible-incremental-representation","title":"Reproducible, incremental representation learning with Rosetta VAE","date":"2022-01-13","arxiv_id":"2201.05206","n_code_links":0,"syntology":null},{"paper":null,"slug":"assisting-unknown-teammates-in-unknown-tasks","title":"Assisting Unknown Teammates in Unknown Tasks: Ad Hoc Teamwork under Partial Observability","date":"2022-01-10","arxiv_id":"2201.03538","n_code_links":0,"syntology":null},{"paper":null,"slug":"interference-aware-cooperative-routing-for","title":"Interference Aware Cooperative Routing for Edge Computing-enabled 5G Networks","date":"2022-01-05","arxiv_id":"2201.01520","n_code_links":0,"syntology":null},{"paper":"/paper/constrained-gradient-descent-a-powerful-and","slug":"constrained-gradient-descent-a-powerful-and","title":"Constrained Gradient Descent: A Powerful and Principled Evasion Attack Against Neural Networks","date":"2021-12-28","arxiv_id":"2112.14232","n_code_links":1,"syntology":null},{"paper":"/paper/rosnet-a-wmn-based-framework-using-uavs-and","slug":"rosnet-a-wmn-based-framework-using-uavs-and","title":"ROSNet: A WMN based Framework using UAVs and Ground Nodes for Post-Disaster Management","date":"2021-12-22","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"can-machine-learning-tools-support-the","title":"Can Machine Learning Tools Support the Identification of Sustainable Design Leads From Product Reviews? Opportunities and Challenges","date":"2021-12-17","arxiv_id":"2112.09391","n_code_links":0,"syntology":null},{"paper":null,"slug":"cofrnets-interpretable-neural-architecture","title":"CoFrNets: Interpretable Neural Architecture Inspired by Continued Fractions","date":"2021-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/beyond-ndcg-behavioral-testing-of-recommender","slug":"beyond-ndcg-behavioral-testing-of-recommender","title":"Beyond NDCG: behavioral testing of recommender systems with RecList","date":"2021-11-18","arxiv_id":"2111.09963","n_code_links":3,"syntology":null},{"paper":"/paper/smace-a-new-method-for-the-interpretability","slug":"smace-a-new-method-for-the-interpretability","title":"SMACE: A New Method for the Interpretability of Composite Decision Systems","date":"2021-11-16","arxiv_id":"2111.08749","n_code_links":1,"syntology":null},{"paper":null,"slug":"anti-jamming-games-for-multi-user-multi-band","title":"Anti-Jamming Games in Multi-Band Wireless Ad Hoc Networks","date":"2021-11-11","arxiv_id":"2111.11178","n_code_links":0,"syntology":null},{"paper":null,"slug":"kalman-filtering-with-adversarial-corruptions","title":"Kalman Filtering with Adversarial Corruptions","date":"2021-11-11","arxiv_id":"2111.06395","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-decision-rules-under-partial","title":"Optimal Decision Rules Under Partial Identification","date":"2021-11-09","arxiv_id":"2111.04926","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-cooperate-with-unseen-agent-via","title":"Learning to Cooperate with Unseen Agent via Meta-Reinforcement Learning","date":"2021-11-05","arxiv_id":"2111.03431","n_code_links":0,"syntology":null},{"paper":null,"slug":"mixtures-of-laplace-approximations-for","title":"Mixtures of Laplace Approximations for Improved Post-Hoc Uncertainty in Deep Learning","date":"2021-11-05","arxiv_id":"2111.03577","n_code_links":0,"syntology":null},{"paper":"/paper/convolutional-motif-kernel-networks","slug":"convolutional-motif-kernel-networks","title":"Convolutional Motif Kernel Networks","date":"2021-11-03","arxiv_id":"2111.02272","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-learning-aided-routing-for-space-air","title":"Deep Learning Aided Routing for Space-Air-Ground Integrated Networks Relying on Real Satellite, Flight, and Shipping Data","date":"2021-10-28","arxiv_id":"2110.15138","n_code_links":0,"syntology":null},{"paper":"/paper/uniform-concentration-bounds-toward-a-unified","slug":"uniform-concentration-bounds-toward-a-unified","title":"Uniform Concentration Bounds toward a Unified Framework for Robust Clustering","date":"2021-10-27","arxiv_id":"2110.14148","n_code_links":1,"syntology":null},{"paper":null,"slug":"aware-adoption-of-ai-from-potential-to","title":"Representations of epistemic uncertainty and awareness in data-driven strategies","date":"2021-10-21","arxiv_id":"2110.11482","n_code_links":0,"syntology":null},{"paper":null,"slug":"single-modal-entropy-based-active-learning","title":"Single-Modal Entropy based Active Learning for Visual Question Answering","date":"2021-10-21","arxiv_id":"2110.10906","n_code_links":0,"syntology":null},{"paper":null,"slug":"cyclic-prefix-cp-jamming-against","title":"Cyclic Prefix (CP) Jamming Against Eavesdropping Relays in OFDM Systems","date":"2021-10-18","arxiv_id":"2110.09130","n_code_links":0,"syntology":null},{"paper":null,"slug":"state-space-constraints-improve-the","title":"State-Space Constraints Improve the Generalization of the Differentiable Neural Computer in some Algorithmic Tasks","date":"2021-10-18","arxiv_id":"2110.09138","n_code_links":0,"syntology":null},{"paper":"/paper/ae-stylegan-improved-training-of-style-based","slug":"ae-stylegan-improved-training-of-style-based","title":"AE-StyleGAN: Improved Training of Style-Based Auto-Encoders","date":"2021-10-17","arxiv_id":"2110.08718","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","official":{"repos":["phymhan/stylegan2-pytorch"],"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"]}}},{"paper":null,"slug":"certainty-modeling-of-a-decision-support","title":"Certainty Modeling of a Decision Support System for Mobile Monitoring of Exercise induced Respiratory Conditions","date":"2021-10-15","arxiv_id":"2110.07898","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploratory-lagrangian-based-particle-tracing","title":"Exploratory Lagrangian-Based Particle Tracing Using Deep Learning","date":"2021-10-15","arxiv_id":"2110.08338","n_code_links":0,"syntology":null},{"paper":null,"slug":"designing-language-technologies-for-social","title":"Designing Language Technologies for Social Good: The Road not Taken","date":"2021-10-14","arxiv_id":"2110.07444","n_code_links":0,"syntology":null},{"paper":"/paper/automated-essay-scoring-using-transformer","slug":"automated-essay-scoring-using-transformer","title":"Automated Essay Scoring Using Transformer Models","date":"2021-10-13","arxiv_id":"2110.06874","n_code_links":1,"syntology":null},{"paper":null,"slug":"governance-and-communication-of-algorithmic","title":"Governance and Communication of Algorithmic Decision Making: A Case Study on Public Sector","date":"2021-10-08","arxiv_id":"2110.09226","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-abbreviation-expansion-in-context","title":"Structured abbreviation expansion in context","date":"2021-10-04","arxiv_id":"2110.01140","n_code_links":0,"syntology":null},{"paper":"/paper/lemon-explainable-entity-matching","slug":"lemon-explainable-entity-matching","title":"LEMON: Explainable Entity Matching","date":"2021-10-01","arxiv_id":"2110.00516","n_code_links":1,"syntology":null},{"paper":null,"slug":"gene-regulatory-network-inference-from-single","title":"Gene regulatory network inference from single-cell data using a self-consistent proteomic field","date":"2021-09-30","arxiv_id":"2109.14888","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-statistical-manifold-framework-for-point","title":"A Statistical Manifold Framework for Point Cloud Data","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"online-ad-hoc-teamwork-under-partial","title":"Online Ad Hoc Teamwork under Partial Observability","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"optimized-separable-convolution-yet-another","title":"Optimized Separable Convolution: Yet Another Efficient Convolution Operator","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"simmer-simple-maximization-of-entropy-and","title":"SimMER: Simple Maximization of Entropy and Rank for Self-supervised Representation Learning","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-trustworthy-explanations-with","title":"Towards trustworthy explanations with gradient-based attribution methods","date":"2021-09-24","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"the-promise-of-dataflow-architectures-in-the","title":"Dataflow Accelerator Architecture for Autonomous Machine Computing","date":"2021-09-15","arxiv_id":"2109.07047","n_code_links":0,"syntology":null},{"paper":"/paper/what-s-in-a-name-answer-equivalence-for-open","slug":"what-s-in-a-name-answer-equivalence-for-open","title":"What's in a Name? Answer Equivalence For Open-Domain Question Answering","date":"2021-09-11","arxiv_id":"2109.05289","n_code_links":1,"syntology":null},{"paper":"/paper/neural-latents-benchmark-21-evaluating-latent","slug":"neural-latents-benchmark-21-evaluating-latent","title":"Neural Latents Benchmark '21: Evaluating latent variable models of neural population activity","date":"2021-09-09","arxiv_id":"2109.04463","n_code_links":2,"syntology":{"ran":17,"of":24,"n_ran_checked":17,"n_instrument":0,"unverified":7,"pointer_only":3,"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) · 7 unverified","official":{"repos":["neurallatents/nlb_tools"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"hypergraph-of-entity-a-general-model-for","title":"Hypergraph-of-Entity: A General Model for Entity-Oriented Search","date":"2021-09-01","arxiv_id":"2109.00450","n_code_links":0,"syntology":null},{"paper":"/paper/information-theoretic-classification-accuracy","slug":"information-theoretic-classification-accuracy","title":"Information-theoretic Classification Accuracy: A Criterion that Guides Data-driven Combination of Ambiguous Outcome Labels in Multi-class Classification","date":"2021-09-01","arxiv_id":"2109.00582","n_code_links":1,"syntology":null},{"paper":null,"slug":"podcast-metadata-and-content-episode","title":"Podcast Metadata and Content: Episode Relevance andAttractiveness in Ad Hoc Search","date":"2021-08-25","arxiv_id":"2108.11460","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-systematic-literature-review-of-automated-2","title":"A Systematic Review of Automated Query Reformulations in Source Code Search","date":"2021-08-22","arxiv_id":"2108.09646","n_code_links":0,"syntology":null},{"paper":null,"slug":"temporally-nonstationary-component-analysis","title":"Temporally Nonstationary Component Analysis; Application to Noninvasive Fetal Electrocardiogram Extraction","date":"2021-08-20","arxiv_id":"2108.09353","n_code_links":0,"syntology":null},{"paper":null,"slug":"memory-aware-partitioning-of-machine-learning","title":"Memory-Aware Partitioning of Machine Learning Applications for Optimal Energy Use in Batteryless Systems","date":"2021-08-05","arxiv_id":"2108.04059","n_code_links":0,"syntology":null},{"paper":"/paper/shared-interest-large-scale-visual-analysis","slug":"shared-interest-large-scale-visual-analysis","title":"Shared Interest: Measuring Human-AI Alignment to Identify Recurring Patterns in Model Behavior","date":"2021-07-20","arxiv_id":"2107.09234","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":5,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["mitvis/shared-interest"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"quantifying-machine-learning-induced","title":"Quantifying machine learning-induced overdiagnosis in sepsis","date":"2021-07-03","arxiv_id":"2107.10399","n_code_links":0,"syntology":null},{"paper":"/paper/meaningfully-explaining-a-model-s-mistakes","slug":"meaningfully-explaining-a-model-s-mistakes","title":"Meaningfully Debugging Model Mistakes using Conceptual Counterfactual Explanations","date":"2021-06-24","arxiv_id":"2106.12723","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["mertyg/debug-mistakes-cce"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"automatic-head-overcoat-thickness-measure","title":"Automatic Head Overcoat Thickness Measure with NASNet-Large-Decoder Net","date":"2021-06-22","arxiv_id":"2106.12054","n_code_links":0,"syntology":null},{"paper":"/paper/objective-discovery-of-dominant-dynamical","slug":"objective-discovery-of-dominant-dynamical","title":"Objective discovery of dominant dynamical processes with intelligible machine learning","date":"2021-06-21","arxiv_id":"2106.12963","n_code_links":1,"syntology":null},{"paper":null,"slug":"seen-sharpening-explanations-for-graph-neural","title":"SEEN: Sharpening Explanations for Graph Neural Networks using Explanations from Neighborhoods","date":"2021-06-16","arxiv_id":"2106.08532","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-objective-evaluation-of-post-hoc","slug":"on-the-objective-evaluation-of-post-hoc","title":"A Framework for Evaluating Post Hoc Feature-Additive Explainers","date":"2021-06-15","arxiv_id":"2106.08376","n_code_links":1,"syntology":null},{"paper":"/paper/s-lime-stabilized-lime-for-model-explanation","slug":"s-lime-stabilized-lime-for-model-explanation","title":"S-LIME: Stabilized-LIME for Model Explanation","date":"2021-06-15","arxiv_id":"2106.07875","n_code_links":2,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ZhengzeZhou/slime"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"improved-predictive-uncertainty-using","title":"Frustratingly Easy Uncertainty Estimation for Distribution Shift","date":"2021-06-07","arxiv_id":"2106.03762","n_code_links":0,"syntology":null},{"paper":null,"slug":"dreca-a-general-task-augmentation-strategy","title":"DReCa: A General Task Augmentation Strategy for Few-Shot Natural Language Inference","date":"2021-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"calibrating-over-parametrized-simulation","title":"Calibrating Over-Parametrized Simulation Models: A Framework via Eligibility Set","date":"2021-05-27","arxiv_id":"2105.12893","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-network-selection-for-the-object","title":"Dynamic Network selection for the Object Detection task: why it matters and what we (didn't) achieve","date":"2021-05-27","arxiv_id":"2105.13279","n_code_links":0,"syntology":null},{"paper":null,"slug":"image-based-plant-wilting-estimation","title":"Image-Based Plant Wilting Estimation","date":"2021-05-27","arxiv_id":"2105.12926","n_code_links":0,"syntology":null},{"paper":null,"slug":"propositional-encodings-of-acyclicity-and","title":"Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination","date":"2021-05-27","arxiv_id":"2105.12908","n_code_links":0,"syntology":null},{"paper":null,"slug":"shades-of-confusion-lexical-uncertainty","title":"Shades of confusion: Lexical uncertainty modulates ad hoc coordination in an interactive communication task","date":"2021-05-13","arxiv_id":"2105.06546","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-shield-a-probabilistic-approach","title":"Stochastic-Shield: A Probabilistic Approach Towards Training-Free Adversarial Defense in Quantized CNNs","date":"2021-05-13","arxiv_id":"2105.06512","n_code_links":0,"syntology":null},{"paper":"/paper/do-concept-bottleneck-models-learn-as","slug":"do-concept-bottleneck-models-learn-as","title":"Do Concept Bottleneck Models Learn as Intended?","date":"2021-05-10","arxiv_id":"2105.04289","n_code_links":1,"syntology":null},{"paper":"/paper/few-shot-conversational-dense-retrieval","slug":"few-shot-conversational-dense-retrieval","title":"Few-Shot Conversational Dense Retrieval","date":"2021-05-10","arxiv_id":"2105.04166","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["thunlp/ConvDR"],"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"]}}},{"paper":null,"slug":"ms-marco-benchmarking-ranking-models-in-the","title":"MS MARCO: Benchmarking Ranking Models in the Large-Data Regime","date":"2021-05-09","arxiv_id":"2105.04021","n_code_links":0,"syntology":null},{"paper":null,"slug":"predictive-landscapes-for-biological-cellular","title":"Predictive landscapes hidden beneath biological cellular automata","date":"2021-05-05","arxiv_id":"2105.01999","n_code_links":0,"syntology":null},{"paper":"/paper/this-looks-like-that-does-it-shortcomings-of","slug":"this-looks-like-that-does-it-shortcomings-of","title":"This Looks Like That... Does it? Shortcomings of Latent Space Prototype Interpretability in Deep Networks","date":"2021-05-05","arxiv_id":"2105.02968","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-by-design-structuring-and","title":"Learning by Design: Structuring and Documenting the Human Choices in Machine Learning Development","date":"2021-05-03","arxiv_id":"2105.00687","n_code_links":0,"syntology":null},{"paper":"/paper/end-to-end-grasping-policies-for-human-in-the","slug":"end-to-end-grasping-policies-for-human-in-the","title":"End-to-end grasping policies for human-in-the-loop robots via deep reinforcement learning","date":"2021-04-26","arxiv_id":"2104.12842","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-survey-on-millimeter-wave-beamforming","title":"A Survey on Millimeter-Wave Beamforming Enabled UAV Communications and Networking","date":"2021-04-19","arxiv_id":"2104.09204","n_code_links":0,"syntology":null},{"paper":null,"slug":"trec-deep-learning-track-reusable-test","title":"TREC Deep Learning Track: Reusable Test Collections in the Large Data Regime","date":"2021-04-19","arxiv_id":"2104.09399","n_code_links":0,"syntology":null},{"paper":"/paper/graphsvx-shapley-value-explanations-for-graph","slug":"graphsvx-shapley-value-explanations-for-graph","title":"GraphSVX: Shapley Value Explanations for Graph Neural Networks","date":"2021-04-18","arxiv_id":"2104.10482","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"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) · 3 unverified","official":{"repos":["AlexDuvalinho/GraphSVX"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"training-humans-to-train-robots-dynamic-motor","title":"Training Humans to Train Robots Dynamic Motor Skills","date":"2021-04-17","arxiv_id":"2104.08631","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-agent-reinforcement-learning-based-3","title":"Multi-Agent Reinforcement Learning Based Coded Computation for Mobile Ad Hoc Computing","date":"2021-04-15","arxiv_id":"2104.07539","n_code_links":0,"syntology":null},{"paper":null,"slug":"route-vplat-survey-and-analysis-of-routing","title":"Route-VPlat: Survey and Analysis of Routing Protocols for Communication in Multi-hop Vehicular Platooning","date":"2021-04-13","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"route-vplat-survey-and-analysis-of-routing-1","title":"Route-VPlat: Survey and Analysis of Routing Protocols for Communication in Multi-hop Vehicular Platooning","date":"2021-04-13","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"fatigued-pagerank","title":"Fatigued PageRank","date":"2021-04-12","arxiv_id":"2104.05369","n_code_links":0,"syntology":null},{"paper":null,"slug":"fatigued-random-walks-in-hypergraphs-a","title":"Fatigued Random Walks in Hypergraphs: A Neuronal Analogy to Improve Retrieval Performance","date":"2021-04-12","arxiv_id":"2104.05364","n_code_links":0,"syntology":null},{"paper":"/paper/from-partners-to-populations-a-hierarchical","slug":"from-partners-to-populations-a-hierarchical","title":"From partners to populations: A hierarchical Bayesian account of coordination and convention","date":"2021-04-12","arxiv_id":"2104.05857","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-dual-critic-reinforcement-learning","title":"A Dual-Critic Reinforcement Learning Framework for Frame-level Bit Allocation in HEVC/H.265","date":"2021-04-05","arxiv_id":"2104.01735","n_code_links":0,"syntology":null},{"paper":null,"slug":"artificial-intelligence-human-rights","title":"Artificial intelligence, human rights, democracy, and the rule of law: a primer","date":"2021-04-02","arxiv_id":"2104.04147","n_code_links":0,"syntology":null},{"paper":null,"slug":"sustainability-in-a-market-design-for","title":"A Pricing Mechanism to Jointly Mitigate Market Power and Environmental Externalities in Electricity Markets","date":"2021-04-01","arxiv_id":"2104.00578","n_code_links":0,"syntology":null},{"paper":null,"slug":"ia-gcn-interpretable-attention-based-graph","title":"IA-GCN: Interpretable Attention based Graph Convolutional Network for Disease prediction","date":"2021-03-29","arxiv_id":"2103.15587","n_code_links":0,"syntology":null},{"paper":"/paper/despeckling-polarimetric-sar-data-using-a","slug":"despeckling-polarimetric-sar-data-using-a","title":"Despeckling Polarimetric SAR Data Using a Multi-Stream Complex-Valued Fully Convolutional Network","date":"2021-03-12","arxiv_id":"2103.07394","n_code_links":1,"syntology":null},{"paper":"/paper/genetic-improvement-of-routing-protocols-for","slug":"genetic-improvement-of-routing-protocols-for","title":"Genetic Improvement of Routing Protocols for Delay Tolerant Networks","date":"2021-03-12","arxiv_id":"2103.07428","n_code_links":1,"syntology":null}],"record_sha256":"bfe19422959e8d829a996f63d5ae2612790f8166ace3c50ea1bcc5970568be5e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}