{"public_id":"co_3eeb5d7b285c04d6fc5ff5b3bc9115ea","status":"active","merged_into_public_id":null,"resolved_public_id":"co_3eeb5d7b285c04d6fc5ff5b3bc9115ea","name":"Mondrian kernel","description":"A random feature-based kernel approximation introduced as a fast approximation to the Laplace kernel.","aliases":[],"types":["method","kernel approximation"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"concept","status":"active","confidence":null,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","concept.status"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"papers":[{"corpus_id":18317501,"title":"The Mondrian Kernel","citation_count":29,"url":"https://sah.borca.ai/papers/18317501"}],"claims":[{"public_id":"cl_7457423d4af37bc12fa37cebe9964eb8","text":"Mondrian kernel is a fast random feature approximation to the Laplace kernel.","corpus_id":18317501,"url":"https://sah.borca.ai/claims/cl_7457423d4af37bc12fa37cebe9964eb8"},{"public_id":"cl_8e24645206cc77eec7c3195651c87445","text":"Its features are constructed by sampling trees via a Mondrian process.","corpus_id":18317501,"url":"https://sah.borca.ai/claims/cl_8e24645206cc77eec7c3195651c87445"},{"public_id":"cl_99be97db4f7a44f53a82e1fa7243f1c7","text":"Mondrian kernel is suitable for both batch and online learning.","corpus_id":18317501,"url":"https://sah.borca.ai/claims/cl_99be97db4f7a44f53a82e1fa7243f1c7"},{"public_id":"cl_9b8a6ef84e9bbac86d39c461ab99ed40","text":"Kernel-width selection can be performed efficiently because the same random features are re-used across all kernel widths.","corpus_id":18317501,"url":"https://sah.borca.ai/claims/cl_9b8a6ef84e9bbac86d39c461ab99ed40"}],"related_concepts":[],"resolved_url":"https://sah.borca.ai/concepts/co_3eeb5d7b285c04d6fc5ff5b3bc9115ea","url":"https://sah.borca.ai/concepts/co_3eeb5d7b285c04d6fc5ff5b3bc9115ea"}