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

Trend · papers per month

4691137182 · Jun 202019922001200920172026
48 results for modulation schemes

Skein modules over 3-manifolds are shown to form line bundles.

problem Understanding the structure of skein modules over 3-manifolds.
method Using the Frobenius morphism, the skein module is mapped to a coherent sheaf over the SL2 character scheme.
result When the character scheme is reduced, the sheaf is a line bundle.

We present the first fully variational Bayesian inference scheme for continuous Gaussian-process-modulated Poisson processes. Such point processes are used in a variety of domains, including neuroscience, geo-statistics and astronomy, but their use is hindered by the computational cost of existing inference schemes. Ou…

2014-11-02abs ↗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.

Constructs noncommutative spaces for D-branes on complex algebraic spaces.

problem Mathematical model for D-branes on noncommutative spaces.
method Toric geometry, Azumaya schemes, invertible sheaves.
result Embeds algebraic Calabi-Yau spaces into soft noncommutative schemes.

Paper proposes a time-frequency analysis method for blind modulation classification in MIMO systems.

problem Blind modulation classification in MIMO systems with overlapping signals and unknown channel parameters.
method Time-frequency analysis using windowed short-time Fourier transform, conversion to RGB spectrogram images, convolutional neural network for classification, decision fusion.
result Proposed scheme achieves high classification accuracy at different SNRs, outperforming existing methods.

A core aspect of human intelligence is the ability to learn new tasks quickly and switch between them flexibly. Here, we describe a modular continual reinforcement learning paradigm inspired by these abilities. We first introduce a visual interaction environment that allows many types of tasks to be unified in a single…

2017-11-20abs ↗pdf ↗

Learn to automatically plug domain-specific modules into a common network.

problem Learning inflexibility and computational intensiveness in multi-domain learning.
method Neural Architecture Search (NAS) for data-driven adapter plugging and structure design.
result NAS-driven MDL model achieves comparable performance to existing approaches.

Enhances multi-modular models by directing information flow between components.

problem Improving predictive performance in multi-modular models with misspecification.
method Introduces Semi-Modular Inference (SMI) with an influence parameter to control information flow between modules.
result SMI allows for tunable and directed information flow, improving prediction in some settings.

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 ↗

RB-Modulation trains free diffusion models without external adapters.

problem Training-free personalization of diffusion models with style and content control.
method Stochastic optimal control with a style descriptor and cross-attention aggregation.
result Precise content and style extraction and control without external adapters.

Following our approach to metric Lie algebras developed in math.DG/0312243 we propose a way of understanding pseudo-Riemannian symmetric spaces which are not semi-simple. We introduce cohomology sets (called quadratic cohomology) associated with orthogonal modules of Lie algebras with involution. Then we construct a fu…

2004-08-18abs ↗pdf ↗

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.

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 define a deformation of the triply graded Khovanov-Rozansky homology of a link LL depending on a choice of parameters ycy_c for each component of LL, which satisfies link-splitting properties similar to the Batson-Seed invariant. Keeping the ycy_c as formal variables yields a link homology valued in triply graded …

2017-12-11abs ↗pdf ↗

In classical Hawkes process, the baseline intensity and triggering kernel are assumed to be a constant and parametric function respectively, which limits the model flexibility. To generalize it, we present a fully Bayesian nonparametric model, namely Gaussian process modulated Hawkes process and propose an EM-variation…

2019-05-29abs ↗pdf ↗

We lift ambit fields as introduced by Barndorff-Nielsen and Schmiegel to a class of Hilbert space-valued volatility modulated Volterra processes. We name this class Hambit fields, and show that they can be expressed as a countable sum of weighted real-valued volatility modulated Volterra processes. Moreover, Hambit fie…

2015-09-28abs ↗pdf ↗

Systems of partial differential equations lie at the heart of physics. Despite this, the general theory of these systems has remained rather obscure in comparison to numerical approaches such as finite element models and various other discretisation schemes. There are, however, several theoretical approaches to systems…

2001-06-12abs ↗pdf ↗

Stability of catenoid in hyperbolic space proven without symmetry assumptions.

problem Stability of catenoid in hyperbolic space.
method Profile construction, modulation analysis, integrated local energy decay, vectorfield method.
result Nonlinear asymptotic stability of catenoid for n5n \geq 5 without symmetry assumptions.

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.

Control of drawdown, that is, the control of the drops in wealth over time from peaks to subsequent lows, is of great concern from a risk management perspective. With this motivation in mind, the focal point of this paper is to address the drawdown issue in a stock trading context. Although our analysis can be carried …

2017-10-04abs ↗pdf ↗

Massive multiple-input multiple-output (MIMO) systems require downlink channel state information (CSI) at the base station (BS) to better utilize the available spatial diversity and multiplexing gains. However, in a frequency division duplex (FDD) massive MIMO system, CSI feedback overhead degrades the overall spectral…

2019-10-23abs ↗pdf ↗

Unbalanced data arises in many learning tasks such as clustering of multi-class data, hierarchical divisive clustering and semisupervised learning. Graph-based approaches are popular tools for these problems. Graph construction is an important aspect of graph-based learning. We show that graph-based algorithms can fail…

2011-12-11abs ↗pdf ↗

The paper describes hyperkähler geometry of cotangent bundles using rank-1 projections.

problem Understanding hyperkähler geometry of cotangent bundles via algebraic methods.
method Algebraic description via the scheme of rank-1 projections, isometric embeddings, and generalizations.
result Explicit isometric embeddings and generalizations of hyperkähler geometry.

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoo…

2020-02-13abs ↗pdf ↗

Current deep neural networks can achieve remarkable performance on a single task. However, when the deep neural network is continually trained on a sequence of tasks, it seems to gradually forget the previous learned knowledge. This phenomenon is referred to as \textit{catastrophic forgetting} and motivates the field c…

2019-09-25abs ↗pdf ↗

Revealing a community structure in a network or dataset is a central problem arising in many scientific areas. The modularity function QQ is an established measure quantifying the quality of a community, being identified as a set of nodes having high modularity. In our terminology, a set of nodes with positive modular…

2017-08-18abs ↗pdf ↗

Proposes a model for predicting events from event streams.

problem Predicting events like part replacement and failure in manufacturing and teleservice systems.
method Non-parametric prognostic framework using MGCP modulated Poisson processes.
result MGCP prior facilitates sharing of information and analysis of flexible event patterns.