{"id":"W4388685739","doi":"10.48550/arxiv.2311.07540","title":"Finding planted cliques using gradient descent","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Combinatorics; Clique; Markov chain Monte Carlo; Mathematics; Omega; Markov chain; Vertex (graph theory); Time complexity; Vertex cover; Discrete mathematics; Gradient descent; Graph; Monte Carlo method; Computer science; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170798,0.001066554,0.001188866,0.0008369416,0.0006920937,0.001024018,0.00162988,0.001336751,0.003217025],"category_scores_gemma":[0.007730778,0.0008396823,0.0008165385,0.0007482489,0.001629369,0.001881466,0.001590982,0.00195049,0.0006680873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0017812,"about_ca_system_score_gemma":0.001928587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006747699,"about_ca_topic_score_gemma":0.01046077,"domain_scores_codex":[0.9992926,0.0002734273,0.00001833843,0.0002048304,0.0001217,0.00008899052],"domain_scores_gemma":[0.9963375,0.002695148,0.0002840036,0.0002724252,0.0002251501,0.0001857789],"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.0001329098,0.0001055584,0.001143554,0.0001264828,0.00009670854,0.0001084304,0.00007507816,0.877542,0.002067249,0.0853799,0.005967565,0.02725455],"study_design_scores_gemma":[0.00001251795,0.000007489261,0.00007016383,0.000004652877,0.000002873041,0.000005852512,0.000005553792,0.9681245,0.0001982783,0.03125424,0.0003104353,0.000003527452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02951024,0.0001877573,0.9655347,0.0006963012,0.0000464797,0.00007390756,0.000172869,0.000682704,0.003095056],"genre_scores_gemma":[0.5089948,0.0002646308,0.4812533,0.0004572,0.00009236782,0.0003208154,0.0008676187,0.0005546759,0.007194615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006747699,"threshold_uncertainty_score":0.01341683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2234772960350749,"score_gpt":0.2309315381908273,"score_spread":0.007454242155752383,"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."}}