{"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/23","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":23,"pages_in_order":27,"rows_per_page":100,"rows":[2201,2300],"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/22","next":"/task/all/papers/24","papers":[{"url":null,"slug":"friendship-is-all-we-need-a-multi-graph","title":"Friendship is All we Need: A Multi-graph Embedding Approach for Modeling Customer Behavior","date":"2020-10-06","arxiv_id":"2010.02780","repositories_listed":0,"syntology":null},{"url":null,"slug":"bcnn-a-binary-cnn-with-all-matrix-ops","title":"BCNN: A Binary CNN with All Matrix Ops Quantized to 1 Bit Precision","date":"2020-10-01","arxiv_id":"2010.00704","repositories_listed":0,"syntology":null},{"url":null,"slug":"lipschitz-neural-networks-are-dense-in-the","title":"Lipschitz neural networks are dense in the set of all Lipschitz functions","date":"2020-09-29","arxiv_id":"2009.13881","repositories_listed":0,"syntology":null},{"url":null,"slug":"once-quantized-for-all-progressively","title":"Once Quantized for All: Progressively Searching for Quantized Compact Models","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-image-generation-with-one-vs-all","title":"Conditional Image Generation with One-Vs-All Classifier","date":"2020-09-18","arxiv_id":"2009.08688","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-order-refining-for-end-to-end-chinese","title":"High-order Refining for End-to-end Chinese Semantic Role Labeling","date":"2020-09-15","arxiv_id":"2009.06957","repositories_listed":0,"syntology":null},{"url":null,"slug":"praflow-rvc-pyramid-recurrent-all-pairs-field","title":"PRAFlow_RVC: Pyramid Recurrent All-Pairs Field Transforms for Optical Flow Estimation in Robust Vision Challenge 2020","date":"2020-09-14","arxiv_id":"2009.06360","repositories_listed":0,"syntology":null},{"url":null,"slug":"proposal-free-volumetric-instance","title":"Proposal-Free Volumetric Instance Segmentation from Latent Single-Instance Masks","date":"2020-09-10","arxiv_id":"2009.04998","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-weather-sub-50-cm-radar-inertial","title":"All-Weather sub-50-cm Radar-Inertial Positioning","date":"2020-09-09","arxiv_id":"2009.04814","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-data-inclusive-deep-learning-models-to","title":"All Data Inclusive, Deep Learning Models to Predict Critical Events in the Medical Information Mart for Intensive Care III Database (MIMIC III)","date":"2020-09-02","arxiv_id":"2009.01366","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotically-optimal-strategies-for-online","title":"Asymptotically optimal strategies for online prediction with history-dependent experts","date":"2020-08-31","arxiv_id":"2008.13703","repositories_listed":0,"syntology":null},{"url":"/paper/all-about-knowledge-graphs-for-actions","slug":"all-about-knowledge-graphs-for-actions","title":"All About Knowledge Graphs for Actions","date":"2020-08-28","arxiv_id":"2008.12432","repositories_listed":0,"syntology":null},{"url":null,"slug":"mcmia-model-compression-against-membership","title":"Against Membership Inference Attack: Pruning is All You Need","date":"2020-08-28","arxiv_id":"2008.13578","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-all-credible-bayesian-network","title":"Learning All Credible Bayesian Network Structures for Model Averaging","date":"2020-08-27","arxiv_id":"2008.13618","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameterization-of-all-output-rectifying","title":"Parameterization of All Output-Rectifying Retrofit Controllers","date":"2020-08-26","arxiv_id":"2008.11552","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-weight-bitwidth-to-rule-them-all","title":"One Weight Bitwidth to Rule Them All","date":"2020-08-22","arxiv_id":"2008.09916","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-bit-to-rule-them-all-binarizing-the","title":"One Bit to Rule Them All : Binarizing the Reconstruction in 1-bit Compressive Sensing","date":"2020-08-17","arxiv_id":"2008.07264","repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-controllability-of-networked","title":"Structural Controllability of Networked Relative Coupling Systems","date":"2020-08-16","arxiv_id":"1911.06450","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-evaluation-of-rating-systems-in-online","title":"The Evaluation of Rating Systems in Online Free-for-All Games","date":"2020-08-15","arxiv_id":"2008.06787","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-little-data-do-we-need-for-patient-level","title":"Logistic regression models for patient-level prediction based on massive observational data: Do we need all data?","date":"2020-08-14","arxiv_id":"2008.07361","repositories_listed":0,"syntology":null},{"url":null,"slug":"speech-to-semantics-improve-asr-and-nlu","title":"Speech To Semantics: Improve ASR and NLU Jointly via All-Neural Interfaces","date":"2020-08-14","arxiv_id":"2008.06173","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-should-not-be-contrastive-in-contrastive","title":"What Should Not Be Contrastive in Contrastive Learning","date":"2020-08-13","arxiv_id":"2008.05659","repositories_listed":0,"syntology":null},{"url":null,"slug":"almost-all-of-entity-resolution","title":"(Almost) All of Entity Resolution","date":"2020-08-10","arxiv_id":"2008.04443","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-to-do-when-you-can-t-do-it-all-temporal","title":"What to Do When You Can't Do It All: Temporal Logic Planning with Soft Temporal Logic Constraints","date":"2020-08-05","arxiv_id":"2008.01926","repositories_listed":0,"syntology":null},{"url":null,"slug":"making-coherence-out-of-nothing-at-all","title":"Making Coherence Out of Nothing At All: Measuring the Evolution of Gradient Alignment","date":"2020-08-03","arxiv_id":"2008.01217","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-digital-fpga-based-dac-with-none-or-few","title":"All-Digital FPGA-based DAC with None or Few External Components","date":"2020-08-02","arxiv_id":"2008.00572","repositories_listed":0,"syntology":null},{"url":null,"slug":"6g-oriented-wireless-communication-channel","title":"6G Oriented Wireless Communication Channel Characteristics Analysis and Modeling","date":"2020-07-28","arxiv_id":"2007.13958","repositories_listed":0,"syntology":null},{"url":null,"slug":"cyclic-imaging-for-all-sky-interference","title":"Cyclic Imaging for All-Sky Interference Forecasting with Array Radio Telescopes","date":"2020-07-26","arxiv_id":"2007.13035","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-optical-information-processing-capacity","title":"All-Optical Information Processing Capacity of Diffractive Surfaces","date":"2020-07-25","arxiv_id":"2007.12813","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-at-once-temporally-adaptive-multi-frame","title":"All at Once: Temporally Adaptive Multi-Frame Interpolation with Advanced Motion Modeling","date":"2020-07-23","arxiv_id":"2007.11762","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconfigurable-waveguides-using-glide","title":"Reconfigurable Waveguides Using Glide-Symmetric Bed of Nails: Design of an All-Metal Switch at Millimetre-Wave Band","date":"2020-07-15","arxiv_id":"2007.08021","repositories_listed":0,"syntology":null},{"url":null,"slug":"free-running-similarity-based-angiography","title":"Free-running SIMilarity-Based Angiography (SIMBA) for simplified anatomical MR imaging of the heart","date":"2020-07-13","arxiv_id":"2007.06544","repositories_listed":0,"syntology":null},{"url":null,"slug":"relaxing-the-i-i-d-assumption-adaptive","title":"Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic Regularization","date":"2020-07-13","arxiv_id":"2007.06552","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-one-vs-all-classifiers-for","title":"Revisiting One-vs-All Classifiers for Predictive Uncertainty and Out-of-Distribution Detection in Neural Networks","date":"2020-07-10","arxiv_id":"2007.05134","repositories_listed":0,"syntology":null},{"url":null,"slug":"treewidth-aware-complexity-in-asp-not-all","title":"Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard","date":"2020-07-09","arxiv_id":"2007.04620","repositories_listed":0,"syntology":null},{"url":null,"slug":"not-all-unlabeled-data-are-equal-learning-to","title":"Not All Unlabeled Data are Equal: Learning to Weight Data in Semi-supervised Learning","date":"2020-07-02","arxiv_id":"2007.01293","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-modeling-for-user-personality","title":"Hierarchical Modeling for User Personality Prediction: The Role of Message-Level Attention","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-size-fits-all-multilingual-models","title":"One-Size-Fits-All Multilingual Models","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sampling-from-a-k-dpp-without-looking-at-all","title":"Sampling from a $k$-DPP without looking at all items","date":"2020-06-30","arxiv_id":"2006.16947","repositories_listed":0,"syntology":null},{"url":null,"slug":"segmentation-approach-for-coreference","title":"Segmentation Approach for Coreference Resolution Task","date":"2020-06-30","arxiv_id":"2007.04301","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiclass-classification-with-an-ensemble-of","title":"Digit Image Recognition Using an Ensemble of One-Versus-All Deep Network Classifiers","date":"2020-06-28","arxiv_id":"2007.01192","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-recognition-is-accomplished-by","title":"All Recognition is Accomplished By Interacting Bottom-Up Sensory and Top-Down Context Bias in Occipital to Frontal Cortex Neural Networks","date":"2020-06-26","arxiv_id":"2006.15128","repositories_listed":0,"syntology":null},{"url":null,"slug":"not-all-failure-modes-are-created-equal","title":"Not all Failure Modes are Created Equal: Training Deep Neural Networks for Explicable (Mis)Classification","date":"2020-06-26","arxiv_id":"2006.14841","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-model-to-pronounce-them-all-multilingual-1","title":"One Model to Pronounce Them All: Multilingual Grapheme-to-Phoneme Conversion With a Transformer Ensemble","date":"2020-06-23","arxiv_id":"2006.13343","repositories_listed":0,"syntology":null},{"url":null,"slug":"logarithmic-pruning-is-all-you-need","title":"Logarithmic Pruning is All You Need","date":"2020-06-22","arxiv_id":"2006.12156","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-optical-cochlear-implants","title":"All-Optical Cochlear Implants","date":"2020-06-20","arxiv_id":"2006.11577","repositories_listed":0,"syntology":null},{"url":null,"slug":"control-of-a-rigid-wing-pumping-airborne-wind","title":"Control of a Rigid Wing Pumping Airborne Wind Energy System in all Operational Phases","date":"2020-06-19","arxiv_id":"2006.11141","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooking-is-all-about-people-comment","title":"Cooking Is All About People: Comment Classification On Cookery Channels Using BERT and Classification Models (Malayalam-English Mix-Code)","date":"2020-06-15","arxiv_id":"2007.04249","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-or-nothing-statistical-and-computational","title":"All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation","date":"2020-06-14","arxiv_id":"2006.07971","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-aware-transformer-is-attention-all","title":"Graph-Aware Transformer: Is Attention All Graphs Need?","date":"2020-06-09","arxiv_id":"2006.05213","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-differentiation-for-all-photons","title":"Automatic Differentiation for All Photons Imaging to See Inside Volumetric Scattering Media","date":"2020-06-02","arxiv_id":"2006.01897","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-in-one-bad-weather-removal-using","title":"All in One Bad Weather Removal Using Architectural Search","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-versus-all-for-deep-neural-network","title":"One Versus all for deep Neural Network Incertitude (OVNNI) quantification","date":"2020-06-01","arxiv_id":"2006.00954","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-all-good-actors-look-the-same-exploring","title":"Do All Good Actors Look The Same? Exploring News Veracity Detection Across The U.S. and The U.K","date":"2020-05-26","arxiv_id":"2006.01211","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-many-to-one-strongly-stable-fractional","title":"On the many-to-one strongly stable fractional matching set","date":"2020-05-22","arxiv_id":"1905.12500","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-map-decoding-all-you-need-the-inadequacy","title":"Is MAP Decoding All You Need? The Inadequacy of the Mode in Neural Machine Translation","date":"2020-05-20","arxiv_id":"2005.10283","repositories_listed":0,"syntology":null},{"url":null,"slug":"competitive-wakeup-scheme-for-distributed","title":"Competitive Wakeup Scheme for Distributed Devices","date":"2020-05-19","arxiv_id":"2005.09242","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-size-fits-all-can-we-train-one-denoiser","title":"One Size Fits All: Can We Train One Denoiser for All Noise Levels?","date":"2020-05-19","arxiv_id":"2005.09627","repositories_listed":0,"syntology":null},{"url":null,"slug":"jncd-based-perceptual-compression-of-rgb-4-4","title":"HVS-Based Perceptual Color Compression of Image Data","date":"2020-05-16","arxiv_id":"2005.07930","repositories_listed":0,"syntology":null},{"url":null,"slug":"infinite-duration-all-pay-bidding-games","title":"Infinite-Duration All-Pay Bidding Games","date":"2020-05-12","arxiv_id":"2005.06636","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-synchronization-of-pulse-coupled-1","title":"Global Synchronization of Pulse-Coupled Oscillator Networks Under Byzantine Attacks","date":"2020-05-07","arxiv_id":"2005.04216","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-that-glitters-is-not-gold-a-gold-standard","title":"All That Glitters is Not Gold: A Gold Standard of Adjective-Noun Collocations for German","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-sample-complexities-for-deep-neural","title":"Improved Sample Complexities for Deep Neural Networks and Robust Classification via an All-Layer Margin","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"jacks-of-all-trades-masters-of-none","title":"Jacks of All Trades, Masters Of None: Addressing Distributional Shift and Obtrusiveness via Transparent Patch Attacks","date":"2020-05-01","arxiv_id":"2005.00656","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-correlation-of-word-embedding","title":"On the Correlation of Word Embedding Evaluation Metrics","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-classifier-for-all-ambiguous-words","title":"One Classifier for All Ambiguous Words: Overcoming Data Sparsity by Utilizing Sense Correlations Across Words","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"when-bert-plays-the-lottery-all-tickets-are","title":"When BERT Plays the Lottery, All Tickets Are Winning","date":"2020-05-01","arxiv_id":"2005.00561","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-training-is-almost-all-you-need-an","title":"Pre-training Is (Almost) All You Need: An Application to Commonsense Reasoning","date":"2020-04-29","arxiv_id":"2004.14074","repositories_listed":0,"syntology":null},{"url":null,"slug":"technological-improvement-rate-estimates-for","title":"Technological improvement rate estimates for all technologies: Use of patent data and an extended domain description","date":"2020-04-29","arxiv_id":"2004.13919","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-you-need-is-a-second-look-towards-tighter","title":"All you need is a second look: Towards Tighter Arbitrary shape text detection","date":"2020-04-26","arxiv_id":"2004.12436","repositories_listed":0,"syntology":null},{"url":null,"slug":"responsible-ai-and-its-stakeholders","title":"Responsible AI and Its Stakeholders","date":"2020-04-23","arxiv_id":"2004.11434","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-integration-of-shapley-scarf-housing","title":"On the integration of Shapley-Scarf housing markets","date":"2020-04-20","arxiv_id":"2004.09075","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-sets-of-robust-recurrent-neural","title":"A Convex Parameterization of Robust Recurrent Neural Networks","date":"2020-04-11","arxiv_id":"2004.05290","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-model-to-recognize-them-all-marginal","title":"One Model to Recognize Them All: Marginal Distillation from NER Models with Different Tag Sets","date":"2020-04-10","arxiv_id":"2004.05140","repositories_listed":0,"syntology":null},{"url":null,"slug":"u-net-using-stacked-dilated-convolutions-for","title":"U-Net Using Stacked Dilated Convolutions for Medical Image Segmentation","date":"2020-04-07","arxiv_id":"2004.03466","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-principled-approach-to-learning-stochastic","title":"Not All Features Are Equal: Discovering Essential Features for Preserving Prediction Privacy","date":"2020-03-26","arxiv_id":"2003.12154","repositories_listed":0,"syntology":null},{"url":"/paper/greedynas-towards-fast-one-shot-nas-with","slug":"greedynas-towards-fast-one-shot-nas-with","title":"GreedyNAS: Towards Fast One-Shot NAS with Greedy Supernet","date":"2020-03-25","arxiv_id":"2003.11236","repositories_listed":0,"syntology":null},{"url":null,"slug":"not-all-domains-are-equally-complex-adaptive","title":"Not all domains are equally complex: Adaptive Multi-Domain Learning","date":"2020-03-25","arxiv_id":"2003.11504","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-graphnet-zoo-a-plug-and-play-framework","title":"The GraphNet Zoo: An All-in-One Graph Based Deep Semi-Supervised Framework for Medical Image Classification","date":"2020-03-13","arxiv_id":"2003.06451","repositories_listed":0,"syntology":null},{"url":null,"slug":"tackling-real-noisy-reverberant-meetings-with","title":"Tackling real noisy reverberant meetings with all-neural source separation, counting, and diarization system","date":"2020-03-09","arxiv_id":"2003.03987","repositories_listed":0,"syntology":null},{"url":null,"slug":"lsf-join-locality-sensitive-filtering-for","title":"LSF-Join: Locality Sensitive Filtering for Distributed All-Pairs Set Similarity Under Skew","date":"2020-03-06","arxiv_id":"2003.02972","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-auto-encoder-not-all-failures-are","title":"Variational Auto-Encoder: not all failures are equal","date":"2020-03-04","arxiv_id":"2003.01972","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-all-roads-lead-to-rome-understanding-the","title":"Do all Roads Lead to Rome? Understanding the Role of Initialization in Iterative Back-Translation","date":"2020-02-28","arxiv_id":"2002.12867","repositories_listed":0,"syntology":null},{"url":null,"slug":"publicly-verifiable-databases-with-all","title":"Publicly Verifiable Databases With All Efficient Updating Operations","date":"2020-02-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"annotating-and-extracting-synthesis-process","title":"Annotating and Extracting Synthesis Process of All-Solid-State Batteries from Scientific Literature","date":"2020-02-18","arxiv_id":"2002.07339","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-rcnn-universal-object-detector-via","title":"Universal-RCNN: Universal Object Detector via Transferable Graph R-CNN","date":"2020-02-18","arxiv_id":"2002.07417","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-multi-task-learning-via-generalized","title":"Deep Multi-Task Learning via Generalized Tensor Trace Norm","date":"2020-02-12","arxiv_id":"2002.04799","repositories_listed":0,"syntology":null},{"url":null,"slug":"reproducing-kernel-hilbert-spaces-cannot","title":"Reproducing Kernel Hilbert Spaces Cannot Contain all Continuous Functions on a Compact Metric Space","date":"2020-02-08","arxiv_id":"2002.03171","repositories_listed":0,"syntology":null},{"url":null,"slug":"proving-the-lottery-ticket-hypothesis-pruning","title":"Proving the Lottery Ticket Hypothesis: Pruning is All You Need","date":"2020-02-03","arxiv_id":"2002.00585","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-explanation-does-not-fit-all-the-promise","title":"One Explanation Does Not Fit All: The Promise of Interactive Explanations for Machine Learning Transparency","date":"2020-01-27","arxiv_id":"2001.09734","repositories_listed":0,"syntology":null},{"url":null,"slug":"further-boosting-bert-based-models-by","title":"BERT's output layer recognizes all hidden layers? Some Intriguing Phenomena and a simple way to boost BERT","date":"2020-01-25","arxiv_id":"2001.09309","repositories_listed":0,"syntology":null},{"url":null,"slug":"oiad-one-for-all-image-anomaly-detection-with","title":"OIAD: One-for-all Image Anomaly Detection with Disentanglement Learning","date":"2020-01-18","arxiv_id":"2001.06640","repositories_listed":0,"syntology":null},{"url":null,"slug":"classifying-all-interacting-pairs-in-a-single","title":"Classifying All Interacting Pairs in a Single Shot","date":"2020-01-13","arxiv_id":"2001.04360","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-of-pruning-techniques-for-deep","title":"Modeling of Pruning Techniques for Deep Neural Networks Simplification","date":"2020-01-13","arxiv_id":"2001.04062","repositories_listed":0,"syntology":null},{"url":null,"slug":"secure-multiparty-computations-in-floating","title":"Secure multiparty computations in floating-point arithmetic","date":"2020-01-09","arxiv_id":"2001.03192","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-in-the-exponential-family-information","title":"All in the (Exponential) Family: Information Geometry and Thermodynamic Variational Inference","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"involutive-mcmc-one-way-to-derive-them-all","title":"Involutive MCMC: One Way to Derive Them All","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"all-in-one-image-grounded-conversational","title":"All-in-One Image-Grounded Conversational Agents","date":"2019-12-28","arxiv_id":"1912.12394","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparative-study-on-machine-learning","title":"A Comparative Study on Machine Learning Algorithms for the Control of a Wall Following Robot","date":"2019-12-26","arxiv_id":"1912.11856","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-design-framework-for-all-digital-mmwave","title":"A design framework for all-digital mmWave massive MIMO with per-antenna nonlinearities","date":"2019-12-25","arxiv_id":"1912.11643","repositories_listed":0,"syntology":null}],"record_sha256":"e279bc03f636d85fd9e17292745e08bacdd1d2bcf98fcbf820d3994140892226","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}