{"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/7","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":7,"pages_in_order":49,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/computational-efficiency/papers/8","papers":[{"url":"/paper/iterative-distributed-multinomial-regression","slug":"iterative-distributed-multinomial-regression","title":"Iterative Distributed Multinomial Regression","date":"2024-12-02","arxiv_id":"2412.01030","repositories_listed":1,"syntology":null},{"url":"/paper/rilq-rank-insensitive-lora-based-quantization","slug":"rilq-rank-insensitive-lora-based-quantization","title":"RILQ: Rank-Insensitive LoRA-based Quantization Error Compensation for Boosting 2-bit Large Language Model Accuracy","date":"2024-12-02","arxiv_id":"2412.01129","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rilq-rank-insensitive-lora-based-quantization#ran","syntology_url":"https://syntology.ai/paper/2412.01129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.01129"}},"official":{"repos":["aiha-lab/rilq"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/2dmamba-efficient-state-space-model-for-image","slug":"2dmamba-efficient-state-space-model-for-image","title":"2DMamba: Efficient State Space Model for Image Representation with Applications on Giga-Pixel Whole Slide Image Classification","date":"2024-12-01","arxiv_id":"2412.00678","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":1,"n_no_contract":5,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/2dmamba-efficient-state-space-model-for-image#ran","syntology_url":"https://syntology.ai/paper/2412.00678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.00678"}},"official":{"repos":["atlasanalyticslab/2dmamba"],"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/dssrnn-decomposition-enhanced-state-space","slug":"dssrnn-decomposition-enhanced-state-space","title":"DSSRNN: Decomposition-Enhanced State-Space Recurrent Neural Network for Time-Series Analysis","date":"2024-12-01","arxiv_id":"2412.00994","repositories_listed":1,"syntology":null},{"url":"/paper/nonlinearity-and-uncertainty-informed-moment","slug":"nonlinearity-and-uncertainty-informed-moment","title":"Nonlinearity and Uncertainty Informed Moment-Matching Gaussian Mixture Splitting","date":"2024-11-30","arxiv_id":"2412.00343","repositories_listed":1,"syntology":null},{"url":"/paper/wafer2spike-spiking-neural-network-for-wafer","slug":"wafer2spike-spiking-neural-network-for-wafer","title":"Wafer2Spike: Spiking Neural Network for Wafer Map Pattern Classification","date":"2024-11-29","arxiv_id":"2411.19422","repositories_listed":1,"syntology":null},{"url":"/paper/controlling-participation-in-federated","slug":"controlling-participation-in-federated","title":"Controlling Participation in Federated Learning with Feedback","date":"2024-11-28","arxiv_id":"2411.19242","repositories_listed":1,"syntology":null},{"url":"/paper/l4acados-learning-based-models-for-acados","slug":"l4acados-learning-based-models-for-acados","title":"L4acados: Learning-based models for acados, applied to Gaussian process-based predictive control","date":"2024-11-28","arxiv_id":"2411.19258","repositories_listed":1,"syntology":null},{"url":"/paper/a-runtime-adaptive-transformer-neural-network","slug":"a-runtime-adaptive-transformer-neural-network","title":"A Runtime-Adaptive Transformer Neural Network Accelerator on FPGAs","date":"2024-11-27","arxiv_id":"2411.18148","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-logistic-ensembles-with-recursive","slug":"dynamic-logistic-ensembles-with-recursive","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","date":"2024-11-27","arxiv_id":"2411.18649","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-effectiveness-of-incremental-training","slug":"on-the-effectiveness-of-incremental-training","title":"On the Effectiveness of Incremental Training of Large Language Models","date":"2024-11-27","arxiv_id":"2411.18700","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-deployment-of-transformer-models-in","slug":"efficient-deployment-of-transformer-models-in","title":"Efficient Deployment of Transformer Models in Analog In-Memory Computing Hardware","date":"2024-11-26","arxiv_id":"2411.17367","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-character-level-understanding-in","slug":"enhancing-character-level-understanding-in","title":"Enhancing Character-Level Understanding in LLMs through Token Internal Structure Learning","date":"2024-11-26","arxiv_id":"2411.17679","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-efficiency-of-nlp-inspired-methods-for","slug":"on-the-efficiency-of-nlp-inspired-methods-for","title":"On the Efficiency of NLP-Inspired Methods for Tabular Deep Learning","date":"2024-11-26","arxiv_id":"2411.17207","repositories_listed":1,"syntology":null},{"url":"/paper/star-attention-efficient-llm-inference-over","slug":"star-attention-efficient-llm-inference-over","title":"Star Attention: Efficient LLM Inference over Long Sequences","date":"2024-11-26","arxiv_id":"2411.17116","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/star-attention-efficient-llm-inference-over#ran","syntology_url":"https://syntology.ai/paper/2411.17116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17116"}},"official":{"repos":["NVIDIA/Star-Attention"],"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/flow-annealed-importance-sampling-bootstrap-1","slug":"flow-annealed-importance-sampling-bootstrap-1","title":"Flow Annealed Importance Sampling Bootstrap meets Differentiable Particle Physics","date":"2024-11-25","arxiv_id":"2411.16234","repositories_listed":1,"syntology":null},{"url":"/paper/vicon-vision-in-context-operator-networks-for","slug":"vicon-vision-in-context-operator-networks-for","title":"VICON: Vision In-Context Operator Networks for Multi-Physics Fluid Dynamics Prediction","date":"2024-11-25","arxiv_id":"2411.16063","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-ternary-weight-embedding-model","slug":"efficient-ternary-weight-embedding-model","title":"Efficient Ternary Weight Embedding Model: Bridging Scalability and Performance","date":"2024-11-23","arxiv_id":"2411.15438","repositories_listed":1,"syntology":null},{"url":"/paper/ldm-morph-latent-diffusion-model-guided","slug":"ldm-morph-latent-diffusion-model-guided","title":"LDM-Morph: Latent diffusion model guided deformable image registration","date":"2024-11-23","arxiv_id":"2411.15426","repositories_listed":1,"syntology":null},{"url":"/paper/multi-scale-cascaded-large-model-for-whole","slug":"multi-scale-cascaded-large-model-for-whole","title":"Multi-scale Cascaded Large-Model for Whole-body ROI Segmentation","date":"2024-11-23","arxiv_id":"2411.15526","repositories_listed":1,"syntology":null},{"url":"/paper/tangnn-a-concise-scalable-and-effective-graph","slug":"tangnn-a-concise-scalable-and-effective-graph","title":"TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning","date":"2024-11-23","arxiv_id":"2411.15458","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-way-kronecker-factored-approximate","slug":"a-new-way-kronecker-factored-approximate","title":"A New Way: Kronecker-Factored Approximate Curvature Deep Hedging and its Benefits","date":"2024-11-22","arxiv_id":"2411.15002","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-kolmogorov-arnold-networks-for-1","slug":"exploring-kolmogorov-arnold-networks-for-1","title":"Exploring Kolmogorov-Arnold Networks for Interpretable Time Series Classification","date":"2024-11-22","arxiv_id":"2411.14904","repositories_listed":1,"syntology":null},{"url":"/paper/mambairv2-attentive-state-space-restoration","slug":"mambairv2-attentive-state-space-restoration","title":"MambaIRv2: Attentive State Space Restoration","date":"2024-11-22","arxiv_id":"2411.15269","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/mambairv2-attentive-state-space-restoration#ran","syntology_url":"https://syntology.ai/paper/2411.15269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15269"}},"official":{"repos":["csguoh/mambair"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/nd-bimamba2-a-unified-bidirectional","slug":"nd-bimamba2-a-unified-bidirectional","title":"Nd-BiMamba2: A Unified Bidirectional Architecture for Multi-Dimensional Data Processing","date":"2024-11-22","arxiv_id":"2411.15380","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-and-parametric-avatar-pose-and-shape","slug":"implicit-and-parametric-avatar-pose-and-shape","title":"Implicit and Parametric Avatar Pose and Shape Estimation From a Single Frontal Image of a Clothed Human","date":"2024-11-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/umbrella-reinforcement-learning","slug":"umbrella-reinforcement-learning","title":"Umbrella Reinforcement Learning -- computationally efficient tool for hard non-linear problems","date":"2024-11-21","arxiv_id":"2411.14117","repositories_listed":1,"syntology":null},{"url":"/paper/when-precision-meets-position-bfloat16-breaks","slug":"when-precision-meets-position-bfloat16-breaks","title":"When Precision Meets Position: BFloat16 Breaks Down RoPE in Long-Context Training","date":"2024-11-20","arxiv_id":"2411.13476","repositories_listed":1,"syntology":null},{"url":"/paper/data-to-model-distillation-data-efficient","slug":"data-to-model-distillation-data-efficient","title":"Data-to-Model Distillation: Data-Efficient Learning Framework","date":"2024-11-19","arxiv_id":"2411.12841","repositories_listed":1,"syntology":null},{"url":"/paper/fgp-feature-gradient-prune-for-efficient","slug":"fgp-feature-gradient-prune-for-efficient","title":"FGP: Feature-Gradient-Prune for Efficient Convolutional Layer Pruning","date":"2024-11-19","arxiv_id":"2411.12781","repositories_listed":1,"syntology":null},{"url":"/paper/sefd-semantic-enhanced-framework-for","slug":"sefd-semantic-enhanced-framework-for","title":"SEFD: Semantic-Enhanced Framework for Detecting LLM-Generated Text","date":"2024-11-17","arxiv_id":"2411.12764","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/sefd-semantic-enhanced-framework-for#ran","syntology_url":"https://syntology.ai/paper/2411.12764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.12764"}},"official":{"repos":["hwq0726/sefd"],"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/lora-unlearns-more-and-retains-more-student","slug":"lora-unlearns-more-and-retains-more-student","title":"LoRA Unlearns More and Retains More (Student Abstract)","date":"2024-11-16","arxiv_id":"2411.11907","repositories_listed":1,"syntology":null},{"url":"/paper/local-global-attention-an-adaptive-mechanism","slug":"local-global-attention-an-adaptive-mechanism","title":"Local-Global Attention: An Adaptive Mechanism for Multi-Scale Feature Integration","date":"2024-11-14","arxiv_id":"2411.09604","repositories_listed":1,"syntology":null},{"url":"/paper/when-mamba-meets-xlstm-an-efficient-and","slug":"when-mamba-meets-xlstm-an-efficient-and","title":"When Mamba Meets xLSTM: An Efficient and Precise Method with the xLSTM-VMUNet Model for Skin lesion Segmentation","date":"2024-11-14","arxiv_id":"2411.09363","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-accelerated-quantum-transport","slug":"deep-learning-accelerated-quantum-transport","title":"Deep Learning Accelerated Quantum Transport Simulations in Nanoelectronics: From Break Junctions to Field-Effect Transistors","date":"2024-11-13","arxiv_id":"2411.08800","repositories_listed":1,"syntology":null},{"url":"/paper/dbgdel-database-enhanced-gene-deletion","slug":"dbgdel-database-enhanced-gene-deletion","title":"DBgDel: Database-Enhanced Gene Deletion Framework for Growth-Coupled Production in Genome-Scale Metabolic Models","date":"2024-11-12","arxiv_id":"2411.08077","repositories_listed":1,"syntology":null},{"url":"/paper/wavelet-latent-diffusion-wala-billion","slug":"wavelet-latent-diffusion-wala-billion","title":"Wavelet Latent Diffusion (Wala): Billion-Parameter 3D Generative Model with Compact Wavelet Encodings","date":"2024-11-12","arxiv_id":"2411.08017","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-moral-machine-experiment-on-large","slug":"large-scale-moral-machine-experiment-on-large","title":"Large-scale moral machine experiment on large language models","date":"2024-11-11","arxiv_id":"2411.06790","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/large-scale-moral-machine-experiment-on-large#ran","syntology_url":"https://syntology.ai/paper/2411.06790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06790"}},"official":{"repos":["kztakemoto/mmllm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-for-modelling-breast","slug":"graph-neural-networks-for-modelling-breast","title":"Graph Neural Networks for modelling breast biomechanical compression","date":"2024-11-10","arxiv_id":"2411.06596","repositories_listed":1,"syntology":null},{"url":"/paper/lssinst-improving-geometric-modeling-in-lss","slug":"lssinst-improving-geometric-modeling-in-lss","title":"LSSInst: Improving Geometric Modeling in LSS-Based BEV Perception with Instance Representation","date":"2024-11-09","arxiv_id":"2411.06173","repositories_listed":1,"syntology":null},{"url":"/paper/effects-of-charging-and-discharging","slug":"effects-of-charging-and-discharging","title":"Effects of charging and discharging capabilities on trade-offs between model accuracy and computational efficiency in pumped thermal electricity storage","date":"2024-11-08","arxiv_id":"2411.07805","repositories_listed":1,"syntology":null},{"url":"/paper/physics-constrained-coupled-neural","slug":"physics-constrained-coupled-neural","title":"Physics-constrained coupled neural differential equations for one dimensional blood flow modeling","date":"2024-11-08","arxiv_id":"2411.05631","repositories_listed":1,"syntology":null},{"url":"/paper/variance-aware-linear-ucb-with-deep","slug":"variance-aware-linear-ucb-with-deep","title":"Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits","date":"2024-11-08","arxiv_id":"2411.05979","repositories_listed":1,"syntology":null},{"url":"/paper/energy-based-physics-informed-neural-network","slug":"energy-based-physics-informed-neural-network","title":"Energy-based physics-informed neural network for frictionless contact problems under large deformation","date":"2024-11-06","arxiv_id":"2411.03671","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-graph-based-machine","slug":"privacy-preserving-graph-based-machine","title":"Privacy-Preserving Graph-Based Machine Learning with Fully Homomorphic Encryption for Collaborative Anti-Money Laundering","date":"2024-11-05","arxiv_id":"2411.02926","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/privacy-preserving-graph-based-machine#ran","syntology_url":"https://syntology.ai/paper/2411.02926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02926"}},"official":{"repos":["fabecode/GraphML-FHE"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/real-time-polygonal-semantic-mapping-for","slug":"real-time-polygonal-semantic-mapping-for","title":"Real-Time Polygonal Semantic Mapping for Humanoid Robot Stair Climbing","date":"2024-11-04","arxiv_id":"2411.01919","repositories_listed":1,"syntology":null},{"url":"/paper/an-algorithm-for-two-player-repeated-games","slug":"an-algorithm-for-two-player-repeated-games","title":"An algorithm for two-player repeated games with imperfect public monitoring","date":"2024-11-03","arxiv_id":"2411.01566","repositories_listed":1,"syntology":null},{"url":"/paper/cross-d-conv-cross-dimensional-transferable","slug":"cross-d-conv-cross-dimensional-transferable","title":"Cross-D Conv: Cross-Dimensional Transferable Knowledge Base via Fourier Shifting Operation","date":"2024-11-02","arxiv_id":"2411.02441","repositories_listed":1,"syntology":null},{"url":"/paper/birdie-advancing-state-space-models-with","slug":"birdie-advancing-state-space-models-with","title":"Birdie: Advancing State Space Models with Reward-Driven Objectives and Curricula","date":"2024-11-01","arxiv_id":"2411.01030","repositories_listed":1,"syntology":null},{"url":"/paper/ps-dag-projected-stochastic-approximation","slug":"ps-dag-projected-stochastic-approximation","title":"$ψ$DAG: Projected Stochastic Approximation Iteration for DAG Structure Learning","date":"2024-10-31","arxiv_id":"2410.23862","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/ps-dag-projected-stochastic-approximation#ran","syntology_url":"https://syntology.ai/paper/2410.23862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23862"}},"official":{"repos":["kz29/-psiDAG"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-walsh-hadamard-derived-linear-vector","slug":"a-walsh-hadamard-derived-linear-vector","title":"A Walsh Hadamard Derived Linear Vector Symbolic Architecture","date":"2024-10-30","arxiv_id":"2410.22669","repositories_listed":1,"syntology":null},{"url":"/paper/buzz-beehive-structured-sparse-kv-cache-with","slug":"buzz-beehive-structured-sparse-kv-cache-with","title":"BUZZ: Beehive-structured Sparse KV Cache with Segmented Heavy Hitters for Efficient LLM Inference","date":"2024-10-30","arxiv_id":"2410.23079","repositories_listed":1,"syntology":null},{"url":"/paper/comparative-analysis-of-demonstration","slug":"comparative-analysis-of-demonstration","title":"Comparative Analysis of Demonstration Selection Algorithms for LLM In-Context Learning","date":"2024-10-30","arxiv_id":"2410.23099","repositories_listed":1,"syntology":null},{"url":"/paper/skipsnn-efficiently-classifying-spike-trains","slug":"skipsnn-efficiently-classifying-spike-trains","title":"SkipSNN: Efficiently Classifying Spike Trains with Event-attention","date":"2024-10-29","arxiv_id":"2411.05806","repositories_listed":1,"syntology":null},{"url":"/paper/a-temporal-linear-network-for-time-series","slug":"a-temporal-linear-network-for-time-series","title":"A Temporal Linear Network for Time Series Forecasting","date":"2024-10-28","arxiv_id":"2410.21448","repositories_listed":1,"syntology":null},{"url":"/paper/atlas-adapting-trajectory-lengths-and-step","slug":"atlas-adapting-trajectory-lengths-and-step","title":"ATLAS: Adapting Trajectory Lengths and Step-Size for Hamiltonian Monte Carlo","date":"2024-10-28","arxiv_id":"2410.21587","repositories_listed":1,"syntology":null},{"url":"/paper/bidirectional-recurrence-for-cardiac-motion","slug":"bidirectional-recurrence-for-cardiac-motion","title":"Bidirectional Recurrence for Cardiac Motion Tracking with Gaussian Process Latent Coding","date":"2024-10-28","arxiv_id":"2410.20752","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/bidirectional-recurrence-for-cardiac-motion#ran","syntology_url":"https://syntology.ai/paper/2410.20752","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.20752"}},"official":{"repos":["xmed-lab/gptrack"],"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/fast-calibrated-explanations-efficient-and","slug":"fast-calibrated-explanations-efficient-and","title":"Fast Calibrated Explanations: Efficient and Uncertainty-Aware Explanations for Machine Learning Models","date":"2024-10-28","arxiv_id":"2410.21129","repositories_listed":1,"syntology":null},{"url":"/paper/neural-hamilton-can-a-i-understand","slug":"neural-hamilton-can-a-i-understand","title":"Neural Hamilton: Can A.I. Understand Hamiltonian Mechanics?","date":"2024-10-28","arxiv_id":"2410.20951","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-direct-preference-optimization","slug":"accelerating-direct-preference-optimization","title":"Accelerating Direct Preference Optimization with Prefix Sharing","date":"2024-10-27","arxiv_id":"2410.20305","repositories_listed":1,"syntology":null},{"url":"/paper/cgkn-a-deep-learning-framework-for-modeling","slug":"cgkn-a-deep-learning-framework-for-modeling","title":"CGKN: A Deep Learning Framework for Modeling Complex Dynamical Systems and Efficient Data Assimilation","date":"2024-10-26","arxiv_id":"2410.20072","repositories_listed":1,"syntology":null},{"url":"/paper/clap-i-resolving-miscalibration-for-deep","slug":"clap-i-resolving-miscalibration-for-deep","title":"CLAP. I. Resolving miscalibration for deep learning-based galaxy photometric redshift estimation","date":"2024-10-25","arxiv_id":"2410.19390","repositories_listed":1,"syntology":null},{"url":"/paper/larctan-skan-simple-and-efficient-single","slug":"larctan-skan-simple-and-efficient-single","title":"LArctan-SKAN: Simple and Efficient Single-Parameterized Kolmogorov-Arnold Networks using Learnable Trigonometric Function","date":"2024-10-25","arxiv_id":"2410.19360","repositories_listed":1,"syntology":null},{"url":"/paper/not-all-heads-matter-a-head-level-kv-cache","slug":"not-all-heads-matter-a-head-level-kv-cache","title":"Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and Reasoning","date":"2024-10-25","arxiv_id":"2410.19258","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/not-all-heads-matter-a-head-level-kv-cache#ran","syntology_url":"https://syntology.ai/paper/2410.19258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.19258"}},"official":{"repos":["fyyfu/headkv"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-neural-implicit-representation-for","slug":"efficient-neural-implicit-representation-for","title":"Efficient Neural Implicit Representation for 3D Human Reconstruction","date":"2024-10-23","arxiv_id":"2410.17741","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-random-feature-latent-variable","slug":"scalable-random-feature-latent-variable","title":"Scalable Random Feature Latent Variable Models","date":"2024-10-23","arxiv_id":"2410.17700","repositories_listed":1,"syntology":null},{"url":"/paper/yolov11-an-overview-of-the-key-architectural","slug":"yolov11-an-overview-of-the-key-architectural","title":"YOLOv11: An Overview of the Key Architectural Enhancements","date":"2024-10-23","arxiv_id":"2410.17725","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-logistic-bandits","slug":"combinatorial-logistic-bandits","title":"Combinatorial Logistic Bandits","date":"2024-10-22","arxiv_id":"2410.17075","repositories_listed":1,"syntology":null},{"url":"/paper/kanice-kolmogorov-arnold-networks-with","slug":"kanice-kolmogorov-arnold-networks-with","title":"KANICE: Kolmogorov-Arnold Networks with Interactive Convolutional Elements","date":"2024-10-22","arxiv_id":"2410.17172","repositories_listed":1,"syntology":null},{"url":"/paper/language-model-non-myopic-generation-for","slug":"language-model-non-myopic-generation-for","title":"Non-myopic Generation of Language Models for Reasoning and Planning","date":"2024-10-22","arxiv_id":"2410.17195","repositories_listed":1,"syntology":null},{"url":"/paper/linear-partial-gromov-wasserstein-embedding","slug":"linear-partial-gromov-wasserstein-embedding","title":"Linear Partial Gromov-Wasserstein Embedding","date":"2024-10-22","arxiv_id":"2410.16669","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/linear-partial-gromov-wasserstein-embedding#ran","syntology_url":"https://syntology.ai/paper/2410.16669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16669"}},"official":{"repos":["mint-vu/linearized_partial_gromov_wasserstein"],"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/s-cfe-simple-counterfactual-explanations","slug":"s-cfe-simple-counterfactual-explanations","title":"S-CFE: Simple Counterfactual Explanations","date":"2024-10-21","arxiv_id":"2410.15723","repositories_listed":1,"syntology":null},{"url":"/paper/interweaving-insights-high-order-feature","slug":"interweaving-insights-high-order-feature","title":"Interweaving Insights: High-Order Feature Interaction for Fine-Grained Visual Recognition","date":"2024-10-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lora-ir-taming-low-rank-experts-for-efficient","slug":"lora-ir-taming-low-rank-experts-for-efficient","title":"LoRA-IR: Taming Low-Rank Experts for Efficient All-in-One Image Restoration","date":"2024-10-20","arxiv_id":"2410.15385","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/lora-ir-taming-low-rank-experts-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2410.15385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15385"}},"official":{"repos":["shallowdream204/lora-ir"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fitv2-scalable-and-improved-flexible-vision","slug":"fitv2-scalable-and-improved-flexible-vision","title":"FiTv2: Scalable and Improved Flexible Vision Transformer for Diffusion Model","date":"2024-10-17","arxiv_id":"2410.13925","repositories_listed":1,"syntology":null},{"url":"/paper/learning-efficient-representations-of","slug":"learning-efficient-representations-of","title":"Learning Efficient Representations of Neutrino Telescope Events","date":"2024-10-17","arxiv_id":"2410.13148","repositories_listed":1,"syntology":null},{"url":"/paper/quamba-a-post-training-quantization-recipe","slug":"quamba-a-post-training-quantization-recipe","title":"Quamba: A Post-Training Quantization Recipe for Selective State Space Models","date":"2024-10-17","arxiv_id":"2410.13229","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/quamba-a-post-training-quantization-recipe#ran","syntology_url":"https://syntology.ai/paper/2410.13229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13229"}},"official":{"repos":["enyac-group/quamba"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/supervised-kernel-thinning","slug":"supervised-kernel-thinning","title":"Supervised Kernel Thinning","date":"2024-10-17","arxiv_id":"2410.13749","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/supervised-kernel-thinning#ran","syntology_url":"https://syntology.ai/paper/2410.13749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13749"}},"official":{"repos":["ag2435/npr"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-prototype-evolving-for-test-time","slug":"dual-prototype-evolving-for-test-time","title":"Dual Prototype Evolving for Test-Time Generalization of Vision-Language Models","date":"2024-10-16","arxiv_id":"2410.12790","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/dual-prototype-evolving-for-test-time#ran","syntology_url":"https://syntology.ai/paper/2410.12790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12790"}},"official":{"repos":["zhangce01/DPE-CLIP"],"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/a-dpo-adaptive-reward-margin-is-what-direct","slug":"a-dpo-adaptive-reward-margin-is-what-direct","title":"$α$-DPO: Adaptive Reward Margin is What Direct Preference Optimization Needs","date":"2024-10-14","arxiv_id":"2410.10148","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":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-dpo-adaptive-reward-margin-is-what-direct#ran","syntology_url":"https://syntology.ai/paper/2410.10148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10148"}},"official":{"repos":["junkangwu/alpha-dpo"],"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/free-video-llm-prompt-guided-visual","slug":"free-video-llm-prompt-guided-visual","title":"Free Video-LLM: Prompt-guided Visual Perception for Efficient Training-free Video LLMs","date":"2024-10-14","arxiv_id":"2410.10441","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-model-evaluation-via-matrix-1","slug":"large-language-model-evaluation-via-matrix-1","title":"Large Language Model Evaluation via Matrix Nuclear-Norm","date":"2024-10-14","arxiv_id":"2410.10672","repositories_listed":1,"syntology":null},{"url":"/paper/sglp-a-similarity-guided-fast-layer-partition","slug":"sglp-a-similarity-guided-fast-layer-partition","title":"SGLP: A Similarity Guided Fast Layer Partition Pruning for Compressing Large Deep Models","date":"2024-10-14","arxiv_id":"2410.14720","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-longitudinal-experiments","slug":"large-scale-longitudinal-experiments","title":"Large Scale Longitudinal Experiments: Estimation and Inference","date":"2024-10-13","arxiv_id":"2410.09952","repositories_listed":1,"syntology":null},{"url":"/paper/prompt-tuning-for-audio-deepfake-detection","slug":"prompt-tuning-for-audio-deepfake-detection","title":"Prompt Tuning for Audio Deepfake Detection: Computationally Efficient Test-time Domain Adaptation with Limited Target Dataset","date":"2024-10-13","arxiv_id":"2410.09869","repositories_listed":1,"syntology":null},{"url":"/paper/coral-order-agnostic-language-modeling-for","slug":"coral-order-agnostic-language-modeling-for","title":"COrAL: Order-Agnostic Language Modeling for Efficient Iterative Refinement","date":"2024-10-12","arxiv_id":"2410.09675","repositories_listed":1,"syntology":null},{"url":"/paper/popos-improving-efficient-and-robust-facial","slug":"popos-improving-efficient-and-robust-facial","title":"POPoS: Improving Efficient and Robust Facial Landmark Detection with Parallel Optimal Position Search","date":"2024-10-12","arxiv_id":"2410.09583","repositories_listed":1,"syntology":null},{"url":"/paper/plddt-predictor-high-speed-protein-screening","slug":"plddt-predictor-high-speed-protein-screening","title":"pLDDT-Predictor: High-speed Protein Screening Using Transformer and ESM2","date":"2024-10-11","arxiv_id":"2410.21283","repositories_listed":1,"syntology":null},{"url":"/paper/octopus-inspired-optimization-algorithm-multi","slug":"octopus-inspired-optimization-algorithm-multi","title":"Octopus Inspired Optimization Algorithm: Multi-Level Structures and Parallel Computing Strategies","date":"2024-10-10","arxiv_id":"2410.07968","repositories_listed":1,"syntology":null},{"url":"/paper/privately-learning-from-graphs-with","slug":"privately-learning-from-graphs-with","title":"Privately Learning from Graphs with Applications in Fine-tuning Large Language Models","date":"2024-10-10","arxiv_id":"2410.08299","repositories_listed":1,"syntology":null},{"url":"/paper/shap-select-lightweight-feature-selection","slug":"shap-select-lightweight-feature-selection","title":"Shap-Select: Lightweight Feature Selection Using SHAP Values and Regression","date":"2024-10-09","arxiv_id":"2410.06815","repositories_listed":1,"syntology":null},{"url":"/paper/amortized-control-of-continuous-state-space","slug":"amortized-control-of-continuous-state-space","title":"Amortized Control of Continuous State Space Feynman-Kac Model for Irregular Time Series","date":"2024-10-08","arxiv_id":"2410.05602","repositories_listed":1,"syntology":null},{"url":"/paper/cr-ctc-consistency-regularization-on-ctc-for","slug":"cr-ctc-consistency-regularization-on-ctc-for","title":"CR-CTC: Consistency regularization on CTC for improved speech recognition","date":"2024-10-07","arxiv_id":"2410.05101","repositories_listed":1,"syntology":null},{"url":"/paper/granular-ball-twin-support-vector-machine","slug":"granular-ball-twin-support-vector-machine","title":"Granular Ball Twin Support Vector Machine","date":"2024-10-07","arxiv_id":"2410.04774","repositories_listed":1,"syntology":null},{"url":"/paper/residual-kolmogorov-arnold-network-for","slug":"residual-kolmogorov-arnold-network-for","title":"Residual Kolmogorov-Arnold Network for Enhanced Deep Learning","date":"2024-10-07","arxiv_id":"2410.05500","repositories_listed":1,"syntology":null},{"url":"/paper/bisimulation-metric-for-model-predictive","slug":"bisimulation-metric-for-model-predictive","title":"Bisimulation metric for Model Predictive Control","date":"2024-10-06","arxiv_id":"2410.04553","repositories_listed":1,"syntology":null},{"url":"/paper/improving-temporal-link-prediction-via","slug":"improving-temporal-link-prediction-via","title":"Improving Temporal Link Prediction via Temporal Walk Matrix Projection","date":"2024-10-05","arxiv_id":"2410.04013","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/improving-temporal-link-prediction-via#ran","syntology_url":"https://syntology.ai/paper/2410.04013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04013"}},"official":{"repos":["lxd99/tpnet"],"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/a-training-free-conditional-diffusion-model","slug":"a-training-free-conditional-diffusion-model","title":"A Training-Free Conditional Diffusion Model for Learning Stochastic Dynamical Systems","date":"2024-10-04","arxiv_id":"2410.03108","repositories_listed":1,"syntology":null},{"url":"/paper/learning-structured-representations-by","slug":"learning-structured-representations-by","title":"Learning Structured Representations by Embedding Class Hierarchy with Fast Optimal Transport","date":"2024-10-04","arxiv_id":"2410.03052","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":1,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-structured-representations-by#ran","syntology_url":"https://syntology.ai/paper/2410.03052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03052"}},"official":{"repos":["uiuctml/OTCPCC"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/never-mind-the-no-ops-faster-and-less","slug":"never-mind-the-no-ops-faster-and-less","title":"Never Mind The No-Ops: Faster and Less Volatile Simulation Modelling of Co-Evolutionary Species Interactions via Spatial Cyclic Games","date":"2024-10-04","arxiv_id":"2410.03586","repositories_listed":1,"syntology":null}],"record_sha256":"0d84fc2458b88a8b6e01ff4a760e53750a2d0588f292a0b0d748576e042fb3c7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}