{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/open-question/papers/4","list_of":"/task/open-question","task":"Open-Ended Question Answering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":8,"rows_per_page":100,"rows":[301,400],"of":796,"counts":{"archive_papers_tagged":796,"with_a_code_link":228,"where_syntology_ran_a_sample":70,"not_listed_spam_title":0,"listed":796,"listed_where_code_ran":70,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":11,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/open-question","prev":"/task/open-question/papers/3","next":"/task/open-question/papers/5","papers":[{"url":null,"slug":"spatial-temporal-traffic-modeling-with-a","title":"Spatial-temporal traffic modeling with a fusion graph reconstructed by tensor decomposition","date":"2022-12-12","arxiv_id":"2212.05653","repositories_listed":0,"syntology":null},{"url":null,"slug":"pretrained-diffusion-models-for-unified-human","title":"Pretrained Diffusion Models for Unified Human Motion Synthesis","date":"2022-12-06","arxiv_id":"2212.02837","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-riemannian-optimization-handling","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","date":"2022-11-26","arxiv_id":"2211.14645","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-relational-bias-on-knowledge","title":"Mitigating Relational Bias on Knowledge Graphs","date":"2022-11-26","arxiv_id":"2211.14489","repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-learning-for-tensor-gaussian","title":"Transfer learning for tensor Gaussian graphical models","date":"2022-11-17","arxiv_id":"2211.09391","repositories_listed":0,"syntology":null},{"url":null,"slug":"prompting-language-models-for-linguistic","title":"Prompting Language Models for Linguistic Structure","date":"2022-11-15","arxiv_id":"2211.07830","repositories_listed":0,"syntology":null},{"url":null,"slug":"searching-for-carriers-of-the-diffuse","title":"Searching for Carriers of the Diffuse Interstellar Bands Across Disciplines, using Natural Language Processing","date":"2022-11-15","arxiv_id":"2211.08513","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-robust-numerical-question-answering","title":"Towards Robust Numerical Question Answering: Diagnosing Numerical Capabilities of NLP Systems","date":"2022-11-14","arxiv_id":"2211.07455","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-algebraic-approach-to-spike-time-neural","title":"An algebraic approach to spike-time neural codes in the hippocampus","date":"2022-11-12","arxiv_id":"2211.06692","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-architectural-bottleneck-principle","title":"The Architectural Bottleneck Principle","date":"2022-11-11","arxiv_id":"2211.06420","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent-omni-surfaces-aided-wireless","title":"Intelligent Omni-Surfaces Aided Wireless Communications: Does the Reciprocity Hold?","date":"2022-11-06","arxiv_id":"2211.03059","repositories_listed":0,"syntology":null},{"url":null,"slug":"p4p-conflict-aware-motion-prediction-for","title":"P4P: Conflict-Aware Motion Prediction for Planning in Autonomous Driving","date":"2022-11-03","arxiv_id":"2211.01634","repositories_listed":0,"syntology":null},{"url":null,"slug":"passage-mask-a-learnable-regularization","title":"Passage-Mask: A Learnable Regularization Strategy for Retriever-Reader Models","date":"2022-11-02","arxiv_id":"2211.00915","repositories_listed":0,"syntology":null},{"url":null,"slug":"quasi-newton-steps-for-efficient-online-exp","title":"Quasi-Newton Steps for Efficient Online Exp-Concave Optimization","date":"2022-11-02","arxiv_id":"2211.01357","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-utility-maximisation-under","title":"Robust utility maximisation under proportional transaction costs for càdlàg price processes","date":"2022-11-01","arxiv_id":"2211.00532","repositories_listed":0,"syntology":null},{"url":null,"slug":"preventing-verbatim-memorization-in-language","title":"Preventing Verbatim Memorization in Language Models Gives a False Sense of Privacy","date":"2022-10-31","arxiv_id":"2210.17546","repositories_listed":0,"syntology":null},{"url":null,"slug":"hsvi-can-solve-zero-sum-partially-observable","title":"HSVI can solve zero-sum Partially Observable Stochastic Games","date":"2022-10-26","arxiv_id":"2210.14640","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-theory-of-mind-on-the-limits-of-social","title":"Neural Theory-of-Mind? On the Limits of Social Intelligence in Large LMs","date":"2022-10-24","arxiv_id":"2210.13312","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-complexity-an-object-relations","title":"Quantifying Complexity: An Object-Relations Approach to Complex Systems","date":"2022-10-22","arxiv_id":"2210.12347","repositories_listed":0,"syntology":null},{"url":null,"slug":"backdoor-attack-and-defense-in-federated","title":"Backdoor Attack and Defense in Federated Generative Adversarial Network-based Medical Image Synthesis","date":"2022-10-19","arxiv_id":"2210.10886","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-adversarial-robustness-of-mixture-of","title":"On the Adversarial Robustness of Mixture of Experts","date":"2022-10-19","arxiv_id":"2210.10253","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-the-synthetic-electronic-health","title":"Evaluation of the Synthetic Electronic Health Records","date":"2022-10-16","arxiv_id":"2210.08655","repositories_listed":0,"syntology":null},{"url":null,"slug":"murag-multimodal-retrieval-augmented","title":"MuRAG: Multimodal Retrieval-Augmented Generator for Open Question Answering over Images and Text","date":"2022-10-06","arxiv_id":"2210.02928","repositories_listed":0,"syntology":null},{"url":null,"slug":"nanoscopic-distribution-of-vacht-and-vglut3","title":"Nanoscopic distribution of VAChT and VGLUT3 in striatal cholinergic varicosities suggests colocalization and segregation of the two transporters in synaptic vesicles","date":"2022-10-06","arxiv_id":"2210.02728","repositories_listed":0,"syntology":null},{"url":null,"slug":"connecting-surrogate-safety-measures-to-crash","title":"Connecting Surrogate Safety Measures to Crash Probablity via Causal Probabilistic Time Series Prediction","date":"2022-10-04","arxiv_id":"2210.01363","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterization-of-effects-of-transfer","title":"The (In)Effectiveness of Intermediate Task Training For Domain Adaptation and Cross-Lingual Transfer Learning","date":"2022-10-03","arxiv_id":"2210.01091","repositories_listed":0,"syntology":null},{"url":null,"slug":"sentiment-is-all-you-need-to-win-us","title":"Sentiment is all you need to win US Presidential elections","date":"2022-09-27","arxiv_id":"2209.13487","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-norm-minimization-of-nesterov","title":"Gradient Norm Minimization of Nesterov Acceleration: $o(1/k^3)$","date":"2022-09-19","arxiv_id":"2209.08862","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpreting-mechanism-of-synergism-of-drug","title":"Interpreting the Mechanism of Synergism for Drug Combinations Using Attention-Based Hierarchical Graph Pooling","date":"2022-09-19","arxiv_id":"2209.09245","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-and-structured-knowledge-grounded","title":"Structured Knowledge Grounding for Question Answering","date":"2022-09-17","arxiv_id":"2209.08284","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-monte-carlo-ucb-for","title":"On the Convergence of Monte Carlo UCB for Random-Length Episodic MDPs","date":"2022-09-07","arxiv_id":"2209.02864","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-ph-regret-learning-in-extensive","title":"Near-Optimal $Φ$-Regret Learning in Extensive-Form Games","date":"2022-08-20","arxiv_id":"2208.09747","repositories_listed":0,"syntology":null},{"url":null,"slug":"net-fleet-achieving-linear-convergence","title":"NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data","date":"2022-08-17","arxiv_id":"2208.08490","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-machine-learning-reconstructing-lattice","title":"Deep Machine Learning Reconstructing Lattice Topology with Strong Thermal Fluctuations","date":"2022-08-08","arxiv_id":"2208.04119","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-masked-image-modeling-via","title":"Understanding Masked Image Modeling via Learning Occlusion Invariant Feature","date":"2022-08-08","arxiv_id":"2208.04164","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-lewis-weight-sampling","title":"Online Lewis Weight Sampling","date":"2022-07-17","arxiv_id":"2207.08268","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-prediction-in-sub-linear-space","title":"Online Prediction in Sub-linear Space","date":"2022-07-16","arxiv_id":"2207.07974","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-merging-feature-engineering-and-deep","title":"On Merging Feature Engineering and Deep Learning for Diagnosis, Risk-Prediction and Age Estimation Based on the 12-Lead ECG","date":"2022-07-13","arxiv_id":"2207.06096","repositories_listed":0,"syntology":null},{"url":null,"slug":"synergy-and-symmetry-in-deep-learning","title":"Synergy and Symmetry in Deep Learning: Interactions between the Data, Model, and Inference Algorithm","date":"2022-07-11","arxiv_id":"2207.04612","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-lingual-qa-as-a-stepping-stone-for","title":"Cross-Lingual QA as a Stepping Stone for Monolingual Open QA in Icelandic","date":"2022-07-05","arxiv_id":"2207.01918","repositories_listed":0,"syntology":null},{"url":null,"slug":"log-precision-transformers-are-constant-depth","title":"The Parallelism Tradeoff: Limitations of Log-Precision Transformers","date":"2022-07-02","arxiv_id":"2207.00729","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-based-dynamic-model-1","title":"Reinforcement Learning Based Dynamic Model Combination for Time Series Forecasting","date":"2022-06-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tackling-spoofing-aware-speaker-verification","title":"Tackling Spoofing-Aware Speaker Verification with Multi-Model Fusion","date":"2022-06-18","arxiv_id":"2206.09131","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-bounds-for-state-tomography-with","title":"When Does Adaptivity Help for Quantum State Learning?","date":"2022-06-10","arxiv_id":"2206.05265","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-approximation-lower-bound-in-l-p","title":"A general approximation lower bound in $L^p$ norm, with applications to feed-forward neural networks","date":"2022-06-09","arxiv_id":"2206.04360","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-queries-under-semi-random","title":"Clustering with Queries under Semi-Random Noise","date":"2022-06-09","arxiv_id":"2206.04583","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-generate-imaginary-tasks-for","title":"Learning to generate imaginary tasks for improving generalization in meta-learning","date":"2022-06-09","arxiv_id":"2206.04335","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantitative-performance-evaluation-of","title":"Benchmarking Bayesian neural networks and evaluation metrics for regression tasks","date":"2022-06-08","arxiv_id":"2206.06779","repositories_listed":0,"syntology":null},{"url":null,"slug":"allometric-scaling-in-global-corporations-as","title":"Scaling laws in global corporations as a benchmarking approach to assess environmental performance","date":"2022-06-07","arxiv_id":"2206.03148","repositories_listed":0,"syntology":null},{"url":null,"slug":"nearly-optimal-best-of-both-worlds-algorithms","title":"Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs","date":"2022-06-02","arxiv_id":"2206.00873","repositories_listed":0,"syntology":null},{"url":null,"slug":"reflections-on-30-years-of-language-resource","title":"Reflections on 30 Years of Language Resource Development and Sharing","date":"2022-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"3psdf-three-pole-signed-distance-function-for","title":"3PSDF: Three-Pole Signed Distance Function for Learning Surfaces with Arbitrary Topologies","date":"2022-05-31","arxiv_id":"2205.15572","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-and-fast-tie-breaking-for-voting","title":"Most Equitable Voting Rules","date":"2022-05-30","arxiv_id":"2205.14838","repositories_listed":0,"syntology":null},{"url":null,"slug":"houdini-escaping-from-moderately-constrained","title":"HOUDINI: Escaping from Moderately Constrained Saddles","date":"2022-05-27","arxiv_id":"2205.13753","repositories_listed":0,"syntology":null},{"url":null,"slug":"mirror-descent-maximizes-generalized-margin","title":"Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently","date":"2022-05-25","arxiv_id":"2205.12808","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-em-algorithm-on-over-specified-two","title":"Beyond EM Algorithm on Over-specified Two-Component Location-Scale Gaussian Mixtures","date":"2022-05-23","arxiv_id":"2205.11078","repositories_listed":0,"syntology":null},{"url":null,"slug":"polter-policy-trajectory-ensemble","title":"POLTER: Policy Trajectory Ensemble Regularization for Unsupervised Reinforcement Learning","date":"2022-05-23","arxiv_id":"2205.11357","repositories_listed":0,"syntology":null},{"url":null,"slug":"memorization-and-optimization-in-deep-neural","title":"Memorization and Optimization in Deep Neural Networks with Minimum Over-parameterization","date":"2022-05-20","arxiv_id":"2205.10217","repositories_listed":0,"syntology":null},{"url":null,"slug":"pareto-optimal-fairness-utility-amortizations","title":"Pareto-Optimal Fairness-Utility Amortizations in Rankings with a DBN Exposure Model","date":"2022-05-16","arxiv_id":"2205.07647","repositories_listed":0,"syntology":null},{"url":null,"slug":"bacteriophage-effect-on-parasitism-resistance","title":"Bacteriophage effect on parasitism resistance","date":"2022-05-06","arxiv_id":"2205.03382","repositories_listed":0,"syntology":null},{"url":null,"slug":"modality-specific-learning-rates-for","title":"Modality-specific Learning Rates for Effective Multimodal Additive Late-fusion","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"human-ai-collaboration-via-conditional","title":"Human-AI Collaboration via Conditional Delegation: A Case Study of Content Moderation","date":"2022-04-25","arxiv_id":"2204.11788","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-computational-theory-of-learning-flexible","title":"A Computational Theory of Learning Flexible Reward-Seeking Behavior with Place Cells","date":"2022-04-22","arxiv_id":"2204.11843","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-vicinal-risk-minimization-for","title":"Revisiting Vicinal Risk Minimization for Partially Supervised Multi-Label Classification Under Data Scarcity","date":"2022-04-19","arxiv_id":"2204.08954","repositories_listed":0,"syntology":null},{"url":null,"slug":"topology-and-geometry-of-data-manifold-in","title":"Topology and geometry of data manifold in deep learning","date":"2022-04-19","arxiv_id":"2204.08624","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-language-modeling-for-goal-1","title":"Context-Aware Language Modeling for Goal-Oriented Dialogue Systems","date":"2022-04-18","arxiv_id":"2204.10198","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-view-brain-decoding","title":"Cross-view Brain Decoding","date":"2022-04-18","arxiv_id":"2204.09564","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-comparative-statics-of-persuasion","title":"The comparative statics of persuasion","date":"2022-04-14","arxiv_id":"2204.07474","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-predictive-control-for-fluid-human-to","title":"Model Predictive Control for Fluid Human-to-Robot Handovers","date":"2022-03-31","arxiv_id":"2204.00134","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-quantum-kernels-for-small-data","title":"Compositional optimization of quantum circuits for quantum kernels of support vector machines","date":"2022-03-25","arxiv_id":"2203.13848","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-risk-bounds-of-iterative-hard","title":"Stability and Risk Bounds of Iterative Hard Thresholding","date":"2022-03-17","arxiv_id":"2203.09413","repositories_listed":0,"syntology":null},{"url":null,"slug":"occlusion-fields-an-implicit-representation","title":"Occlusion Fields: An Implicit Representation for Non-Line-of-Sight Surface Reconstruction","date":"2022-03-16","arxiv_id":"2203.08657","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-structured-abstain-problem-and-the-lovasz","title":"The Structured Abstain Problem and the Lovász Hinge","date":"2022-03-16","arxiv_id":"2203.08645","repositories_listed":0,"syntology":null},{"url":null,"slug":"x-learner-learning-cross-sources-and-tasks","title":"X-Learner: Learning Cross Sources and Tasks for Universal Visual Representation","date":"2022-03-16","arxiv_id":"2203.08764","repositories_listed":0,"syntology":null},{"url":null,"slug":"regret-bounds-for-expected-improvement","title":"Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization","date":"2022-03-15","arxiv_id":"2203.07875","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-characterization-of-multiclass-learnability","title":"A Characterization of Multiclass Learnability","date":"2022-03-03","arxiv_id":"2203.01550","repositories_listed":0,"syntology":null},{"url":null,"slug":"biological-error-correction-codes-generate","title":"Fault-Tolerant Neural Networks from Biological Error Correction Codes","date":"2022-02-25","arxiv_id":"2202.12887","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameterized-intractability-for-multi-winner","title":"Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule","date":"2022-02-24","arxiv_id":"2202.12006","repositories_listed":0,"syntology":null},{"url":null,"slug":"partially-fake-audio-detection-by-self","title":"Partially Fake Audio Detection by Self-attention-based Fake Span Discovery","date":"2022-02-14","arxiv_id":"2202.06684","repositories_listed":0,"syntology":null},{"url":null,"slug":"complexity-of-arithmetic-in-warded-datalog","title":"Complexity of Arithmetic in Warded Datalog+-","date":"2022-02-10","arxiv_id":"2202.05086","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-characterizations-of-learnability-with","title":"On characterizations of learnability with computable learners","date":"2022-02-10","arxiv_id":"2202.05041","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hypothesis-driven-method-based-on-machine","title":"A hypothesis-driven method based on machine learning for neuroimaging data analysis","date":"2022-02-09","arxiv_id":"2202.04397","repositories_listed":0,"syntology":null},{"url":null,"slug":"width-is-less-important-than-depth-in-relu","title":"Width is Less Important than Depth in ReLU Neural Networks","date":"2022-02-08","arxiv_id":"2202.03841","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-learning-of-extensive-form-games","title":"Near-Optimal Learning of Extensive-Form Games with Imperfect Information","date":"2022-02-03","arxiv_id":"2202.01752","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-heterogeneous-federated","title":"On the Convergence of Heterogeneous Federated Learning with Arbitrary Adaptive Online Model Pruning","date":"2022-01-27","arxiv_id":"2201.11803","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-machine-common-sense-via-cloze","title":"Evaluating Machine Common Sense via Cloze Testing","date":"2022-01-19","arxiv_id":"2201.07902","repositories_listed":0,"syntology":null},{"url":null,"slug":"evidentiality-guided-generation-for-knowledge-1","title":"Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-the-ability-of-language-models-to","title":"Testing the Ability of Language Models to Interpret Figurative Language","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/leveraging-scale-invariance-and-uncertainity","slug":"leveraging-scale-invariance-and-uncertainity","title":"FogAdapt: Self-Supervised Domain Adaptation for Semantic Segmentation of Foggy Images","date":"2022-01-07","arxiv_id":"2201.02588","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-online-learning-with-bounded-loss","title":"Universal Online Learning with Bounded Loss: Reduction to Binary Classification","date":"2021-12-29","arxiv_id":"2112.14638","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-impact-of-virtualization-on-the","title":"Exploring the Impact of Virtualization on the Usability of the Deep Learning Applications","date":"2021-12-17","arxiv_id":"2112.09780","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dynamical-model-for-the-origin-of-anisogamy","title":"A Dynamical Model for the Origin of Anisogamy","date":"2021-12-16","arxiv_id":"2112.09244","repositories_listed":0,"syntology":null},{"url":null,"slug":"does-pre-training-induce-systematic-inference","title":"Does Pre-training Induce Systematic Inference? How Masked Language Models Acquire Commonsense Knowledge","date":"2021-12-16","arxiv_id":"2112.08583","repositories_listed":0,"syntology":null},{"url":null,"slug":"explanation-as-question-answering-based-on","title":"Explanation as Question Answering based on Design Knowledge","date":"2021-12-16","arxiv_id":"2112.09616","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-structure-in-silence-the-role-of","title":"Finding Structure in Silence: The Role of Pauses in Aligning Speaker Expectations","date":"2021-12-15","arxiv_id":"2112.08126","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-armed-bandits-with-bounded-arm-memory","title":"Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-practical-consistency-of-meta","title":"On the Practical Consistency of Meta-Reinforcement Learning Algorithms","date":"2021-12-01","arxiv_id":"2112.00478","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-value-of-infinite-gradients-in","title":"On the Value of Infinite Gradients in Variational Autoencoder Models","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-stochastic-and-online-gradient-descent","title":"Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-complexity-of-normalizing","title":"Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes","date":"2021-11-28","arxiv_id":"2111.14148","repositories_listed":0,"syntology":null}],"record_sha256":"20cf33703cfa7b0e04ddf22b67fa418e179007fb0ea084134a5fb25496629176","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}