Compactly Supported Quasi-tight Multiframelets with High Balancing Orders and Compact Framelet Transforms
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Framelets (a.k.a. wavelet frames) are of interest in both theory and applications. Quite often, tight or dual framelets with high vanishing moments are constructed through the popular oblique extension principle (OEP). Though OEP can increase vanishing moments for improved sparsity, it has a serious shortcoming for scalar framelets: the associated discrete framelet transform is often not compact and deconvolution is unavoidable. Here we say that a framelet transform is compact if it can be implemented by convolution using only finitely supported filters. On the other hand, in sharp contrast to the extensively studied scalar framelets, multiframelets (a.k.a. vector framelets) derived through OEP from refinable vector functions are much less studied and are far from well understood. Also, most constructed multiframelets often lack balancing property which reduces sparsity. In this paper, we are particularly interested in quasi-tight multiframelets, which are special dual multiframelets but behave almost identically as tight multiframelets. From any compactly supported \emph{refinable vector function having at least two entries}, we prove that we can always construct through OEP a compactly supported quasi-tight multiframelet such that (1) its associated discrete framelet transform is compact and has the highest possible balancing order; (2) all compactly supported framelet generators have the highest possible order of vanishing moments, matching the approximation/accuracy order of its underlying refinable vector function. This result demonstrates great advantages of OEP for multiframelets (retaining all the desired properties) over scalar framelets.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it