{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001457824,0.0001034549,0.0001166261,0.00003356153,0.0001578927,0.0001562754,0.0003751647,0.00006314983,0.00002279355],"category_scores_gemma":[0.00003317847,0.00009339232,0.00007007963,0.0001379949,0.00001242037,0.0002791005,0.00005381076,0.0001271227,0.00005689335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001333375,"about_ca_system_score_gemma":0.00003878395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000481163,"about_ca_topic_score_gemma":8.185522e-7,"domain_scores_codex":[0.9991423,0.00001636555,0.0001663559,0.0002991614,0.000131623,0.0002441734],"domain_scores_gemma":[0.9993859,0.0002171188,0.00005242515,0.0001445675,0.00003694749,0.0001630541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003827299,0.0003123118,0.003950942,0.0004337357,0.000190289,0.00023711,0.0141603,0.0186369,0.04134902,0.3435972,0.3118248,0.2649247],"study_design_scores_gemma":[0.0009415029,0.000424796,0.004284883,0.00007351095,0.00001356414,0.00001545018,0.00007690524,0.9387038,0.007076019,0.004567766,0.04338409,0.0004376554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004234246,0.00005913301,0.9755021,0.01374336,0.0001206639,0.0001358,0.000003913906,0.0004258991,0.005774879],"genre_scores_gemma":[0.8174201,4.305177e-7,0.179488,0.002805008,0.0001464725,0.00001109288,0.00001843919,0.000007663456,0.0001028661],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.920067,"threshold_uncertainty_score":0.3808428,"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."}}