{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000990952,0.0001945067,0.0003871788,0.00150941,0.0007637198,0.000131942,0.002562305,0.0001621081,0.00009897133],"category_scores_gemma":[0.0001316215,0.0002395092,0.0002242634,0.002228132,0.0003558169,0.001304706,0.001336748,0.0004780015,0.00003350334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002909048,"about_ca_system_score_gemma":0.0004447365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001666825,"about_ca_topic_score_gemma":0.00006288124,"domain_scores_codex":[0.9966404,0.0006008481,0.0001781722,0.0007458819,0.001039409,0.0007952507],"domain_scores_gemma":[0.9971037,0.0005822796,0.0001739856,0.0008507071,0.0008973961,0.00039195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006172759,0.0004127708,0.006735696,0.0005137821,0.0002432369,0.0001072128,0.003156365,0.006773884,0.002501742,0.958936,0.01104809,0.008953956],"study_design_scores_gemma":[0.003609317,0.0011728,0.002335549,0.0001097498,0.00002619324,0.00001147981,0.005189317,0.4589753,0.00006226885,0.006067608,0.5220106,0.0004298592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01115064,0.00004438538,0.9658766,0.001626472,0.0001800613,0.001621088,0.0001327666,0.0001363666,0.01923167],"genre_scores_gemma":[0.7898114,0.001553459,0.1470374,0.00006218987,0.00009210021,0.000001898393,0.0004087277,0.00005000922,0.06098281],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9528684,"threshold_uncertainty_score":0.9766901,"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."}}