{"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/set/papers/94","list_of":"/method/set","method":"SET","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":94,"pages_in_order":135,"rows_per_page":100,"rows":[9301,9400],"of":13419,"counts":{"archive_papers_tagged":13419,"with_a_code_link":4158,"where_syntology_ran_a_sample":1186,"not_listed_spam_title":0,"listed":13419,"listed_where_code_ran":1186,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1038,"every_run_a_failure_of_syntologys_instrument":148,"listed_with_a_run_with_no_instrument_failure":1038,"listed_every_run_a_failure_of_syntologys_instrument":148,"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/set","prev":"/method/set/papers/93","next":"/method/set/papers/95","papers":[{"paper":null,"slug":"cori-cjkv-benchmark-with-romanization","title":"CORI: CJKV Benchmark with Romanization Integration -- A step towards Cross-lingual Transfer Beyond Textual Scripts","date":"2024-04-19","arxiv_id":"2404.12618","n_code_links":0,"syntology":null},{"paper":"/paper/cyberseceval-2-a-wide-ranging-cybersecurity","slug":"cyberseceval-2-a-wide-ranging-cybersecurity","title":"CyberSecEval 2: A Wide-Ranging Cybersecurity Evaluation Suite for Large Language Models","date":"2024-04-19","arxiv_id":"2404.13161","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["facebookresearch/purplellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"decentralized-coordination-of-distributed","title":"Decentralized Coordination of Distributed Energy Resources through Local Energy Markets and Deep Reinforcement Learning","date":"2024-04-19","arxiv_id":"2404.13142","n_code_links":0,"syntology":null},{"paper":"/paper/dubo-sql-diverse-retrieval-augmented","slug":"dubo-sql-diverse-retrieval-augmented","title":"Dubo-SQL: Diverse Retrieval-Augmented Generation and Fine Tuning for Text-to-SQL","date":"2024-04-19","arxiv_id":"2404.12560","n_code_links":1,"syntology":null},{"paper":null,"slug":"enabling-natural-zero-shot-prompting-on","title":"Enabling Natural Zero-Shot Prompting on Encoder Models via Statement-Tuning","date":"2024-04-19","arxiv_id":"2404.12897","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-counterfactual-explanation-search","title":"Enhancing Counterfactual Explanation Search with Diffusion Distance and Directional Coherence","date":"2024-04-19","arxiv_id":"2404.12810","n_code_links":0,"syntology":null},{"paper":"/paper/generalized-few-shot-meets-remote-sensing","slug":"generalized-few-shot-meets-remote-sensing","title":"Generalized Few-Shot Meets Remote Sensing: Discovering Novel Classes in Land Cover Mapping via Hybrid Semantic Segmentation Framework","date":"2024-04-19","arxiv_id":"2404.12721","n_code_links":3,"syntology":null},{"paper":null,"slug":"generative-modelling-with-high-order-langevin","title":"Generative Modelling with High-Order Langevin Dynamics","date":"2024-04-19","arxiv_id":"2404.12814","n_code_links":0,"syntology":null},{"paper":"/paper/is-retain-set-all-you-need-in-machine","slug":"is-retain-set-all-you-need-in-machine","title":"Is Retain Set All You Need in Machine Unlearning? Restoring Performance of Unlearned Models with Out-Of-Distribution Images","date":"2024-04-19","arxiv_id":"2404.12922","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["jbonato1/scar"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/neural-semantic-parsing-with-extremely-rich","slug":"neural-semantic-parsing-with-extremely-rich","title":"Neural Semantic Parsing with Extremely Rich Symbolic Meaning Representations","date":"2024-04-19","arxiv_id":"2404.12698","n_code_links":1,"syntology":null},{"paper":"/paper/next-generation-loss-function-for-image","slug":"next-generation-loss-function-for-image","title":"Next Generation Loss Function for Image Classification","date":"2024-04-19","arxiv_id":"2404.12948","n_code_links":1,"syntology":null},{"paper":"/paper/optimizing-calibration-by-gaining-aware-of","slug":"optimizing-calibration-by-gaining-aware-of","title":"Optimizing Calibration by Gaining Aware of Prediction Correctness","date":"2024-04-19","arxiv_id":"2404.13016","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":7,"n_instrument":0,"unverified":0,"pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["liuyvchi/correctness-aware-calibration"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"relevant-or-random-can-llms-truly-perform","title":"Relevant or Random: Can LLMs Truly Perform Analogical Reasoning?","date":"2024-04-19","arxiv_id":"2404.12728","n_code_links":0,"syntology":null},{"paper":"/paper/robust-clip-based-detector-for-exposing","slug":"robust-clip-based-detector-for-exposing","title":"Robust CLIP-Based Detector for Exposing Diffusion Model-Generated Images","date":"2024-04-19","arxiv_id":"2404.12908","n_code_links":1,"syntology":null},{"paper":"/paper/stronger-random-baselines-for-in-context","slug":"stronger-random-baselines-for-in-context","title":"Stronger Random Baselines for In-Context Learning","date":"2024-04-19","arxiv_id":"2404.13020","n_code_links":2,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["gyauney/max-random-baseline","gyauney/stronger-random-baselines"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/towards-logically-consistent-language-models","slug":"towards-logically-consistent-language-models","title":"Towards Logically Consistent Language Models via Probabilistic Reasoning","date":"2024-04-19","arxiv_id":"2404.12843","n_code_links":0,"syntology":{"ran":14,"of":16,"n_ran_checked":13,"n_instrument":1,"unverified":2,"pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":"/paper/towards-reliable-latent-knowledge-estimation","slug":"towards-reliable-latent-knowledge-estimation","title":"Towards Reliable Latent Knowledge Estimation in LLMs: Zero-Prompt Many-Shot Based Factual Knowledge Extraction","date":"2024-04-19","arxiv_id":"2404.12957","n_code_links":1,"syntology":null},{"paper":null,"slug":"unified-scene-representation-and","title":"Unified Scene Representation and Reconstruction for 3D Large Language Models","date":"2024-04-19","arxiv_id":"2404.13044","n_code_links":0,"syntology":null},{"paper":null,"slug":"zadeh-s-type-2-fuzzy-logic-systems-precision","title":"Zadeh's Type-2 Fuzzy Logic Systems: Precision and High-Quality Prediction Intervals","date":"2024-04-19","arxiv_id":"2404.12800","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-new-reliable-parsimonious-learning-strategy","title":"A New Reliable & Parsimonious Learning Strategy Comprising Two Layers of Gaussian Processes, to Address Inhomogeneous Empirical Correlation Structures","date":"2024-04-18","arxiv_id":"2404.12478","n_code_links":0,"syntology":null},{"paper":"/paper/ambigdocs-reasoning-across-documents-on","slug":"ambigdocs-reasoning-across-documents-on","title":"AmbigDocs: Reasoning across Documents on Different Entities under the Same Name","date":"2024-04-18","arxiv_id":"2404.12447","n_code_links":1,"syntology":null},{"paper":null,"slug":"automated-similarity-metric-generation-for","title":"Automated Similarity Metric Generation for Recommendation","date":"2024-04-18","arxiv_id":"2404.11818","n_code_links":0,"syntology":null},{"paper":null,"slug":"constituents-correspond-to-word-sequence","title":"Unsupervised Parsing by Searching for Frequent Word Sequences among Sentences with Equivalent Predicate-Argument Structures","date":"2024-04-18","arxiv_id":"2404.12059","n_code_links":0,"syntology":null},{"paper":null,"slug":"contract-scheduling-with-distributional-and","title":"Contract Scheduling with Distributional and Multiple Advice","date":"2024-04-18","arxiv_id":"2404.12485","n_code_links":0,"syntology":null},{"paper":null,"slug":"deconstructing-human-ai-collaboration-agency","title":"Deconstructing Human-AI Collaboration: Agency, Interaction, and Adaptation","date":"2024-04-18","arxiv_id":"2404.12056","n_code_links":0,"syntology":null},{"paper":null,"slug":"doughnet-a-visual-predictive-model-for","title":"DoughNet: A Visual Predictive Model for Topological Manipulation of Deformable Objects","date":"2024-04-18","arxiv_id":"2404.12524","n_code_links":0,"syntology":null},{"paper":null,"slug":"floz-evidence-estimation-from-posterior","title":"Bayesian evidence estimation from posterior samples with normalizing flows","date":"2024-04-18","arxiv_id":"2404.12294","n_code_links":0,"syntology":null},{"paper":"/paper/freediff-progressive-frequency-truncation-for","slug":"freediff-progressive-frequency-truncation-for","title":"FreeDiff: Progressive Frequency Truncation for Image Editing with Diffusion Models","date":"2024-04-18","arxiv_id":"2404.11895","n_code_links":1,"syntology":null},{"paper":null,"slug":"generalizing-machine-learning-evaluation","title":"Generalizing Machine Learning Evaluation through the Integration of Shannon Entropy and Rough Set Theory","date":"2024-04-18","arxiv_id":"2404.12511","n_code_links":0,"syntology":null},{"paper":"/paper/generating-diverse-criteria-on-the-fly-to","slug":"generating-diverse-criteria-on-the-fly-to","title":"MCRanker: Generating Diverse Criteria On-the-Fly to Improve Point-wise LLM Rankers","date":"2024-04-18","arxiv_id":"2404.11960","n_code_links":1,"syntology":null},{"paper":"/paper/information-theory-unifies-atomistic-machine","slug":"information-theory-unifies-atomistic-machine","title":"Model-free quantification of completeness, uncertainties, and outliers in atomistic machine learning using information theory","date":"2024-04-18","arxiv_id":"2404.12367","n_code_links":1,"syntology":null},{"paper":"/paper/introducing-v0-5-of-the-ai-safety-benchmark","slug":"introducing-v0-5-of-the-ai-safety-benchmark","title":"Introducing v0.5 of the AI Safety Benchmark from MLCommons","date":"2024-04-18","arxiv_id":"2404.12241","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"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) · 0 unverified","official":{"repos":["mlcommons/modelbench"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"investigating-guiding-information-for","title":"Investigating Guiding Information for Adaptive Collocation Point Sampling in PINNs","date":"2024-04-18","arxiv_id":"2404.12282","n_code_links":0,"syntology":null},{"paper":null,"slug":"kdk-a-defense-mechanism-against-label","title":"KDk: A Defense Mechanism Against Label Inference Attacks in Vertical Federated Learning","date":"2024-04-18","arxiv_id":"2404.12369","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-the-domain-specific-inverse-nufft","title":"Learning the Domain Specific Inverse NUFFT for Accelerated Spiral MRI using Diffusion Models","date":"2024-04-18","arxiv_id":"2404.12361","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-content-bias-in-frechet-video-distance","slug":"on-the-content-bias-in-frechet-video-distance","title":"On the Content Bias in Fréchet Video Distance","date":"2024-04-18","arxiv_id":"2404.12391","n_code_links":1,"syntology":{"ran":16,"of":21,"n_ran_checked":9,"n_instrument":7,"unverified":5,"pointer_only":7,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 2 violated, 7 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":null,"slug":"parafusion-a-large-scale-llm-driven-english","title":"ParaFusion: A Large-Scale LLM-Driven English Paraphrase Dataset Infused with High-Quality Lexical and Syntactic Diversity","date":"2024-04-18","arxiv_id":"2404.12010","n_code_links":0,"syntology":null},{"paper":null,"slug":"practical-considerations-for-discrete-time","title":"Practical Considerations for Discrete-Time Implementations of Continuous-Time Control Barrier Function-Based Safety Filters","date":"2024-04-18","arxiv_id":"2404.12329","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantifying-aleatoric-and-epistemic-2","title":"Quantifying Aleatoric and Epistemic Uncertainty with Proper Scoring Rules","date":"2024-04-18","arxiv_id":"2404.12215","n_code_links":0,"syntology":null},{"paper":null,"slug":"redefining-the-shortest-path-problem","title":"Redefining the Shortest Path Problem Formulation of the Linear Non-Gaussian Acyclic Model: Pairwise Likelihood Ratios, Prior Knowledge, and Path Enumeration","date":"2024-04-18","arxiv_id":"2404.11922","n_code_links":0,"syntology":null},{"paper":null,"slug":"reka-core-flash-and-edge-a-series-of-powerful","title":"Reka Core, Flash, and Edge: A Series of Powerful Multimodal Language Models","date":"2024-04-18","arxiv_id":"2404.12387","n_code_links":0,"syntology":null},{"paper":null,"slug":"sequential-compositional-generalization-in","title":"Sequential Compositional Generalization in Multimodal Models","date":"2024-04-18","arxiv_id":"2404.12013","n_code_links":0,"syntology":null},{"paper":null,"slug":"singular-limit-analysis-of-gradient-descent","title":"Singular-limit analysis of gradient descent with noise injection","date":"2024-04-18","arxiv_id":"2404.12293","n_code_links":0,"syntology":null},{"paper":null,"slug":"what-does-clip-know-about-peeling-a-banana","title":"What does CLIP know about peeling a banana?","date":"2024-04-18","arxiv_id":"2404.12015","n_code_links":0,"syntology":null},{"paper":"/paper/a-learning-to-rank-formulation-of-clustering","slug":"a-learning-to-rank-formulation-of-clustering","title":"A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search","date":"2024-04-17","arxiv_id":"2404.11731","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":7,"n_instrument":0,"unverified":1,"pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["tomvek/mips-learnt-ivf"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"achieving-rotation-invariance-in-convolution","title":"Achieving Rotation Invariance in Convolution Operations: Shifting from Data-Driven to Mechanism-Assured","date":"2024-04-17","arxiv_id":"2404.11309","n_code_links":0,"syntology":null},{"paper":"/paper/advancing-social-intelligence-in-ai-agents","slug":"advancing-social-intelligence-in-ai-agents","title":"Advancing Social Intelligence in AI Agents: Technical Challenges and Open Questions","date":"2024-04-17","arxiv_id":"2404.11023","n_code_links":1,"syntology":null},{"paper":null,"slug":"classifying-sums-of-exponentially-damped","title":"Classifying Sums of Exponentially Damped Sinusoids Using an Associated Numerical Range","date":"2024-04-17","arxiv_id":"2404.11413","n_code_links":0,"syntology":null},{"paper":"/paper/comparative-analysis-of-deep-natural-networks","slug":"comparative-analysis-of-deep-natural-networks","title":"Comparative Analysis of Deep Natural Networks and Large Language Models for Aspect-Based Sentiment Analysis","date":"2024-04-17","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"control-theoretic-approach-to-fine-tuning-and","title":"Control Theoretic Approach to Fine-Tuning and Transfer Learning","date":"2024-04-17","arxiv_id":"2404.11013","n_code_links":0,"syntology":null},{"paper":"/paper/exploring-key-point-analysis-with-pairwise","slug":"exploring-key-point-analysis-with-pairwise","title":"Exploring Key Point Analysis with Pairwise Generation and Graph Partitioning","date":"2024-04-17","arxiv_id":"2404.11384","n_code_links":1,"syntology":{"ran":8,"of":13,"n_ran_checked":1,"n_instrument":7,"unverified":5,"pointer_only":13,"phrase":"8 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; 7 where Syntology's instrument failed) · 5 unverified","official":{"repos":["alibaba-nlp/key-point-analysis"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"factorized-motion-fields-for-fast-sparse","title":"Factorized Motion Fields for Fast Sparse Input Dynamic View Synthesis","date":"2024-04-17","arxiv_id":"2404.11669","n_code_links":0,"syntology":null},{"paper":null,"slug":"infusion-inpainting-3d-gaussians-via-learning","title":"InFusion: Inpainting 3D Gaussians via Learning Depth Completion from Diffusion Prior","date":"2024-04-17","arxiv_id":"2404.11613","n_code_links":0,"syntology":null},{"paper":null,"slug":"kathakali-hand-gesture-recognition-with","title":"Pose2Gest: A Few-Shot Model-Free Approach Applied In South Indian Classical Dance Gesture Recognition","date":"2024-04-17","arxiv_id":"2404.11205","n_code_links":0,"syntology":null},{"paper":"/paper/mushroom-segmentation-and-3d-pose-estimation","slug":"mushroom-segmentation-and-3d-pose-estimation","title":"Mushroom Segmentation and 3D Pose Estimation from Point Clouds using Fully Convolutional Geometric Features and Implicit Pose Encoding","date":"2024-04-17","arxiv_id":"2404.12144","n_code_links":1,"syntology":null},{"paper":"/paper/pack-of-llms-model-fusion-at-test-time-via","slug":"pack-of-llms-model-fusion-at-test-time-via","title":"Pack of LLMs: Model Fusion at Test-Time via Perplexity Optimization","date":"2024-04-17","arxiv_id":"2404.11531","n_code_links":1,"syntology":{"ran":6,"of":10,"n_ran_checked":5,"n_instrument":1,"unverified":4,"pointer_only":10,"phrase":"6 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; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["cmavro/packllm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"partial-identification-of-heteroskedastic","title":"Partial Identification of Heteroskedastic Structural VARs: Theory and Bayesian Inference","date":"2024-04-17","arxiv_id":"2404.11057","n_code_links":0,"syntology":null},{"paper":null,"slug":"pre-processing-matters-a-segment-search","title":"BAHOP: Similarity-based Basin Hopping for A fast hyper-parameter search in WSI classification","date":"2024-04-17","arxiv_id":"2404.11161","n_code_links":0,"syntology":null},{"paper":null,"slug":"predicting-long-horizon-futures-by","title":"Predicting Long-horizon Futures by Conditioning on Geometry and Time","date":"2024-04-17","arxiv_id":"2404.11554","n_code_links":0,"syntology":null},{"paper":"/paper/procedural-dilemma-generation-for-evaluating","slug":"procedural-dilemma-generation-for-evaluating","title":"Procedural Dilemma Generation for Evaluating Moral Reasoning in Humans and Language Models","date":"2024-04-17","arxiv_id":"2404.10975","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":5,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["cicl-stanford/moral-evals"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"runtime-analyses-of-nsga-iii-on-many","title":"Runtime Analyses of NSGA-III on Many-Objective Problems","date":"2024-04-17","arxiv_id":"2404.11433","n_code_links":0,"syntology":null},{"paper":null,"slug":"runtime-analysis-of-evolutionary-diversity","title":"Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem","date":"2024-04-17","arxiv_id":"2404.11496","n_code_links":0,"syntology":null},{"paper":"/paper/sure-summarizing-retrievals-using-answer","slug":"sure-summarizing-retrievals-using-answer","title":"SuRe: Summarizing Retrievals using Answer Candidates for Open-domain QA of LLMs","date":"2024-04-17","arxiv_id":"2404.13081","n_code_links":2,"syntology":{"ran":5,"of":5,"n_ran_checked":0,"n_instrument":5,"unverified":0,"pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","official":{"repos":["bbuing9/iclr24_sure"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"testing-mechanisms","title":"Testing Mechanisms","date":"2024-04-17","arxiv_id":"2404.11739","n_code_links":0,"syntology":null},{"paper":"/paper/tino-edit-timestep-and-noise-optimization-for","slug":"tino-edit-timestep-and-noise-optimization-for","title":"TiNO-Edit: Timestep and Noise Optimization for Robust Diffusion-Based Image Editing","date":"2024-04-17","arxiv_id":"2404.11120","n_code_links":1,"syntology":{"ran":8,"of":9,"n_ran_checked":8,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["sherryxtchen/tino-edit"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/towards-highly-realistic-artistic-style","slug":"towards-highly-realistic-artistic-style","title":"Towards Highly Realistic Artistic Style Transfer via Stable Diffusion with Step-aware and Layer-aware Prompt","date":"2024-04-17","arxiv_id":"2404.11474","n_code_links":1,"syntology":{"ran":10,"of":20,"n_ran_checked":6,"n_instrument":4,"unverified":10,"pointer_only":4,"phrase":"10 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 10 unverified","official":{"repos":["jamie-cheung/lsast"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":3,"n_ran_no_instrument_failure":6,"n_unverified":10,"ran_from_kinds":["official"]}}},{"paper":"/paper/unified-examination-of-entity-linking-in","slug":"unified-examination-of-entity-linking-in","title":"Unified Examination of Entity Linking in Absence of Candidate Sets","date":"2024-04-17","arxiv_id":"2404.11061","n_code_links":1,"syntology":null},{"paper":null,"slug":"vision-based-control-for-landing-an-aerial","title":"Vision-based control for landing an aerial vehicle on a marine vessel","date":"2024-04-17","arxiv_id":"2404.11336","n_code_links":0,"syntology":null},{"paper":"/paper/a-concise-tiling-strategy-for-preserving","slug":"a-concise-tiling-strategy-for-preserving","title":"A Concise Tiling Strategy for Preserving Spatial Context in Earth Observation Imagery","date":"2024-04-16","arxiv_id":"2404.10927","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["elliesch/flipnslide"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"anomaly-correction-of-business-processes","title":"Anomaly Correction of Business Processes Using Transformer Autoencoder","date":"2024-04-16","arxiv_id":"2404.10211","n_code_links":0,"syntology":null},{"paper":null,"slug":"automated-discovery-of-functional-actual","title":"Automated Discovery of Functional Actual Causes in Complex Environments","date":"2024-04-16","arxiv_id":"2404.10883","n_code_links":0,"syntology":null},{"paper":null,"slug":"circuit-theoretic-joint-parameter-state","title":"Circuit-theoretic Joint Parameter-State Estimation -- Balancing Optimality and AC Feasibility","date":"2024-04-16","arxiv_id":"2404.10676","n_code_links":0,"syntology":null},{"paper":null,"slug":"cross-language-evolution-of-divergent","title":"Cross-Language Evolution of Divergent Collective Memory Around the Arab Spring","date":"2024-04-16","arxiv_id":"2404.10706","n_code_links":0,"syntology":null},{"paper":"/paper/disentangling-instructive-information-from","slug":"disentangling-instructive-information-from","title":"Disentangling Instructive Information from Ranked Multiple Candidates for Multi-Document Scientific Summarization","date":"2024-04-16","arxiv_id":"2404.10416","n_code_links":1,"syntology":null},{"paper":"/paper/emc-2-efficient-mcmc-negative-sampling-for","slug":"emc-2-efficient-mcmc-negative-sampling-for","title":"EMC$^2$: Efficient MCMC Negative Sampling for Contrastive Learning with Global Convergence","date":"2024-04-16","arxiv_id":"2404.10575","n_code_links":1,"syntology":{"ran":11,"of":14,"n_ran_checked":11,"n_instrument":0,"unverified":3,"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) · 3 unverified","official":{"repos":["amazon-science/contrastive_emc2"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"from-a-lossless-1-5-1-compression-algorithm","title":"From a Lossless (~1.5:1) Compression Algorithm for Llama2 7B Weights to Variable Precision, Variable Range, Compressed Numeric Data Types for CNNs and LLMs","date":"2024-04-16","arxiv_id":"2404.10896","n_code_links":0,"syntology":null},{"paper":null,"slug":"gaitpoint-a-gait-recognition-network","title":"GaitPoint+: A Gait Recognition Network Incorporating Point Cloud Analysis and Recycling","date":"2024-04-16","arxiv_id":"2404.10213","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-text-steganography-with-large","title":"Generative Text Steganography with Large Language Model","date":"2024-04-16","arxiv_id":"2404.10229","n_code_links":0,"syntology":null},{"paper":"/paper/human-algorithm-collaborative-bayesian","slug":"human-algorithm-collaborative-bayesian","title":"Human-Algorithm Collaborative Bayesian Optimization for Engineering Systems","date":"2024-04-16","arxiv_id":"2404.10949","n_code_links":1,"syntology":null},{"paper":null,"slug":"intra-operative-tumour-margin-evaluation-in","title":"Intra-operative tumour margin evaluation in breast-conserving surgery with deep learning","date":"2024-04-16","arxiv_id":"2404.10600","n_code_links":0,"syntology":null},{"paper":null,"slug":"know-yourself-better-diverse-discriminative","title":"Know Yourself Better: Diverse Discriminative Feature Learning Improves Open Set Recognition","date":"2024-04-16","arxiv_id":"2404.10370","n_code_links":0,"syntology":null},{"paper":"/paper/learnable-prompt-for-few-shot-semantic","slug":"learnable-prompt-for-few-shot-semantic","title":"Learnable Prompt for Few-Shot Semantic Segmentation in Remote Sensing Domain","date":"2024-04-16","arxiv_id":"2404.10307","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-from-offline-and-online-experiences","title":"Learning from Offline and Online Experiences: A Hybrid Adaptive Operator Selection Framework","date":"2024-04-16","arxiv_id":"2404.10252","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-wireless-data-knowledge-graph-for","title":"Learning Wireless Data Knowledge Graph for Green Intelligent Communications: Methodology and Experiments","date":"2024-04-16","arxiv_id":"2404.10365","n_code_links":0,"syntology":null},{"paper":"/paper/llm-powered-test-case-generation-for","slug":"llm-powered-test-case-generation-for","title":"LLM-Powered Test Case Generation for Detecting Bugs in Plausible Programs","date":"2024-04-16","arxiv_id":"2404.10304","n_code_links":1,"syntology":null},{"paper":"/paper/n-agent-ad-hoc-teamwork","slug":"n-agent-ad-hoc-teamwork","title":"N-Agent Ad Hoc Teamwork","date":"2024-04-16","arxiv_id":"2404.10740","n_code_links":1,"syntology":{"ran":13,"of":18,"n_ran_checked":7,"n_instrument":6,"unverified":5,"pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 4 honoured, 0 violated, 3 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified","official":{"repos":["carolinewang01/naht"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/privacy-preserving-training-as-a-service-for","slug":"privacy-preserving-training-as-a-service-for","title":"Privacy-Enhanced Training-as-a-Service for On-Device Intelligence: Concept, Architectural Scheme, and Open Problems","date":"2024-04-16","arxiv_id":"2404.10255","n_code_links":1,"syntology":null},{"paper":null,"slug":"rapidvol-rapid-reconstruction-of-3d","title":"RapidVol: Rapid Reconstruction of 3D Ultrasound Volumes from Sensorless 2D Scans","date":"2024-04-16","arxiv_id":"2404.10766","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-noisy-label-learning-via-two-stream","title":"Robust Noisy Label Learning via Two-Stream Sample Distillation","date":"2024-04-16","arxiv_id":"2404.10499","n_code_links":0,"syntology":null},{"paper":null,"slug":"simplex-decomposition-for-portfolio","title":"Simplex Decomposition for Portfolio Allocation Constraints in Reinforcement Learning","date":"2024-04-16","arxiv_id":"2404.10683","n_code_links":0,"syntology":null},{"paper":"/paper/spvloc-semantic-panoramic-viewport-matching","slug":"spvloc-semantic-panoramic-viewport-matching","title":"SPVLoc: Semantic Panoramic Viewport Matching for 6D Camera Localization in Unseen Environments","date":"2024-04-16","arxiv_id":"2404.10527","n_code_links":1,"syntology":null},{"paper":"/paper/the-ninth-ntire-2024-efficient-super","slug":"the-ninth-ntire-2024-efficient-super","title":"The Ninth NTIRE 2024 Efficient Super-Resolution Challenge Report","date":"2024-04-16","arxiv_id":"2404.10343","n_code_links":3,"syntology":null},{"paper":null,"slug":"two-stage-stance-labeling-user-hashtag","title":"Two-Stage Stance Labeling: User-Hashtag Heuristics with Graph Neural Networks","date":"2024-04-16","arxiv_id":"2404.10228","n_code_links":0,"syntology":null},{"paper":null,"slug":"unveiling-the-misuse-potential-of-base-large","title":"Unveiling the Misuse Potential of Base Large Language Models via In-Context Learning","date":"2024-04-16","arxiv_id":"2404.10552","n_code_links":0,"syntology":null},{"paper":null,"slug":"vasa-1-lifelike-audio-driven-talking-faces","title":"VASA-1: Lifelike Audio-Driven Talking Faces Generated in Real Time","date":"2024-04-16","arxiv_id":"2404.10667","n_code_links":0,"syntology":null},{"paper":"/paper/vocabulary-free-image-classification-and","slug":"vocabulary-free-image-classification-and","title":"Vocabulary-free Image Classification and Semantic Segmentation","date":"2024-04-16","arxiv_id":"2404.10864","n_code_links":1,"syntology":null},{"paper":null,"slug":"watch-your-step-optimal-retrieval-for","title":"Watch Your Step: Optimal Retrieval for Continual Learning at Scale","date":"2024-04-16","arxiv_id":"2404.10758","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-emotional-stimuli-meet-prompt-designing","title":"When Emotional Stimuli meet Prompt Designing: An Auto-Prompt Graphical Paradigm","date":"2024-04-16","arxiv_id":"2404.10500","n_code_links":0,"syntology":null},{"paper":null,"slug":"3d-gaussian-splatting-as-markov-chain-monte","title":"3D Gaussian Splatting as Markov Chain Monte Carlo","date":"2024-04-15","arxiv_id":"2404.09591","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-competitive-game-optimization-algorithm-for","title":"A competitive game optimization algorithm for Unmanned Aerial Vehicle path planning","date":"2024-04-15","arxiv_id":"2404.09567","n_code_links":0,"syntology":null}],"record_sha256":"79c0c18d46b23a66ebeba7a1be16cd3517da0b4c341e0424f906a03613464e82","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}