{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_da9f7c1278efe8e2e653747869018a69493e2600f41a4938279cf93950bb7a7e","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_da9f7c1278efe8e2e653747869018a69493e2600f41a4938279cf93950bb7a7e","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"bacd259ee53c1265b6d3fea3d9e8be84c288c5b9d96cccc7a07733a2ce0abd4c","published":"Mon, 20 Jul 2026 00:00:00 -0400","receipt_hash":"bacd259ee53c1265b6d3fea3d9e8be84c288c5b9d96cccc7a07733a2ce0abd4c","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"bacd259ee53c1265b6d3fea3d9e8be84c288c5b9d96cccc7a07733a2ce0abd4c","observed_at":"2026-07-20T04:43:09.641409Z","parent_run_hash":"0fd83663f0f57da59b26313ca1a35283a3e9f06e3165d3e143d26f7174743aca","published":"Mon, 20 Jul 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2604.13780v2 Announce Type: replace-cross \nAbstract: Soft Q-learning has emerged as a versatile model-free method for entropy-regularised reinforcement learning, optimising for returns augmented with a penalty on the divergence from a reference policy. Despite its success, the multi-step extensions of soft Q-learning remain relatively unexplored and limited to on-policy action sampling under the Boltzmann policy. In this brief research note, we first present a formal $n$-step formulation for soft Q-learning and then extend this framework to the fully off-policy case by introducing a novel Soft Tree Backup operator. Finally, we unify these developments into Soft $Q(\\lambda)$, an elegant online, off-policy, eligibility trace framework that allows for efficient credit assignment under arbitrary behaviour policies. Our derivations propose a model-free method for learning entropy-regularised value functions that can be utilised in future empirical experiments.","title":"Soft $Q(\\lambda)$: A multi-step off-policy method for entropy regularised reinforcement learning using eligibility traces","url":"https://arxiv.org/abs/2604.13780","vendor":"arxiv_cs_ai"},"summary":"arXiv:2604.13780v2 Announce Type: replace-cross \nAbstract: Soft Q-learning has emerged as a versatile model-free method for entropy-regularised reinforcement learning, optimising for returns augmented with a penalty on the divergence from a reference policy. Despite its success, the multi-step extensions of soft Q-learning remain relatively unexplored and limited to on-policy action sampling under the Boltzmann policy. In this brief research note, we first present a formal $n$-step formulation for soft Q-learning and then extend this framework to the fully off-policy case by introducing a novel Soft Tree Backup operator. Finally, we unify these developments into Soft $Q(\\lambda)$, an elegant online, off-policy, eligibility trace framework that allows for efficient credit assignment under arbitrary behaviour policies. Our derivations propose a model-free method for learning entropy-regularised value functions that can be utilised in future empirical experiments.","title":"Soft $Q(\\lambda)$: A multi-step off-policy method for entropy regularised reinforcement learning using eligibility traces","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-20T04:43:09Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2604.13780"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:d2ed611b10895c2ef154418347068d90940ea1fa8d9ee6c23ab90f5f6faae3ba4b875c3ffd86fdab194f206ac8a3a9e4f7179b06b7217e79ada9cd1275da9f04","signer":"crovia.substrate","subject":{"observed_at":"2026-07-20T04:43:09Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2604.13780"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"0261d810df065b37d4c381ae454521087f3f95f4afae4eb910709a35898593c6","leaf_index":333395,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"8b7a06c828e2cee57efdaf12bfd89a2669e248a4a471a85d35d08faacfaed473","side":"left"},{"sibling":"d81f92b8fa97bf1a62a651e018667af0239439160356e2c47f63cbf517be28db","side":"left"},{"sibling":"315674a404b8aca8ec01ef987d46af0c7bc3194ec5e93c2f5aeab73918bdabc2","side":"right"},{"sibling":"6247342c1c432802f506d98a3ad92a1a74c604a1ace10def0bc0d3b32bce19b9","side":"right"},{"sibling":"7b7055cf4d248c5a423c6f9235e6bbf89087f96140f239fb92980e2a711e3781","side":"left"},{"sibling":"cafc5529c4d98a0d1cf7ab89a7300fc6c7eaa68c576b882112c3382c257c9b70","side":"right"},{"sibling":"fd7a2f2e44dc3f058d65e59ceb20b3d20eb68b3d8d84208ea601209a4c4df8a9","side":"left"},{"sibling":"5f23b1a0a67d8fa1aa690680510620f249f8d6683d46c202fca306510fbe398e","side":"right"},{"sibling":"f720760992870795e6d2b913ad9162f9e144b821ea97e4dada744d0cac06e93b","side":"right"},{"sibling":"45c0e4431502711514503abd48e8b3d34ee2f4bffa994c883aaf2adecd0ad8e9","side":"left"},{"sibling":"dedd2da92d9447ddf1b1db68fe20109a426ed18359861ed746907ac820021a8d","side":"left"},{"sibling":"a1c43cc7cd9c775fac33940ee5124aece01596733f003fc53743f43483f9f597","side":"right"},{"sibling":"b5ad3eafd7eeb74c063261356fdd9bf6059ee6d0bf1e3c70e60731b394a5536e","side":"left"},{"sibling":"93e399d152203db688c6a5a58d25131205603504f5b79123a1f2b5a5ed9c1e54","side":"right"},{"sibling":"b6e0cad7f6eb9107f0edd276f1a9942635d8cd6d60d2a97e7daac08b110dc209","side":"right"},{"sibling":"80ec062e7e625dc3f9bb5865cb5198696bbec2608e48abae5670677b90695899","side":"right"},{"sibling":"77025bcb374a7ad74f520643e20a8ae1205a7ee78507b0beb93117760f1c29d3","side":"left"},{"sibling":"0aced6f0c9dec3e6cc9e89b68b70f5f8ce7e1eb13606d92db1917b76e57393c7","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":333540,"merkle_root":"ee60f62b8a724dd9bde638d638caf32cefec4440f832018b457ff47a0ec56a8c","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260720T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-20T05:38:36Z","sig_algorithm":"ed25519","signature":"82a3787e628bfab19c377d875220e1aaedfc498736c545f4708a1b887e8398afdf306995994493a36c864ff7139a2d436b905ce7081aaa540789aa4f707dc800","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_da9f7c1278efe8e2e653747869018a69493e2600f41a4938279cf93950bb7a7e"}}