{"id":"W2096352571","doi":"10.1109/tsp.2004.831128","title":"Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Minimax; Bounded function; Upper and lower bounds; Algorithm; Redundancy (engineering); Rate–distortion theory; Discrete mathematics; Distortion (music); Combinatorics; Data compression; Computer science; Mathematical optimization; Mathematical analysis","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.001506501,0.001051096,0.0007829387,0.0008119224,0.0004941049,0.001191988,0.001958477,0.001201217,0.001769571],"category_scores_gemma":[0.009837289,0.0004385564,0.0005311628,0.00115312,0.001638862,0.00263431,0.001569958,0.002059761,0.000515473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00208623,"about_ca_system_score_gemma":0.001076302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008512715,"about_ca_topic_score_gemma":0.0007915281,"domain_scores_codex":[0.9987048,0.000397725,0.00007366823,0.00025154,0.0004575585,0.0001147596],"domain_scores_gemma":[0.9954667,0.003162707,0.0004985999,0.0004638464,0.000345963,0.00006219984],"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.0001913907,0.00006211922,0.0004784331,0.000142249,0.00003973985,0.00006299206,0.000154129,0.5485669,0.009673472,0.3283842,0.001347245,0.110897],"study_design_scores_gemma":[0.00002272031,0.00004771512,0.0000873647,0.00001896266,0.000007149316,0.00004251993,0.0000118863,0.9239301,0.003818557,0.07093035,0.001067456,0.0000152246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00764349,0.0003013047,0.9897333,0.0001225515,0.00001985868,0.00005063713,0.00002222269,0.0001927539,0.001914013],"genre_scores_gemma":[0.3949701,0.0009799431,0.5988026,0.0001847841,0.00009059894,0.0004675923,0.000146247,0.0001046671,0.004253463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00208623,"threshold_uncertainty_score":0.01513678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02477583337455361,"score_gpt":0.2605651538793277,"score_spread":0.2357893205047741,"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."}}