{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/favor","slug":"favor","name":"FAVOR+","full_name":"Fast Attention Via Positive Orthogonal Random Features","full_name_withheld":false,"description_markdown":"**FAVOR+**, or **Fast Attention Via Positive Orthogonal Random Features**, is an efficient attention mechanism used in the [Performer](https://paperswithcode.com/method/performer) architecture which leverages approaches such as kernel methods and random features approximation for approximating [softmax](https://paperswithcode.com/method/softmax) and Gaussian kernels. \r\n\r\nFAVOR+ works for attention blocks using matrices $\\mathbf{A} \\in \\mathbb{R}^{L×L}$ of the form $\\mathbf{A}(i, j) = K(\\mathbf{q}\\_{i}^{T}, \\mathbf{k}\\_{j}^{T})$, with $\\mathbf{q}\\_{i}/\\mathbf{k}\\_{j}$ standing for the $i^{th}/j^{th}$ query/key row-vector in $\\mathbf{Q}/\\mathbf{K}$ and kernel $K : \\mathbb{R}^{d } × \\mathbb{R}^{d} \\rightarrow \\mathbb{R}\\_{+}$ defined for the (usually randomized) mapping: $\\phi : \\mathbb{R}^{d } → \\mathbb{R}^{r}\\_{+}$ (for some $r > 0$) as:\r\n\r\n$$K(\\mathbf{x}, \\mathbf{y}) = E[\\phi(\\mathbf{x})^{T}\\phi(\\mathbf{y})] $$\r\n\r\nWe call $\\phi(\\mathbf{u})$ a random feature map for $\\mathbf{u} \\in \\mathbb{R}^{d}$ . For $\\mathbf{Q}^{'}, \\mathbf{K}^{'} \\in \\mathbb{R}^{L \\times r}$ with rows given as $\\phi(\\mathbf{q}\\_{i}^{T})^{T}$ and $\\phi(\\mathbf{k}\\_{i}^{T})^{T}$  respectively, this leads directly to the efficient attention mechanism of the form:\r\n\r\n$$ \\hat{Att\\_{\\leftrightarrow}}\\left(\\mathbf{Q}, \\mathbf{K}, \\mathbf{V}\\right) = \\hat{\\mathbf{D}}^{-1}(\\mathbf{Q^{'}}((\\mathbf{K^{'}})^{T}\\mathbf{V}))$$\r\n\r\nwhere\r\n\r\n$$\\mathbf{\\hat{D}} = \\text{diag}(\\mathbf{Q^{'}}((\\mathbf{K^{'}})\\mathbf{1}\\_{L})) $$\r\n\r\nThe above scheme constitutes the [FA](https://paperswithcode.com/method/dfa)-part of the FAVOR+ mechanism. The other parts are achieved by:\r\n\r\n- The R part :  The softmax kernel is approximated though trigonometric functions, in the form of a regularized softmax-kernel SMREG, that employs positive random features (PRFs).\r\n- The OR+ part : To reduce the variance of the estimator, so we can use a smaller number of random features, different samples are entangled to be exactly orthogonal using the Gram-Schmidt orthogonalization procedure.\r\n\r\nThe details are quite technical, so it is recommended you read the paper for further information on these steps.","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"https://arxiv.org/abs/2009.14794v4","title":"Rethinking Attention with Performers","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Attention Mechanisms","url":"/methods/category/attention-mechanisms","pwc_aliases":["attention-mechanisms-1"]}],"n_papers_tagged":102,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"expertlongbench-benchmarking-language-models","title":"ExpertLongBench: Benchmarking Language Models on Expert-Level Long-Form Generation Tasks with Structured Checklists","date":"2025-06-02","arxiv_id":"2506.01241","n_code_links":0,"syntology":null},{"paper":null,"slug":"wirelessmathbench-a-mathematical-modeling","title":"WirelessMathBench: A Mathematical Modeling Benchmark for LLMs in Wireless Communications","date":"2025-05-20","arxiv_id":"2505.14354","n_code_links":0,"syntology":null},{"paper":null,"slug":"cacheformer-high-attention-based-segment","title":"CacheFormer: High Attention-Based Segment Caching","date":"2025-04-18","arxiv_id":"2504.13981","n_code_links":0,"syntology":null},{"paper":null,"slug":"deconstructing-jazz-piano-style-using-machine","title":"Deconstructing Jazz Piano Style Using Machine Learning","date":"2025-04-07","arxiv_id":"2504.05009","n_code_links":0,"syntology":null},{"paper":"/paper/predicting-survivability-of-cancer-patients","slug":"predicting-survivability-of-cancer-patients","title":"Predicting Survivability of Cancer Patients with Metastatic Patterns Using Explainable AI","date":"2025-04-07","arxiv_id":"2504.06306","n_code_links":1,"syntology":null},{"paper":null,"slug":"forecasting-empty-container-availability-for","title":"Forecasting Empty Container availability for Vehicle Booking System Application","date":"2025-03-14","arxiv_id":"2503.11728","n_code_links":0,"syntology":null},{"paper":"/paper/stead-spatio-temporal-efficient-anomaly-1","slug":"stead-spatio-temporal-efficient-anomaly-1","title":"STEAD: Spatio-Temporal Efficient Anomaly Detection for Time and Compute Sensitive Applications","date":"2025-03-11","arxiv_id":"2503.07942","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-learning-based-approach-for-automatic-2d","title":"Deep Learning-Based Approach for Automatic 2D and 3D MRI Segmentation of Gliomas","date":"2025-02-27","arxiv_id":"2502.19760","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-use-of-performer-and-agent-attention","title":"On the use of Performer and Agent Attention for Spoken Language Identification","date":"2025-02-09","arxiv_id":"2502.05841","n_code_links":0,"syntology":null},{"paper":null,"slug":"nick-patrick-contreras","title":"Nick Patrick Contreras","date":"2025-01-09","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"comparative-study-of-deep-learning","title":"Comparative Study of Deep Learning Architectures for Textual Damage Level Classification","date":"2025-01-03","arxiv_id":"2501.01694","n_code_links":0,"syntology":null},{"paper":"/paper/electra-and-gpt-4o-cost-effective-partners","slug":"electra-and-gpt-4o-cost-effective-partners","title":"ELECTRA and GPT-4o: Cost-Effective Partners for Sentiment Analysis","date":"2024-12-29","arxiv_id":"2501.00062","n_code_links":1,"syntology":null},{"paper":null,"slug":"music-genre-classification-ensemble-learning","title":"Music Genre Classification: Ensemble Learning with Subcomponents-level Attention","date":"2024-12-20","arxiv_id":"2412.15602","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-two-hop-curse-llms-trained-on-a-b-b-c","title":"The Two-Hop Curse: LLMs trained on A$\\rightarrow$B, B$\\rightarrow$C fail to learn A$\\rightarrow$C","date":"2024-11-25","arxiv_id":"2411.16353","n_code_links":0,"syntology":null},{"paper":null,"slug":"soar-self-occluded-avatar-recovery-from-a","title":"SOAR: Self-Occluded Avatar Recovery from a Single Video In the Wild","date":"2024-10-31","arxiv_id":"2410.23800","n_code_links":0,"syntology":null},{"paper":null,"slug":"pertok-expressive-encoding-and-modeling-of","title":"PerTok: Expressive Encoding and Modeling of Symbolic Musical Ideas and Variations","date":"2024-10-02","arxiv_id":"2410.02060","n_code_links":0,"syntology":null},{"paper":null,"slug":"glmha-a-guided-low-rank-multi-head-self","title":"GLMHA A Guided Low-rank Multi-Head Self-Attention for Efficient Image Restoration and Spectral Reconstruction","date":"2024-10-01","arxiv_id":"2410.00380","n_code_links":0,"syntology":null},{"paper":"/paper/large-language-models-versus-classical","slug":"large-language-models-versus-classical","title":"Large Language Models versus Classical Machine Learning: Performance in COVID-19 Mortality Prediction Using High-Dimensional Tabular Data","date":"2024-09-02","arxiv_id":"2409.02136","n_code_links":2,"syntology":null},{"paper":null,"slug":"equitable-skin-disease-prediction-using","title":"Equitable Skin Disease Prediction Using Transfer Learning and Domain Adaptation","date":"2024-09-01","arxiv_id":"2409.00873","n_code_links":0,"syntology":null},{"paper":null,"slug":"tangram-a-challenging-benchmark-for-geometric","title":"Tangram: Benchmark for Evaluating Geometric Element Recognition in Large Multimodal Models","date":"2024-08-25","arxiv_id":"2408.13854","n_code_links":0,"syntology":null},{"paper":"/paper/gabinsight-exploring-gender-activity-binding","slug":"gabinsight-exploring-gender-activity-binding","title":"GABInsight: Exploring Gender-Activity Binding Bias in Vision-Language Models","date":"2024-07-30","arxiv_id":"2407.21001","n_code_links":1,"syntology":null},{"paper":"/paper/motamot-a-dataset-for-revealing-the-supremacy","slug":"motamot-a-dataset-for-revealing-the-supremacy","title":"Motamot: A Dataset for Revealing the Supremacy of Large Language Models over Transformer Models in Bengali Political Sentiment Analysis","date":"2024-07-28","arxiv_id":"2407.19528","n_code_links":1,"syntology":null},{"paper":null,"slug":"scghsom-hierarchical-clustering-and","title":"scGHSOM: Hierarchical clustering and visualization of single-cell and CRISPR data using growing hierarchical SOM","date":"2024-07-24","arxiv_id":"2407.16984","n_code_links":0,"syntology":null},{"paper":"/paper/predicting-the-best-of-n-visual-trackers","slug":"predicting-the-best-of-n-visual-trackers","title":"Predicting the Best of N Visual Trackers","date":"2024-07-22","arxiv_id":"2407.15707","n_code_links":1,"syntology":null},{"paper":null,"slug":"lightweight-large-language-model-for","title":"Lightweight Large Language Model for Medication Enquiry: Med-Pal","date":"2024-07-02","arxiv_id":"2407.12822","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-reinforcement-learning-strategies-in","title":"Deep Reinforcement Learning Strategies in Finance: Insights into Asset Holding, Trading Behavior, and Purchase Diversity","date":"2024-06-29","arxiv_id":"2407.09557","n_code_links":0,"syntology":null},{"paper":null,"slug":"modeling-the-real-world-with-high-density","title":"Modeling the Real World with High-Density Visual Particle Dynamics","date":"2024-06-28","arxiv_id":"2406.19800","n_code_links":0,"syntology":null},{"paper":"/paper/hopping-too-late-exploring-the-limitations-of","slug":"hopping-too-late-exploring-the-limitations-of","title":"Hopping Too Late: Exploring the Limitations of Large Language Models on Multi-Hop Queries","date":"2024-06-18","arxiv_id":"2406.12775","n_code_links":1,"syntology":{"ran":10,"of":12,"n_ran_checked":5,"n_instrument":5,"unverified":2,"pointer_only":0,"phrase":"10 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; 5 where Syntology's instrument failed) · 2 unverified","official":{"repos":["edenbiran/HoppingTooLate"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/smart-expert-system-large-language-models-as","slug":"smart-expert-system-large-language-models-as","title":"Adaptable and Reliable Text Classification using Large Language Models","date":"2024-05-17","arxiv_id":"2405.10523","n_code_links":1,"syntology":null},{"paper":null,"slug":"designing-and-evaluating-dialogue-llms-for-co","title":"Designing and Evaluating Dialogue LLMs for Co-Creative Improvised Theatre","date":"2024-05-11","arxiv_id":"2405.07111","n_code_links":0,"syntology":null},{"paper":null,"slug":"analyzing-male-domestic-violence-through","title":"Analyzing Domestic Violence through Exploratory Data Analysis and Explainable Ensemble Learning Insights","date":"2024-03-22","arxiv_id":"2403.15594","n_code_links":0,"syntology":null},{"paper":"/paper/improving-image-classification-accuracy","slug":"improving-image-classification-accuracy","title":"SynerMix: Synergistic Mixup Solution for Enhanced Intra-Class Cohesion and Inter-Class Separability in Image Classification","date":"2024-03-21","arxiv_id":"2403.14137","n_code_links":2,"syntology":null},{"paper":"/paper/toward-generalist-anomaly-detection-via-in","slug":"toward-generalist-anomaly-detection-via-in","title":"Toward Generalist Anomaly Detection via In-context Residual Learning with Few-shot Sample Prompts","date":"2024-03-11","arxiv_id":"2403.06495","n_code_links":2,"syntology":{"ran":16,"of":21,"n_ran_checked":9,"n_instrument":7,"unverified":5,"pointer_only":16,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","official":{"repos":["mala-lab/inctrl","mala-lab/winclip"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"enhancing-price-prediction-in-cryptocurrency","title":"Enhancing Price Prediction in Cryptocurrency Using Transformer Neural Network and Technical Indicators","date":"2024-03-06","arxiv_id":"2403.03606","n_code_links":0,"syntology":null},{"paper":"/paper/a-change-detection-reality-check","slug":"a-change-detection-reality-check","title":"A Change Detection Reality Check","date":"2024-02-10","arxiv_id":"2402.06994","n_code_links":1,"syntology":null},{"paper":null,"slug":"diffperformer-iterative-learning-of","title":"DiffPerformer: Iterative Learning of Consistent Latent Guidance for Diffusion-based Human Video Generation","date":"2024-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"hate-speech-and-offensive-content-detection","title":"Hate Speech and Offensive Content Detection in Indo-Aryan Languages: A Battle of LSTM and Transformers","date":"2023-12-09","arxiv_id":"2312.05671","n_code_links":0,"syntology":null},{"paper":"/paper/gauhuman-articulated-gaussian-splatting-from","slug":"gauhuman-articulated-gaussian-splatting-from","title":"GauHuman: Articulated Gaussian Splatting from Monocular Human Videos","date":"2023-12-05","arxiv_id":"2312.02973","n_code_links":1,"syntology":{"ran":9,"of":10,"n_ran_checked":4,"n_instrument":5,"unverified":1,"pointer_only":10,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","official":{"repos":["skhu101/gauhuman"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/comprehensive-evaluation-and-insights-into","slug":"comprehensive-evaluation-and-insights-into","title":"Comprehensive framework for evaluation of deep neural networks in detection and quantification of lymphoma from PET/CT images: clinical insights, pitfalls, and observer agreement analyses","date":"2023-11-16","arxiv_id":"2311.09614","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-intelligent-social-learning-based","title":"An Intelligent Social Learning-based Optimization Strategy for Black-box Robotic Control with Reinforcement Learning","date":"2023-11-11","arxiv_id":"2311.06576","n_code_links":0,"syntology":null},{"paper":null,"slug":"geoformer-predicting-human-mobility-using","title":"GeoFormer: Predicting Human Mobility using Generative Pre-trained Transformer (GPT)","date":"2023-11-09","arxiv_id":"2311.05092","n_code_links":0,"syntology":null},{"paper":null,"slug":"inside-the-black-box-neural-network-based","title":"Inside the black box: Neural network-based real-time prediction of US recessions","date":"2023-10-26","arxiv_id":"2310.17571","n_code_links":0,"syntology":null},{"paper":null,"slug":"systematic-assessment-of-factual-knowledge-in","title":"Systematic Assessment of Factual Knowledge in Large Language Models","date":"2023-10-18","arxiv_id":"2310.11638","n_code_links":0,"syntology":null},{"paper":"/paper/kandinsky-an-improved-text-to-image-synthesis","slug":"kandinsky-an-improved-text-to-image-synthesis","title":"Kandinsky: an Improved Text-to-Image Synthesis with Image Prior and Latent Diffusion","date":"2023-10-05","arxiv_id":"2310.03502","n_code_links":1,"syntology":{"ran":12,"of":18,"n_ran_checked":5,"n_instrument":7,"unverified":6,"pointer_only":10,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 7 where Syntology's instrument failed) · 6 unverified","official":{"repos":["ai-forever/Kandinsky-2"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["found_in_text","official"]}}},{"paper":null,"slug":"polysketchformer-fast-transformers-via","title":"PolySketchFormer: Fast Transformers via Sketching Polynomial Kernels","date":"2023-10-02","arxiv_id":"2310.01655","n_code_links":0,"syntology":null},{"paper":null,"slug":"holoassist-an-egocentric-human-interaction-1","title":"HoloAssist: an Egocentric Human Interaction Dataset for Interactive AI Assistants in the Real World","date":"2023-09-29","arxiv_id":"2309.17024","n_code_links":0,"syntology":null},{"paper":"/paper/nominality-score-conditioned-time-series","slug":"nominality-score-conditioned-time-series","title":"Nominality Score Conditioned Time Series Anomaly Detection by Point/Sequential Reconstruction","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"large-scale-weakly-supervised-learning-for","title":"Large-scale Weakly Supervised Learning for Road Extraction from Satellite Imagery","date":"2023-09-14","arxiv_id":"2309.07823","n_code_links":0,"syntology":null},{"paper":null,"slug":"2309-05786","title":"Stringesthesia: Dynamically Shifting Musical Agency Between Audience and Performer Based on Trust in an Interactive and Improvised Performance","date":"2023-09-11","arxiv_id":"2309.05786","n_code_links":0,"syntology":null},{"paper":null,"slug":"decode-data-driven-energy-consumption","title":"DECODE: Data-driven Energy Consumption Prediction leveraging Historical Data and Environmental Factors in Buildings","date":"2023-09-06","arxiv_id":"2309.02908","n_code_links":0,"syntology":null},{"paper":"/paper/ghunerf-generalizable-human-nerf-from-a","slug":"ghunerf-generalizable-human-nerf-from-a","title":"GHuNeRF: Generalizable Human NeRF from a Monocular Video","date":"2023-08-31","arxiv_id":"2308.16576","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["chaneyddtt/ghunerf"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/jazzvar-a-dataset-of-variations-found-within","slug":"jazzvar-a-dataset-of-variations-found-within","title":"JAZZVAR: A Dataset of Variations found within Solo Piano Performances of Jazz Standards for Music Overpainting","date":"2023-07-18","arxiv_id":"2307.09670","n_code_links":1,"syntology":null},{"paper":null,"slug":"sumformer-universal-approximation-for","title":"Sumformer: Universal Approximation for Efficient Transformers","date":"2023-07-05","arxiv_id":"2307.02301","n_code_links":0,"syntology":null},{"paper":"/paper/using-sequences-of-life-events-to-predict","slug":"using-sequences-of-life-events-to-predict","title":"Using Sequences of Life-events to Predict Human Lives","date":"2023-06-05","arxiv_id":"2306.03009","n_code_links":2,"syntology":null},{"paper":null,"slug":"r2h-building-multimodal-navigation-helpers","title":"R2H: Building Multimodal Navigation Helpers that Respond to Help Requests","date":"2023-05-23","arxiv_id":"2305.14260","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-methods-for-extracting","title":"Deep Learning Methods for Extracting Metaphorical Names of Flowers and Plants","date":"2023-05-18","arxiv_id":"2305.10833","n_code_links":0,"syntology":null},{"paper":"/paper/tsi-gan-unsupervised-time-series-anomaly","slug":"tsi-gan-unsupervised-time-series-anomaly","title":"TSI-GAN: Unsupervised Time Series Anomaly Detection using Convolutional Cycle-Consistent Generative Adversarial Networks","date":"2023-03-22","arxiv_id":"2303.12952","n_code_links":1,"syntology":null},{"paper":"/paper/towards-unbounded-machine-unlearning-1","slug":"towards-unbounded-machine-unlearning-1","title":"Towards Unbounded Machine Unlearning","date":"2023-02-20","arxiv_id":"2302.09880","n_code_links":1,"syntology":null},{"paper":"/paper/automatic-modulation-classification-with-deep","slug":"automatic-modulation-classification-with-deep","title":"Automatic Modulation Classification with Deep Neural Networks","date":"2023-01-27","arxiv_id":"2301.11773","n_code_links":1,"syntology":null},{"paper":"/paper/unsupervised-construction-of-representations","slug":"unsupervised-construction-of-representations","title":"Robust representations of oil wells' intervals via sparse attention mechanism","date":"2022-12-29","arxiv_id":"2212.14246","n_code_links":2,"syntology":null},{"paper":null,"slug":"gaussian-process-classification-bandits","title":"Gaussian Process Classification Bandits","date":"2022-12-26","arxiv_id":"2212.13157","n_code_links":0,"syntology":null},{"paper":"/paper/human-performance-modeling-and-rendering-via","slug":"human-performance-modeling-and-rendering-via","title":"Human Performance Modeling and Rendering via Neural Animated Mesh","date":"2022-09-18","arxiv_id":"2209.08468","n_code_links":1,"syntology":null},{"paper":null,"slug":"multiple-view-performers-for-shape-completion","title":"Multiple View Performers for Shape Completion","date":"2022-09-13","arxiv_id":"2209.06291","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-free-deep-reinforcement-learning-in","title":"Model-Free Deep Reinforcement Learning in Software-Defined Networks","date":"2022-09-03","arxiv_id":"2209.01490","n_code_links":0,"syntology":null},{"paper":"/paper/nrbdmf-a-recommendation-algorithm-for","slug":"nrbdmf-a-recommendation-algorithm-for","title":"NRBdMF: A recommendation algorithm for predicting drug effects considering directionality","date":"2022-08-05","arxiv_id":"2208.04312","n_code_links":1,"syntology":null},{"paper":null,"slug":"drivable-volumetric-avatars-using-texel","title":"Drivable Volumetric Avatars using Texel-Aligned Features","date":"2022-07-20","arxiv_id":"2207.09774","n_code_links":0,"syntology":null},{"paper":"/paper/ndf-neural-deformable-fields-for-dynamic","slug":"ndf-neural-deformable-fields-for-dynamic","title":"NDF: Neural Deformable Fields for Dynamic Human Modelling","date":"2022-07-19","arxiv_id":"2207.09193","n_code_links":1,"syntology":null},{"paper":"/paper/memory-free-online-change-point-detection-a","slug":"memory-free-online-change-point-detection-a","title":"Memory-free Online Change-point Detection: A Novel Neural Network Approach","date":"2022-07-08","arxiv_id":"2207.03932","n_code_links":1,"syntology":null},{"paper":"/paper/machine-and-deep-learning-applications-to","slug":"machine-and-deep-learning-applications-to","title":"Machine and Deep Learning Applications to Mouse Dynamics for Continuous User Authentication","date":"2022-05-26","arxiv_id":"2205.13646","n_code_links":1,"syntology":null},{"paper":"/paper/generalizable-neural-performer-learning","slug":"generalizable-neural-performer-learning","title":"Generalizable Neural Performer: Learning Robust Radiance Fields for Human Novel View Synthesis","date":"2022-04-25","arxiv_id":"2204.11798","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["generalizable-neural-performer/gnr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"performer-a-novel-ppg-to-ecg-reconstruction","title":"Performer: A Novel PPG-to-ECG Reconstruction Transformer for a Digital Biomarker of Cardiovascular Disease Detection","date":"2022-04-25","arxiv_id":"2204.11795","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-variants-of-root-normalised-order-aware","title":"On Variants of Root Normalised Order-aware Divergence and a Divergence based on Kendall's Tau","date":"2022-04-15","arxiv_id":"2204.07304","n_code_links":0,"syntology":null},{"paper":null,"slug":"animatable-neural-radiance-fields-from-1","title":"Neural Rendering of Humans in Novel View and Pose from Monocular Video","date":"2022-04-04","arxiv_id":"2204.01218","n_code_links":0,"syntology":null},{"paper":"/paper/context-aware-automatic-music-transcription","slug":"context-aware-automatic-music-transcription","title":"Acoustics-specific Piano Velocity Estimation","date":"2022-03-30","arxiv_id":"2203.16294","n_code_links":1,"syntology":null},{"paper":"/paper/uv-volumes-for-real-time-rendering-of","slug":"uv-volumes-for-real-time-rendering-of","title":"UV Volumes for Real-time Rendering of Editable Free-view Human Performance","date":"2022-03-27","arxiv_id":"2203.14402","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":2,"n_instrument":2,"unverified":1,"pointer_only":1,"phrase":"4 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["fanegg/UV-Volumes"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"prioritized-variable-length-test-cases","title":"Prioritized Variable-length Test Cases Generation for Finite State Machines","date":"2022-03-17","arxiv_id":"2203.09596","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-nlp-task-effectiveness-of-long-range","title":"The NLP Task Effectiveness of Long-Range Transformers","date":"2022-02-16","arxiv_id":"2202.07856","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-performer-score-to-audio-music","title":"Deep Performer: Score-to-Audio Music Performance Synthesis","date":"2022-02-12","arxiv_id":"2202.06034","n_code_links":0,"syntology":null},{"paper":null,"slug":"automotive-parts-assessment-applying-real","title":"Automotive Parts Assessment: Applying Real-time Instance-Segmentation Models to Identify Vehicle Parts","date":"2022-02-02","arxiv_id":"2202.00884","n_code_links":0,"syntology":null},{"paper":"/paper/convolutional-xformers-for-vision","slug":"convolutional-xformers-for-vision","title":"Convolutional Xformers for Vision","date":"2022-01-25","arxiv_id":"2201.10271","n_code_links":1,"syntology":null},{"paper":null,"slug":"looking-at-the-performer-from-a-hopfield","title":"Looking at the Performer from a Hopfield Point of View","date":"2022-01-17","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancement-of-healthcare-data-performance","title":"Enhancement of Healthcare Data Performance Metrics using Neural Network Machine Learning Algorithms","date":"2022-01-16","arxiv_id":"2201.05962","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-data-compression-for-3d-sparse-tpc","slug":"efficient-data-compression-for-3d-sparse-tpc","title":"Efficient Data Compression for 3D Sparse TPC via Bicephalous Convolutional Autoencoder","date":"2021-11-09","arxiv_id":"2111.05423","n_code_links":1,"syntology":null},{"paper":null,"slug":"losses-dissonances-and-distortions","title":"Losses, Dissonances, and Distortions","date":"2021-11-08","arxiv_id":"2111.05128","n_code_links":0,"syntology":null},{"paper":null,"slug":"phylotransformer-a-discriminative-model-for","title":"PhyloTransformer: A Discriminative Model for Mutation Prediction Based on a Multi-head Self-attention Mechanism","date":"2021-11-03","arxiv_id":"2111.01969","n_code_links":0,"syntology":null},{"paper":"/paper/transformers-generalize-deepsets-and-can-be","slug":"transformers-generalize-deepsets-and-can-be","title":"Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphs","date":"2021-10-27","arxiv_id":"2110.14416","n_code_links":2,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["jw9730/hot"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"pyramidal-blur-aware-x-corner-chessboard","title":"Pyramidal Blur Aware X-Corner Chessboard Detector","date":"2021-10-26","arxiv_id":"2110.13793","n_code_links":0,"syntology":null},{"paper":"/paper/multimodal-performers-for-genomic-selection","slug":"multimodal-performers-for-genomic-selection","title":"Multimodal Performers for Genomic Selection and Crop Yield Prediction","date":"2021-10-20","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"audiomer-a-convolutional-transformer-for-1","title":"Audiomer: A Convolutional Transformer For Keyword Spotting","date":"2021-09-21","arxiv_id":"2109.10252","n_code_links":0,"syntology":null},{"paper":"/paper/neural-human-performer-learning-generalizable","slug":"neural-human-performer-learning-generalizable","title":"Neural Human Performer: Learning Generalizable Radiance Fields for Human Performance Rendering","date":"2021-09-15","arxiv_id":"2109.07448","n_code_links":1,"syntology":null},{"paper":"/paper/permuteformer-efficient-relative-position","slug":"permuteformer-efficient-relative-position","title":"PermuteFormer: Efficient Relative Position Encoding for Long Sequences","date":"2021-09-06","arxiv_id":"2109.02377","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["cpcp1998/permuteformer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"somtimes-self-organizing-maps-for-time-series","title":"SOMTimeS: Self Organizing Maps for Time Series Clustering and its Application to Serious Illness Conversations","date":"2021-08-26","arxiv_id":"2108.11523","n_code_links":0,"syntology":null},{"paper":null,"slug":"performer-identification-from-symbolic","title":"Performer Identification From Symbolic Representation of Music Using Statistical Models","date":"2021-08-05","arxiv_id":"2108.02576","n_code_links":0,"syntology":null},{"paper":null,"slug":"relightable-neural-video-portrait","title":"Neural Relighting and Expression Transfer On Video Portraits","date":"2021-07-30","arxiv_id":"2107.14735","n_code_links":0,"syntology":null},{"paper":"/paper/vision-xformers-efficient-attention-for-image","slug":"vision-xformers-efficient-attention-for-image","title":"Vision Xformers: Efficient Attention for Image Classification","date":"2021-07-05","arxiv_id":"2107.02239","n_code_links":2,"syntology":null},{"paper":"/paper/memory-efficient-transformers-via-top-k","slug":"memory-efficient-transformers-via-top-k","title":"Memory-efficient Transformers via Top-$k$ Attention","date":"2021-06-13","arxiv_id":"2106.06899","n_code_links":2,"syntology":null},{"paper":null,"slug":"sequential-online-chore-division-for","title":"Sequential Online Chore Division for Autonomous Vehicle Convoy Formation","date":"2021-04-09","arxiv_id":"2104.04159","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-practical-survey-on-faster-and-lighter","title":"A Practical Survey on Faster and Lighter Transformers","date":"2021-03-26","arxiv_id":"2103.14636","n_code_links":0,"syntology":null},{"paper":"/paper/the-facells-an-exploratory-study-about-lstm","slug":"the-facells-an-exploratory-study-about-lstm","title":"The FaCells. An Exploratory Study about LSTM Layers on Face Sketches Classifiers","date":"2021-02-22","arxiv_id":"2102.11361","n_code_links":1,"syntology":null},{"paper":"/paper/neural-body-implicit-neural-representations","slug":"neural-body-implicit-neural-representations","title":"Neural Body: Implicit Neural Representations with Structured Latent Codes for Novel View Synthesis of Dynamic Humans","date":"2020-12-31","arxiv_id":"2012.15838","n_code_links":3,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zju3dv/neuralbody"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":102,"with_a_code_link":43,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":102,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":8,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":8,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/method/favor/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":2,"url":"/method/favor/papers/2","json":"/method/favor/papers/2.json","rows":2},{"order":"ran","page":1,"of":1,"url":"/method/favor/papers/ran/1","json":"/method/favor/papers/ran/1.json","rows":9}],"tasks":[{"task":"/task/language-modelling","name":"Language Modelling","papers":6},{"task":"/task/decoder","name":"Decoder","papers":5},{"task":"/task/time-series-1","name":"Time Series","papers":5},{"task":"/task/classification-1","name":"Classification","papers":4},{"task":"/task/language-modeling","name":"Language Modeling","papers":4},{"task":"/task/time-series","name":"Time Series Analysis","papers":4},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":3},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":3},{"task":"/task/decision-making","name":"Decision Making","papers":3},{"task":null,"name":"GPU","papers":3},{"task":"/task/image-classification","name":"Image Classification","papers":3},{"task":"/task/nerf","name":"NeRF","papers":3},{"task":"/task/novel-view-synthesis","name":"Novel View Synthesis","papers":3},{"task":"/task/segmentation","name":"Segmentation","papers":3},{"task":"/task/sentiment-analysis","name":"Sentiment Analysis","papers":3},{"task":"/task/image-classification","name":"image-classification","papers":3},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":2},{"task":"/task/benchmarking","name":"Benchmarking","papers":2},{"task":"/task/clustering","name":"Clustering","papers":2},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":2}],"tasks_shown":20,"n_tasks":143,"usage_by_year":[{"year":"2020","papers":3},{"year":"2021","papers":17},{"year":"2022","papers":23},{"year":"2023","papers":23},{"year":"2024","papers":25},{"year":"2025","papers":11}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/favor"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=FAVOR%2B","read_at":"2026-10-05T00:55:54+00:00","query":"FAVOR+","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"FAVOR+","origin_arxiv_id":"2009.14794"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":5,"in_graph":7,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2009.14794","citations":2442},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'FAVOR+'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"Performers","relation":"same_paper","relation_means":"from the same paper; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Performers')","origin_arxiv_id":null}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2009.14794","page":"/paper/rethinking-attention-with-performers","syntology_url":"https://syntology.ai/paper/2009.14794","in_graph_layer":true,"samples":16,"ran":11,"n_ran_checked":7,"n_instrument":4,"unverified":5,"phrase":"11 ran (of which 3 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 7 in the graph, strongest link: official). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2009.14794) is about this method is not checked.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"e7e0ae2845ba04663925a0ee6fb85bbe44e986c3e189b375a1519d99b6b55b3a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}