{"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/inductive-bias/papers/3","list_of":"/task/inductive-bias","task":"Inductive Bias","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":16,"rows_per_page":100,"rows":[201,300],"of":1529,"counts":{"archive_papers_tagged":1529,"with_a_code_link":716,"where_syntology_ran_a_sample":284,"not_listed_spam_title":0,"listed":1529,"listed_where_code_ran":284,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":244,"every_run_a_failure_of_syntologys_instrument":40,"listed_with_a_run_with_no_instrument_failure":244,"listed_every_run_a_failure_of_syntologys_instrument":40,"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/inductive-bias","prev":"/task/inductive-bias/papers/2","next":"/task/inductive-bias/papers/4","papers":[{"url":"/paper/vf-nerf-learning-neural-vector-fields-for","slug":"vf-nerf-learning-neural-vector-fields-for","title":"VF-NeRF: Learning Neural Vector Fields for Indoor Scene Reconstruction","date":"2024-08-16","arxiv_id":"2408.08766","repositories_listed":1,"syntology":null},{"url":"/paper/mtsci-a-conditional-diffusion-model-for","slug":"mtsci-a-conditional-diffusion-model-for","title":"MTSCI: A Conditional Diffusion Model for Multivariate Time Series Consistent Imputation","date":"2024-08-11","arxiv_id":"2408.05740","repositories_listed":1,"syntology":null},{"url":"/paper/msg-chart-multimodal-scene-graph-for-chartqa","slug":"msg-chart-multimodal-scene-graph-for-chartqa","title":"MSG-Chart: Multimodal Scene Graph for ChartQA","date":"2024-08-09","arxiv_id":"2408.04852","repositories_listed":1,"syntology":null},{"url":"/paper/global-local-progressive-integration-network","slug":"global-local-progressive-integration-network","title":"No-Reference Image Quality Assessment with Global-Local Progressive Integration and Semantic-Aligned Quality Transfer","date":"2024-08-07","arxiv_id":"2408.03885","repositories_listed":1,"syntology":null},{"url":"/paper/depth-wise-convolutions-in-vision","slug":"depth-wise-convolutions-in-vision","title":"Depth-Wise Convolutions in Vision Transformers for Efficient Training on Small Datasets","date":"2024-07-28","arxiv_id":"2407.19394","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":2,"n_no_contract":8,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 2 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/depth-wise-convolutions-in-vision#ran","syntology_url":"https://syntology.ai/paper/2407.19394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.19394"}},"official":{"repos":["ztx-100/efficient_vit_with_dw"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dependency-transformer-grammars-integrating","slug":"dependency-transformer-grammars-integrating","title":"Dependency Transformer Grammars: Integrating Dependency Structures into Transformer Language Models","date":"2024-07-24","arxiv_id":"2407.17406","repositories_listed":1,"syntology":null},{"url":"/paper/systematic-reasoning-about-relational-domains","slug":"systematic-reasoning-about-relational-domains","title":"Systematic Reasoning About Relational Domains With Graph Neural Networks","date":"2024-07-24","arxiv_id":"2407.17396","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/systematic-reasoning-about-relational-domains#ran","syntology_url":"https://syntology.ai/paper/2407.17396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.17396"}},"official":{"repos":["erg0dic/gnn-sg"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-art-of-imitation-learning-long-horizon","slug":"the-art-of-imitation-learning-long-horizon","title":"The Art of Imitation: Learning Long-Horizon Manipulation Tasks from Few Demonstrations","date":"2024-07-18","arxiv_id":"2407.13432","repositories_listed":1,"syntology":null},{"url":"/paper/subgraph-aware-training-of-text-based-methods","slug":"subgraph-aware-training-of-text-based-methods","title":"Subgraph-Aware Training of Language Models for Knowledge Graph Completion Using Structure-Aware Contrastive Learning","date":"2024-07-17","arxiv_id":"2407.12703","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-separable-video-transformer-for","slug":"hierarchical-separable-video-transformer-for","title":"Hierarchical Separable Video Transformer for Snapshot Compressive Imaging","date":"2024-07-16","arxiv_id":"2407.11946","repositories_listed":1,"syntology":null},{"url":"/paper/partimagenet-dataset-scaling-up-part-based","slug":"partimagenet-dataset-scaling-up-part-based","title":"PartImageNet++ Dataset: Scaling up Part-based Models for Robust Recognition","date":"2024-07-15","arxiv_id":"2407.10918","repositories_listed":1,"syntology":{"n":19,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 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; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/partimagenet-dataset-scaling-up-part-based#ran","syntology_url":"https://syntology.ai/paper/2407.10918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10918"}},"official":{"repos":["LixiaoTHU/PartImageNetPP"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/empowering-graph-invariance-learning-with","slug":"empowering-graph-invariance-learning-with","title":"Empowering Graph Invariance Learning with Deep Spurious Infomax","date":"2024-07-13","arxiv_id":"2407.11083","repositories_listed":1,"syntology":null},{"url":"/paper/lpgd-a-general-framework-for-backpropagation","slug":"lpgd-a-general-framework-for-backpropagation","title":"LPGD: A General Framework for Backpropagation through Embedded Optimization Layers","date":"2024-07-08","arxiv_id":"2407.05920","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lpgd-a-general-framework-for-backpropagation#ran","syntology_url":"https://syntology.ai/paper/2407.05920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05920"}},"official":{"repos":["martius-lab/diffcp-lpgd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/g-adaptive-mesh-refinement-leveraging-graph","slug":"g-adaptive-mesh-refinement-leveraging-graph","title":"G-Adaptivity: optimised graph-based mesh relocation for finite element methods","date":"2024-07-05","arxiv_id":"2407.04516","repositories_listed":1,"syntology":null},{"url":"/paper/strengthening-structural-inductive-biases-by","slug":"strengthening-structural-inductive-biases-by","title":"Strengthening Structural Inductive Biases by Pre-training to Perform Syntactic Transformations","date":"2024-07-05","arxiv_id":"2407.04543","repositories_listed":1,"syntology":null},{"url":"/paper/artificial-inductive-bias-for-synthetic","slug":"artificial-inductive-bias-for-synthetic","title":"Artificial Inductive Bias for Synthetic Tabular Data Generation in Data-Scarce Scenarios","date":"2024-07-03","arxiv_id":"2407.03080","repositories_listed":1,"syntology":null},{"url":"/paper/probing-the-effects-of-broken-symmetries-in","slug":"probing-the-effects-of-broken-symmetries-in","title":"Probing the effects of broken symmetries in machine learning","date":"2024-06-25","arxiv_id":"2406.17747","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/probing-the-effects-of-broken-symmetries-in#ran","syntology_url":"https://syntology.ai/paper/2406.17747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17747"}},"official":{"repos":["spozdn/pet"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unlocking-continual-learning-abilities-in","slug":"unlocking-continual-learning-abilities-in","title":"Unlocking Continual Learning Abilities in Language Models","date":"2024-06-25","arxiv_id":"2406.17245","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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","sample_list":"/paper/unlocking-continual-learning-abilities-in#ran","syntology_url":"https://syntology.ai/paper/2406.17245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17245"}},"official":{"repos":["wenyudu/migu"],"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"]}}},{"url":"/paper/exploring-cross-domain-few-shot","slug":"exploring-cross-domain-few-shot","title":"Exploring Cross-Domain Few-Shot Classification via Frequency-Aware Prompting","date":"2024-06-24","arxiv_id":"2406.16422","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"phrase":"5 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exploring-cross-domain-few-shot#ran","syntology_url":"https://syntology.ai/paper/2406.16422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16422"}},"official":{"repos":["tinkez/fap_cdfsc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-exact-computation-of-inductive-bias","slug":"towards-exact-computation-of-inductive-bias","title":"Towards Exact Computation of Inductive Bias","date":"2024-06-22","arxiv_id":"2406.15941","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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","sample_list":"/paper/towards-exact-computation-of-inductive-bias#ran","syntology_url":"https://syntology.ai/paper/2406.15941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15941"}},"official":{"repos":["FieteLab/Exact-Inductive-Bias"],"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"]}}},{"url":"/paper/adversaries-with-incentives-a-strategic","slug":"adversaries-with-incentives-a-strategic","title":"Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness","date":"2024-06-17","arxiv_id":"2406.11458","repositories_listed":1,"syntology":null},{"url":"/paper/composing-object-relations-and-attributes-for-1","slug":"composing-object-relations-and-attributes-for-1","title":"Composing Object Relations and Attributes for Image-Text Matching","date":"2024-06-17","arxiv_id":"2406.11820","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/composing-object-relations-and-attributes-for-1#ran","syntology_url":"https://syntology.ai/paper/2406.11820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11820"}},"official":{"repos":["vkhoi/cora_cvpr24"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-encoder-free-vision-language-models","slug":"unveiling-encoder-free-vision-language-models","title":"Unveiling Encoder-Free Vision-Language Models","date":"2024-06-17","arxiv_id":"2406.11832","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/unveiling-encoder-free-vision-language-models#ran","syntology_url":"https://syntology.ai/paper/2406.11832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11832"}},"official":{"repos":["baaivision/eve"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/leveraging-locality-to-boost-sample","slug":"leveraging-locality-to-boost-sample","title":"Leveraging Locality to Boost Sample Efficiency in Robotic Manipulation","date":"2024-06-15","arxiv_id":"2406.10615","repositories_listed":1,"syntology":null},{"url":"/paper/scale-equivariant-graph-metanetworks","slug":"scale-equivariant-graph-metanetworks","title":"Scale Equivariant Graph Metanetworks","date":"2024-06-15","arxiv_id":"2406.10685","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scale-equivariant-graph-metanetworks#ran","syntology_url":"https://syntology.ai/paper/2406.10685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10685"}},"official":{"repos":["jkalogero/scalegmn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-implicit-optimization-for-robust-and","slug":"deep-implicit-optimization-for-robust-and","title":"Deep Implicit Optimization enables Robust Learnable Features for Deformable Image Registration","date":"2024-06-11","arxiv_id":"2406.07361","repositories_listed":1,"syntology":null},{"url":"/paper/adapting-pretrained-vits-with-convolution","slug":"adapting-pretrained-vits-with-convolution","title":"Adapting Pretrained ViTs with Convolution Injector for Visuo-Motor Control","date":"2024-06-10","arxiv_id":"2406.06072","repositories_listed":1,"syntology":null},{"url":"/paper/physics-informed-bayesian-optimization-of-1","slug":"physics-informed-bayesian-optimization-of-1","title":"Physics-Informed Bayesian Optimization of Variational Quantum Circuits","date":"2024-06-10","arxiv_id":"2406.06150","repositories_listed":1,"syntology":null},{"url":"/paper/small-e-small-language-model-with-linear","slug":"small-e-small-language-model-with-linear","title":"Small-E: Small Language Model with Linear Attention for Efficient Speech Synthesis","date":"2024-06-06","arxiv_id":"2406.04467","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-aware-coarse-to-fine-mlps-for","slug":"correlation-aware-coarse-to-fine-mlps-for","title":"Correlation-aware Coarse-to-fine MLPs for Deformable Medical Image Registration","date":"2024-05-31","arxiv_id":"2406.00123","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":11,"n_ran_checked":12,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":17,"phrase":"14 ran (of which 11 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/correlation-aware-coarse-to-fine-mlps-for#ran","syntology_url":"https://syntology.ai/paper/2406.00123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00123"}},"official":{"repos":["mungomeng/registration-corrmlp"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":11,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-latent-graph-structures-and-their","slug":"learning-latent-graph-structures-and-their","title":"Learning Latent Graph Structures and their Uncertainty","date":"2024-05-30","arxiv_id":"2405.19933","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"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) · 0 unverified","sample_list":"/paper/learning-latent-graph-structures-and-their#ran","syntology_url":"https://syntology.ai/paper/2405.19933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19933"}},"official":{"repos":["allemanenti/Learning-Calibrated-Structures"],"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"]}}},{"url":"/paper/sequence-augmented-se-3-flow-matching-for","slug":"sequence-augmented-se-3-flow-matching-for","title":"Sequence-Augmented SE(3)-Flow Matching For Conditional Protein Backbone Generation","date":"2024-05-30","arxiv_id":"2405.20313","repositories_listed":1,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":20,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sequence-augmented-se-3-flow-matching-for#ran","syntology_url":"https://syntology.ai/paper/2405.20313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20313"}},"official":{"repos":["dreamfold/foldflow"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":3,"ran_from_kinds":["community","official"]}}},{"url":"/paper/e-n-equivariant-topological-neural-networks","slug":"e-n-equivariant-topological-neural-networks","title":"E(n) Equivariant Topological Neural Networks","date":"2024-05-24","arxiv_id":"2405.15429","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/e-n-equivariant-topological-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.15429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15429"}},"official":{"repos":["NSAPH-Projects/topological-equivariant-networks"],"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/symmetric-linear-bandits-with-hidden-symmetry","slug":"symmetric-linear-bandits-with-hidden-symmetry","title":"Symmetric Linear Bandits with Hidden Symmetry","date":"2024-05-22","arxiv_id":"2405.13899","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/symmetric-linear-bandits-with-hidden-symmetry#ran","syntology_url":"https://syntology.ai/paper/2405.13899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.13899"}},"official":{"repos":["namtrankekl/symmetric-linear-bandit-with-hidden-symmetry"],"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/forecasting-with-hyper-trees","slug":"forecasting-with-hyper-trees","title":"Forecasting with Hyper-Trees","date":"2024-05-13","arxiv_id":"2405.07836","repositories_listed":1,"syntology":null},{"url":"/paper/spatiotemporal-implicit-neural-representation-1","slug":"spatiotemporal-implicit-neural-representation-1","title":"Spatiotemporal Implicit Neural Representation as a Generalized Traffic Data Learner","date":"2024-05-06","arxiv_id":"2405.03185","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-learning-on-directed-acyclic","slug":"convolutional-learning-on-directed-acyclic","title":"Convolutional Learning on Directed Acyclic Graphs","date":"2024-05-05","arxiv_id":"2405.03056","repositories_listed":1,"syntology":null},{"url":"/paper/u-dits-downsample-tokens-in-u-shaped","slug":"u-dits-downsample-tokens-in-u-shaped","title":"U-DiTs: Downsample Tokens in U-Shaped Diffusion Transformers","date":"2024-05-04","arxiv_id":"2405.02730","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/u-dits-downsample-tokens-in-u-shaped#ran","syntology_url":"https://syntology.ai/paper/2405.02730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02730"}},"official":{"repos":["yuchuantian/u-dit"],"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/no-one-size-fits-all-neurons-task-based","slug":"no-one-size-fits-all-neurons-task-based","title":"No One-Size-Fits-All Neurons: Task-based Neurons for Artificial Neural Networks","date":"2024-05-03","arxiv_id":"2405.02369","repositories_listed":1,"syntology":null},{"url":"/paper/learning-syntax-without-planting-trees","slug":"learning-syntax-without-planting-trees","title":"Learning Syntax Without Planting Trees: Understanding When and Why Transformers Generalize Hierarchically","date":"2024-04-25","arxiv_id":"2404.16367","repositories_listed":1,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":16,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-syntax-without-planting-trees#ran","syntology_url":"https://syntology.ai/paper/2404.16367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.16367"}},"official":{"repos":["kabirahuja2431/transformers-hg"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/gradformer-graph-transformer-with-exponential","slug":"gradformer-graph-transformer-with-exponential","title":"Gradformer: Graph Transformer with Exponential Decay","date":"2024-04-24","arxiv_id":"2404.15729","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradformer-graph-transformer-with-exponential#ran","syntology_url":"https://syntology.ai/paper/2404.15729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15729"}},"official":{"repos":["liuchuang0059/gradformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mamba-360-survey-of-state-space-models-as","slug":"mamba-360-survey-of-state-space-models-as","title":"Mamba-360: Survey of State Space Models as Transformer Alternative for Long Sequence Modelling: Methods, Applications, and Challenges","date":"2024-04-24","arxiv_id":"2404.16112","repositories_listed":1,"syntology":null},{"url":"/paper/sparo-selective-attention-for-robust-and","slug":"sparo-selective-attention-for-robust-and","title":"SPARO: Selective Attention for Robust and Compositional Transformer Encodings for Vision","date":"2024-04-24","arxiv_id":"2404.15721","repositories_listed":1,"syntology":null},{"url":"/paper/bmapopt-optimization-of-brain-tissue","slug":"bmapopt-optimization-of-brain-tissue","title":"BMapEst: Estimation of Brain Tissue Probability Maps using a Differentiable MRI Simulator","date":"2024-04-23","arxiv_id":"2404.14739","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-in-latent-representations-of","slug":"uncertainty-in-latent-representations-of","title":"Uncertainty in latent representations of variational autoencoders optimized for visual tasks","date":"2024-04-23","arxiv_id":"2404.15390","repositories_listed":1,"syntology":null},{"url":"/paper/masked-latent-transformer-with-the-random","slug":"masked-latent-transformer-with-the-random","title":"Masked Latent Transformer with the Random Masking Ratio to Advance the Diagnosis of Dental Fluorosis","date":"2024-04-21","arxiv_id":"2404.13564","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-convolutional-conditional-neural","slug":"spectral-convolutional-conditional-neural","title":"Spectral Convolutional Conditional Neural Processes","date":"2024-04-19","arxiv_id":"2404.13182","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-causal-nature-of-sentiment-analysis","slug":"on-the-causal-nature-of-sentiment-analysis","title":"Do LLMs Think Fast and Slow? A Causal Study on Sentiment Analysis","date":"2024-04-17","arxiv_id":"2404.11055","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-causal-nature-of-sentiment-analysis#ran","syntology_url":"https://syntology.ai/paper/2404.11055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11055"}},"official":{"repos":["cogito233/causal-sa"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-provable-control-of-sensitivity-of-neural","slug":"a-provable-control-of-sensitivity-of-neural","title":"A provable control of sensitivity of neural networks through a direct parameterization of the overall bi-Lipschitzness","date":"2024-04-15","arxiv_id":"2404.09821","repositories_listed":1,"syntology":null},{"url":"/paper/hsvit-horizontally-scalable-vision","slug":"hsvit-horizontally-scalable-vision","title":"HSViT: Horizontally Scalable Vision Transformer","date":"2024-04-08","arxiv_id":"2404.05196","repositories_listed":1,"syntology":null},{"url":"/paper/technical-report-the-graph-spectral-token","slug":"technical-report-the-graph-spectral-token","title":"Technical Report: The Graph Spectral Token -- Enhancing Graph Transformers with Spectral Information","date":"2024-04-08","arxiv_id":"2404.05604","repositories_listed":1,"syntology":null},{"url":"/paper/structured-initialization-for-attention-in","slug":"structured-initialization-for-attention-in","title":"Structured Initialization for Attention in Vision Transformers","date":"2024-04-01","arxiv_id":"2404.01139","repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-divergent-inductive-biases-of-llms","slug":"unveiling-divergent-inductive-biases-of-llms","title":"Unveiling Divergent Inductive Biases of LLMs on Temporal Data","date":"2024-04-01","arxiv_id":"2404.01453","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-patches-for-unbiased-image","slug":"learning-to-rank-patches-for-unbiased-image","title":"Learning to Rank Patches for Unbiased Image Redundancy Reduction","date":"2024-03-31","arxiv_id":"2404.00680","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 1 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","sample_list":"/paper/learning-to-rank-patches-for-unbiased-image#ran","syntology_url":"https://syntology.ai/paper/2404.00680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00680"}},"official":{"repos":["irslu/ltrp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/incorporating-exponential-smoothing-into-mlp","slug":"incorporating-exponential-smoothing-into-mlp","title":"Incorporating Exponential Smoothing into MLP: A Simple but Effective Sequence Model","date":"2024-03-26","arxiv_id":"2403.17445","repositories_listed":1,"syntology":null},{"url":"/paper/graph-image-prior-for-unsupervised-dynamic","slug":"graph-image-prior-for-unsupervised-dynamic","title":"Graph Image Prior for Unsupervised Dynamic Cardiac Cine MRI Reconstruction","date":"2024-03-23","arxiv_id":"2403.15770","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-ensembles-and-regularization-for","slug":"equivariant-ensembles-and-regularization-for","title":"Equivariant Ensembles and Regularization for Reinforcement Learning in Map-based Path Planning","date":"2024-03-19","arxiv_id":"2403.12856","repositories_listed":1,"syntology":null},{"url":"/paper/offline-imitation-of-badminton-player","slug":"offline-imitation-of-badminton-player","title":"Offline Imitation of Badminton Player Behavior via Experiential Contexts and Brownian Motion","date":"2024-03-19","arxiv_id":"2403.12406","repositories_listed":1,"syntology":null},{"url":"/paper/neural-markov-random-field-for-stereo","slug":"neural-markov-random-field-for-stereo","title":"Neural Markov Random Field for Stereo Matching","date":"2024-03-17","arxiv_id":"2403.11193","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"12 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-markov-random-field-for-stereo#ran","syntology_url":"https://syntology.ai/paper/2403.11193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11193"}},"official":{"repos":["aeolusguan/NMRF"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/xb-maml-learning-expandable-basis-parameters","slug":"xb-maml-learning-expandable-basis-parameters","title":"XB-MAML: Learning Expandable Basis Parameters for Effective Meta-Learning with Wide Task Coverage","date":"2024-03-11","arxiv_id":"2403.06768","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/xb-maml-learning-expandable-basis-parameters#ran","syntology_url":"https://syntology.ai/paper/2403.06768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06768"}},"official":{"repos":["johnjaejunlee95/xb-maml"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-learner-parameterization-by","slug":"few-shot-learner-parameterization-by","title":"Few-shot Learner Parameterization by Diffusion Time-steps","date":"2024-03-05","arxiv_id":"2403.02649","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/few-shot-learner-parameterization-by#ran","syntology_url":"https://syntology.ai/paper/2403.02649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.02649"}},"official":{"repos":["yue-zhongqi/tif"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hybrid-square-neural-ode-causal-modeling","slug":"hybrid-square-neural-ode-causal-modeling","title":"Hybrid$^2$ Neural ODE Causal Modeling and an Application to Glycemic Response","date":"2024-02-27","arxiv_id":"2402.17233","repositories_listed":1,"syntology":null},{"url":"/paper/tokenization-counts-the-impact-of","slug":"tokenization-counts-the-impact-of","title":"Tokenization counts: the impact of tokenization on arithmetic in frontier LLMs","date":"2024-02-22","arxiv_id":"2402.14903","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tokenization-counts-the-impact-of#ran","syntology_url":"https://syntology.ai/paper/2402.14903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14903"}},"official":{"repos":["aadityasingh/tokenizationcounts"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-physics-informed-hard-constraints","slug":"scaling-physics-informed-hard-constraints","title":"Scaling physics-informed hard constraints with mixture-of-experts","date":"2024-02-20","arxiv_id":"2402.13412","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"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) · 2 unverified","sample_list":"/paper/scaling-physics-informed-hard-constraints#ran","syntology_url":"https://syntology.ai/paper/2402.13412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13412"}},"official":{"repos":["ask-berkeley/physics-nns-hard-constraints"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/locality-sensitive-hashing-based-efficient","slug":"locality-sensitive-hashing-based-efficient","title":"Locality-Sensitive Hashing-Based Efficient Point Transformer with Applications in High-Energy Physics","date":"2024-02-19","arxiv_id":"2402.12535","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":1,"n_ran_checked":1,"n_instrument":11,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 11 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/locality-sensitive-hashing-based-efficient#ran","syntology_url":"https://syntology.ai/paper/2402.12535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12535"}},"official":{"repos":["graph-com/hept"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/parcv2-physics-aware-recurrent-convolutional","slug":"parcv2-physics-aware-recurrent-convolutional","title":"PARCv2: Physics-aware Recurrent Convolutional Neural Networks for Spatiotemporal Dynamics Modeling","date":"2024-02-19","arxiv_id":"2402.12503","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"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) · 5 unverified","sample_list":"/paper/parcv2-physics-aware-recurrent-convolutional#ran","syntology_url":"https://syntology.ai/paper/2402.12503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12503"}},"official":{"repos":["hphong1990/parcv2"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/fvit-a-focal-vision-transformer-with-gabor","slug":"fvit-a-focal-vision-transformer-with-gabor","title":"FViT: A Focal Vision Transformer with Gabor Filter","date":"2024-02-17","arxiv_id":"2402.11303","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 3 unverified","sample_list":"/paper/fvit-a-focal-vision-transformer-with-gabor#ran","syntology_url":"https://syntology.ai/paper/2402.11303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11303"}},"official":{"repos":["nkusyl/fvit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/contiformer-continuous-time-transformer-for-1","slug":"contiformer-continuous-time-transformer-for-1","title":"ContiFormer: Continuous-Time Transformer for Irregular Time Series Modeling","date":"2024-02-16","arxiv_id":"2402.10635","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_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) · 4 unverified","sample_list":"/paper/contiformer-continuous-time-transformer-for-1#ran","syntology_url":"https://syntology.ai/paper/2402.10635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10635"}},"official":{"repos":["microsoft/SeqML"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-excitation-projective-simulation-with-a","slug":"multi-excitation-projective-simulation-with-a","title":"Multi-Excitation Projective Simulation with a Many-Body Physics Inspired Inductive Bias","date":"2024-02-15","arxiv_id":"2402.10192","repositories_listed":1,"syntology":null},{"url":"/paper/graph-inference-acceleration-by-learning-mlps","slug":"graph-inference-acceleration-by-learning-mlps","title":"SimMLP: Training MLPs on Graphs without Supervision","date":"2024-02-14","arxiv_id":"2402.08918","repositories_listed":1,"syntology":null},{"url":"/paper/confronting-reward-overoptimization-for","slug":"confronting-reward-overoptimization-for","title":"Confronting Reward Overoptimization for Diffusion Models: A Perspective of Inductive and Primacy Biases","date":"2024-02-13","arxiv_id":"2402.08552","repositories_listed":1,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 5 unverified","sample_list":"/paper/confronting-reward-overoptimization-for#ran","syntology_url":"https://syntology.ai/paper/2402.08552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.08552"}},"official":{"repos":["ZiyiZhang27/tdpo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"url":"/paper/hyperbert-mixing-hypergraph-aware-layers-with","slug":"hyperbert-mixing-hypergraph-aware-layers-with","title":"HyperBERT: Mixing Hypergraph-Aware Layers with Language Models for Node Classification on Text-Attributed Hypergraphs","date":"2024-02-11","arxiv_id":"2402.07309","repositories_listed":1,"syntology":null},{"url":"/paper/time-series-diffusion-in-the-frequency-domain","slug":"time-series-diffusion-in-the-frequency-domain","title":"Time Series Diffusion in the Frequency Domain","date":"2024-02-08","arxiv_id":"2402.05933","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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","sample_list":"/paper/time-series-diffusion-in-the-frequency-domain#ran","syntology_url":"https://syntology.ai/paper/2402.05933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05933"}},"official":{"repos":["jonathancrabbe/fourierdiffusion"],"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"]}}},{"url":"/paper/on-the-completeness-of-invariant-geometric","slug":"on-the-completeness-of-invariant-geometric","title":"On the Completeness of Invariant Geometric Deep Learning Models","date":"2024-02-07","arxiv_id":"2402.04836","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"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) · 0 unverified","sample_list":"/paper/on-the-completeness-of-invariant-geometric#ran","syntology_url":"https://syntology.ai/paper/2402.04836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04836"}},"official":{"repos":["GraphPKU/GeoNGNN"],"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"]}}},{"url":"/paper/arithmetic-feature-interaction-is-necessary","slug":"arithmetic-feature-interaction-is-necessary","title":"Arithmetic Feature Interaction Is Necessary for Deep Tabular Learning","date":"2024-02-04","arxiv_id":"2402.02334","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-superconductor-discovery-through","slug":"accelerating-superconductor-discovery-through","title":"Accelerating superconductor discovery through tempered deep learning of the electron-phonon spectral function","date":"2024-01-29","arxiv_id":"2401.16611","repositories_listed":1,"syntology":null},{"url":"/paper/mixmobilenet-a-mixed-mobile-network-for-edge","slug":"mixmobilenet-a-mixed-mobile-network-for-edge","title":"MixMobileNet: A Mixed Mobile Network for Edge Vision Applications","date":"2024-01-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-initialization-for-data","slug":"convolutional-initialization-for-data","title":"Convolutional Initialization for Data-Efficient Vision Transformers","date":"2024-01-23","arxiv_id":"2401.12511","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-tree-search-in-latent-state","slug":"differentiable-tree-search-in-latent-state","title":"Differentiable Tree Search Network","date":"2024-01-22","arxiv_id":"2401.11660","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-diffusion-time-steps-for","slug":"exploring-diffusion-time-steps-for","title":"Exploring Diffusion Time-steps for Unsupervised Representation Learning","date":"2024-01-21","arxiv_id":"2401.11430","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/exploring-diffusion-time-steps-for#ran","syntology_url":"https://syntology.ai/paper/2401.11430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11430"}},"official":{"repos":["yue-zhongqi/diti"],"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/boosting-image-quality-assessment-through","slug":"boosting-image-quality-assessment-through","title":"Boosting Image Quality Assessment through Efficient Transformer Adaptation with Local Feature Enhancement","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-contrastive-variational-graph-auto-encoder","slug":"a-contrastive-variational-graph-auto-encoder","title":"A Contrastive Variational Graph Auto-Encoder for Node Clustering","date":"2023-12-28","arxiv_id":"2312.16830","repositories_listed":1,"syntology":null},{"url":"/paper/transformer-based-no-reference-image-quality","slug":"transformer-based-no-reference-image-quality","title":"Transformer-based No-Reference Image Quality Assessment via Supervised Contrastive Learning","date":"2023-12-12","arxiv_id":"2312.06995","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-the-cross-architecture","slug":"boosting-the-cross-architecture","title":"Boosting the Cross-Architecture Generalization of Dataset Distillation through an Empirical Study","date":"2023-12-09","arxiv_id":"2312.05598","repositories_listed":1,"syntology":null},{"url":"/paper/timedrl-disentangled-representation-learning","slug":"timedrl-disentangled-representation-learning","title":"TimeDRL: Disentangled Representation Learning for Multivariate Time-Series","date":"2023-12-07","arxiv_id":"2312.04142","repositories_listed":1,"syntology":null},{"url":"/paper/energy-based-potential-games-for-joint-motion","slug":"energy-based-potential-games-for-joint-motion","title":"Energy-based Potential Games for Joint Motion Forecasting and Control","date":"2023-12-04","arxiv_id":"2312.01811","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"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","sample_list":"/paper/energy-based-potential-games-for-joint-motion#ran","syntology_url":"https://syntology.ai/paper/2312.01811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01811"}},"official":{"repos":["rst-tu-dortmund/diff_epo_planner"],"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"]}}},{"url":"/paper/mobileutr-revisiting-the-relationship-between","slug":"mobileutr-revisiting-the-relationship-between","title":"MobileUtr: Revisiting the relationship between light-weight CNN and Transformer for efficient medical image segmentation","date":"2023-12-04","arxiv_id":"2312.01740","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-distance-encoding-neural-networks","slug":"recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","arxiv_id":"2312.01538","repositories_listed":1,"syntology":{"n":21,"n_ran":12,"n_constructed":2,"n_ran_checked":9,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":21,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/recurrent-distance-encoding-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2312.01538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01538"}},"official":{"repos":["skeletondyh/gred"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/language-embedded-3d-gaussians-for-open","slug":"language-embedded-3d-gaussians-for-open","title":"Language Embedded 3D Gaussians for Open-Vocabulary Scene Understanding","date":"2023-11-30","arxiv_id":"2311.18482","repositories_listed":1,"syntology":null},{"url":"/paper/reward-retinal-waves-for-pre-training","slug":"reward-retinal-waves-for-pre-training","title":"ReWaRD: Retinal Waves for Pre-Training Artificial Neural Networks Mimicking Real Prenatal Development","date":"2023-11-28","arxiv_id":"2311.17232","repositories_listed":1,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":17,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/reward-retinal-waves-for-pre-training#ran","syntology_url":"https://syntology.ai/paper/2311.17232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17232"}},"official":{"repos":["bennyca/reward"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/a-metalearned-neural-circuit-for","slug":"a-metalearned-neural-circuit-for","title":"A Metalearned Neural Circuit for Nonparametric Bayesian Inference","date":"2023-11-24","arxiv_id":"2311.14601","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-robust-jet-tagging-at-the-lhc","slug":"efficient-and-robust-jet-tagging-at-the-lhc","title":"Efficient and Robust Jet Tagging at the LHC with Knowledge Distillation","date":"2023-11-23","arxiv_id":"2311.14160","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-and-robust-jet-tagging-at-the-lhc#ran","syntology_url":"https://syntology.ai/paper/2311.14160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14160"}},"official":{"repos":["ryanliu30/kd4jets"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/from-images-to-connections-can-dqn-with-gnns","slug":"from-images-to-connections-can-dqn-with-gnns","title":"From Images to Connections: Can DQN with GNNs learn the Strategic Game of Hex?","date":"2023-11-22","arxiv_id":"2311.13414","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-in-a-decomposed","slug":"representation-learning-in-a-decomposed","title":"Representation Learning in a Decomposed Encoder Design for Bio-inspired Hebbian Learning","date":"2023-11-22","arxiv_id":"2401.08603","repositories_listed":1,"syntology":null},{"url":"/paper/architecture-matters-uncovering-implicit-1","slug":"architecture-matters-uncovering-implicit-1","title":"Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning","date":"2023-11-05","arxiv_id":"2311.02687","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/architecture-matters-uncovering-implicit-1#ran","syntology_url":"https://syntology.ai/paper/2311.02687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02687"}},"official":{"repos":["pku-ml/architecturemattersgcl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/e-2-equivariant-neural-networks-for-robust","slug":"e-2-equivariant-neural-networks-for-robust","title":"E(2) Equivariant Neural Networks for Robust Galaxy Morphology Classification","date":"2023-11-02","arxiv_id":"2311.01500","repositories_listed":1,"syntology":null},{"url":"/paper/syntactic-inductive-bias-in-transformer","slug":"syntactic-inductive-bias-in-transformer","title":"Syntactic Inductive Bias in Transformer Language Models: Especially Helpful for Low-Resource Languages?","date":"2023-11-01","arxiv_id":"2311.00268","repositories_listed":1,"syntology":null},{"url":"/paper/sqlformer-deep-auto-regressive-query-graph","slug":"sqlformer-deep-auto-regressive-query-graph","title":"SQLformer: Deep Auto-Regressive Query Graph Generation for Text-to-SQL Translation","date":"2023-10-27","arxiv_id":"2310.18376","repositories_listed":1,"syntology":null},{"url":"/paper/c-disentanglement-discovering-causally","slug":"c-disentanglement-discovering-causally","title":"C-Disentanglement: Discovering Causally-Independent Generative Factors under an Inductive Bias of Confounder","date":"2023-10-26","arxiv_id":"2310.17325","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/c-disentanglement-discovering-causally#ran","syntology_url":"https://syntology.ai/paper/2310.17325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17325"}},"official":{"repos":["xliu1231/causal_disentangle"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-pairwise-encodings-for-link","slug":"adaptive-pairwise-encodings-for-link","title":"LPFormer: An Adaptive Graph Transformer for Link Prediction","date":"2023-10-17","arxiv_id":"2310.11009","repositories_listed":1,"syntology":null}],"record_sha256":"0044cfc6756697fd664f36da5a9ccbe0107ee2e402cac611696230bd836218f4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}