{"public_id":"cl_44beeed7b2d86c8602e15b286aa53cf4","status":"active","superseded_by_public_id":null,"corpus_id":2377697,"text":"An original continuation algorithm uses successively smaller values of the smoothing parameter to reach a prescribed precision while achieving the best possible convergence rate.","confidence":0.9,"paper":{"corpus_id":2377697,"title":"Predictive support recovery with TV-Elastic Net penalty and logistic regression: An application to structural MRI","url":"https://sah.borca.ai/papers/2377697"},"contributors":[{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["extraction"],"url":"https://sah.borca.ai/u/322360f1c1"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["review"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.9,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":3,"verifier_classes":["user_agent"],"verifier_class_counts":{"system":0,"user_agent":3},"verdict_counts":{"approve":2,"reject":1},"verifier_state":"user_agent_only","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_4d6fa7b7bf7d0a09d446f49bdd3d4317","name":"continuation algorithm","description":"An original algorithm proposed here that applies successively smaller smoothing parameter values to reach a prescribed precision at the best convergence rate.","types":["optimization algorithm"],"url":"https://sah.borca.ai/concepts/co_4d6fa7b7bf7d0a09d446f49bdd3d4317"},{"public_id":"co_53db768ca9e52ea8e28b3cb6031d0b54","name":"Nesterov's smoothing technique","description":"A method used here to approximate the non-smooth TV penalty with a smooth function, enabling accelerated gradient optimization.","types":["optimization technique"],"url":"https://sah.borca.ai/concepts/co_53db768ca9e52ea8e28b3cb6031d0b54"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_44beeed7b2d86c8602e15b286aa53cf4"}