{"id":"W1877180816","doi":"10.48550/arxiv.1207.1415","title":"Approximate Linear Programming for First-order MDPs","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Elevator Systems and Control","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov decision process; Computer science; Bellman equation; Linear programming; Mathematical optimization; Set (abstract data type); Algorithm; Domain (mathematical analysis); Scheduling (production processes); Function (biology); Markov process; Mathematics; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197811,0.001421647,0.001512768,0.0007834287,0.0005775264,0.001549738,0.001285954,0.001464565,0.005041751],"category_scores_gemma":[0.009515841,0.0008617053,0.001149422,0.0009827905,0.001290854,0.001553325,0.001544844,0.002912743,0.0006098798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002090388,"about_ca_system_score_gemma":0.002395521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0070296,"about_ca_topic_score_gemma":0.00820459,"domain_scores_codex":[0.9988355,0.0004720275,0.00004344297,0.0001665126,0.0003275904,0.0001548861],"domain_scores_gemma":[0.9939106,0.00523528,0.0002634561,0.0002084946,0.0002872921,0.00009482819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001968171,0.00001484338,0.0001105146,0.00005100311,0.00001402899,0.00001889098,0.00002819471,0.9626847,0.0001857174,0.02860265,0.0003684588,0.007901311],"study_design_scores_gemma":[0.000005288657,0.000006055032,0.00001077972,0.000004615854,0.000002108857,0.000003456927,0.000003590432,0.9832579,0.0001020166,0.01635856,0.0002439891,0.000001651765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003771308,0.0001548517,0.9938923,0.0001512142,0.00001772961,0.00002632748,0.00004941443,0.0002080108,0.001728927],"genre_scores_gemma":[0.3849685,0.000591621,0.6067161,0.0002589437,0.00009696958,0.0005962987,0.0003626456,0.0003280792,0.006080778],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0070296,"threshold_uncertainty_score":0.01686633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04792486780726249,"score_gpt":0.1712421801003338,"score_spread":0.1233173122930713,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}