Martingale posteriors quantify uncertainty by forward-imputing observations from one-step-ahead predictive distributions, but implementations stop after finitely many imputations. For the empirical P\'olya-urn posterior of a quantile the law of the stopped state is derived. The quantile of the stopped urn measure keeps the familiar martingale tail-sum variance fraction; the deployed stochastic-approximation tracker with frozen gain $c$ does not. Its variance carries an explicit factor $G_a$ with $a=cf_0(q_\tau)$, which may fall below or exceed the tail fraction, and a density-adapted gain restores calibration through a density-free inflation. Shared urn innovations yield the joint law of finitely many quantile levels. For conditional quantile regression, a smoothed martingale posterior started at the ordinary quantile-regression estimator with a full inverse-Jacobian matrix gain satisfies a process Bernstein--von Mises theorem with calibrated finite-horizon bands; scalar or diagonal gains cannot match the sandwich covariance process.
Analytic Continual Learning (ACL) offers a computationally efficient alternative to gradient-based approaches. Recent ACL methods are based on Recursive Least Squares (RLS) and have achieved the state-of-the-art results compared to other alternatives. However, they falter significantly in Class-Incremental Learning scenarios characterized by Long-Tailed distributions. While the ill-conditioning of the autocorrelation (Gram) matrix is a known limitation of RLS, we demonstrate that class imbalance exacerbates this issue into a distinct spectral pathology:"tail"classes suffer from severe spectral collapse, rendering their subspaces numerically indistinguishable from noise. Standard Ridge Regression ($L_2$) fails to address this effectively as it applies isotropic regularization - a uniform penalty that is insufficient to stabilize the tail without over-shrinking the head. To address this, we propose Geometry-Spectral Rectification (GSR), a theoretically grounded framework that treats long-tailed learning as a spectral regularization problem. Unlike standard isotropic regularization (Ridge) which uniformly penalizes all eigenvalues, GSR acts as an anisotropic spectral filter, selectively inflating the collapsed eigenvalues of tail classes. We construct a structured, data-dependent spectral perturbation matrix $\Delta$ that selectively inflates collapsed tail eigen-directions of the Gram matrix. Theoretical analysis proves that GSR guarantees an improved stable rank for the Gram matrix, ensuring numerical stability. Extensive experiments show that GSR establishes a new state-of-the-art for analytic CIL, offering a superior trade-off between computational efficiency and robust generalization in long-tailed settings.
Q. Tran, Ngoc-Hai Nguyen, Quan Dao et al.· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
