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,657 papers · 148 categories

Trend · papers per month

57113170226 · Jun 202019922001200920172026
48 results for Gaussian wiretap channel

End-to-end learning of codes for secure BPSK communication in Gaussian wiretap channel.

problem Secure communication in the presence of an adversary for BPSK modulation.
method Learning finite-length codes using deep neural networks (DNNs) with mutual information estimation.
result Learned codes achieve near-optimal security performance, as demonstrated by numerical results.

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.

This research highlights the secrecy potential of nonlinear generative models and their all-or-nothing phase transition.

problem Secrecy potential of nonlinear generative models in statistical learning.
method Replica method to derive asymptotic normalized cross entropy and statistical decoupling of Bayesian estimator.
result Strictly nonlinear models exhibit an all-or-nothing phase transition, leading to perfect secrecy.

Proposes GPCA module for channel attention in CNNs using Gaussian processes.

problem Improving performance in visual tasks through effective channel selection.
method Integrates Gaussian processes into channel attention mechanisms for probabilistic modeling of channel correlations.
result Demonstrates improved performance of GPCA module in end-to-end CNN training.

We establish large deviation principles for convolutional neural networks.

problem Understanding the behavior of convolutional neural networks in the infinite-channel limit.
method We establish large deviation principles for convolutional neural networks under Gaussian prior and posterior distributions.
result We provide a large deviation principle for the sequence of conditional covariance matrices and the posterior distribution.

Multi-output Gaussian processes (MOGPs) are an extension of Gaussian Processes (GPs) for predicting multiple output variables (also called channels, tasks) simultaneously. In this paper we use the convolution theorem to design a new kernel for MOGPs, by modeling cross channel dependencies through cross convolution of t…

2018-08-07abs ↗pdf ↗

This paper finds the noise threshold for learning Gaussian mixture models equals channel capacity.

problem Learning Gaussian mixture models with noisy data.
method Bayesian formulation with uniformly distributed centers on a sphere, analyzing the large system limit.
result The maximal noise level σ2σ^2 for which GMM learning is as easy as labeled observations is the channel capacity.

The idea of end-to-end learning of communications systems through neural network -based autoencoders has the shortcoming that it requires a differentiable channel model. We present in this paper a novel learning algorithm which alleviates this problem. The algorithm iterates between supervised training of the receiver …

2018-04-06abs ↗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 ↗

We propose a joint source and channel coding (JSCC) technique for wireless image transmission that does not rely on explicit codes for either compression or error correction; instead, it directly maps the image pixel values to the complex-valued channel input symbols. We parameterize the encoder and decoder functions b…

2018-09-04abs ↗pdf ↗

Early approaches to multiple-output Gaussian processes (MOGPs) relied on linear combinations of independent, latent, single-output Gaussian processes (GPs). This resulted in cross-covariance functions with limited parametric interpretation, thus conflicting with the ability of single-output GPs to understand lengthscal…

2017-09-05abs ↗pdf ↗

GCAE uses density estimation to achieve reliable disentanglement in latent space.

problem Disentangled learning representations suffer from reliability issues.
method GCAE uses Gaussian Channel Autoencoder with Dual Total Correlation (DTC) to avoid the curse of dimensionality.
result GCAE achieves highly competitive and reliable disentanglement scores.

New algorithm solves Schrödinger bridge problem with mismatched channels.

problem Solving Schrödinger bridge problem with input and noise channel mismatch.
method Design of a Sinkhorn recursion with memory for nonlinear PDEs.
result Demonstrates solving control-affine Schrödinger bridge problem.

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.

The study reveals flaws in pruning criteria and proposes a new assumption for better filter selection.

problem Flaws in existing pruning criteria for CNNs.
method Empirical experiments and Convolutional Weight Distribution Assumption.
result The Convolutional Weight Distribution Assumption improves filter selection in pruning.

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 ↗

Paper studies zero-sum games with noisy observations and identifies equilibrium conditions.

problem Zero-sum games with noisy observations of the leader's actions.
method Analyzes the equilibrium of games with noisy action observability, identifies necessary conditions for uniqueness, and investigates the cardinality of best responses.
result The noisy observations significantly impact the cardinality of the follower's set of best responses, and under certain conditions, this set becomes a singleton almost surely.

Paper models and compresses wideband CSI feedback in FDD MIMO systems.

