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

238476714952 · Jun 202019922001200920172026
48 results for No-Transaction Band Network

The paper bridges stochastic control and deep hedging for European call options with transaction costs.

problem Hedging and pricing European call options with proportional transaction costs.
method Complementary perspectives: stochastic control and deep hedging. Two architectures proposed: NTBN-Delta and WW-NTBN.
result WW-NTBN converges faster, matches no-transaction bands more closely, and generalizes well across transaction cost regimes.

The convolutional layers are core building blocks of neural network architectures. In general, a convolutional filter applies to the entire frequency spectrum of the input data. We explore artificially constraining the frequency spectra of these filters and data, called band-limiting, during training. The frequency dom…

2019-11-21abs ↗pdf ↗

In cellular systems, the user equipment (UE) can request a change in the frequency band when its rate drops below a threshold on the current band. The UE is then instructed by the base station (BS) to measure the quality of candidate bands, which requires a measurement gap in the data transmission, thus lowering the da…

2019-10-02abs ↗pdf ↗

Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of bands required to present the link as boundaries of an unknotted (flat) banded surf…

2011-04-30abs ↗pdf ↗

Finding minima of a real valued non-convex function over a high dimensional space is a major challenge in science. We provide evidence that some such functions that are defined on high dimensional domains have a narrow band of values whose pre-image contains the bulk of its critical points. This is in contrast with the…

2014-12-20abs ↗pdf ↗

This work uses sampling theory to analyze smoothness and error bounds of finite neural networks.

problem Analyzing the function space of finite neural networks and providing error bounds.
method Applying sampling theory to finite neural networks with non-expansive activation functions, considering both deterministic and random sampling.
result Novel error bounds for univariate neural networks under band-limited input assumption, highlighting the advantage of deterministic uniform sampling.

New method constructs confidence bands for ODE models with unknown regulatory effects.

problem Building confidence bands for ODE models with unknown regulatory relations is challenging.
method Localized kernel learning approach combined with de-biasing method.
result The constructed confidence band has the desired asymptotic coverage probability and accurately recovers the regulatory network.

The goal of this study is to explain and examine the statistical underpinnings of the Bollinger Band methodology. We start off by elucidating the rolling regression time series model and deriving its explicit relationship to Bollinger Bands. Next we illustrate the use of Bollinger Bands in pairs trading and prove the e…

2012-12-20abs ↗pdf ↗

Wiatowski and Bölcskei, 2015, proved that deformation stability and vertical translation invariance of deep convolutional neural network-based feature extractors are guaranteed by the network structure per se rather than the specific convolution kernels and non-linearities. While the translation invariance result appli…

2016-04-29abs ↗pdf ↗

We give a short proof that if a non-trivial band sum of two knots results in a tight fibered knot, then the band sum is a connected sum. In particular, this means that any prime knot obtained by a non-trivial band sum is not tight fibered. Since a positive L-space knot is tight fibered, a non-trivial band sum never yie…

2015-09-01abs ↗pdf ↗

The paper creates nonparametric confidence bands for band-limited functions.

problem Estimating confidence bands for band-limited functions with finite samples and unknown noise.
method Uses Paley-Wiener reproducing kernel Hilbert spaces and gradient-perturbation methods.
result Non-asymptotic guarantees for confidence regions without assuming a parametric model.

New method finds arbitrage opportunities in fluctuating asset bands.

problem Finding arbitrage opportunities in fluctuating asset bands.
method Formulate as maximizing volatility within a price band, using convex-concave optimization.
result Approximately solves non-convex optimization problem for moving-band arbitrage.

CP-ROC bands improve graph classification accuracy and uncertainty quantification.

problem Uncertainty quantification and robustness to distributional shifts in graph classification.
method Conditional Prediction ROC (CP-ROC) bands for graph classification, developed for TGNNs and adaptable to GNNs.
result Statistically guaranteed coverage for CP-ROC under local exchangeability condition, improving prediction reliability.

Every classical knot is band-pass equivalent to the unknot or the trefoil. The band-pass class of a knot is a concordance invariant. Every ribbon knot, for example, is band-pass equivalent to the unknot. Here we introduce the long virtual knot concordance group VC\mathscr{VC}. It is shown that for every concordance cla…

2016-03-01abs ↗pdf ↗

The paper improves nonparametric confidence bands for band-limited functions.

problem Constructing nonparametric simultaneous confidence bands with nonasymptotic and distribition-free guarantees.
method Based on Paley-Wiener reproducing kernel Hilbert spaces, the paper relaxes assumptions, improves noise estimation, and tightens constraints.
result Enhanced confidence bands with improved efficiency and tighter constraints.

We introduce a new sparse estimator of the covariance matrix for high-dimensional models in which the variables have a known ordering. Our estimator, which is the solution to a convex optimization problem, is equivalently expressed as an estimator which tapers the sample covariance matrix by a Toeplitz, sparsely-banded…

2014-05-23abs ↗pdf ↗

In this research, an emotion recognition system is developed based on valence/arousal model using electroencephalography (EEG) signals. EEG signals are decomposed into the gamma, beta, alpha and theta frequency bands using discrete wavelet transform (DWT), and spectral features are extracted from each frequency band. P…

2019-03-18abs ↗pdf ↗

Paper shows how to embed Möbius bands with many twists and small aspect ratios.

problem Finding the smallest aspect ratio for Möbius bands with many twists.
method Constructs a folded paper ribbon knot to bound the aspect ratio.
result Paper Möbius bands and annuli with any number of half-twists can be embedded with aspect ratio less than 8.

Band selection, by choosing a set of representative bands in hyperspectral image (HSI), is an effective method to reduce the redundant information without compromising the original contents. Recently, various unsupervised band selection methods have been proposed, but most of them are based on approximation algorithms …

2019-04-30abs ↗pdf ↗

We prove optimal systolic inequalities on Finsler Mobius bands relating the systole and the height of the Mobius band to its Holmes-Thompson volume. We also establish an optimal systolic in- equality for Finsler Klein bottles of revolution, which we conjecture to hold true for arbitrary Finsler metrics. Extremal metric…

2015-03-04abs ↗pdf ↗

New theorem on embedding Moebius bands in 3D space.

problem Proving the impossibility of placing uncountably many disjoint Moebius bands in 3D space.
method Generalization of Grushin and Palamodov's result to tame subsets in R^N and arbitrary topological embeddings in R^3.
result The impossibility of embedding uncountably many pairwise disjoint Moebius bands in 3D space, even for arbitrary topological embeddings.