Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for channel order

SOR-Mamba improves Mamba for robust time series forecasting by minimizing channel order bias.

problem Robust time series forecasting with Mamba's sequential order bias.
method SOR-Mamba incorporates regularization to minimize channel order discrepancy and introduces CCM for channel correlation preservation.
result SOR-Mamba enhances robustness to channel order and improves forecasting accuracy.

New techniques improve channel prediction in noisy wireless systems.

problem Predicting channels in wireless communication systems from noisy observations.
method Adapted sequence-to-sequence models and transformers with reverse positional encoding and reversed encoder outputs.
result Improved robustness and relationship capture in channel prediction models.

Channel charting (CC) has been proposed recently to enable logical positioning of user equipments (UEs) in the neighborhood of a multi-antenna base-station solely from channel-state information (CSI). CC relies on dimensionality reduction of high-dimensional CSI features in order to construct a channel chart that captu…

2019-08-07abs ↗pdf ↗

In this paper, we investigate cost-aware joint learning and optimization for multi-channel opportunistic spectrum access in a cognitive radio system. We investigate a discrete time model where the time axis is partitioned into frames. Each frame consists of a sensing phase, followed by a transmission phase. During the …

2018-04-11abs ↗pdf ↗

A new machine learning framework reduces IoT data transfer by two orders of magnitude.

problem Reducing data transfer in IoT devices over wireless channels.
method Developed a machine learning framework for distributed functional compression over GMAC and AWGN channels.
result The framework reduces communication by two orders of magnitude compared to cloud-based methods.

DCMIX learns channel importance for high content imaging.

problem Lack of channel importance information in deep learning-based image analysis.
method Image blending concepts with alpha compositing for arbitrary channels.
result DCMIX learns biologically relevant channel importance without sacrificing prediction performance.

Paper proposes a new pipeline for few-shot classification using forget-update module and channel vector sequence.

problem Few-shot classification with limited support samples.
method Channel vector sequence construction module and forget-update module.
result Pipeline achieves state-of-the-art results on various datasets.

Rényi divergence is related to Rényi entropy much like Kullback-Leibler divergence is related to Shannon's entropy, and comes up in many settings. It was introduced by Rényi as a measure of information that satisfies almost the same axioms as Kullback-Leibler divergence, and depends on a parameter that is called its or…

2012-06-12abs ↗pdf ↗

Quantum channels' contraction under privacy constraints studied.

problem Understanding the privacy constraints on quantum channel contractions.
method Established upper bounds on contraction coefficients for specific divergences under QLDP constraints.
result Upper bounds and full characterization of contraction coefficients for specific quantum distances.

Processing temporal sequences is central to a variety of applications in health care, and in particular multi-channel Electrocardiogram (ECG) is a highly prevalent diagnostic modality that relies on robust sequence modeling. While Recurrent Neural Networks (RNNs) have led to significant advances in automated diagnosis …

2018-02-18abs ↗pdf ↗

Symbol detection for Massive Multiple-Input Multiple-Output (MIMO) is a challenging problem for which traditional algorithms are either impractical or suffer from performance limitations. Several recently proposed learning-based approaches achieve promising results on simple channel models (e.g., i.i.d. Gaussian). Howe…

2019-06-11abs ↗pdf ↗

A new method detects hidden driving forces in systems with multiple observables.

problem Hidden driving forces in systems with multiple observables cannot be detected by scalar statistics.
method Cross-spectral witness for hidden nonequilibrium.
result Two simultaneously observed channels retain an off-diagonal cross-spectral sector inaccessible to scalar reductions.

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.

A framework for multi-agent communication over noisy channels in reinforcement learning.

problem Effective communication between multiple agents in a noisy environment.
method A novel multi-agent partially observable Markov decision process (MA-POMDP) framework considering noisy communication channels.
result Jointly learned policies outperform separate learning of communication and decision making.

LSTM neural networks improve fiber nonlinearities in coherent systems.

problem Compensating fiber nonlinearities in digital coherent systems.
method Utilization of Long short-term memory (LSTM) neural networks.
result LSTM neural networks provide superior performance compared to digital back propagation, especially in multi-channel scenarios.

For reliable transmission across a noisy communication channel, classical results from information theory show that it is asymptotically optimal to separate out the source and channel coding processes. However, this decomposition can fall short in the finite bit-length regime, as it requires non-trivial tuning of hand-…

2018-11-19abs ↗pdf ↗

New algorithm reduces age of information in wireless networks with unknown channel reliability.

