{"id":"W2965199817","doi":"","title":"Pure entropic regularization for metrical task systems","year":2019,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Competitive analysis; Randomized algorithm; Online algorithm; Binary logarithm; Metric space; Computer science; Deterministic algorithm; Mathematics; Conditional entropy; Entropy (arrow of time); Embedding; Regularization (linguistics); Exploit; Algorithm; Mathematical optimization; Combinatorics; Discrete mathematics; Upper and lower bounds; Artificial intelligence; Principle of maximum entropy","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.001546557,0.001367602,0.001255954,0.0005571638,0.0006766556,0.001220335,0.001764384,0.001735318,0.006276159],"category_scores_gemma":[0.009871733,0.0004534227,0.0006340182,0.0005752671,0.00148334,0.002409008,0.003217925,0.002606703,0.001192184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001849762,"about_ca_system_score_gemma":0.002040166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003725002,"about_ca_topic_score_gemma":0.00463388,"domain_scores_codex":[0.9989612,0.0003031161,0.00005096266,0.0002682399,0.0002520522,0.0001643432],"domain_scores_gemma":[0.9969457,0.001613795,0.0002526156,0.0005306709,0.0003190079,0.0003382186],"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.0002926872,0.0001426489,0.0008207033,0.000230429,0.00004987532,0.0001373626,0.0001371211,0.6536037,0.006565918,0.2545885,0.009506552,0.07392456],"study_design_scores_gemma":[0.000009942774,0.00002882013,0.00008211062,0.000004351878,0.000002875385,0.00001439485,0.000005562252,0.9574965,0.0004486974,0.04129538,0.0006058521,0.000005506381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04428729,0.0002933952,0.944242,0.00109456,0.00007487062,0.00009274085,0.0002421908,0.0008096513,0.00886327],"genre_scores_gemma":[0.7195572,0.000255849,0.2603301,0.0005545528,0.0001613288,0.000361625,0.000626495,0.0005351771,0.01761769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006276159,"threshold_uncertainty_score":0.02099586,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02489020004812399,"score_gpt":0.2476077590045065,"score_spread":0.2227175589563826,"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."}}