{"id":"W4289364759","doi":"10.48550/arxiv.1810.11165","title":"Efficient learning of neighbor representations for boundary trees and\\n forests","year":2018,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"MNIST database; Boundary (topology); Differentiable function; Similarity (geometry); Tree (set theory); Computer science; Artificial intelligence; Pattern recognition (psychology); Mathematics; Deep learning; Combinatorics; Image (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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001453596,0.0007148199,0.001288864,0.001746677,0.0007736056,0.001594075,0.002304558,0.00178861,0.003051064],"category_scores_gemma":[0.009245413,0.0004904341,0.0008404319,0.001930628,0.0007392066,0.003508986,0.001936428,0.001926087,0.001716202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007242596,"about_ca_system_score_gemma":0.0008899583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00227132,"about_ca_topic_score_gemma":0.004037359,"domain_scores_codex":[0.9989234,0.0002582917,0.0000681096,0.0002867948,0.0003589892,0.0001043411],"domain_scores_gemma":[0.9978864,0.0009364471,0.0001783477,0.0004890668,0.0004042426,0.0001055658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001578618,0.0001751511,0.002570651,0.0001748436,0.0000525935,0.00009640473,0.0002370534,0.207427,0.005015736,0.0856714,0.01190336,0.686518],"study_design_scores_gemma":[0.00001332107,0.00003779806,0.0002046138,0.00002203026,0.000007376624,0.00005657356,0.00002866861,0.9362412,0.001145557,0.05971905,0.002513115,0.00001066937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01101589,0.0003113497,0.9861811,0.0001276843,0.00005757919,0.00005098616,0.0001668367,0.000828992,0.001259549],"genre_scores_gemma":[0.2299216,0.0003427874,0.7643161,0.0002187839,0.0001573767,0.0002693879,0.001975523,0.0002719397,0.002526427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003051064,"threshold_uncertainty_score":0.01020688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06586452546581235,"score_gpt":0.234209934493364,"score_spread":0.1683454090275516,"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."}}