DataProcessing
Navigation page for Blueprint/D5/S3/Estimation/DataProcessing/ at upstream snapshot 988e8ea45e5750acc54388e096d34b4a5be7f7e0.
Contents
- Adaptive Posterior-Policy Sufficiency
- Approximate Simulation Without Exact Attainment
- Nearest Laws With Declared Joint Sources
- Fano Error Bounds after Finite Channels
- Conditional Expectation on Finite Observation Histories
- Finite Convex Hulls for Declared Probability Constraints
- Aggregation of a finite history tree by a public summary
- A chronological probability interpreter for summary policies
- Probability Extension Without Surjective Carrier Bonds
- Total Variation on Compatible Threads
- Feasibility is detected by all level laws
- A nearest feasible completed law
- Probability Extension on Compatible Threads
- One common cut across all levels
- Measurable Descent Error Bounds
- Measurable Maximal Coupling Kernels
- Measurable Postprocessing Defect Contraction
- Measurable Total Variation Triangle
- Finite Convex Hulls of Native Declared Probability Laws
- One-cut equality in a twisted cycle
- Exact ordered-history flow and full archive realization
- Ordered coordinate histories and staged interpretation
- Partial assignment occupancy flows and terminal laws
- Task-Independent Belief Sufficiency
- Universal Belief Decision Sufficiency