problem Learning optimal source-channel pairs to minimize age of information in wireless networks.
method Introduces AoI regret, novel learning algorithm with bounded AoI regret.
result Developed a learning algorithm with O(1)O(1) AoI regret, improving upon Θ(logT)Θ(\log T).

The design of codes for communicating reliably over a statistically well defined channel is an important endeavor involving deep mathematical research and wide-ranging practical applications. In this work, we present the first family of codes obtained via deep learning, which significantly beats state-of-the-art codes …

2018-07-02abs ↗pdf ↗

Two-layer NN with channel attention learns low-degree spherical polynomials efficiently.

problem Learning low-degree spherical polynomials with over-parameterized neural networks.
method Two-layer neural network with channel attention, vanilla gradient descent, learnable channel selection.
result Minimally improved sample complexity of $n \asymp Θ(d^{\ell_0}/\eps)$ for learning low-degree polynomials.

BottleNet++ compresses deep learning features for efficient mobile inference.

problem Balancing computation and communication in mobile devices with deep learning models.
method End-to-end architecture with encoder, non-trainable channel layer, and decoder.
result Achieves high compression ratio and bandwidth reduction with minimal accuracy loss.

Truncated Singular Value Decomposition (SVD) calculates the closest rank-kk approximation of a given input matrix. Selecting the appropriate rank kk defines a critical model order choice in most applications of SVD. To obtain a principled cut-off criterion for the spectrum, we convert the underlying optimization prob…

2011-02-15abs ↗pdf ↗

Massive MIMO is a variant of multiuser MIMO where the number of base-station antennas MM is very large (typically 100), and generally much larger than the number of spatially multiplexed data streams (typically 10). Unfortunately, the front-end A/D conversion necessary to drive hundreds of antennas, with a signal band…

2015-09-24abs ↗pdf ↗

A multi-user multi-armed bandit (MAB) framework is used to develop algorithms for uncoordinated spectrum access. The number of users is assumed to be unknown to each user. A stochastic setting is first considered, where the rewards on a channel are the same for each user. In contrast to prior work, it is assumed that t…

2018-07-02abs ↗pdf ↗

Paper uses RNNs to design LDPC codes for binary erasure channels.

problem Designing capacity-approaching LDPC codes for binary erasure channels.
method Model Density Evolution using RNNs to determine LDPC code coefficients and structure.
result NDE improves LDPC design performance and complexity compared to differential evolution.

Few-shot domain adaptation improves autoencoder performance in changing wireless channels.

problem Frequent retraining of autoencoder for low decoding error rate in changing channel conditions is impractical.
method Uses Gaussian mixture density network and class and component-conditional affine transformations for few-shot adaptation.
result Effective adaptation using very small number of target domain samples, improving performance in real mmWave setups.

For high data rate wireless communication systems, developing an efficient channel estimation approach is extremely vital for channel detection and signal recovery. With the trend of high-mobility wireless communications between vehicles and vehicles-to-infrastructure (V2I), V2I communications pose additional challenge…

2019-07-10abs ↗pdf ↗

Attention mechanism is a hot spot in deep learning field. Using channel attention model is an effective method for improving the performance of the convolutional neural network. Squeeze-and-Excitation block takes advantage of the channel dependence, selectively emphasizing the important channels and compressing the rel…

2019-01-06abs ↗pdf ↗

Proposes dynamic channel pruning during neural network training.

problem Pruning neural networks during training to reduce computational cost and improve efficiency.
method Dynamic channel propagation to update channel utility values and selectively prune channels.
result Our scheme trains and prunes neural networks simultaneously, achieving superior performance.

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.

Generative diffusion models improve channel sampling from limited data.

problem Challenges in channel modelling and data collection for wireless systems.
method Diffusion model with U-Net architecture for frequency domain synthesis.
result Stable training and diverse high-fidelity samples generated from true channel distribution.

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.

A privacy-preserving method for transmitting data over a wiretap channel using generative networks.

problem Privacy protection in communication over a wiretap channel.
method Data-driven approach using variational autoencoder (VAE)-based joint source channel coding (JSCC).
result The approach provides high reconstruction quality at the receiver while confusing the eavesdropper about the latent sensitive attribute.

Algorithm optimizes spectrum access for dynamic multi-user environments.

problem Optimizing spectrum access in uncoordinated multi-user environments with potential collisions.
method Stochastic multi-user bandit framework with estimation and allocation phases.
result Order-optimal system-wide regret of O(logT)O(\log T) for dynamic and static cases.