Papers › Hierarchical State Abstraction Based on Structural Information Principles

Hierarchical State Abstraction Based on Structural Information Principles

24 Apr 2023arXiv:2304.12000archive 2025-07-28

Xianghua Zeng, Hao Peng, Angsheng Li, Chunyang Liu, Lifang He, Philip S. Yu

State abstraction optimizes decision-making by ignoring irrelevant environmental information in reinforcement learning with rich observations. Nevertheless, recent approaches focus on adequate representational capacities resulting in essential information loss, affecting their performances on challenging tasks. In this article, we propose a novel mathematical Structural Information principles-based State Abstraction framework, namely SISA, from the information-theoretic perspective. Specifically, an unsupervised, adaptive hierarchical state clustering method without requiring manual assistance is presented, and meanwhile, an optimal encoding tree is generated. On each non-root tree node, a new aggregation function and condition structural entropy are designed to achieve hierarchical state abstraction and compensate for sampling-induced essential information loss in state abstraction. Empirical evaluations on a visual gridworld domain and six continuous control benchmarks demonstrate that, compared with five SOTA state abstraction approaches, SISA significantly improves mean episode reward and sample efficiency up to 18.98 and 44.44%, respectively. Besides, we experimentally show that SISA is a general framework that can be flexibly integrated with different representation-learning objectives to improve their performances further.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 7 code samples harvested from 1 repository linked to this paper: 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 7 samples from 1 repository, 4 ran (2 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

ringbdstack/sisa officialmentioned in paperpytorchSyntology: 7 samples, 4 ran (2 instrument-failed) · 3 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested: 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
2ran · our draft was wrong
1ran
3unverified

Licence: 7 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from ringbdstack/sisa. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

ringbdstack/sisa official repository 7 samples, 4 ran (2 instrument-failed) · 3 unverified
CombineDelta source code/dmcontrol/hcse/structural_optimization.py ran · honoured contract no licence file found · pointer only · f5e60b5a2cff1b7e · report fixture: signature node1:Node/0/?, node2:Node/0/?, cut_v:float/0/float, g_vol:float/0/float · returned float · level recorded 2026-09-22
PartitionTree source code/dmcontrol/hcse/structural_optimization.py ran no licence file found · pointer only · 4796f1f98a1ef807 · report fixture: signature node_list:list/1/int, p_vol:float/0/float · returned tuple · level recorded 2026-09-24
trans_to_adj source code/dmcontrol/hcse/structural_optimization.py ran · our draft was wrong no licence file found · pointer only · cb653477a7fefad1 · report fixture: signature graph:DiGraph/0/? · returned ndarray · level recorded 2026-09-22
update_node in 6 papers source code/dmcontrol/hcse/structural_optimization.py ran · our draft was wrong no licence file found · pointer only · 1bc1bd0cbe71477b · report fixture: signature tree:dict/0/? · returned dict · level recorded 2026-09-22
pool_trans source code/dmcontrol/hcse/structural_optimization.py unverified no licence file found · pointer only · 90631a4db26644a6 · report
trans_to_tree source code/dmcontrol/hcse/structural_optimization.py unverified no licence file found · pointer only · 3624ac45dd420fc6 · report
update_depth source code/dmcontrol/hcse/structural_optimization.py unverified no licence file found · pointer only · 064cf08bd1addcc0 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for SISA (graph method: SISA). 16 bricks; individually on a fixture: 11 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified. The assembly has not been run end-to-end.

  1. pool_trans entry · level 0 · unverified · 90631a4db26644a6
  2. trans_to_adj helper · level 1 · ran · our draft was wrong · cb653477a7fefad1
  3. trans_to_tree helper · level 0 · unverified · 3624ac45dd420fc6
  4. update_node helper · level 1 · ran · our draft was wrong · 1bc1bd0cbe71477b
  5. PartitionTree helper · level 1 · ran · 4796f1f98a1ef807
  6. update_depth helper · level 0 · unverified · 064cf08bd1addcc0
  7. CombineDelta helper · level 1 · ran · honoured contract · f5e60b5a2cff1b7e
  8. CompressDelta helper · level 1 · ran · honoured contract · 3c6b6d5f29cb86f2
  9. LayerFirst helper · level 1 · ran · our draft was wrong · 1b537434cdccd2b8
  10. PartitionTreeNode helper · level 1 · ran · fde92ce7415b6f1c
  11. child_tree_deepth helper · level 1 · ran · honoured contract · b16d0d091d08f27f
  12. compressNode helper · level 0 · unverified · 93521ab59f43b3bb
  13. cut_volume helper · level 1 · ran; the contract check could not run · 721b31dc7e862365
  14. get_id helper · level 1 · ran · ce53a55f5f9e228a
  15. graph_parse helper · level 1 · ran · our draft was wrong · 21dda7ecf92b5b2c
  16. merge helper · level 0 · unverified · d5cbf6bb01288b04

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2304.12000") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Continuous ControlDecision MakingRepresentation Learningcontinuous-control

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections