{"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/informativeness/papers/3","list_of":"/task/informativeness","task":"Informativeness","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":3,"pages_in_order":8,"rows_per_page":100,"rows":[201,300],"of":735,"counts":{"archive_papers_tagged":735,"with_a_code_link":266,"where_syntology_ran_a_sample":58,"not_listed_spam_title":0,"listed":735,"listed_where_code_ran":58,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":46,"every_run_a_failure_of_syntologys_instrument":12,"listed_with_a_run_with_no_instrument_failure":46,"listed_every_run_a_failure_of_syntologys_instrument":12,"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/informativeness","prev":"/task/informativeness/papers/2","next":"/task/informativeness/papers/4","papers":[{"url":"/paper/sumpubmed-summarization-dataset-of-pubmed","slug":"sumpubmed-summarization-dataset-of-pubmed","title":"SumPubMed: Summarization Dataset of PubMed Scientific Articles","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/can-less-be-more-when-increasing-to-balancing","slug":"can-less-be-more-when-increasing-to-balancing","title":"Can Less be More? When Increasing-to-Balancing Label Noise Rates Considered Beneficial","date":"2021-07-13","arxiv_id":"2107.05913","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/can-less-be-more-when-increasing-to-balancing#ran","syntology_url":"https://syntology.ai/paper/2107.05913","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05913"}},"official":{"repos":["ucsc-real/canlessbemore"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/orthonormal-product-quantization-network-for","slug":"orthonormal-product-quantization-network-for","title":"Orthonormal Product Quantization Network for Scalable Face Image Retrieval","date":"2021-07-01","arxiv_id":"2107.00327","repositories_listed":1,"syntology":null},{"url":"/paper/generating-informative-conclusions-for","slug":"generating-informative-conclusions-for","title":"Generating Informative Conclusions for Argumentative Texts","date":"2021-06-02","arxiv_id":"2106.01064","repositories_listed":1,"syntology":null},{"url":"/paper/near-optimal-multi-perturbation-experimental","slug":"near-optimal-multi-perturbation-experimental","title":"Near-Optimal Multi-Perturbation Experimental Design for Causal Structure Learning","date":"2021-05-28","arxiv_id":"2105.14024","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/near-optimal-multi-perturbation-experimental#ran","syntology_url":"https://syntology.ai/paper/2105.14024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14024"}},"official":{"repos":["ssethz/multi-perturbation-ed"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cost-accuracy-aware-adaptive-labeling-for","slug":"cost-accuracy-aware-adaptive-labeling-for","title":"Cost-Accuracy Aware Adaptive Labeling for Active Learning","date":"2021-05-24","arxiv_id":"2105.11418","repositories_listed":1,"syntology":null},{"url":"/paper/lada-look-ahead-data-acquisition-via-1","slug":"lada-look-ahead-data-acquisition-via-1","title":"LADA: Look-Ahead Data Acquisition via Augmentation for Deep Active Learning","date":"2021-05-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/meta-evaluation-of-conversational-search","slug":"meta-evaluation-of-conversational-search","title":"Meta-evaluation of Conversational Search Evaluation Metrics","date":"2021-04-27","arxiv_id":"2104.13453","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-annotation-protocol-to","slug":"uncertainty-aware-annotation-protocol-to","title":"Uncertainty-Aware Annotation Protocol to Evaluate Deformable Registration Algorithms","date":"2021-04-02","arxiv_id":"2104.01217","repositories_listed":1,"syntology":null},{"url":"/paper/generating-weather-comments-from","slug":"generating-weather-comments-from","title":"Generating Weather Comments from Meteorological Simulations","date":"2021-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-for-deep-object-detection-via","slug":"active-learning-for-deep-object-detection-via","title":"Active Learning for Deep Object Detection via Probabilistic Modeling","date":"2021-03-30","arxiv_id":"2103.16130","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":0,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 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; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/active-learning-for-deep-object-detection-via#ran","syntology_url":"https://syntology.ai/paper/2103.16130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16130"}},"official":{"repos":["nvlabs/al-mdn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-task-oriented-communication-for-edge","slug":"learning-task-oriented-communication-for-edge","title":"Learning Task-Oriented Communication for Edge Inference: An Information Bottleneck Approach","date":"2021-02-08","arxiv_id":"2102.04170","repositories_listed":1,"syntology":null},{"url":"/paper/disambiguatory-signals-are-stronger-in-word","slug":"disambiguatory-signals-are-stronger-in-word","title":"Disambiguatory Signals are Stronger in Word-initial Positions","date":"2021-02-03","arxiv_id":"2102.02183","repositories_listed":1,"syntology":null},{"url":"/paper/belief-based-generation-of-argumentative","slug":"belief-based-generation-of-argumentative","title":"Belief-based Generation of Argumentative Claims","date":"2021-01-24","arxiv_id":"2101.09765","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-attentional-pooling-cap-for","slug":"context-aware-attentional-pooling-cap-for","title":"Context-aware Attentional Pooling (CAP) for Fine-grained Visual Classification","date":"2021-01-17","arxiv_id":"2101.06635","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/context-aware-attentional-pooling-cap-for#ran","syntology_url":"https://syntology.ai/paper/2101.06635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.06635"}},"official":null}},{"url":"/paper/estimating-informativeness-of-samples-with-1","slug":"estimating-informativeness-of-samples-with-1","title":"Estimating informativeness of samples with Smooth Unique Information","date":"2021-01-17","arxiv_id":"2101.06640","repositories_listed":1,"syntology":null},{"url":"/paper/computation-efficient-knowledge-distillation","slug":"computation-efficient-knowledge-distillation","title":"Computation-Efficient Knowledge Distillation via Uncertainty-Aware Mixup","date":"2020-12-17","arxiv_id":"2012.09413","repositories_listed":1,"syntology":null},{"url":"/paper/active-machine-learning-for-spatio-temporal","slug":"active-machine-learning-for-spatio-temporal","title":"Enhanced spatio-temporal electric load forecasts using less data with active deep learning","date":"2020-12-08","arxiv_id":"2012.04407","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-guided-image-captioning","slug":"understanding-guided-image-captioning","title":"Understanding Guided Image Captioning Performance across Domains","date":"2020-12-04","arxiv_id":"2012.02339","repositories_listed":1,"syntology":null},{"url":"/paper/controllable-abstractive-sentence","slug":"controllable-abstractive-sentence","title":"Controllable Abstractive Sentence Summarization with Guiding Entities","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exemplary-natural-images-explain-cnn-1","slug":"exemplary-natural-images-explain-cnn-1","title":"Exemplary Natural Images Explain CNN Activations Better than State-of-the-Art Feature Visualization","date":"2020-10-23","arxiv_id":"2010.12606","repositories_listed":1,"syntology":null},{"url":"/paper/local-knowledge-powered-conversational-agents","slug":"local-knowledge-powered-conversational-agents","title":"Local Knowledge Powered Conversational Agents","date":"2020-10-20","arxiv_id":"2010.10150","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-reference-free-summary-quality","slug":"unsupervised-reference-free-summary-quality","title":"Unsupervised Reference-Free Summary Quality Evaluation via Contrastive Learning","date":"2020-10-05","arxiv_id":"2010.01781","repositories_listed":1,"syntology":null},{"url":"/paper/focus-constrained-attention-mechanism-for","slug":"focus-constrained-attention-mechanism-for","title":"Focus-Constrained Attention Mechanism for CVAE-based Response Generation","date":"2020-09-25","arxiv_id":"2009.12102","repositories_listed":1,"syntology":null},{"url":"/paper/task-specific-objectives-of-pre-trained","slug":"task-specific-objectives-of-pre-trained","title":"Dialogue-adaptive Language Model Pre-training From Quality Estimation","date":"2020-09-10","arxiv_id":"2009.04984","repositories_listed":1,"syntology":null},{"url":"/paper/exploit-camera-raw-data-for-video-super","slug":"exploit-camera-raw-data-for-video-super","title":"Exploit Camera Raw Data for Video Super-Resolution via Hidden Markov Model Inference","date":"2020-08-24","arxiv_id":"2008.10710","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-of-social-media-messages-for","slug":"clustering-of-social-media-messages-for","title":"Clustering of Social Media Messages for Humanitarian Aid Response during Crisis","date":"2020-07-23","arxiv_id":"2007.11756","repositories_listed":1,"syntology":null},{"url":"/paper/deep-active-learning-via-open-set-recognition","slug":"deep-active-learning-via-open-set-recognition","title":"Deep Active Learning via Open Set Recognition","date":"2020-07-04","arxiv_id":"2007.02196","repositories_listed":1,"syntology":null},{"url":"/paper/batch-decorrelation-for-active-metric","slug":"batch-decorrelation-for-active-metric","title":"Batch Decorrelation for Active Metric Learning","date":"2020-05-20","arxiv_id":"2005.10008","repositories_listed":1,"syntology":null},{"url":"/paper/incentive-compatible-critical-values","slug":"incentive-compatible-critical-values","title":"Critical Values Robust to P-hacking","date":"2020-05-08","arxiv_id":"2005.04141","repositories_listed":1,"syntology":null},{"url":"/paper/a-controllable-model-of-grounded-response","slug":"a-controllable-model-of-grounded-response","title":"A Controllable Model of Grounded Response Generation","date":"2020-05-01","arxiv_id":"2005.00613","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-learning-for-abstractive-multi","slug":"few-shot-learning-for-abstractive-multi","title":"Few-Shot Learning for Opinion Summarization","date":"2020-04-30","arxiv_id":"2004.14884","repositories_listed":1,"syntology":null},{"url":"/paper/stay-hungry-stay-focused-generating","slug":"stay-hungry-stay-focused-generating","title":"Stay Hungry, Stay Focused: Generating Informative and Specific Questions in Information-Seeking Conversations","date":"2020-04-30","arxiv_id":"2004.14530","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-social-media-data-using","slug":"analysis-of-social-media-data-using","title":"Analysis of Social Media Data using Multimodal Deep Learning for Disaster Response","date":"2020-04-14","arxiv_id":"2004.11838","repositories_listed":1,"syntology":null},{"url":"/paper/a-theory-of-usable-information-under-1","slug":"a-theory-of-usable-information-under-1","title":"A Theory of Usable Information Under Computational Constraints","date":"2020-02-25","arxiv_id":"2002.10689","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/a-theory-of-usable-information-under-1#ran","syntology_url":"https://syntology.ai/paper/2002.10689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10689"}},"official":null}},{"url":"/paper/distributional-sliced-wasserstein-and","slug":"distributional-sliced-wasserstein-and","title":"Distributional Sliced-Wasserstein and Applications to Generative Modeling","date":"2020-02-18","arxiv_id":"2002.07367","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distributional-sliced-wasserstein-and#ran","syntology_url":"https://syntology.ai/paper/2002.07367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07367"}},"official":{"repos":["VinAIResearch/DSW"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretable-and-fair-comparison-of-link","slug":"interpretable-and-fair-comparison-of-link","title":"On the Ambiguity of Rank-Based Evaluation of Entity Alignment or Link Prediction Methods","date":"2020-02-17","arxiv_id":"2002.06914","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/interpretable-and-fair-comparison-of-link#ran","syntology_url":"https://syntology.ai/paper/2002.06914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06914"}},"official":{"repos":["mberr/rank-based-evaluation"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/syntactically-look-ahead-attention-network","slug":"syntactically-look-ahead-attention-network","title":"Syntactically Look-Ahead Attention Network for Sentence Compression","date":"2020-02-04","arxiv_id":"2002.01145","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-pool-based-active-learning-for","slug":"unsupervised-pool-based-active-learning-for","title":"Unsupervised Pool-Based Active Learning for Linear Regression","date":"2020-01-14","arxiv_id":"2001.05028","repositories_listed":1,"syntology":null},{"url":"/paper/mining-unfollow-behavior-in-large-scale","slug":"mining-unfollow-behavior-in-large-scale","title":"Mining Unfollow Behavior in Large-Scale Online Social Networks via Spatial-Temporal Interaction","date":"2019-11-17","arxiv_id":"1911.07156","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-make-latent-factors-interpretable-by","slug":"how-to-make-latent-factors-interpretable-by","title":"How to make latent factors interpretable by feeding Factorization machines with knowledge graphs","date":"2019-09-11","arxiv_id":"1909.05038","repositories_listed":1,"syntology":null},{"url":"/paper/an-active-learning-approach-for-reducing","slug":"an-active-learning-approach-for-reducing","title":"An Active Learning Approach for Reducing Annotation Cost in Skin Lesion Analysis","date":"2019-09-05","arxiv_id":"1909.02344","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-domain-adaptation-for-neural","slug":"incremental-domain-adaptation-for-neural","title":"Incremental Domain Adaptation for Neural Machine Translation in Low-Resource Settings","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mindful-active-learning","slug":"mindful-active-learning","title":"Mindful Active Learning","date":"2019-07-28","arxiv_id":"1907.12003","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-abstract-for-memory-augmented","slug":"learning-to-abstract-for-memory-augmented","title":"Learning to Abstract for Memory-augmented Conversational Response Generation","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-incremental-learning-of-word","slug":"towards-incremental-learning-of-word","title":"Towards Incremental Learning of Word Embeddings Using Context Informativeness","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/submodular-batch-selection-for-training-deep","slug":"submodular-batch-selection-for-training-deep","title":"Submodular Batch Selection for Training Deep Neural Networks","date":"2019-06-20","arxiv_id":"1906.08771","repositories_listed":1,"syntology":null},{"url":"/paper/conversing-by-reading-contentful-neural","slug":"conversing-by-reading-contentful-neural","title":"Conversing by Reading: Contentful Neural Conversation with On-demand Machine Reading","date":"2019-06-06","arxiv_id":"1906.02738","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/conversing-by-reading-contentful-neural#ran","syntology_url":"https://syntology.ai/paper/1906.02738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02738"}},"official":{"repos":["qkaren/converse_reading_cmr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190600549","slug":"190600549","title":"Know More about Each Other: Evolving Dialogue Strategy via Compound Assessment","date":"2019-06-03","arxiv_id":"1906.00549","repositories_listed":1,"syntology":null},{"url":"/paper/linguistically-informed-specificity-and","slug":"linguistically-informed-specificity-and","title":"Linguistically-Informed Specificity and Semantic Plausibility for Dialogue Generation","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/when-redundancy-is-rational-a-bayesian","slug":"when-redundancy-is-rational-a-bayesian","title":"When redundancy is useful: A Bayesian approach to 'overinformative' referring expressions","date":"2019-03-19","arxiv_id":"1903.08237","repositories_listed":1,"syntology":null},{"url":"/paper/gcn-lase-towards-adequately-incorporating","slug":"gcn-lase-towards-adequately-incorporating","title":"GCN-LASE: Towards Adequately Incorporating Link Attributes in Graph Convolutional Networks","date":"2019-02-26","arxiv_id":"1902.09817","repositories_listed":1,"syntology":null},{"url":"/paper/lipschitz-generative-adversarial-nets","slug":"lipschitz-generative-adversarial-nets","title":"Lipschitz Generative Adversarial Nets","date":"2019-02-15","arxiv_id":"1902.05687","repositories_listed":1,"syntology":null},{"url":"/paper/informative-object-annotations-tell-me","slug":"informative-object-annotations-tell-me","title":"Informative Object Annotations: Tell Me Something I Don't Know","date":"2018-12-26","arxiv_id":"1812.10358","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-feature-acquisition-using-denoising","slug":"dynamic-feature-acquisition-using-denoising","title":"Dynamic Feature Acquisition Using Denoising Autoencoders","date":"2018-11-03","arxiv_id":"1811.01249","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/dynamic-feature-acquisition-using-denoising#ran","syntology_url":"https://syntology.ai/paper/1811.01249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.01249"}},"official":null}},{"url":"/paper/skeleton-to-response-dialogue-generation","slug":"skeleton-to-response-dialogue-generation","title":"Skeleton-to-Response: Dialogue Generation Guided by Retrieval Memory","date":"2018-09-14","arxiv_id":"1809.05296","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/skeleton-to-response-dialogue-generation#ran","syntology_url":"https://syntology.ai/paper/1809.05296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.05296"}},"official":{"repos":["jcyk/skeleton-to-response"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/active-inverse-reward-design","slug":"active-inverse-reward-design","title":"Active Inverse Reward Design","date":"2018-09-09","arxiv_id":"1809.03060","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/active-inverse-reward-design#ran","syntology_url":"https://syntology.ai/paper/1809.03060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03060"}},"official":null}},{"url":"/paper/document-modeling-with-external-attention-for","slug":"document-modeling-with-external-attention-for","title":"Document Modeling with External Attention for Sentence Extraction","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/inducing-temporal-relations-from-time-anchor","slug":"inducing-temporal-relations-from-time-anchor","title":"Inducing Temporal Relations from Time Anchor Annotation","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pool-based-sequential-active-learning-for","slug":"pool-based-sequential-active-learning-for","title":"Pool-Based Sequential Active Learning for Regression","date":"2018-05-12","arxiv_id":"1805.04735","repositories_listed":1,"syntology":null},{"url":"/paper/helping-crisis-responders-find-the","slug":"helping-crisis-responders-find-the","title":"Helping Crisis Responders Find the Informative Needle in the Tweet Haystack","date":"2018-01-29","arxiv_id":"1801.09633","repositories_listed":1,"syntology":null},{"url":"/paper/question-asking-as-program-generation","slug":"question-asking-as-program-generation","title":"Question Asking as Program Generation","date":"2017-11-16","arxiv_id":"1711.06351","repositories_listed":1,"syntology":null},{"url":"/paper/a-variance-maximization-criterion-for-active","slug":"a-variance-maximization-criterion-for-active","title":"A Variance Maximization Criterion for Active Learning","date":"2017-06-23","arxiv_id":"1706.07642","repositories_listed":1,"syntology":null},{"url":"/paper/best-of-both-worlds-transferring-knowledge","slug":"best-of-both-worlds-transferring-knowledge","title":"Best of Both Worlds: Transferring Knowledge from Discriminative Learning to a Generative Visual Dialog Model","date":"2017-06-05","arxiv_id":"1706.01554","repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-from-positive-and-unlabeled","slug":"active-learning-from-positive-and-unlabeled","title":"Active Learning from Positive and Unlabeled Data","date":"2016-02-24","arxiv_id":"1602.07495","repositories_listed":1,"syntology":null},{"url":"/paper/squinky-a-corpus-of-sentence-level-formality","slug":"squinky-a-corpus-of-sentence-level-formality","title":"SQUINKY! A Corpus of Sentence-level Formality, Informativeness, and Implicature","date":"2015-06-07","arxiv_id":"1506.02306","repositories_listed":1,"syntology":null},{"url":null,"slug":"multi-agent-retrieval-augmented-framework-for","title":"Multi-Agent Retrieval-Augmented Framework for Evidence-Based Counterspeech Against Health Misinformation","date":"2025-07-09","arxiv_id":"2507.07307","repositories_listed":0,"syntology":null},{"url":null,"slug":"lumicrs-asymmetric-contrastive-prototype","title":"LumiCRS: Asymmetric Contrastive Prototype Learning for Long-Tail Conversational Movie Recommendation","date":"2025-07-07","arxiv_id":"2507.04722","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-bandwidth-allocation-for-hybrid-event","title":"Dynamic Bandwidth Allocation for Hybrid Event-RGB Transmission","date":"2025-06-25","arxiv_id":"2506.20222","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-reconstruction-as-a-tool-for-feature","title":"Image Reconstruction as a Tool for Feature Analysis","date":"2025-06-09","arxiv_id":"2506.07803","repositories_listed":0,"syntology":null},{"url":null,"slug":"assumption-free-stability-for-ranking","title":"Assumption-free stability for ranking problems","date":"2025-06-02","arxiv_id":"2506.02257","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-the-impact-of-word","title":"Investigating the Impact of Word Informativeness on Speech Emotion Recognition","date":"2025-06-02","arxiv_id":"2506.02239","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-while-exploring-semantics","title":"Understanding while Exploring: Semantics-driven Active Mapping","date":"2025-05-30","arxiv_id":"2506.00225","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-homophily-aware-graph-neural-network","title":"Directed Homophily-Aware Graph Neural Network","date":"2025-05-28","arxiv_id":"2505.22362","repositories_listed":0,"syntology":null},{"url":null,"slug":"limits-of-disclosure-in-search-markets","title":"Limits of Disclosure in Search Markets","date":"2025-05-28","arxiv_id":"2506.06319","repositories_listed":0,"syntology":null},{"url":null,"slug":"oasis-online-sample-selection-for-continual","title":"OASIS: Online Sample Selection for Continual Visual Instruction Tuning","date":"2025-05-27","arxiv_id":"2506.02011","repositories_listed":0,"syntology":null},{"url":null,"slug":"cidre-a-reference-free-multi-aspect-criterion","title":"CIDRe: A Reference-Free Multi-Aspect Criterion for Code Comment Quality Measurement","date":"2025-05-26","arxiv_id":"2505.19757","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-oriented-low-label-semantic","title":"Task-Oriented Low-Label Semantic Communication With Self-Supervised Learning","date":"2025-05-26","arxiv_id":"2505.19940","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-qualitative-investigation-into-llm","title":"A Qualitative Investigation into LLM-Generated Multilingual Code Comments and Automatic Evaluation Metrics","date":"2025-05-21","arxiv_id":"2505.15469","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaem-an-adaptively-and-automated-extensible","title":"AdAEM: An Adaptively and Automated Extensible Measurement of LLMs' Value Difference","date":"2025-05-18","arxiv_id":"2505.13531","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-11416","title":"MID-L: Matrix-Interpolated Dropout Layer with Layer-wise Neuron Selection","date":"2025-05-16","arxiv_id":"2505.11416","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-llm-generated-plain-language-summaries","title":"Are LLM-generated plain language summaries truly understandable? A large-scale crowdsourced evaluation","date":"2025-05-15","arxiv_id":"2505.10409","repositories_listed":0,"syntology":null},{"url":null,"slug":"moltextnet-a-two-million-molecule-text","title":"MolTextNet: A Two-Million Molecule-Text Dataset for Multimodal Molecular Learning","date":"2025-05-15","arxiv_id":"2506.00009","repositories_listed":0,"syntology":null},{"url":null,"slug":"emotion-gradient-metacognitive-rsi-part-i","title":"Emotion-Gradient Metacognitive RSI (Part I): Theoretical Foundations and Single-Agent Architecture","date":"2025-05-12","arxiv_id":"2505.07757","repositories_listed":0,"syntology":null},{"url":null,"slug":"gap-the-theory-of-mind-sharing-beliefs-about","title":"Gap the (Theory of) Mind: Sharing Beliefs About Teammates' Goals Boosts Collaboration Perception, Not Performance","date":"2025-05-06","arxiv_id":"2505.03674","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessing-the-potential-of-generative-agents","title":"Assessing the Potential of Generative Agents in Crowdsourced Fact-Checking","date":"2025-04-24","arxiv_id":"2504.19940","repositories_listed":0,"syntology":null},{"url":null,"slug":"chartqa-x-generating-explanations-for-charts","title":"ChartQA-X: Generating Explanations for Charts","date":"2025-04-17","arxiv_id":"2504.13275","repositories_listed":0,"syntology":null},{"url":null,"slug":"parsimonious-dataset-construction-for","title":"Parsimonious Dataset Construction for Laparoscopic Cholecystectomy Structure Segmentation","date":"2025-04-17","arxiv_id":"2504.12573","repositories_listed":0,"syntology":null},{"url":null,"slug":"gps-distilling-compact-memories-via-grid","title":"GPS: Distilling Compact Memories via Grid-based Patch Sampling for Efficient Online Class-Incremental Learning","date":"2025-04-14","arxiv_id":"2504.10409","repositories_listed":0,"syntology":null},{"url":null,"slug":"competitive-information-disclosure-with-1","title":"Competitive Information Disclosure with Heterogeneous Consumer Search","date":"2025-04-07","arxiv_id":"2504.04659","repositories_listed":0,"syntology":null},{"url":null,"slug":"explainability-of-ai-uncertainty-application","title":"Explaining Uncertainty in Multiple Sclerosis Lesion Segmentation Beyond Prediction Errors","date":"2025-04-07","arxiv_id":"2504.04814","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-complexity-and-informativeness-in","title":"Balancing Complexity and Informativeness in LLM-Based Clustering: Finding the Goldilocks Zone","date":"2025-04-06","arxiv_id":"2504.04314","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminating-bcc-subtypes-using-entropy-and","title":"Discriminating BCC Subtypes Using Entropy and Mutual Information from Dermoscopic Features","date":"2025-04-05","arxiv_id":"2504.04212","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-graph-out-of-distribution-detection","title":"Few-Shot Graph Out-of-Distribution Detection with LLMs","date":"2025-03-28","arxiv_id":"2503.22097","repositories_listed":0,"syntology":null},{"url":null,"slug":"constraint-based-causal-discovery-with-tiered","title":"Constraint-based causal discovery with tiered background knowledge and latent variables in single or overlapping datasets","date":"2025-03-27","arxiv_id":"2503.21526","repositories_listed":0,"syntology":null},{"url":null,"slug":"score-soft-label-compression-centric-dataset","title":"SCORE: Soft Label Compression-Centric Dataset Condensation via Coding Rate Optimization","date":"2025-03-18","arxiv_id":"2503.13935","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-speaker-aware-learning-for-multi","title":"Contrastive Speaker-Aware Learning for Multi-party Dialogue Generation with LLMs","date":"2025-03-11","arxiv_id":"2503.08842","repositories_listed":0,"syntology":null},{"url":null,"slug":"paying-and-persuading","title":"Paying and Persuading","date":"2025-03-08","arxiv_id":"2503.06007","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-crowdsourced-election-monitoring","title":"Scaling Crowdsourced Election Monitoring: Construction and Evaluation of Classification Models for Multilingual and Cross-Domain Classification Settings","date":"2025-03-05","arxiv_id":"2503.03582","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-powered-bayesian-inference","title":"AI-Powered Bayesian Inference","date":"2025-02-26","arxiv_id":"2502.19231","repositories_listed":0,"syntology":null}],"record_sha256":"a05a745755de09a195e6816282b77fe71a18849c62a56d6da4a9a749671f25cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}