{"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/computational-efficiency/papers/10","list_of":"/task/computational-efficiency","task":"Computational Efficiency","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":10,"pages_in_order":49,"rows_per_page":100,"rows":[901,1000],"of":4891,"counts":{"archive_papers_tagged":4891,"with_a_code_link":1644,"where_syntology_ran_a_sample":369,"not_listed_spam_title":0,"listed":4891,"listed_where_code_ran":369,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":307,"every_run_a_failure_of_syntologys_instrument":62,"listed_with_a_run_with_no_instrument_failure":307,"listed_every_run_a_failure_of_syntologys_instrument":62,"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/computational-efficiency","prev":"/task/computational-efficiency/papers/9","next":"/task/computational-efficiency/papers/11","papers":[{"url":"/paper/collaborative-filtering-based-on-diffusion","slug":"collaborative-filtering-based-on-diffusion","title":"Collaborative Filtering Based on Diffusion Models: Unveiling the Potential of High-Order Connectivity","date":"2024-04-22","arxiv_id":"2404.14240","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/collaborative-filtering-based-on-diffusion#ran","syntology_url":"https://syntology.ai/paper/2404.14240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14240"}},"official":{"repos":["jackfrost168/cf_diff"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynammo-dynamic-model-merging-for-efficient","slug":"dynammo-dynamic-model-merging-for-efficient","title":"DynaMMo: Dynamic Model Merging for Efficient Class Incremental Learning for Medical Images","date":"2024-04-22","arxiv_id":"2404.14099","repositories_listed":1,"syntology":null},{"url":"/paper/multibooth-towards-generating-all-your","slug":"multibooth-towards-generating-all-your","title":"MultiBooth: Towards Generating All Your Concepts in an Image from Text","date":"2024-04-22","arxiv_id":"2404.14239","repositories_listed":1,"syntology":null},{"url":"/paper/ammunet-multi-scale-attention-map-merging-for","slug":"ammunet-multi-scale-attention-map-merging-for","title":"AMMUNet: Multi-Scale Attention Map Merging for Remote Sensing Image Segmentation","date":"2024-04-20","arxiv_id":"2404.13408","repositories_listed":1,"syntology":null},{"url":"/paper/partial-large-kernel-cnns-for-efficient-super","slug":"partial-large-kernel-cnns-for-efficient-super","title":"Partial Large Kernel CNNs for Efficient Super-Resolution","date":"2024-04-18","arxiv_id":"2404.11848","repositories_listed":1,"syntology":null},{"url":"/paper/proteus-preserving-model-confidentiality","slug":"proteus-preserving-model-confidentiality","title":"Proteus: Preserving Model Confidentiality during Graph Optimizations","date":"2024-04-18","arxiv_id":"2404.12512","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"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) · 0 unverified","sample_list":"/paper/proteus-preserving-model-confidentiality#ran","syntology_url":"https://syntology.ai/paper/2404.12512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12512"}},"official":{"repos":["proteus-mlsys24/mlsys24-artifact"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stepwise-alignment-for-constrained-language","slug":"stepwise-alignment-for-constrained-language","title":"Stepwise Alignment for Constrained Language Model Policy Optimization","date":"2024-04-17","arxiv_id":"2404.11049","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/stepwise-alignment-for-constrained-language#ran","syntology_url":"https://syntology.ai/paper/2404.11049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11049"}},"official":{"repos":["line/sacpo"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/post-training-network-compression-for-3d","slug":"post-training-network-compression-for-3d","title":"Post-Training Network Compression for 3D Medical Image Segmentation: Reducing Computational Efforts via Tucker Decomposition","date":"2024-04-15","arxiv_id":"2404.09683","repositories_listed":1,"syntology":null},{"url":"/paper/fast-fishing-approximating-bait-for-efficient","slug":"fast-fishing-approximating-bait-for-efficient","title":"Fast Fishing: Approximating BAIT for Efficient and Scalable Deep Active Image Classification","date":"2024-04-13","arxiv_id":"2404.08981","repositories_listed":1,"syntology":null},{"url":"/paper/bert-lsh-reducing-absolute-compute-for","slug":"bert-lsh-reducing-absolute-compute-for","title":"BERT-LSH: Reducing Absolute Compute For Attention","date":"2024-04-12","arxiv_id":"2404.08836","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-population-based-training-for","slug":"generalized-population-based-training-for","title":"Generalized Population-Based Training for Hyperparameter Optimization in Reinforcement Learning","date":"2024-04-12","arxiv_id":"2404.08233","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalized-population-based-training-for#ran","syntology_url":"https://syntology.ai/paper/2404.08233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08233"}},"official":{"repos":["emi-group/gpbt-pl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-aware-laparoscopic-image-desmoking","slug":"attention-aware-laparoscopic-image-desmoking","title":"Attention-Aware Laparoscopic Image Desmoking Network with Lightness Embedding and Hybrid Guided Embedding","date":"2024-04-11","arxiv_id":"2404.07556","repositories_listed":1,"syntology":null},{"url":"/paper/gomavatar-efficient-animatable-human-modeling","slug":"gomavatar-efficient-animatable-human-modeling","title":"GoMAvatar: Efficient Animatable Human Modeling from Monocular Video Using Gaussians-on-Mesh","date":"2024-04-11","arxiv_id":"2404.07991","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gomavatar-efficient-animatable-human-modeling#ran","syntology_url":"https://syntology.ai/paper/2404.07991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.07991"}},"official":null}},{"url":"/paper/tbsn-transformer-based-blind-spot-network-for","slug":"tbsn-transformer-based-blind-spot-network-for","title":"Rethinking Transformer-Based Blind-Spot Network for Self-Supervised Image Denoising","date":"2024-04-11","arxiv_id":"2404.07846","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tbsn-transformer-based-blind-spot-network-for#ran","syntology_url":"https://syntology.ai/paper/2404.07846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.07846"}},"official":{"repos":["nagejacob/tbsn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adapting-llama-decoder-to-vision-transformer","slug":"adapting-llama-decoder-to-vision-transformer","title":"Adapting LLaMA Decoder to Vision Transformer","date":"2024-04-10","arxiv_id":"2404.06773","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":8,"n_pointer_only":13,"phrase":"12 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adapting-llama-decoder-to-vision-transformer#ran","syntology_url":"https://syntology.ai/paper/2404.06773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06773"}},"official":{"repos":["techmonsterwang/illama"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-survival-analysis-by-approximate","slug":"bayesian-survival-analysis-by-approximate","title":"Efficient Training of Probabilistic Neural Networks for Survival Analysis","date":"2024-04-09","arxiv_id":"2404.06421","repositories_listed":1,"syntology":null},{"url":"/paper/lhu-net-a-light-hybrid-u-net-for-cost","slug":"lhu-net-a-light-hybrid-u-net-for-cost","title":"LHU-Net: A Light Hybrid U-Net for Cost-Efficient, High-Performance Volumetric Medical Image Segmentation","date":"2024-04-07","arxiv_id":"2404.05102","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":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) · 0 unverified","sample_list":"/paper/lhu-net-a-light-hybrid-u-net-for-cost#ran","syntology_url":"https://syntology.ai/paper/2404.05102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05102"}},"official":{"repos":["xmindflow/lhunet"],"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/learning-based-model-augmentation-with-lfrs","slug":"learning-based-model-augmentation-with-lfrs","title":"Learning-based model augmentation with LFRs","date":"2024-04-02","arxiv_id":"2404.01901","repositories_listed":1,"syntology":null},{"url":"/paper/tensorized-neuroevolution-of-augmenting","slug":"tensorized-neuroevolution-of-augmenting","title":"Tensorized NeuroEvolution of Augmenting Topologies for GPU Acceleration","date":"2024-04-02","arxiv_id":"2404.01817","repositories_listed":1,"syntology":null},{"url":"/paper/complex-neural-network-based-joint-aoa-and","slug":"complex-neural-network-based-joint-aoa-and","title":"Complex Neural Network based Joint AoA and AoD Estimation for Bistatic ISAC","date":"2024-03-31","arxiv_id":"2404.00582","repositories_listed":1,"syntology":null},{"url":"/paper/aggregating-local-and-global-features-via","slug":"aggregating-local-and-global-features-via","title":"Learning Enriched Features via Selective State Spaces Model for Efficient Image Deblurring","date":"2024-03-29","arxiv_id":"2403.20106","repositories_listed":1,"syntology":null},{"url":"/paper/holo-vqvae-vq-vae-for-phase-only-holograms","slug":"holo-vqvae-vq-vae-for-phase-only-holograms","title":"P-Hologen: An End-to-End Generative Framework for Phase-Only Holograms","date":"2024-03-29","arxiv_id":"2404.01330","repositories_listed":1,"syntology":null},{"url":"/paper/formal-verification-with-constrained","slug":"formal-verification-with-constrained","title":"Reachability Analysis Using Constrained Polynomial Logical Zonotopes","date":"2024-03-27","arxiv_id":"2403.18564","repositories_listed":1,"syntology":null},{"url":"/paper/tiny-models-are-the-computational-saver-for","slug":"tiny-models-are-the-computational-saver-for","title":"Tiny Models are the Computational Saver for Large Models","date":"2024-03-26","arxiv_id":"2403.17726","repositories_listed":1,"syntology":null},{"url":"/paper/grappa-a-machine-learned-molecular-mechanics","slug":"grappa-a-machine-learned-molecular-mechanics","title":"Grappa -- A Machine Learned Molecular Mechanics Force Field","date":"2024-03-25","arxiv_id":"2404.00050","repositories_listed":1,"syntology":null},{"url":"/paper/considerations-in-the-use-of-ml-interaction","slug":"considerations-in-the-use-of-ml-interaction","title":"Considerations in the use of ML interaction potentials for free energy calculations","date":"2024-03-20","arxiv_id":"2403.13952","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-implementation-of-versatile-graph","slug":"sparse-implementation-of-versatile-graph","title":"Sparse Implementation of Versatile Graph-Informed Layers","date":"2024-03-20","arxiv_id":"2403.13781","repositories_listed":1,"syntology":null},{"url":"/paper/vid-tldr-training-free-token-merging-for","slug":"vid-tldr-training-free-token-merging-for","title":"vid-TLDR: Training Free Token merging for Light-weight Video Transformer","date":"2024-03-20","arxiv_id":"2403.13347","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/vid-tldr-training-free-token-merging-for#ran","syntology_url":"https://syntology.ai/paper/2403.13347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13347"}},"official":{"repos":["mlvlab/vid-tldr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stg-mamba-spatial-temporal-graph-learning-via","slug":"stg-mamba-spatial-temporal-graph-learning-via","title":"STG-Mamba: Spatial-Temporal Graph Learning via Selective State Space Model","date":"2024-03-19","arxiv_id":"2403.12418","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/stg-mamba-spatial-temporal-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2403.12418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.12418"}},"official":{"repos":["LincanLi98/STG-Mamba"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-tokenization-strategies-and","slug":"exploring-tokenization-strategies-and","title":"Exploring Tokenization Strategies and Vocabulary Sizes for Enhanced Arabic Language Models","date":"2024-03-17","arxiv_id":"2403.11130","repositories_listed":1,"syntology":null},{"url":"/paper/is-mamba-effective-for-time-series","slug":"is-mamba-effective-for-time-series","title":"Is Mamba Effective for Time Series Forecasting?","date":"2024-03-17","arxiv_id":"2403.11144","repositories_listed":1,"syntology":null},{"url":"/paper/efficientmorph-parameter-efficient","slug":"efficientmorph-parameter-efficient","title":"EfficientMorph: Parameter-Efficient Transformer-Based Architecture for 3D Image Registration","date":"2024-03-16","arxiv_id":"2403.11026","repositories_listed":1,"syntology":null},{"url":"/paper/multi-criteria-token-fusion-with-one-step","slug":"multi-criteria-token-fusion-with-one-step","title":"Multi-criteria Token Fusion with One-step-ahead Attention for Efficient Vision Transformers","date":"2024-03-15","arxiv_id":"2403.10030","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-criteria-token-fusion-with-one-step#ran","syntology_url":"https://syntology.ai/paper/2403.10030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10030"}},"official":{"repos":["mlvlab/mctf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/swinmtl-a-shared-architecture-for","slug":"swinmtl-a-shared-architecture-for","title":"SwinMTL: A Shared Architecture for Simultaneous Depth Estimation and Semantic Segmentation from Monocular Camera Images","date":"2024-03-15","arxiv_id":"2403.10662","repositories_listed":1,"syntology":null},{"url":"/paper/t4p-test-time-training-of-trajectory","slug":"t4p-test-time-training-of-trajectory","title":"T4P: Test-Time Training of Trajectory Prediction via Masked Autoencoder and Actor-specific Token Memory","date":"2024-03-15","arxiv_id":"2403.10052","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/t4p-test-time-training-of-trajectory#ran","syntology_url":"https://syntology.ai/paper/2403.10052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10052"}},"official":{"repos":["daeheepark/t4p"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hyper-cl-conditioning-sentence","slug":"hyper-cl-conditioning-sentence","title":"Hyper-CL: Conditioning Sentence Representations with Hypernetworks","date":"2024-03-14","arxiv_id":"2403.09490","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"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) · 1 unverified","sample_list":"/paper/hyper-cl-conditioning-sentence#ran","syntology_url":"https://syntology.ai/paper/2403.09490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09490"}},"official":{"repos":["hyu-nlp/hyper-cl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stainfuser-controlling-diffusion-for-faster","slug":"stainfuser-controlling-diffusion-for-faster","title":"StainFuser: Controlling Diffusion for Faster Neural Style Transfer in Multi-Gigapixel Histology Images","date":"2024-03-14","arxiv_id":"2403.09302","repositories_listed":1,"syntology":null},{"url":"/paper/timemachine-a-time-series-is-worth-4-mambas","slug":"timemachine-a-time-series-is-worth-4-mambas","title":"TimeMachine: A Time Series is Worth 4 Mambas for Long-term Forecasting","date":"2024-03-14","arxiv_id":"2403.09898","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":3,"phrase":"0 ran · 5 unverified","sample_list":"/paper/timemachine-a-time-series-is-worth-4-mambas#ran","syntology_url":"https://syntology.ai/paper/2403.09898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09898"}},"official":{"repos":["atik-ahamed/timemachine"],"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/harder-tasks-need-more-experts-dynamic","slug":"harder-tasks-need-more-experts-dynamic","title":"Harder Tasks Need More Experts: Dynamic Routing in MoE Models","date":"2024-03-12","arxiv_id":"2403.07652","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/harder-tasks-need-more-experts-dynamic#ran","syntology_url":"https://syntology.ai/paper/2403.07652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07652"}},"official":{"repos":["zhenweian/dynamic_moe"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/an-image-is-worth-1-2-tokens-after-layer-2","slug":"an-image-is-worth-1-2-tokens-after-layer-2","title":"An Image is Worth 1/2 Tokens After Layer 2: Plug-and-Play Inference Acceleration for Large Vision-Language Models","date":"2024-03-11","arxiv_id":"2403.06764","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-image-is-worth-1-2-tokens-after-layer-2#ran","syntology_url":"https://syntology.ai/paper/2403.06764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06764"}},"official":{"repos":["pkunlp-icler/fastv"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/fine-grained-pillar-feature-encoding-via","slug":"fine-grained-pillar-feature-encoding-via","title":"Fine-Grained Pillar Feature Encoding Via Spatio-Temporal Virtual Grid for 3D Object Detection","date":"2024-03-11","arxiv_id":"2403.06433","repositories_listed":1,"syntology":null},{"url":"/paper/fast-kernel-scene-flow","slug":"fast-kernel-scene-flow","title":"Fast Kernel Scene Flow","date":"2024-03-09","arxiv_id":"2403.05896","repositories_listed":1,"syntology":null},{"url":"/paper/cogview3-finer-and-faster-text-to-image","slug":"cogview3-finer-and-faster-text-to-image","title":"CogView3: Finer and Faster Text-to-Image Generation via Relay Diffusion","date":"2024-03-08","arxiv_id":"2403.05121","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/cogview3-finer-and-faster-text-to-image#ran","syntology_url":"https://syntology.ai/paper/2403.05121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.05121"}},"official":null}},{"url":"/paper/rfwave-multi-band-rectified-flow-for-audio","slug":"rfwave-multi-band-rectified-flow-for-audio","title":"RFWave: Multi-band Rectified Flow for Audio Waveform Reconstruction","date":"2024-03-08","arxiv_id":"2403.05010","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/rfwave-multi-band-rectified-flow-for-audio#ran","syntology_url":"https://syntology.ai/paper/2403.05010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.05010"}},"official":{"repos":["bfs18/rfwave"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-consensus-constrained-parsimonious-gaussian","slug":"a-consensus-constrained-parsimonious-gaussian","title":"A consensus-constrained parsimonious Gaussian mixture model for clustering hyperspectral images","date":"2024-03-05","arxiv_id":"2403.03349","repositories_listed":1,"syntology":null},{"url":"/paper/arnn-attentive-recurrent-neural-network-for","slug":"arnn-attentive-recurrent-neural-network-for","title":"ARNN: Attentive Recurrent Neural Network for Multi-channel EEG Signals to Identify Epileptic Seizures","date":"2024-03-05","arxiv_id":"2403.03276","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-baseline-for-efficient-hand-mesh","slug":"a-simple-baseline-for-efficient-hand-mesh","title":"A Simple Baseline for Efficient Hand Mesh Reconstruction","date":"2024-03-04","arxiv_id":"2403.01813","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"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) · 6 unverified","sample_list":"/paper/a-simple-baseline-for-efficient-hand-mesh#ran","syntology_url":"https://syntology.ai/paper/2403.01813","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01813"}},"official":null}},{"url":"/paper/hybridizing-traditional-and-next-generation","slug":"hybridizing-traditional-and-next-generation","title":"Hybridizing Traditional and Next-Generation Reservoir Computing to Accurately and Efficiently Forecast Dynamical Systems","date":"2024-03-04","arxiv_id":"2403.18953","repositories_listed":1,"syntology":null},{"url":"/paper/feature-alignment-rethinking-efficient-active","slug":"feature-alignment-rethinking-efficient-active","title":"Feature Alignment: Rethinking Efficient Active Learning via Proxy in the Context of Pre-trained Models","date":"2024-03-02","arxiv_id":"2403.01101","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 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; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/feature-alignment-rethinking-efficient-active#ran","syntology_url":"https://syntology.ai/paper/2403.01101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01101"}},"official":{"repos":["ZiTingW/asvp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-and-interpretable-2d-homography","slug":"fast-and-interpretable-2d-homography","title":"Fast and Interpretable 2D Homography Decomposition: Similarity-Kernel-Similarity and Affine-Core-Affine Transformations","date":"2024-02-28","arxiv_id":"2402.18008","repositories_listed":1,"syntology":null},{"url":"/paper/torchmd-net-2-0-fast-neural-network","slug":"torchmd-net-2-0-fast-neural-network","title":"TorchMD-Net 2.0: Fast Neural Network Potentials for Molecular Simulations","date":"2024-02-27","arxiv_id":"2402.17660","repositories_listed":1,"syntology":null},{"url":"/paper/vital-an-advanced-framework-for-automated","slug":"vital-an-advanced-framework-for-automated","title":"ViTaL: An Advanced Framework for Automated Plant Disease Identification in Leaf Images Using Vision Transformers and Linear Projection For Feature Reduction","date":"2024-02-27","arxiv_id":"2402.17424","repositories_listed":1,"syntology":null},{"url":"/paper/fast-adversarial-attacks-on-language-models","slug":"fast-adversarial-attacks-on-language-models","title":"Fast Adversarial Attacks on Language Models In One GPU Minute","date":"2024-02-23","arxiv_id":"2402.15570","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fast-adversarial-attacks-on-language-models#ran","syntology_url":"https://syntology.ai/paper/2402.15570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15570"}},"official":{"repos":["vinusankars/beast"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mape-ppi-towards-effective-and-efficient","slug":"mape-ppi-towards-effective-and-efficient","title":"MAPE-PPI: Towards Effective and Efficient Protein-Protein Interaction Prediction via Microenvironment-Aware Protein Embedding","date":"2024-02-22","arxiv_id":"2402.14391","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":2,"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/mape-ppi-towards-effective-and-efficient#ran","syntology_url":"https://syntology.ai/paper/2402.14391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14391"}},"official":{"repos":["lirongwu/mape-ppi"],"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/voom-robust-visual-object-odometry-and","slug":"voom-robust-visual-object-odometry-and","title":"VOOM: Robust Visual Object Odometry and Mapping using Hierarchical Landmarks","date":"2024-02-21","arxiv_id":"2402.13609","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-robust-optimal-bidding-of-renewable","slug":"flexible-robust-optimal-bidding-of-renewable","title":"Flexible Robust Optimal Bidding of Renewable Virtual Power Plants in Sequential Markets","date":"2024-02-19","arxiv_id":"2402.12032","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-low-rank-matrix-estimation","slug":"efficient-low-rank-matrix-estimation","title":"Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits","date":"2024-02-17","arxiv_id":"2402.11156","repositories_listed":1,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/efficient-low-rank-matrix-estimation#ran","syntology_url":"https://syntology.ai/paper/2402.11156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11156"}},"official":{"repos":["jajajang/lowpopart"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":9,"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/model-editing-by-pure-fine-tuning","slug":"model-editing-by-pure-fine-tuning","title":"Model Editing by Standard Fine-Tuning","date":"2024-02-16","arxiv_id":"2402.11078","repositories_listed":1,"syntology":{"n":16,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":16,"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) · 10 unverified","sample_list":"/paper/model-editing-by-pure-fine-tuning#ran","syntology_url":"https://syntology.ai/paper/2402.11078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11078"}},"official":{"repos":["au-revoir/model-editing-ft"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/gaussian-ensemble-belief-propagation-for","slug":"gaussian-ensemble-belief-propagation-for","title":"Gaussian Ensemble Belief Propagation for Efficient Inference in High-Dimensional Systems","date":"2024-02-13","arxiv_id":"2402.08193","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-distributed-deep-learning-using","slug":"accelerating-distributed-deep-learning-using","title":"Accelerating Distributed Deep Learning using Lossless Homomorphic Compression","date":"2024-02-12","arxiv_id":"2402.07529","repositories_listed":1,"syntology":null},{"url":"/paper/anchor-based-large-language-models","slug":"anchor-based-large-language-models","title":"Anchor-based Large Language Models","date":"2024-02-12","arxiv_id":"2402.07616","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"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) · 6 unverified","sample_list":"/paper/anchor-based-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2402.07616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07616"}},"official":{"repos":["pangjh3/anllm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/mercury-an-efficiency-benchmark-for-llm-code","slug":"mercury-an-efficiency-benchmark-for-llm-code","title":"Mercury: A Code Efficiency Benchmark for Code Large Language Models","date":"2024-02-12","arxiv_id":"2402.07844","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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","sample_list":"/paper/mercury-an-efficiency-benchmark-for-llm-code#ran","syntology_url":"https://syntology.ai/paper/2402.07844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07844"}},"official":{"repos":["elfsong/mercury"],"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"]}}},{"url":"/paper/domain-adaptable-fine-tune-distillation","slug":"domain-adaptable-fine-tune-distillation","title":"Domain Adaptable Fine-Tune Distillation Framework For Advancing Farm Surveillance","date":"2024-02-10","arxiv_id":"2402.07059","repositories_listed":1,"syntology":null},{"url":"/paper/peeking-with-peak-sequential-nonparametric","slug":"peeking-with-peak-sequential-nonparametric","title":"Peeking with PEAK: Sequential, Nonparametric Composite Hypothesis Tests for Means of Multiple Data Streams","date":"2024-02-09","arxiv_id":"2402.06122","repositories_listed":1,"syntology":null},{"url":"/paper/premier-taco-pretraining-multitask","slug":"premier-taco-pretraining-multitask","title":"Premier-TACO is a Few-Shot Policy Learner: Pretraining Multitask Representation via Temporal Action-Driven Contrastive Loss","date":"2024-02-09","arxiv_id":"2402.06187","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"6 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/premier-taco-pretraining-multitask#ran","syntology_url":"https://syntology.ai/paper/2402.06187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06187"}},"official":{"repos":["premiertaco/premier-taco"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/crema-multimodal-compositional-video","slug":"crema-multimodal-compositional-video","title":"CREMA: Generalizable and Efficient Video-Language Reasoning via Multimodal Modular Fusion","date":"2024-02-08","arxiv_id":"2402.05889","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"8 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/crema-multimodal-compositional-video#ran","syntology_url":"https://syntology.ai/paper/2402.05889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05889"}},"official":{"repos":["Yui010206/CREMA"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/model-based-rl-for-mean-field-games-is-not","slug":"model-based-rl-for-mean-field-games-is-not","title":"Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL","date":"2024-02-08","arxiv_id":"2402.05724","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-based-rl-for-mean-field-games-is-not#ran","syntology_url":"https://syntology.ai/paper/2402.05724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05724"}},"official":{"repos":["jiaweihhuang/heuristic_mebp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/beblid-boosted-efficient-binary-local-image","slug":"beblid-boosted-efficient-binary-local-image","title":"BEBLID: Boosted efficient binary local image descriptor","date":"2024-02-07","arxiv_id":"2402.04482","repositories_listed":1,"syntology":null},{"url":"/paper/mamba-unet-unet-like-pure-visual-mamba-for","slug":"mamba-unet-unet-like-pure-visual-mamba-for","title":"Mamba-UNet: UNet-Like Pure Visual Mamba for Medical Image Segmentation","date":"2024-02-07","arxiv_id":"2402.05079","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mamba-unet-unet-like-pure-visual-mamba-for#ran","syntology_url":"https://syntology.ai/paper/2402.05079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05079"}},"official":{"repos":["ziyangwang007/mamba-unet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"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/partially-stochastic-infinitely-deep-bayesian","slug":"partially-stochastic-infinitely-deep-bayesian","title":"Partially Stochastic Infinitely Deep Bayesian Neural Networks","date":"2024-02-05","arxiv_id":"2402.03495","repositories_listed":1,"syntology":{"n":17,"n_ran":10,"n_constructed":0,"n_ran_checked":1,"n_instrument":9,"n_unverified":7,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":17,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 9 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/partially-stochastic-infinitely-deep-bayesian#ran","syntology_url":"https://syntology.ai/paper/2402.03495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03495"}},"official":{"repos":["sergio20f/part_stoch_inf_deep"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-multi-modal-model-predictive-control","slug":"scalable-multi-modal-model-predictive-control","title":"Scalable Multi-modal Model Predictive Control via Duality-based Interaction Predictions","date":"2024-02-02","arxiv_id":"2402.01116","repositories_listed":1,"syntology":null},{"url":"/paper/graph-mamba-towards-long-range-graph-sequence","slug":"graph-mamba-towards-long-range-graph-sequence","title":"Graph-Mamba: Towards Long-Range Graph Sequence Modeling with Selective State Spaces","date":"2024-02-01","arxiv_id":"2402.00789","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-mamba-towards-long-range-graph-sequence#ran","syntology_url":"https://syntology.ai/paper/2402.00789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.00789"}},"official":null}},{"url":"/paper/multivariate-probabilistic-time-series","slug":"multivariate-probabilistic-time-series","title":"Multivariate Probabilistic Time Series Forecasting with Correlated Errors","date":"2024-02-01","arxiv_id":"2402.01000","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multivariate-probabilistic-time-series#ran","syntology_url":"https://syntology.ai/paper/2402.01000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01000"}},"official":{"repos":["rottenivy/mv_pts_correlatederr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/speeding-up-and-reducing-memory-usage-for","slug":"speeding-up-and-reducing-memory-usage-for","title":"Speeding up and reducing memory usage for scientific machine learning via mixed precision","date":"2024-01-30","arxiv_id":"2401.16645","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":0,"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/speeding-up-and-reducing-memory-usage-for#ran","syntology_url":"https://syntology.ai/paper/2401.16645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16645"}},"official":{"repos":["lu-group/mixed-precision-sciml"],"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/data-driven-filter-design-in-fbp-transforming","slug":"data-driven-filter-design-in-fbp-transforming","title":"Data-Driven Filter Design in FBP: Transforming CT Reconstruction with Trainable Fourier Series","date":"2024-01-29","arxiv_id":"2401.16039","repositories_listed":1,"syntology":null},{"url":"/paper/open-radvlad-fast-and-robust-radar-place","slug":"open-radvlad-fast-and-robust-radar-place","title":"Open-RadVLAD: Fast and Robust Radar Place Recognition","date":"2024-01-27","arxiv_id":"2401.15380","repositories_listed":1,"syntology":null},{"url":"/paper/computationally-efficient-linear-periodically","slug":"computationally-efficient-linear-periodically","title":"Linear Periodically Time-Variant Digital PLL Phase Noise Modeling Using Conversion Matrices and Uncorrelated Upsampling","date":"2024-01-25","arxiv_id":"2401.13897","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-manipulate-artistic-images","slug":"learning-to-manipulate-artistic-images","title":"Learning to Manipulate Artistic Images","date":"2024-01-25","arxiv_id":"2401.13976","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/learning-to-manipulate-artistic-images#ran","syntology_url":"https://syntology.ai/paper/2401.13976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.13976"}},"official":{"repos":["snailforce/sim-net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unified-width-adaptive-dynamic-network-for","slug":"unified-width-adaptive-dynamic-network-for","title":"Unified-Width Adaptive Dynamic Network for All-In-One Image Restoration","date":"2024-01-24","arxiv_id":"2401.13221","repositories_listed":1,"syntology":null},{"url":"/paper/cis-unet-multi-class-segmentation-of-the","slug":"cis-unet-multi-class-segmentation-of-the","title":"CIS-UNet: Multi-Class Segmentation of the Aorta in Computed Tomography Angiography via Context-Aware Shifted Window Self-Attention","date":"2024-01-23","arxiv_id":"2401.13049","repositories_listed":1,"syntology":null},{"url":"/paper/falcon-fair-active-learning-using-multi-armed","slug":"falcon-fair-active-learning-using-multi-armed","title":"Falcon: Fair Active Learning using Multi-armed Bandits","date":"2024-01-23","arxiv_id":"2401.12722","repositories_listed":1,"syntology":null},{"url":"/paper/texttt-immrax-a-parallelizable-and","slug":"texttt-immrax-a-parallelizable-and","title":"$\\texttt{immrax}$: A Parallelizable and Differentiable Toolbox for Interval Analysis and Mixed Monotone Reachability in JAX","date":"2024-01-21","arxiv_id":"2401.11608","repositories_listed":1,"syntology":null},{"url":"/paper/i-splitee-image-classification-in-split","slug":"i-splitee-image-classification-in-split","title":"I-SplitEE: Image classification in Split Computing DNNs with Early Exits","date":"2024-01-19","arxiv_id":"2401.10541","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/i-splitee-image-classification-in-split#ran","syntology_url":"https://syntology.ai/paper/2401.10541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10541"}},"official":{"repos":["Div290/I-SplitEE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/functional-autoencoder-for-smoothing-and","slug":"functional-autoencoder-for-smoothing-and","title":"Functional Autoencoder for Smoothing and Representation Learning","date":"2024-01-17","arxiv_id":"2401.09499","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"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) · 6 unverified","sample_list":"/paper/functional-autoencoder-for-smoothing-and#ran","syntology_url":"https://syntology.ai/paper/2401.09499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09499"}},"official":{"repos":["cedricbeaulac/fae"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/input-convex-lipschitz-rnn-a-fast-and-robust","slug":"input-convex-lipschitz-rnn-a-fast-and-robust","title":"Input Convex Lipschitz RNN: A Fast and Robust Approach for Engineering Tasks","date":"2024-01-15","arxiv_id":"2401.07494","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-quantification-for-probabilistic","slug":"uncertainty-quantification-for-probabilistic","title":"Uncertainty quantification for probabilistic machine learning in earth observation using conformal prediction","date":"2024-01-12","arxiv_id":"2401.06421","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-for-functional-data-1","slug":"feature-selection-for-functional-data-1","title":"A new computationally efficient algorithm to solve Feature Selection for Functional Data Classification in high-dimensional spaces","date":"2024-01-11","arxiv_id":"2401.05765","repositories_listed":1,"syntology":null},{"url":"/paper/trips-trilinear-point-splatting-for-real-time","slug":"trips-trilinear-point-splatting-for-real-time","title":"TRIPS: Trilinear Point Splatting for Real-Time Radiance Field Rendering","date":"2024-01-11","arxiv_id":"2401.06003","repositories_listed":1,"syntology":null},{"url":"/paper/gridformer-point-grid-transformer-for-surface","slug":"gridformer-point-grid-transformer-for-surface","title":"GridFormer: Point-Grid Transformer for Surface Reconstruction","date":"2024-01-04","arxiv_id":"2401.02292","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":6,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gridformer-point-grid-transformer-for-surface#ran","syntology_url":"https://syntology.ai/paper/2401.02292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.02292"}},"official":{"repos":["list17/gridformer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":6,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/haaqi-net-a-non-intrusive-neural-music","slug":"haaqi-net-a-non-intrusive-neural-music","title":"HAAQI-Net: A Non-intrusive Neural Music Audio Quality Assessment Model for Hearing Aids","date":"2024-01-02","arxiv_id":"2401.01145","repositories_listed":1,"syntology":null},{"url":"/paper/specformer-guarding-vision-transformer","slug":"specformer-guarding-vision-transformer","title":"SpecFormer: Guarding Vision Transformer Robustness via Maximum Singular Value Penalization","date":"2024-01-02","arxiv_id":"2402.03317","repositories_listed":1,"syntology":null},{"url":"/paper/look-up-table-compression-for-efficient-image","slug":"look-up-table-compression-for-efficient-image","title":"Look-Up Table Compression for Efficient Image Restoration","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-multi-scale-network-with-learnable","slug":"efficient-multi-scale-network-with-learnable","title":"Efficient Multi-scale Network with Learnable Discrete Wavelet Transform for Blind Motion Deblurring","date":"2023-12-29","arxiv_id":"2401.00027","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":12,"phrase":"9 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-multi-scale-network-with-learnable#ran","syntology_url":"https://syntology.ai/paper/2401.00027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00027"}},"official":{"repos":["thqiu0419/mlwnet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/finite-time-frequentist-regret-bounds-of","slug":"finite-time-frequentist-regret-bounds-of","title":"Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs","date":"2023-12-24","arxiv_id":"2312.15549","repositories_listed":1,"syntology":null},{"url":"/paper/mgdepth-motion-guided-cost-volume-for-self","slug":"mgdepth-motion-guided-cost-volume-for-self","title":"Manydepth2: Motion-Aware Self-Supervised Multi-Frame Monocular Depth Estimation in Dynamic Scenes","date":"2023-12-23","arxiv_id":"2312.15268","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":0,"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/mgdepth-motion-guided-cost-volume-for-self#ran","syntology_url":"https://syntology.ai/paper/2312.15268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.15268"}},"official":null}},{"url":"/paper/kernel-heterogeneity-improves-sparseness-of","slug":"kernel-heterogeneity-improves-sparseness-of","title":"Kernel Heterogeneity Improves Sparseness of Natural Images Representations","date":"2023-12-22","arxiv_id":"2312.14685","repositories_listed":1,"syntology":null},{"url":"/paper/zeroshape-regression-based-zero-shot-shape","slug":"zeroshape-regression-based-zero-shot-shape","title":"ZeroShape: Regression-based Zero-shot Shape Reconstruction","date":"2023-12-21","arxiv_id":"2312.14198","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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","sample_list":"/paper/zeroshape-regression-based-zero-shot-shape#ran","syntology_url":"https://syntology.ai/paper/2312.14198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14198"}},"official":{"repos":["zxhuang1698/ZeroShape"],"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"]}}},{"url":"/paper/enhancing-trade-offs-in-privacy-utility-and","slug":"enhancing-trade-offs-in-privacy-utility-and","title":"Enhancing Trade-offs in Privacy, Utility, and Computational Efficiency through MUltistage Sampling Technique (MUST)","date":"2023-12-20","arxiv_id":"2312.13389","repositories_listed":1,"syntology":null}],"record_sha256":"6e0dfe4897627269bf96a81aaa6a240d61e1e0d2c7da5b80f1cf604337275bb4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}