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

4.2%8.3%12.5%16.7% · Jan 199619922001200920172026
48 results for coded modulation

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.

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.

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 ↗

We provide complete source code for building a fundamental industry classification based on publically available and freely downloadable data. We compare various fundamental industry classifications by running a horserace of short-horizon trading signals (alphas) utilizing open source heterotic risk models (https://ssr…

2017-06-13abs ↗pdf ↗

In this work, a deep learning-based quantization scheme for log-likelihood ratio (L-value) storage is introduced. We analyze the dependency between the average magnitude of different L-values from the same quadrature amplitude modulation (QAM) symbol and show they follow a consistent ordering. Based on this we design a…

2019-06-18abs ↗pdf ↗

CardiacGen generates realistic ECG signals for training deep learning models.

problem Creating realistic synthetic ECG signals for training deep learning models.
method Hierarchical deep generative model with multi-objective loss functions.
result Synthetic ECG signals from CardiacGen can be used for data augmentation and improve classifier performance.

Auto-decoder synthesizes graphs from latent codes.

problem Creating new graph structures from specified distributions.
method Generative model learns latent codes from empirical distribution. Self-attention identifies likely connectivity patterns. Graph-based normalizing flows sample latent codes.
result Model outperforms state of the art by 1.5x in accuracy and 2x in speed.

This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in the receivers. Specifically, it is first shown that the optimum error correction code that minimizes the probability of bit error can be obtained by perfectly training a speci…

2019-09-24abs ↗pdf ↗

NFM improves deep learning by selectively processing hidden states.

problem Processing entire hidden states in each layer limits modularity and reusability.
method Introduces Neural Function Modules (NFM) with attention, sparsity, and feedback.
result Improves results in classification, generalization, generative modeling, and reinforcement learning.

Code generation maps a program description to executable source code in a programming language. Existing approaches mainly rely on a recurrent neural network (RNN) as the decoder. However, we find that a program contains significantly more tokens than a natural language sentence, and thus it may be inappropriate for RN…

2018-11-14abs ↗pdf ↗

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.

DGRCL integrates dynamic and static graph relations for financial market prediction.

problem Capturing the evolving nature of stock markets while considering both temporal changes and static relational structures.
method Dynamic Graph Representation with Contrastive Learning (DGRCL) framework, including Embedding Enhancement (EE) and Contrastive Constrained Training (CCT) modules.
result DGRCL significantly outperforms state-of-the-art TGL baselines on NASDAQ and NYSE datasets.

DEPTS learns to forecast periodic time series with improved accuracy.

problem Forecasting periodic time series is challenging due to complex dependencies and diverse periods.
method DEPTS uses a decoupled formulation with an expansion module and a periodicity module to handle these challenges.
result DEPTS significantly improves forecasting accuracy, reducing errors by up to 20%.

Inferring new facts from existing knowledge graphs (KG) with explainable reasoning processes is a significant problem and has received much attention recently. However, few studies have focused on relation types unseen in the original KG, given only one or a few instances for training. To bridge this gap, we propose Co…

2019-06-13abs ↗pdf ↗

Pyramid Attention Networks improve image restoration by leveraging self-similarities across scales.

problem Lack of full exploitation of self-similarities in image restoration by recent deep learning methods.
method Introduces a Pyramid Attention module that processes multi-scale feature correspondences to borrow clean signals from coarser levels.
result Pyramid Attention module achieves state-of-the-art results in various image restoration tasks.

We present LumièreNet, a simple, modular, and completely deep-learning based architecture that synthesizes, high quality, full-pose headshot lecture videos from instructor's new audio narration of any length. Unlike prior works, LumièreNet is entirely composed of trainable neural network modules to learn mapping functi…

2019-07-04abs ↗pdf ↗

Optimizing over-the-air convex optimization, analog schemes are nearly optimal at low SNR.

problem Optimizing over-the-air convex optimization with coded gradients.
method Analyzes coded gradients over an additive Gaussian noise channel, considers analog coding schemes.
result Analog coding schemes nearly match the optimal convergence rate at low SNR, but a slowdown is inevitable.

We propose rectified factor networks (RFNs) to efficiently construct very sparse, non-linear, high-dimensional representations of the input. RFN models identify rare and small events in the input, have a low interference between code units, have a small reconstruction error, and explain the data covariance structure. R…

2015-02-23abs ↗pdf ↗

E2GC optimizes energy efficiency in DNNs by balancing computational and data movement costs.

problem Imbalance between computational complexity and data reuse in GConv leads to suboptimal energy efficiency.
method Developed an optimum group size model and proposed E2GC module with constant group size.
result E2GC modules improve energy efficiency by 10.8% and 4.73% on P100 and P4000 GPUs, respectively.

We describe Bayesian Layers, a module designed for fast experimentation with neural network uncertainty. It extends neural network libraries with drop-in replacements for common layers. This enables composition via a unified abstraction over deterministic and stochastic functions and allows for scalability via the unde…

2018-12-10abs ↗pdf ↗

CBC makes CNNs robust against adversarial attacks with minimal computational overhead.

problem Making CNNs robust against adversarial attacks without increasing computational complexity.
method CBC uses a stacked encoder-convolutional model where an auto-encoder encodes the input image, and the latent representation is used for classification.
result CBC is more robust to adversarial examples and has significantly lower computational complexity.

PAQ8 is an open source lossless data compression algorithm that currently achieves the best compression rates on many benchmarks. This report presents a detailed description of PAQ8 from a statistical machine learning perspective. It shows that it is possible to understand some of the modules of PAQ8 and use this under…

2011-08-16abs ↗pdf ↗

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 ↗

We introduce Compositional Imitation Learning and Execution (CompILE): a framework for learning reusable, variable-length segments of hierarchically-structured behavior from demonstration data. CompILE uses a novel unsupervised, fully-differentiable sequence segmentation module to learn latent encodings of sequential d…

2018-12-04abs ↗pdf ↗

This paper proposes an alternative to E2E training for deep networks, reducing memory footprint.

problem High GPUs memory footprint in end-to-end training of deep networks.
method Locally supervised learning with information propagation loss to avoid information collapse.
result The proposed method achieves competitive performance with less than 40% memory footprint compared to E2E training.

Active localization is the problem of generating robot actions that allow it to maximally disambiguate its pose within a reference map. Traditional approaches to this use an information-theoretic criterion for action selection and hand-crafted perceptual models. In this work we propose an end-to-end differentiable meth…

2019-03-05abs ↗pdf ↗

Express Wavenet reduces neural network parameters to 1% of standard networks.

problem Optical neural networks with high parameter count.
method Wavelet modulation, random shift wavelets, expressway structure.
result Express Wavenet achieves high accuracy with significantly fewer parameters.

The quality of data representation in deep learning methods is directly related to the prior model imposed on the representations; however, generally used fixed priors are not capable of adjusting to the context in the data. To address this issue, we propose deep predictive coding networks, a hierarchical generative mo…

2013-01-16abs ↗pdf ↗