{"id":"W3041442431","doi":"10.24963/ijcai.2020/663","title":"Lagrangian Decomposition for Classical Planning (Extended Abstract)","year":2020,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"European Commission","keywords":"Heuristics; Mathematical optimization; Solver; Computation; Computer science; Heuristic; Decomposition; Operator (biology); Lagrangian relaxation; Lagrangian; Abstraction; Algorithm; Mathematics; Applied mathematics","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.000954492,0.0007573488,0.0005701861,0.0008382106,0.0003956046,0.001029386,0.0006504993,0.0004992537,0.01263075],"category_scores_gemma":[0.002766916,0.0004128847,0.001069802,0.001362985,0.001245489,0.0009707175,0.001247594,0.001734017,0.002846535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001972067,"about_ca_system_score_gemma":0.001355657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005941227,"about_ca_topic_score_gemma":0.006322199,"domain_scores_codex":[0.9994825,0.000209352,0.00001766624,0.00005586184,0.00018115,0.00005344958],"domain_scores_gemma":[0.9992749,0.0004516702,0.0000669264,0.00006131949,0.0001046812,0.0000404141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003723777,0.00003832344,0.0001570115,0.0002393678,0.00002806095,0.00007386241,0.0000756171,0.3485181,0.0009114672,0.5926375,0.01052239,0.046761],"study_design_scores_gemma":[0.00001270779,0.00001544783,0.00009817979,0.00005165305,0.000008526596,0.00002033978,0.00001387071,0.6176005,0.0003316787,0.374667,0.007171895,0.000008167402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002859473,0.0007876756,0.9734464,0.0003229838,0.00009346375,0.0000461845,0.0001986398,0.0001639431,0.02208122],"genre_scores_gemma":[0.1979891,0.001490801,0.7796949,0.000313836,0.0002850738,0.0004859041,0.0007460607,0.0003855606,0.0186087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01263075,"threshold_uncertainty_score":0.04225409,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03739064176648905,"score_gpt":0.2967809915805669,"score_spread":0.2593903498140779,"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."}}