- Rating
- 2
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies the selection of lossless compression pipelines for numerical data under different priorities for compressed size, compression time, and decompression time. It proposes a reinforcement-learning-based method that searches reversible operator trees and uses a byte lower bound to prune unpromising branches. The paper compares weighted objective values across six preference settings on a selected test subset from five datasets.
Critical strengths
The paper combines adjustable objectives for compressed size, compression time, and decompression time with reversible operator composition and certified pruning, providing a unified way to search for pipelines under different application priorities.
Critical weaknesses
The main results use a post-hoc selected test subset, and the relationship between the interim selector used in the experiments and the full reinforcement-learning method is unclear. This makes it difficult to assess the proposed method’s performance on the complete test set.
Questions for authors
- Could the authors clarify which implementation produced the OCRL results in Tables 1 and 2? Section 5.1 describes a deterministic weight-gated interim selector, while Section 5.3 describes a frozen weight-by-type selector. Are these results produced by the full method described in Section 4, including GRPO training and pruning? If not, please report the results of the full method separately.
- Could the authors provide a fuller assessment of generalization? Table 1 reports 64 test columns selected post hoc from cases favorable to the interim selector. Please report results on the complete held-out test set and for each dataset, and clarify whether the evaluated weight combinations were seen during training. Results on unseen weights and datasets would also be helpful
2 comments
I thank the authors for their detailed responses and additional experiments, which have addressed my questions.
Critical Weaknesses
W1. We will replace the 64-column claim in Section 5.1 with complete predefined-partition results, mark the subset diagnostic, and identify implementations beside OCRL labels and in captions.
On the 20-dataset partition, the frozen 18-entry weight-by-type selector and direct Zstd share inputs, executable, and complete containers across 448 columns and 486 tasks. Dataset-equal J is lower for the selector at all six weights by 4.70% to 34.67%, with wins on 12, 20, 19, 15, 13, and 15 datasets. Codes 100,010,001,550,505,433 denote (1,0,0),(0,1,0),(0,0,1),(.5,.5,0),(.5,0,.5),(.4,.3,.3). This comparison fixes E0=15.1598 and D0=7.0232 ns/B.
The full partition uses the weight-by-type selector. The submitted weight-100 row uses a hybrid selector. Neither is GRPO evidence.
Questions For Authors
Q1. We will report implementation, applicable checkpoint, selection procedure, candidate-opportunity budget, and online cost scope beside Tables 1-2 and in Sections 5.1-5.3. We will define the revised gate in Section 4.2 and add its ablation in Section 5.3.
The separate factorial uses round-30 seed 0, selected on 19 validation inputs from three seeds without test outcomes. Learned and heuristic orderings use a cap of 16 non-refilling opportunities on 29 frozen slices from 20 test datasets, each with five timing repeats. Some heuristic frontiers end at nine. E includes per-request model loading, search, and final encoding. Native selection includes model loading and search, excluding final encoding and IPC.
Gate ON reduces E by 15.25% with learned ordering and 21.25% with heuristic ordering. Native selection time falls at every weight by 13.44% to 21.53% and 17.59% to 30.51%. Learned J remains higher at all six weights, by 0.14% to 21.31% with the gate OFF and 0.27% to 21.31% with it ON. Under shared validation-frozen task-bucket caps, the gate lowers E by 5.94% and 9.75% while using 26.55% and 14.11% more opportunities. These caps permit overshoot and do not match actual runtime. With the gate ON, learned beats heuristic only at 010, by 7.89% in E and 0.0267% in J, and has higher J at the other weights.
E/slot effects use five-run task medians, dataset task means, then equal dataset and weight means. The gate saves evaluation under either ordering without establishing learned superiority. The factorial disables the submitted certified subtree rule. The revised gate bound covers one same-sample evaluation, not deployment J or a subtree. B_raw counts pre-transform numeric bytes. E and D use ns/B_raw. D is internal cold decode excluding startup and I/O. This panel fixes E0=6.3754 and D0=2.4286 ns/B. Its J is not comparable with the selector study.
Q2 .We will add the complete selector table and training scope to Section 5.1 and a complete-results appendix.
Cells give selector/Zstd J per dataset. Values below 1 favor the selector.
The overall reduction is 1−mean_d(Js,d)/mean_d(Jz,d), not the mean of displayed ratios. At weight 100, the reduction is 5.94%, the ratio of means is .9406, and the mean row ratio is 1.0336.
Training, validation, and test have pairwise-disjoint source groups, dataset identities, and payload hashes. All six weights were seen in training. The 29 historical slices were held out from this model's training and validation. They provide seen-weight evidence for one policy, without unseen-weight or complete-partition GRPO evidence. The fixed selector provides complete-partition coverage.