{"url":"/task/prediction","name":"Prediction","slug":"prediction","description_markdown":null,"categories":[{"name":"Time Series","url":"/area/time-series"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":8760,"papers_with_code":2835,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/prediction-on-qm9","slug":"prediction-on-qm9","dataset":"QM9","dataset_url":"/dataset/qm9","rows_in_archive":4,"metrics":["Edit Distance"],"first_row_in_archive_order":{"model":"ANY2GRAPH + FD","paper_title":"Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss","paper_url":"/paper/end-to-end-supervised-prediction-of-arbitrary","paper_date":"2024-02-19","arxiv_id":"2402.12269","code_links":[{"title":"KrzakalaPaul/Any2Graph","url":"https://github.com/KrzakalaPaul/Any2Graph"}],"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":5}}},{"leaderboard":"/sota/prediction-on-synthetic","slug":"prediction-on-synthetic","dataset":"Synthetic","dataset_url":null,"rows_in_archive":2,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"CW-AT","paper_title":"CW-CNN & CW-AN: Convolutional Networks and Attention Networks for CW-Complexes","paper_url":"/paper/cw-cnn-cw-an-convolutional-networks-and","paper_date":"2024-08-29","arxiv_id":"2408.16686","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/qm9","name":"QM9","full_name":"","num_papers_in_archive":76},{"url":"/dataset/sdwpf","name":"SDWPF","full_name":"A Dataset for Spatial Dynamic Wind Power Forecasting  Challenge at KDD Cup 2022","num_papers_in_archive":6},{"url":"/dataset/bone-cement-removal-with-audio-monitoring","name":"Bone Cement Removal with Audio-Monitoring","full_name":"Bone Cement Removal with Audio-Monitoring and Erosion Depth","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":2835,"tagged_in_all":8760,"items":[{"url":"/paper/why-should-i-trust-you-explaining-the","title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","date":"2016-02-16","arxiv_id":"1602.04938","repositories_listed":27,"syntology":{"n":19,"n_ran":5,"n_unverified":14,"n_pointer_only":0}},{"url":"/paper/variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","arxiv_id":"1611.07308","repositories_listed":22,"syntology":{"n":13,"n_ran":7,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/deep-interest-network-for-click-through-rate","title":"Deep Interest Network for Click-Through Rate Prediction","date":"2017-06-21","arxiv_id":"1706.06978","repositories_listed":18,"syntology":null},{"url":"/paper/deeper-depth-prediction-with-fully","title":"Deeper Depth Prediction with Fully Convolutional Residual Networks","date":"2016-06-01","arxiv_id":"1606.00373","repositories_listed":18,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/vision-transformers-for-dense-prediction","title":"Vision Transformers for Dense Prediction","date":"2021-03-24","arxiv_id":"2103.13413","repositories_listed":15,"syntology":{"n":116,"n_ran":54,"n_unverified":62,"n_pointer_only":15}},{"url":"/paper/deep-interest-evolution-network-for-click","title":"Deep Interest Evolution Network for Click-Through Rate Prediction","date":"2018-09-11","arxiv_id":"1809.03672","repositories_listed":15,"syntology":{"n":14,"n_ran":0,"n_unverified":14,"n_pointer_only":0}},{"url":"/paper/curiosity-driven-exploration-by-self","title":"Curiosity-driven Exploration by Self-supervised Prediction","date":"2017-05-15","arxiv_id":"1705.05363","repositories_listed":13,"syntology":{"n":32,"n_ran":16,"n_unverified":16,"n_pointer_only":14}},{"url":"/paper/product-based-neural-networks-for-user","title":"Product-based Neural Networks for User Response Prediction","date":"2016-11-01","arxiv_id":"1611.00144","repositories_listed":11,"syntology":null},{"url":"/paper/inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/190909638","title":"Accident Risk Prediction based on Heterogeneous Sparse Data: New Dataset and Insights","date":"2019-09-19","arxiv_id":"1909.09638","repositories_listed":10,"syntology":null},{"url":"/paper/t-gcn-a-temporal-graph-convolutionalnetwork","title":"T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Prediction","date":"2018-11-12","arxiv_id":"1811.05320","repositories_listed":10,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/product-based-neural-networks-for-user-1","title":"Product-based Neural Networks for User Response Prediction over Multi-field Categorical Data","date":"2018-07-01","arxiv_id":"1807.00311","repositories_listed":10,"syntology":null},{"url":"/paper/evidential-deep-learning-to-quantify","title":"Evidential Deep Learning to Quantify Classification Uncertainty","date":"2018-06-05","arxiv_id":"1806.01768","repositories_listed":10,"syntology":{"n":5,"n_ran":4,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/link-prediction-based-on-graph-neural","title":"Link Prediction Based on Graph Neural Networks","date":"2018-02-27","arxiv_id":"1802.09691","repositories_listed":10,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":2}},{"url":"/paper/a-deep-reinforced-model-for-abstractive","title":"A Deep Reinforced Model for Abstractive Summarization","date":"2017-05-11","arxiv_id":"1705.04304","repositories_listed":10,"syntology":null},{"url":"/paper/complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","date":"2016-06-20","arxiv_id":"1606.06357","repositories_listed":9,"syntology":null},{"url":"/paper/multi-scale-context-aggregation-by-dilated","title":"Multi-Scale Context Aggregation by Dilated Convolutions","date":"2015-11-23","arxiv_id":"1511.07122","repositories_listed":9,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":2}},{"url":"/paper/scheduled-sampling-for-sequence-prediction","title":"Scheduled Sampling for Sequence Prediction with Recurrent Neural Networks","date":"2015-06-09","arxiv_id":"1506.03099","repositories_listed":9,"syntology":{"n":8,"n_ran":0,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/cyclemlp-a-mlp-like-architecture-for-dense","title":"CycleMLP: A MLP-like Architecture for Dense Prediction","date":"2021-07-21","arxiv_id":"2107.10224","repositories_listed":8,"syntology":{"n":15,"n_ran":8,"n_unverified":7,"n_pointer_only":1}},{"url":"/paper/on-human-motion-prediction-using-recurrent","title":"On human motion prediction using recurrent neural networks","date":"2017-05-06","arxiv_id":"1705.02445","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":3}},{"url":"/paper/utilizing-self-supervised-representations-for","title":"Utilizing Self-supervised Representations for MOS Prediction","date":"2021-04-07","arxiv_id":"2104.03017","repositories_listed":7,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/dense-contrastive-learning-for-self","title":"Dense Contrastive Learning for Self-Supervised Visual Pre-Training","date":"2020-11-18","arxiv_id":"2011.09157","repositories_listed":7,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}},{"url":"/paper/flen-leveraging-field-for-scalable-ctr","title":"FLEN: Leveraging Field for Scalable CTR Prediction","date":"2019-11-12","arxiv_id":"1911.04690","repositories_listed":7,"syntology":null},{"url":"/paper/mesh-r-cnn","title":"Mesh R-CNN","date":"2019-06-06","arxiv_id":"1906.02739","repositories_listed":7,"syntology":null},{"url":"/paper/deep-session-interest-network-for-click","title":"Deep Session Interest Network for Click-Through Rate Prediction","date":"2019-05-16","arxiv_id":"1905.06482","repositories_listed":7,"syntology":{"n":11,"n_ran":2,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/recurrent-neural-networks-for-multivariate","title":"Recurrent Neural Networks for Multivariate Time Series with Missing Values","date":"2016-06-06","arxiv_id":"1606.01865","repositories_listed":7,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":2}},{"url":"/paper/heterogeneous-networks-in-drug-target","title":"Heterogeneous networks in drug-target interaction prediction","date":"2025-04-22","arxiv_id":"2504.16152","repositories_listed":6,"syntology":null},{"url":"/paper/efficientvit-enhanced-linear-attention-for","title":"EfficientViT: Multi-Scale Linear Attention for High-Resolution Dense Prediction","date":"2022-05-29","arxiv_id":"2205.14756","repositories_listed":6,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/masked-feature-prediction-for-self-supervised","title":"Masked Feature Prediction for Self-Supervised Visual Pre-Training","date":"2021-12-16","arxiv_id":"2112.09133","repositories_listed":6,"syntology":null},{"url":"/paper/fuxictr-an-open-benchmark-for-click-through","title":"BARS-CTR: Open Benchmarking for Click-Through Rate Prediction","date":"2020-09-12","arxiv_id":"2009.05794","repositories_listed":6,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}}],"syntology_records":20,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}