Hub-and-spoke systems from symbolic dynamics can have completely positive mean dimension without uniformly positive mean dimension or entropy, with proofs linking entropy and mean dimension properties at the level of fixed covers.
hub
Compressed sensing
17 Pith papers cite this work. Polarity classification is still indexing.
17
Pith papers citing it
hub tools
citation-role summary
background 2
citation-polarity summary
fields
cs.LG 4 cs.CV 2 eess.SP 2 math.OC 2 astro-ph.CO 1 astro-ph.IM 1 math.DS 1 math.ST 1 physics.geo-ph 1 q-bio.NC 1verdicts
UNVERDICTED 17roles
background 2representative citing papers
Introduces zero-inflated Gaussian distributions for EDAs to jointly optimize sparsity patterns and active parameter values without bi-level schemes or custom operators.
Polynomial-time SDP and ellipsoid-based approximation of Kolmogorov widths yields efficient robust detection boundaries matching upper bounds up to polylog factors for structured constrained signals.
CSGuard binds diffusion-model watermarks to a secret matrix via compressed sensing, cutting forgery attack success from 100% to 28.12% while preserving 100% detection on legitimate images.
DUSG-Tomo-Net performs super-resolved gridless TomoSAR inversion by learning a Toeplitz-structured covariance representation from single-look nonuniform-baseline data via deep unfolding and projection enforcement.
Sparse autoencoders resolve superposition in image-based neuron representations, recovering geometric fidelity and enabling scRNA-seq adaptation plus GW-map alignment to reconstruct pathology pathways without spatial transcriptomics.
Differential Unfolding replaces uniform stacking in deep unfolding networks with a heterogeneous structure of anchoring and differential evolution stages to achieve better accuracy-efficiency trade-offs in video SCI reconstruction.
Extends variable projection to constrained separable nonlinear least-squares via bilevel collapse, yielding exact reduced gradients and a convergent conditional-gradient algorithm.
Introduces a local measurement-manifold compatibility measure that bounds stable reconstruction error under generative priors and motivates fixed and adaptive acquisition rules.
The paper formalizes residual margin stability via span-level idealizations for SRC, derives a lower bound under coverage and separation assumptions, and proposes geometry-shaping training objectives evaluated under fixed SRC/OMP inference.
Random undersampling reduces SPR measurements by a factor of 6 on a carbon fibre-aluminium composite using weighted random sampling on sparse signals.
Introduces group sparsity constraint and soft energy lower bound in compressed sensing to reconstruct directional wave spectra from sparse multi-channel buoy data.
Mathematical analysis shows sparse linear regression mitigates output dimension collapse in brain-to-image reconstruction at small data scales by exploiting sparsity in the brain-to-feature mapping.
New inconsistent alternating projection scheme for basis pursuit with linear convergence proofs and competitive benchmarks.
Extends Fano bounds to sufficiency of low conditional entropy and defines a quantum entanglement task for infinite-dimensional systems with bounds via maximal singlet fraction of finite-dimensional approximations.
A review of Faraday Rotation Measure Synthesis techniques and SKA Array Assembly stages for high-resolution Faraday tomography of cosmic magnetic structures.
Review of cosmic ray production and radio emission in galaxy clusters with recommendations for SKA observations of magnetic fields and low-energy particles.
citing papers explorer
-
On the coherent extension of some Fano-type learning bounds
Extends Fano bounds to sufficiency of low conditional entropy and defines a quantum entanglement task for infinite-dimensional systems with bounds via maximal singlet fraction of finite-dimensional approximations.