{"id":"W1516611346","doi":"10.1287/opre.2017.1705","title":"Inverse Optimization with Noisy Data","year":2018,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematical optimization; Inverse problem; Regularization (linguistics); Optimization problem; Mathematics; Heuristics; Curse of dimensionality; Computer science; Duality (order theory); Algorithm; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004271118,0.0001546463,0.0001479231,0.0002900458,0.0002280868,0.0003964583,0.0008368198,0.0001902259,0.0002140375],"category_scores_gemma":[0.00007745068,0.0001393204,0.00001515694,0.0002905474,0.0001580257,0.0002003089,0.001178791,0.0007822019,0.0001012401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009204428,"about_ca_system_score_gemma":0.0001966636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002835892,"about_ca_topic_score_gemma":0.0007416242,"domain_scores_codex":[0.9986548,0.0001075668,0.0001562688,0.0004058084,0.0004144812,0.0002610178],"domain_scores_gemma":[0.9973876,0.00003279188,0.00000755333,0.001907356,0.0005953439,0.00006937516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004455603,0.00001493234,0.00001137809,0.00001998881,0.00003847819,0.000007612186,0.00008895691,0.9313119,0.000277742,0.0000622857,0.0677627,0.0003995646],"study_design_scores_gemma":[0.00006763079,0.00003211851,0.00001187714,0.0001650239,0.00001000758,0.000004252487,0.00003161059,0.9913926,0.002498652,0.00006559001,0.005552979,0.0001676585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04246214,0.000427197,0.8992797,0.0006205703,0.0005865468,0.001831671,0.000342631,0.001863869,0.05258575],"genre_scores_gemma":[0.5093654,0.001218066,0.4826441,0.00005035377,0.0009936794,0.0002360762,0.003751867,0.0001780234,0.001562441],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4669033,"threshold_uncertainty_score":0.5681319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2089417900898251,"score_gpt":0.3953565392059529,"score_spread":0.1864147491161278,"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."}}