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

87175262349 · Jun 202019922001200920172026
48 results for joint source channel coding

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 ↗

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.

We consider wireless transmission of images in the presence of channel output feedback. From a Shannon theoretic perspective feedback does not improve the asymptotic end-to-end performance, and separate source coding followed by capacity-achieving channel coding, which ignores the feedback signal, achieves the optimal …

2019-11-25abs ↗pdf ↗

Study neural communication systems with bandwidth-limited channels.

problem Reliable message transmission despite noisy channels.
method Jointly model compression and error correction with neural networks; introduce prior for missing information; use auxiliary latent variables.
result Joint neural communication systems outperform separate models under expected information loss.

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 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.

In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and …

2018-04-02abs ↗pdf ↗

In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of NN-dimensional lattices. We propose a constructive scheme based on a set of curves on …

2012-02-09abs ↗pdf ↗

This paper models the crowdsourced labeling/classification problem as a sparsely encoded source coding problem, where each query answer, regarded as a code bit, is the XOR of a small number of labels, as source information bits. In this paper we leverage the connections between this problem and well-studied codes with …

2019-06-25abs ↗pdf ↗

The scientific literature is a rich source of information for data mining with conceptual knowledge graphs; the open science movement has enriched this literature with complementary source code that implements scientific models. To exploit this new resource, we construct a knowledge graph using unsupervised learning me…

2019-08-25abs ↗pdf ↗

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 ↗

MGLM models all possible language channel factorizations for improved multilingual generation.

problem Generating multilingual text with flexibility and quality.
method Generative joint distribution model over language channels, marginalizing all possible factorizations.
result MGLM outperforms traditional models in multilingual generation tasks.

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.

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.

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.

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.

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

Estimates rate-distortion function for large datasets using neural networks.

problem Designing lossy data compression schemes and comparing them with theoretical limits.
method Re-formulate rate-distortion objective and solve using neural networks.
result NERD accurately estimates the rate-distortion function for real-world datasets.

A Python package solves source duplication in single channel LVMs using spectral regularisation.

problem Source duplication in LVMs hampers their practical use in single channel applications.
method Spectral regularisation term added to address source duplication issue.
result Spectral regularisation framework enables easier investigation and utilisation of LVMs.

Model learns code representations from comments for data analysis tasks.

problem Lack of descriptive labels for analyzing large code corpora.
method Weakly supervised transformer architecture for joint code and comment representation.
result Model achieves 38% accuracy increase over expert-supplied heuristics.

AverageTime uses simple averaging to enhance long-term time series forecasting.

problem Long-term time series forecasting with improved intra-sequence and cross-channel dependencies.
method Proposes AverageTime, a simple, efficient, and scalable forecasting model that reframes channel extraction as a stackable architecture.
result AverageTime surpasses state-of-the-art models in forecasting performance with near-linear complexity.

Study fusion methods for financial image views to improve robustness against attacks.

problem Improving robustness of financial image views for next-day direction prediction.
method Same-source multi-view learning with early fusion and late fusion, using OHLCV and technical-indicator views, and evaluating pixel-space L-infinity attacks.
result Early fusion can suffer negative transfer under noisy settings, while late fusion is more reliable once labels stabilize.

Research shows ESG signals lower exposure to market fragility during stress periods.

problem Market fragility often occurs together, and ESG is associated with reduced exposure.
method Monthly data on S&P 500 constituents from 2014 to 2025, analyzing downside returns, volatility, illiquidity, and cofragility states.
result A one-standard-deviation increase in ESG lowers the probability of severe cofragility by 0.92 percentage points during stress periods.

New algorithm for active learning from feedback coding.

problem Efficiently selecting examples for labeling in active machine learning.
method Formalized structural similarities between active learning and feedback channel coding, developed an optimal transport-based algorithm called Approximate Posterior Matching (APM).
result Learning performance comparable to existing methods at reduced computational cost.

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).

This paper addresses the problem of identifying a lower dimensional space where observed data can be sparsely represented. This under-complete dictionary learning task can be formulated as a blind separation problem of sparse sources linearly mixed with an unknown orthogonal mixing matrix. This issue is formulated in a…

2009-08-31abs ↗pdf ↗

The possibility of latency arbitrage in financial markets has led to the deployment of high-speed communication links between distant financial centers. These links are noisy and so there is a need for coding. In this paper, we develop a gametheoretic model of trading behavior where two traders compete to capture laten…

2015-04-27abs ↗pdf ↗

Knowledge of the channel state information (CSI) at the transmitter side is one of the primary sources of information that can be used for the efficient allocation of wireless resources. Obtaining downlink (DL) CSI in Frequency Division Duplexing (FDD) systems from uplink (UL) CSI is not as straightforward as in TDD sy…

2018-12-16abs ↗pdf ↗

Quantum CNNs improve on multi-channel data processing.

problem Lack of efficient processing for multi-channel data in QCNNs.
method Developed hardware-adaptable quantum circuit ansatzes for convolutional kernels.
result Quantum CNNs outperform existing QCNNs on multi-channel data classification tasks.