Paper develops efficient algorithms to estimate channel subspace from low-dimensional projections.
problem Estimating channel subspace information from limited projections in JSDM.
method Develops novel algorithms requiring sampling only O(2√M) elements for p-dim beamformer.
result Estimators return a p-dim beamformer with performance comparable to full knowledge.
PixelHop++ improves image classification with a smaller model size.
problem Improving image classification models with smaller sizes.
method Decomposing input tensor, channel-wise Saab transform, successive subspace learning, feature ranking.
result PixelHop++ offers a flexible tradeoff between model size and performance.
This paper presents a novel approach to speaker subspace modelling based on Gaussian-Binary Restricted Boltzmann Machines (GRBM). The proposed model is based on the idea of shared factors as in the Probabilistic Linear Discriminant Analysis (PLDA). GRBM hidden layer is divided into speaker and channel factors, herein t…
Paper models dynamic multivariate functional data with sparse subspace learning.
problem Complex, high-dimensional multivariate functional data with evolving cross-correlations.
method Sparse subspace learning for automatic subspaces formulation and cross-correlation dynamics description.
result Efficient estimation and feature extraction of multivariate functional data.
BankGCN improves graph convolution networks by handling multi-channel signals with adaptive filter banks.
problem Handling multi-channel graph signals with limited architectures.
method BankGCN decomposes multi-channel signals into subspaces and uses adapted filters for each subspace.
result BankGCN achieves excellent performance in graph classification on benchmark datasets.
New subspace methods resist limited adversary corruption on test instances.
problem Adversary can corrupt up to l features in test instances.
method Subspace voting techniques to transform algorithms.
result Significant fraction of voting hypotheses do not contain corrupt features.
VAE leverages MMSE channel estimation with data-driven modeling.
problem Data-driven channel estimation for wireless communications.
method Variational autoencoder (VAE) modeling of channel distribution and LMMSE approximation.
result VAE-based channel estimators approximate MMSE performance with practical training methods.
New DL algorithm estimates OFDM channels without pilots.
problem Estimating OFDM channels in deep fading conditions.
method Deep learning (DL) for blind channel estimation.
result First theory on MSE performance of DL-based estimator.
A new DVAE architecture improves channel estimation by incorporating temporal correlations.
problem Improving the estimation of time-varying channels.
method Introducing k-MemoryMarkovVAE (k-MMVAE) architecture to learn temporal correlations.
result The k-MMVAE aided channel estimator outperforms other ML aided estimators.
Paper proposes online learning for MIMO channel estimation using neural networks.
problem Challenges in MIMO channel estimation due to physical model simplifications and system configuration requirements.
method Unfold a channel estimation algorithm as a neural network, allowing online learning and correction of imperfect models.
result Achieves channel estimation error close to that of a perfectly calibrated system.
Deep learning improves channel estimation in communication systems.
problem Improving channel estimation accuracy in communication systems.
method Proposed a deep learning pipeline using image processing techniques to estimate channel response.
result The proposed algorithm shows comparable performance to MMSE with full channel knowledge and better than ALMMSE.
Deep learning predicts V2I channel responses for high-mobility wireless communications.
problem Efficient channel estimation for high-mobility V2I communications.
method Developed a deep neural network-based channel prediction method.
result Deep neural networks can learn and predict V2I channel properties in real-time.
ReQuestNet simplifies 5G channel estimation with a unified model.
problem Complex channel estimation in 5G systems with varying conditions.
method Unified neural architecture that handles dynamic resource blocks and transmit layers.
result Significantly outperforms legacy methods, achieving up to 10dB gain at high SNRs.
BestChanID identifies the channel with maximal capacity using training sequences.
problem Identifying the channel with maximal capacity among several discrete memoryless channels.
method Formulated as a multi-armed bandit problem, proposed a capacity estimator, and developed gap-elimination algorithms.
result Guaranteed to output the DMC with the largest capacity with a desired confidence.
ICE algorithm removes noisy channel assumption for universal discrete denoising.
problem Universal discrete denoising under channel uncertainty.
method Iterative channel estimation based on Neural DUDE, alternating channel estimation and neural network parameter estimation.
result ICE-N-DUDE achieves superior performance regardless of channel and clean source uncertainties.
Paper proposes neural network for efficient MIMO channel estimation and pilot reduction.
problem High overhead from pilot transmission in wideband MIMO systems.
method Neural network architecture for frequency-aware pilot design and channel estimation, with pruning technique.
result Neural network outperforms linear minimum mean square error (LMMSE) estimation.
Biological neural network mimics CCA for multi-channel data.
problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.
New model estimates unknown number of users in asynchronous multiuser communication.
problem Estimating unknown number of users in asynchronous multiuser communication.
method Infinite factorial finite state machine model with Bayesian nonparametric approach.
result Effective recovery of data-generating process for various scenarios.
A nonlinear channel estimator using complex Least Square Support Vector Machines (LS-SVM) is proposed for pilot-aided OFDM system and applied to Long Term Evolution (LTE) downlink under high mobility conditions. The estimation algorithm makes use of the reference signals to estimate the total frequency response of the …
A-MMSE uses attention to learn efficient OFDM channel estimation.
problem Accurate OFDM channel estimation requires second-order statistics, which are hard to obtain in practice.
method A-MMSE is a model-based DNN framework that learns linear MMSE filters via Attention Transformer, reducing inference complexity.
result A-MMSE outperforms other methods in normalized MSE across various SNR conditions.
Paper bounds subspace estimator error from noisy projections.
problem Estimating subspaces from noisy data.
method Derives perturbation bound on optimal subspace estimator.
result Fundamental result with implications in matrix completion and clustering.
Iterative BP-CNN improves channel decoding under correlated noise.
problem Channel decoding under correlated noise.
method Concatenates CNN with BP decoder, iteratively improving SNR.
result Iterative BP-CNN achieves better BER with lower complexity.
Existing methods for sparse channel estimation typically provide an estimate computed as the solution maximizing an objective function defined as the sum of the log-likelihood function and a penalization term proportional to the l1-norm of the parameter of interest. However, other penalization terms have proven to have…
Neural network improves K-factor estimation for OFDM systems.
problem Estimating Ricean K factor for link quality in OFDM systems.
method Classified as a classification problem, neural network estimates K factor at transmitter side.
result High accuracy in K factor estimation with reduced feedback bandwidth.
Bayesian methods reduce variance in subspace identification for small data sets.
problem High variance in traditional subspace identification methods for large models or small sample sizes.
method Investigation of Bayesian estimation solutions (regularized and shrinkage estimators) for subspace identification.
result Bayesian estimators reduce estimation risk by up to 40% compared to traditional methods.
In this letter, we consider two sets of observations defined as subspace signals embedded in noise and we wish to analyze the distance between these two subspaces. The latter entails evaluating the angles between the subspaces, an issue reminiscent of the well-known Procrustes problem. A Bayesian approach is investigat…
Deep learning improves one-bit OFDM receiver performance.
problem One-bit quantization complicates accurate channel estimation and data detection in OFDM receivers.
method Developed deep neural networks for channel estimation and data detection, using a two-step training policy.
result Deep learning-based designs achieve lower BER than unquantized OFDM at moderate SNRs.
In this paper, we present a Bayesian channel estimation algorithm for multicarrier receivers based on pilot symbol observations. The inherent sparse nature of wireless multipath channels is exploited by modeling the prior distribution of multipath components' gains with a hierarchical representation of the Bessel K pro…
Proposes C2AF network for multi-view time series classification.
problem Improving multi-view time series classification performance.
method Two-stream structured encoder, graph-based correlation matrix, channel-aware fusion mechanism.
result Extensive experimental results show superior performance over state-of-the-art methods.
DNNs improve localization from channel estimates, overcoming practical impairments.
problem Improving localization accuracy from channel estimates in Massive MIMO systems.
method Principled feature design for DNNs invariant to practical impairments.
result DNN achieves high localization accuracy and generalization capability.
This paper considers the problem of robust subspace recovery: given a set of N points in RD, if many lie in a d-dimensional subspace, then can we recover the underlying subspace? We show that Tyler's M-estimator can be used to recover the underlying subspace, if the percentage of the inliers is larger t…
Unified framework for structured principal subspace estimation with bounds and rates.
problem Structured principal subspace estimation problems.
method Unified framework, minimax lower and upper bounds, information-geometric complexity.
result Minimax rates of convergence for specific settings, including optimal rates for non-negative PCA/SVD.
New methods for robust subspace recovery in noisy data with adversarial outliers.
problem Robust subspace recovery in the presence of adversarial outliers.
method Proposed two tractable estimators: a variant of RANSAC and a simple relaxation of the theoretical estimator.
result Achieve state-of-the-art theoretical performance in a noiseless RSR setting with adversarial outliers.
Theoretical guarantees for STE, a robust subspace recovery method.
problem Recovering a low-dimensional subspace from corrupted data.
method Subspace-constrained Tyler's estimator (STE) with initialization conditions.
result STE can effectively recover the subspace under certain conditions.
CDA framework infers channel influence from aggregated data without user identifiers.
problem Lack of user-level path data due to privacy regulations and platform restrictions.
method CDA integrates PCMCI for causal discovery and Structural Causal Model for effect estimation.
result CDA achieves strong accuracy in estimating channel influence, even under structural uncertainty.
New method uses VAEs for blind channel equalization and decoding.
problem Blind channel equalization and decoding without pilot symbols.
method Variational autoencoders (VAEs) for blind channel equalization and decoding.
result Significant improvement in error rate compared to existing methods.
New method estimates active subspaces for jump-discontinuous functions.
problem Estimating active subspaces for discontinuous functions like ABMs.
method Extending active subspaces to discontinuous functions, using Gaussian process.
result Identifies important parameters in ABM simulations of refugee movement.
New method separates noisy auto-correlated components from multi-channel measurements.
problem Separating independent auto-correlated components from noisy multi-channel data.
method Simultaneous reconstruction and separation of components considering all channels, using information field theory.
result Significant improvement in signal-to-noise ratio, allowing separations even in high noise conditions.
We consider the task of opportunistic channel access in a primary system composed of independent Gilbert-Elliot channels where the secondary (or opportunistic) user does not dispose of a priori information regarding the statistical characteristics of the system. It is shown that this problem may be cast into the framew…
A new method prunes neural network channels based on operation characteristics.
problem Compressing deep neural networks efficiently and maintaining accuracy.
method Differentiable masks for channel pruning considering BN and ReLU.
result Outstanding performance in accuracy with less resources compared to state-of-the-art methods.
We study sparse principal components analysis in high dimensions, where p (the number of variables) can be much larger than n (the number of observations), and analyze the problem of estimating the subspace spanned by the principal eigenvectors of the population covariance matrix. We introduce two complementary not…
A method for identifying joint and individual subspaces from multi-view data.
problem Unclear conditions for reliably identifying joint and individual subspaces from noisy, high-dimensional measurements.
method Rigorously quantifies conditions based on signal rank, principal angles, and noise levels. Characterizes spectrum perturbations of product of projection matrices.
result Estimates joint and individual subspaces more accurately than existing approaches in simulations and real-world applications.
The paper improves alignment methods for deep neural networks using geometric and spectral analysis.
problem Improving alignment methods for deep neural networks.
method Geometric and spectral analysis of residual Jacobian chains.
result Deterministic and margin-verified results on the transport of dominant singular subspaces across layers.
New ML models improve VVLC channel characterization for vehicular OWC.
problem Inaccurate channel models for VVLC due to mobility effects.
method Machine learning (ML) models incorporating ambient light, turbulence, and reflection effects.
result ML models predict VVLC channel loss and CFR more accurately than existing methods.
Proposes a new algorithm to estimate invariant subspaces across multilayer networks.
problem Estimating invariant subspaces across heterogeneous multiple networks.
method Bias-corrected joint spectral embedding algorithm that recursively calibrates diagonal bias and iteratively updates the subspace estimator.
result Established entrywise subspace perturbation bound and entrywise eigenvector central limit theorem for the algorithm.
Study on estimating covariance and precision matrices along specific subspaces.
problem Estimating covariance and precision matrices along prescribed subspaces or directions.
method Analysis of finite sample covariance, focusing on components corresponding to desired subspaces or directions.
result Estimation accuracy depends almost exclusively on components corresponding to desired subspaces or directions.
Random orthogonalization improves FL in massive MIMO systems without CSI.
problem Efficient model aggregation in FL with minimal channel estimation overhead.
method Combining FL with massive MIMO's channel hardening and favorable propagation, random orthogonalization reduces channel estimation overhead.
result Achieves model aggregation without CSI, significantly reducing channel estimation overhead.
Robust STAP with coprime arrays reduces clutter using sparse modeling.
problem Limited performance due to training samples support in practical applications.
method Two-stage approach: 1) RD virtual snapshot, 2) RD sparse measurement modeling with OMP-like recovery.
result Robust to prior knowledge errors, good clutter suppression performance.