{"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/value-prediction","name":"Value prediction","slug":"value-prediction","description_markdown":null,"categories":[{"name":"Computer Code","url":"/area/computer-code"},{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":83,"papers_with_code":21,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":0,"subtasks":1,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/value-prediction-on-py150-1","slug":"value-prediction-on-py150-1","dataset":"Py150","dataset_url":null,"rows_in_archive":1,"metrics":["MRR"],"first_row_in_archive_order":{"model":"DFSud","paper_title":"Code Prediction by Feeding Trees to Transformers","paper_url":"/paper/code-prediction-by-feeding-trees-to","paper_date":"2020-03-30","arxiv_id":"2003.13848","code_links":[{"title":"facebookresearch/code-prediction-transformer","url":"https://github.com/facebookresearch/code-prediction-transformer"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/code-prediction-by-feeding-trees-to#ran","syntology_url":"https://syntology.ai/paper/2003.13848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13848"}},"official":{"repos":["facebookresearch/code-prediction-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}}],"datasets":[],"subtasks":[{"url":"/task/body-mass-index-bmi-prediction","name":"Body Mass Index (BMI) Prediction"}],"parent_tasks":[{"url":"/task/program-synthesis","name":"Program Synthesis"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":83,"of":83,"of_with_code":21,"tagged_in_all":83,"counts":{"archive_papers_tagged":83,"with_a_code_link":21,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":83,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":8,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":8,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"items":[{"url":"/paper/uncertainty-based-offline-reinforcement","slug":"uncertainty-based-offline-reinforcement","title":"Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble","date":"2021-10-04","arxiv_id":"2110.01548","repositories_listed":5,"syntology":{"n":21,"n_ran":13,"n_constructed":11,"n_ran_checked":12,"n_instrument":1,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":6,"phrase":"13 ran (of which 11 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/uncertainty-based-offline-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2110.01548","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.01548"}},"official":null}},{"url":"/paper/value-prediction-network","slug":"value-prediction-network","title":"Value Prediction Network","date":"2017-07-11","arxiv_id":"1707.03497","repositories_listed":2,"syntology":null},{"url":"/paper/shapley-guided-utility-learning-for-effective","slug":"shapley-guided-utility-learning-for-effective","title":"Shapley-Guided Utility Learning for Effective Graph Inference Data Valuation","date":"2025-03-23","arxiv_id":"2503.18195","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-federated-collaborative","slug":"personalized-federated-collaborative","title":"Personalized Federated Collaborative Filtering: A Variational AutoEncoder Approach","date":"2024-08-16","arxiv_id":"2408.08931","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/personalized-federated-collaborative#ran","syntology_url":"https://syntology.ai/paper/2408.08931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08931"}},"official":{"repos":["mtics/feddae"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-syntax-score-prediction-benchmark","slug":"end-to-end-syntax-score-prediction-benchmark","title":"CardioSyntax: end-to-end SYNTAX score prediction -- dataset, benchmark and method","date":"2024-07-29","arxiv_id":"2407.19894","repositories_listed":1,"syntology":null},{"url":"/paper/spatial-division-augmented-occupancy-field","slug":"spatial-division-augmented-occupancy-field","title":"Spatial-Division Augmented Occupancy Field for Bone Shape Reconstruction from Biplanar X-Rays","date":"2024-07-22","arxiv_id":"2407.15433","repositories_listed":1,"syntology":null},{"url":"/paper/worldvaluesbench-a-large-scale-benchmark","slug":"worldvaluesbench-a-large-scale-benchmark","title":"WorldValuesBench: A Large-Scale Benchmark Dataset for Multi-Cultural Value Awareness of Language Models","date":"2024-04-25","arxiv_id":"2404.16308","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/worldvaluesbench-a-large-scale-benchmark#ran","syntology_url":"https://syntology.ai/paper/2404.16308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.16308"}},"official":{"repos":["demon702/worldvaluesbench"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/supercompiler-code-optimization-with-zero","slug":"supercompiler-code-optimization-with-zero","title":"CompilerDream: Learning a Compiler World Model for General Code Optimization","date":"2024-04-24","arxiv_id":"2404.16077","repositories_listed":1,"syntology":null},{"url":"/paper/extremecast-boosting-extreme-value-prediction","slug":"extremecast-boosting-extreme-value-prediction","title":"ExtremeCast: Boosting Extreme Value Prediction for Global Weather Forecast","date":"2024-02-02","arxiv_id":"2402.01295","repositories_listed":1,"syntology":null},{"url":"/paper/a-multi-granularity-aware-aspect-learning","slug":"a-multi-granularity-aware-aspect-learning","title":"A Multi-Granularity-Aware Aspect Learning Model for Multi-Aspect Dense Retrieval","date":"2023-12-05","arxiv_id":"2312.02538","repositories_listed":1,"syntology":null},{"url":"/paper/spatiotemporal-graph-neural-networks-with","slug":"spatiotemporal-graph-neural-networks-with","title":"Uncertainty-Aware Probabilistic Graph Neural Networks for Road-Level Traffic Accident Prediction","date":"2023-09-10","arxiv_id":"2309.05072","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-from-passive-data-via","slug":"reinforcement-learning-from-passive-data-via","title":"Reinforcement Learning from Passive Data via Latent Intentions","date":"2023-04-10","arxiv_id":"2304.04782","repositories_listed":1,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":4,"n_honours":3,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/reinforcement-learning-from-passive-data-via#ran","syntology_url":"https://syntology.ai/paper/2304.04782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.04782"}},"official":{"repos":["dibyaghosh/icvf_release"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-fast-and-slow-a-goal-directed-memory","slug":"learning-fast-and-slow-a-goal-directed-memory","title":"Learning, Fast and Slow: A Goal-Directed Memory-Based Approach for Dynamic Environments","date":"2023-01-31","arxiv_id":"2301.13758","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-estimation-bias-in-double-q-learning-1","slug":"on-the-estimation-bias-in-double-q-learning-1","title":"On the Estimation Bias in Double Q-Learning","date":"2021-09-29","arxiv_id":"2109.14419","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-the-estimation-bias-in-double-q-learning-1#ran","syntology_url":"https://syntology.ai/paper/2109.14419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.14419"}},"official":{"repos":["stilwell-git/doubly-bounded-q-learning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-state-representations-from-random","slug":"learning-state-representations-from-random","title":"Learning State Representations from Random Deep Action-conditional Predictions","date":"2021-02-09","arxiv_id":"2102.04897","repositories_listed":1,"syntology":null},{"url":"/paper/date-dual-attentive-tree-aware-embedding-for","slug":"date-dual-attentive-tree-aware-embedding-for","title":"DATE: Dual Attentive Tree-aware Embedding for Customs Fraud Detection","date":"2020-08-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/timexplain-a-framework-for-explaining-the","slug":"timexplain-a-framework-for-explaining-the","title":"timeXplain -- A Framework for Explaining the Predictions of Time Series Classifiers","date":"2020-07-15","arxiv_id":"2007.07606","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/timexplain-a-framework-for-explaining-the#ran","syntology_url":"https://syntology.ai/paper/2007.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.07606"}},"official":{"repos":["loadingbyte/timexplain"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/piven-a-deep-neural-network-for-prediction","slug":"piven-a-deep-neural-network-for-prediction","title":"PIVEN: A Deep Neural Network for Prediction Intervals with Specific Value Prediction","date":"2020-06-09","arxiv_id":"2006.05139","repositories_listed":1,"syntology":null},{"url":"/paper/spatial-action-maps-for-mobile-manipulation","slug":"spatial-action-maps-for-mobile-manipulation","title":"Spatial Action Maps for Mobile Manipulation","date":"2020-04-20","arxiv_id":"2004.09141","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spatial-action-maps-for-mobile-manipulation#ran","syntology_url":"https://syntology.ai/paper/2004.09141","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09141"}},"official":{"repos":["jimmyyhwu/spatial-action-maps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ace-an-actor-ensemble-algorithm-for","slug":"ace-an-actor-ensemble-algorithm-for","title":"ACE: An Actor Ensemble Algorithm for Continuous Control with Tree Search","date":"2018-11-06","arxiv_id":"1811.02696","repositories_listed":1,"syntology":null},{"url":"/paper/treeqn-and-atreec-differentiable-tree","slug":"treeqn-and-atreec-differentiable-tree","title":"TreeQN and ATreeC: Differentiable Tree-Structured Models for Deep Reinforcement Learning","date":"2017-10-31","arxiv_id":"1710.11417","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/treeqn-and-atreec-differentiable-tree#ran","syntology_url":"https://syntology.ai/paper/1710.11417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11417"}},"official":{"repos":["oxwhirl/treeqn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":null,"slug":"shore-a-long-term-user-lifetime-value","title":"SHORE: A Long-term User Lifetime Value Prediction Model in Digital Games","date":"2025-06-12","arxiv_id":"2506.10487","repositories_listed":0,"syntology":null},{"url":null,"slug":"mini-game-lifetime-value-prediction-in-wechat","title":"Mini-Game Lifetime Value Prediction in WeChat","date":"2025-05-21","arxiv_id":"2506.11037","repositories_listed":0,"syntology":null},{"url":null,"slug":"genprm-scaling-test-time-compute-of-process","title":"GenPRM: Scaling Test-Time Compute of Process Reward Models via Generative Reasoning","date":"2025-04-01","arxiv_id":"2504.00891","repositories_listed":0,"syntology":null},{"url":null,"slug":"partially-observable-reinforcement-learning","title":"Partially Observable Reinforcement Learning with Memory Traces","date":"2025-03-19","arxiv_id":"2503.15200","repositories_listed":0,"syntology":null},{"url":null,"slug":"influencenet-ai-models-for-banzhaf-and","title":"InfluenceNet: AI Models for Banzhaf and Shapley Value Prediction","date":"2025-03-11","arxiv_id":"2503.08381","repositories_listed":0,"syntology":null},{"url":null,"slug":"constructa-automating-commercial-construction","title":"CONSTRUCTA: Automating Commercial Construction Schedules in Fabrication Facilities with Large Language Models","date":"2025-02-17","arxiv_id":"2502.12066","repositories_listed":0,"syntology":null},{"url":null,"slug":"auction-design-using-value-prediction-with","title":"Auction Design using Value Prediction with Hallucinations","date":"2025-02-12","arxiv_id":"2502.08792","repositories_listed":0,"syntology":null},{"url":null,"slug":"digital-twin-enabled-real-time-control-in","title":"Digital Twin Synchronization: Bridging the Sim-RL Agent to a Real-Time Robotic Additive Manufacturing Control","date":"2025-01-29","arxiv_id":"2501.18016","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-regression-based-watch-time","title":"Generative Regression Based Watch Time Prediction for Short-Video Recommendation","date":"2024-12-28","arxiv_id":"2412.20211","repositories_listed":0,"syntology":null},{"url":null,"slug":"st-rep-learning-predictive-representations","title":"ST-ReP: Learning Predictive Representations Efficiently for Spatial-Temporal Forecasting","date":"2024-12-19","arxiv_id":"2412.14537","repositories_listed":0,"syntology":null},{"url":null,"slug":"customer-lifetime-value-prediction-with","title":"Customer Lifetime Value Prediction with Uncertainty Estimation Using Monte Carlo Dropout","date":"2024-11-24","arxiv_id":"2411.15944","repositories_listed":0,"syntology":null},{"url":null,"slug":"pairwise-markov-chains-for-volatility","title":"Pairwise Markov Chains for Volatility Forecasting","date":"2024-11-18","arxiv_id":"2411.11838","repositories_listed":0,"syntology":null},{"url":null,"slug":"optdist-learning-optimal-distribution-for","title":"OptDist: Learning Optimal Distribution for Customer Lifetime Value Prediction","date":"2024-08-16","arxiv_id":"2408.08585","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-well-can-vision-language-models-see-image","title":"How Well Can Vision Language Models See Image Details?","date":"2024-08-07","arxiv_id":"2408.03940","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimal-tightness-bound-for-the-simulation","title":"An Optimal Tightness Bound for the Simulation Lemma","date":"2024-06-24","arxiv_id":"2406.16249","repositories_listed":0,"syntology":null},{"url":null,"slug":"alphazeroes-direct-score-maximization","title":"AlphaZeroES: Direct score maximization outperforms planning loss minimization","date":"2024-06-12","arxiv_id":"2406.08687","repositories_listed":0,"syntology":null},{"url":null,"slug":"biology-inspired-joint-distribution-neurons","title":"Biology-inspired joint distribution neurons based on Hierarchical Correlation Reconstruction allowing for multidirectional neural networks","date":"2024-05-08","arxiv_id":"2405.05097","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffstock-probabilistic-relational-stock","title":"DiffSTOCK: Probabilistic relational Stock Market Predictions using Diffusion Models","date":"2024-03-21","arxiv_id":"2403.14063","repositories_listed":0,"syntology":null},{"url":null,"slug":"value-prediction-for-spatiotemporal-gait-data","title":"Value Prediction for Spatiotemporal Gait Data Using Deep Learning","date":"2024-02-29","arxiv_id":"2403.07926","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-structural-knowledge-exploitation-and","title":"Deep Structural Knowledge Exploitation and Synergy for Estimating Node Importance Value on Heterogeneous Information Networks","date":"2024-02-19","arxiv_id":"2402.12411","repositories_listed":0,"syntology":null},{"url":null,"slug":"airi-predicting-retention-indices-and-their","title":"AIRI: Predicting Retention Indices and their Uncertainties using Artificial Intelligence","date":"2024-01-03","arxiv_id":"2401.01506","repositories_listed":0,"syntology":null},{"url":null,"slug":"ehancing-ct-image-synthesis-from-multi-modal","title":"Enhancing CT Image synthesis from multi-modal MRI data based on a multi-task neural network framework","date":"2023-12-13","arxiv_id":"2312.08343","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-market-value-in-professional","title":"Explainable artificial intelligence model for identifying Market Value in Professional Soccer Players","date":"2023-11-08","arxiv_id":"2311.04599","repositories_listed":0,"syntology":null},{"url":null,"slug":"sage-structured-attribute-value-generation","title":"SAGE: Structured Attribute Value Generation for Billion-Scale Product Catalogs","date":"2023-09-12","arxiv_id":"2309.05920","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-meta-learning-based-stacked-regression","title":"A Meta-learning based Stacked Regression Approach for Customer Lifetime Value Prediction","date":"2023-08-07","arxiv_id":"2308.08502","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-multi-view-framework-for-customer","title":"Contrastive Multi-view Framework for Customer Lifetime Value Prediction","date":"2023-06-26","arxiv_id":"2306.14400","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-chart-understanding-in-vision-and","title":"Enhanced Chart Understanding in Vision and Language Task via Cross-modal Pre-training on Plot Table Pairs","date":"2023-05-29","arxiv_id":"2305.18641","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-better-understanding-of","title":"Towards a Better Understanding of Representation Dynamics under TD-learning","date":"2023-05-29","arxiv_id":"2305.18491","repositories_listed":0,"syntology":null},{"url":null,"slug":"attentive-continuous-generative-self-training","title":"Attentive Continuous Generative Self-training for Unsupervised Domain Adaptive Medical Image Translation","date":"2023-05-23","arxiv_id":"2305.14589","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimal-time-deadbeat-consensus-and","title":"Minimal-time Deadbeat Consensus and Individual Disagreement Degree Prediction for High-order Linear Multi-agent Systems","date":"2023-04-13","arxiv_id":"2304.06224","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-deep-policy-gradients-with-value","title":"Improving Deep Policy Gradients with Value Function Search","date":"2023-02-20","arxiv_id":"2302.10145","repositories_listed":0,"syntology":null},{"url":null,"slug":"earthquake-magnitude-and-b-value-prediction","title":"Earthquake Magnitude and b value prediction model using Extreme Learning Machine","date":"2023-01-23","arxiv_id":"2301.09756","repositories_listed":0,"syntology":null},{"url":null,"slug":"consciousness-is-learning-predictive","title":"Consciousness is entailed by compositional learning of new causal structures in deep predictive processing systems","date":"2023-01-17","arxiv_id":"2301.07016","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-compile-smartly-for-program-size","title":"Learning Compiler Pass Orders using Coreset and Normalized Value Prediction","date":"2023-01-09","arxiv_id":"2301.05104","repositories_listed":0,"syntology":null},{"url":null,"slug":"simplifying-model-based-rl-learning","title":"Simplifying Model-based RL: Learning Representations, Latent-space Models, and Policies with One Objective","date":"2022-09-18","arxiv_id":"2209.08466","repositories_listed":0,"syntology":null},{"url":null,"slug":"billion-user-customer-lifetime-value","title":"Billion-user Customer Lifetime Value Prediction: An Industrial-scale Solution from Kuaishou","date":"2022-08-29","arxiv_id":"2208.13358","repositories_listed":0,"syntology":null},{"url":null,"slug":"value-consistent-representation-learning-for","title":"Value-Consistent Representation Learning for Data-Efficient Reinforcement Learning","date":"2022-06-25","arxiv_id":"2206.12542","repositories_listed":0,"syntology":null},{"url":null,"slug":"associative-learning-mechanism-for-drug","title":"Associative Learning Mechanism for Drug-Target Interaction Prediction","date":"2022-05-24","arxiv_id":"2205.15364","repositories_listed":0,"syntology":null},{"url":null,"slug":"region-of-interest-focused-mri-to-synthetic","title":"Region of Interest focused MRI to Synthetic CT Translation using Regression and Classification Multi-task Network","date":"2022-03-30","arxiv_id":"2203.16288","repositories_listed":0,"syntology":null},{"url":null,"slug":"autodime-automatic-design-of-interesting","title":"AutoDIME: Automatic Design of Interesting Multi-Agent Environments","date":"2022-03-04","arxiv_id":"2203.02481","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-should-i-trust-you-bellman-the-bellman","title":"Why Should I Trust You, Bellman? The Bellman Error is a Poor Replacement for Value Error","date":"2022-01-28","arxiv_id":"2201.12417","repositories_listed":0,"syntology":null},{"url":null,"slug":"corgi-content-rich-graph-neural-networks-with","title":"CoRGi: Content-Rich Graph Neural Networks with Attention","date":"2021-10-10","arxiv_id":"2110.04866","repositories_listed":0,"syntology":null},{"url":null,"slug":"x-model-improving-data-efficiency-in-deep-1","title":"X-model: Improving Data Efficiency in Deep Learning with A Minimax Model","date":"2021-10-09","arxiv_id":"2110.04572","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-and-leveraging","title":"Understanding and Leveraging Overparameterization in Recursive Value Estimation","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"why-should-i-trust-you-bellman-evaluating-the","title":"Why Should I Trust You, Bellman? Evaluating the Bellman Objective with Off-Policy Data","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-self-training-for-cross-domain","title":"Generative Self-training for Cross-domain Unsupervised Tagged-to-Cine MRI Synthesis","date":"2021-06-23","arxiv_id":"2106.12499","repositories_listed":0,"syntology":null},{"url":null,"slug":"rcurrency-live-digital-asset-trading-using-a","title":"RCURRENCY: Live Digital Asset Trading Using a Recurrent Neural Network-based Forecasting System","date":"2021-06-13","arxiv_id":"2106.06972","repositories_listed":0,"syntology":null},{"url":null,"slug":"turing-an-accurate-and-interpretable-multi","title":"Turing: an Accurate and Interpretable Multi-Hypothesis Cross-Domain Natural Language Database Interface","date":"2021-06-08","arxiv_id":"2106.04559","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-optimality-of-batch-policy","title":"On the Optimality of Batch Policy Optimization Algorithms","date":"2021-04-06","arxiv_id":"2104.02293","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-value-equivalence-principle-for-model","title":"The Value Equivalence Principle for Model-Based Reinforcement Learning","date":"2020-11-06","arxiv_id":"2011.03506","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-deep-policy-gradients-via-state","title":"Rethinking Deep Policy Gradients via State-Wise Policy Improvement","date":"2020-10-19","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-value-improvement-path-towards-better","title":"The Value-Improvement Path: Towards Better Representations for Reinforcement Learning","date":"2020-06-03","arxiv_id":"2006.02243","repositories_listed":0,"syntology":null},{"url":null,"slug":"value-driven-hindsight-modelling-1","title":"Value-driven Hindsight Modelling","date":"2020-02-19","arxiv_id":"2002.08329","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-contextual-information-to-improve-blood","title":"Using Contextual Information to Improve Blood Glucose Prediction","date":"2019-08-24","arxiv_id":"1909.01735","repositories_listed":0,"syntology":null},{"url":null,"slug":"forecasting-wireless-demand-with-extreme","title":"Forecasting Wireless Demand with Extreme Values using Feature Embedding in Gaussian Processes","date":"2019-05-15","arxiv_id":"1905.06744","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-deep-policy-gradient-algorithms-truly","title":"A Closer Look at Deep Policy Gradients","date":"2018-11-06","arxiv_id":"1811.02553","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatial-correlation-and-value-prediction-in","title":"Spatial Correlation and Value Prediction in Convolutional Neural Networks","date":"2018-07-21","arxiv_id":"1807.10598","repositories_listed":0,"syntology":null},{"url":null,"slug":"reliability-and-sharpness-in-border-crossing","title":"Reliability and Sharpness in Border Crossing Traffic Interval Prediction","date":"2017-11-13","arxiv_id":"1711.04848","repositories_listed":0,"syntology":null},{"url":null,"slug":"acquiring-background-knowledge-to-improve","title":"Acquiring Background Knowledge to Improve Moral Value Prediction","date":"2017-09-16","arxiv_id":"1709.05467","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-neural-network-for-non-discrete","title":"Multi-task Neural Network for Non-discrete Attribute Prediction in Knowledge Graphs","date":"2017-08-16","arxiv_id":"1708.04828","repositories_listed":0,"syntology":null},{"url":null,"slug":"customer-lifetime-value-prediction-using","title":"Customer Lifetime Value Prediction Using Embeddings","date":"2017-03-07","arxiv_id":"1703.02596","repositories_listed":0,"syntology":null},{"url":null,"slug":"avoiding-confusion-between-predictors-and","title":"Avoiding Confusion between Predictors and Inhibitors in Value Function Approximation","date":"2013-12-19","arxiv_id":"1312.5714","repositories_listed":0,"syntology":null}],"syntology_records":8,"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"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":8,"papers_where_code_ran_first_page":"/task/value-prediction/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/value-prediction/papers/ran/1","json":"/task/value-prediction/papers/ran/1.json","rows":8}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"80370e396074ab905ebf059ab71c1cdc7d3b21ba23572fe0d498e5ff576da898","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}