problem Fundamental limits of channel state information (CSI) feedback in FDD massive MIMO systems.
method Modeling CSI as a Gaussian-mixture source with latent geometry states, proposing Gaussian-mixture transform coding (GMTC).
result Near-optimal CSI compression achieved through state-adaptive transform coding without large neural encoders.

Gaussian beams describe the amplitude and phase of rays and are widely used to model acoustic propagation. This paper describes four new results in the theory of Gaussian beams. (1) A new version of the Červený equations for the amplitude and phase of Gaussian beams is developed by applying the equivalence of Hamilton-…

2013-04-06abs ↗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.

Inspired by recent advances in deep learning, we propose a novel iterative BP-CNN architecture for channel decoding under correlated noise. This architecture concatenates a trained convolutional neural network (CNN) with a standard belief-propagation (BP) decoder. The standard BP decoder is used to estimate the coded b…

2017-07-18abs ↗pdf ↗

New algorithms for hypothesis testing in high-dimensional data are shown to be effective under various noisy conditions.

problem Testing high-dimensional probability measures under noisy conditions.
method Low coordinate degree functions (LCDF) using Efron-Stein decomposition.
result LCDF can effectively test high-dimensional probability measures under noisy channels, with efficacy depending on scalar Fisher information.

Misspecification-Aware Simulation-Based Inference via Side-Channel Guidance

problem Simulation-based inference (SBI) of latent parameters is hindered by simulator misspecification.
method Misspecification-Aware Simulation-Based Inference (MA-SBI) turns side-channel text into a posterior correction.
result MA-SBI matches the oracle posterior across 10 seeds and two backbones.

A central machine is interested in estimating the underlying structure of a sparse Gaussian Graphical Model (GGM) from datasets distributed across multiple local machines. The local machines can communicate with the central machine through a wireless multiple access channel. In this paper, we are interested in designin…

2018-12-26abs ↗pdf ↗

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.

Thompson Sampling tackles noisy context in stochastic bandits.

problem Designing an action policy for noisy, corrupted contexts in stochastic bandits.
method Introducing a Thompson Sampling algorithm for Gaussian bandits with Gaussian context noise, adopting an information-theoretic analysis.
result Demonstrates the Bayesian regret of the proposed algorithm concerning the oracle's action policy.

New scheme optimizes BMI through probabilistic and geometric shaping.

problem Optimizing bit-wise mutual information (BMI) for coded modulation.
method Joint optimization of BMI through probabilistic and geometric shaping.
result Joint optimization enables a continuum of constellation geometries and probability distributions.

The choice of constellations largely affects the performance of communication systems. When designing constellations, both the locations and probability of occurrence of the points can be optimized. These approaches are referred to as geometric and probabilistic shaping, respectively. Usually, the geometry of the const…

2019-06-18abs ↗pdf ↗

In Financial Signal Processing, multiple time series such as financial indicators, stock prices and exchange rates are strongly coupled due to their dependence on the latent state of the market and therefore they are required to be jointly analysed. We focus on learning the relationships among financial time series by …

2020-02-11abs ↗pdf ↗

Relationships that exist between the classical, Shannon-type, and geometric-based approaches to sampling are investigated. Some aspects of coding and communication through a Gaussian channel are considered. In particular, a constructive method to determine the quantizing dimension in Zador's theorem is provided. A geom…

2010-02-15abs ↗pdf ↗

A deep neural network (DNN) based power control method is proposed, which aims at solving the non-convex optimization problem of maximizing the sum rate of a multi-user interference channel. Towards this end, we first present PCNet, which is a multi-layer fully connected neural network that is specifically designed for…

2018-07-26abs ↗pdf ↗

Independent Component Analysis (ICA) is a technique for unsupervised exploration of multi-channel data widely used in observational sciences. In its classical form, ICA relies on modeling the data as a linear mixture of non-Gaussian independent sources. The problem can be seen as a likelihood maximization problem. We i…

2017-11-29abs ↗pdf ↗

Improved sampling from high-dimensional Gaussians using smoothed scores.

problem Sampling from high-dimensional Gaussian distributions with gradient information.
method Using smoothed scores, which are gradients of the logarithms of Gaussian-convolved densities, to overcome approximation barriers.
result Improved sampling efficiency with a complexity of \(O\left(\left(\logκ+\log(e\sqrt d/δ_{ m TV}) ight)\log(e\sqrt d/δ_{ m TV}) ight)\) smoothed-score queries.