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

1122 · Jun 202219922001200920172026
28 results for band-limited

The paper improves confidence regions for band-limited functions using tighter norm bounds and majority voting.

problem Constructing reliable confidence regions for band-limited functions from noisy data.
method Improved norm bounds using Hoeffding's inequality and empirical Bernstein bound, majority voting to aggregate intervals.
result Confidence intervals retain their simultaneous coverage guarantee even when aggregated from random subsamples.

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.

We study the volume distribution of nodal domains of random band-limited functions on generic manifolds, and find that in the high energy limit a typical instance obeys a deterministic universal law, independent of the manifold. Some of the basic qualitative properties of this law, such as its support, monotonicity and…

2016-06-18abs ↗pdf ↗

In this paper, a nonparametric maximum likelihood (ML) estimator for band-limited (BL) probability density functions (pdfs) is proposed. The BLML estimator is consistent and computationally efficient. To compute the BLML estimator, three approximate algorithms are presented: a binary quadratic programming (BQP) algorit…

2015-03-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 ↗

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.

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 propose a novel class of Gaussian processes (GPs) whose spectra have compact support, meaning that their sample trajectories are almost-surely band limited. As a complement to the growing literature on spectral design of covariance kernels, the core of our proposal is to model power spectral densities through a rect…

2019-09-16abs ↗pdf ↗

Band-limited SAC improves learning efficiency and stability in simulated environments.

problem Improving sample efficiency and stability in SAC algorithms.
method Artificially bandlimiting the target critic's spatial resolution using a convolutional filter.
result Bandlimited SAC outperforms classic twin-critic SAC in various Gym environments and is more stable.

Compression of Neural Networks (NN) has become a highly studied topic in recent years. The main reason for this is the demand for industrial scale usage of NNs such as deploying them on mobile devices, storing them efficiently, transmitting them via band-limited channels and most importantly doing inference at scale. I…

2017-11-17abs ↗pdf ↗

This paper presents a bias-variance tradeoff of graph Laplacian regularizer, which is widely used in graph signal processing and semi-supervised learning tasks. The scaling law of the optimal regularization parameter is specified in terms of the spectral graph properties and a novel signal-to-noise ratio parameter, whi…

2017-06-02abs ↗pdf ↗

Deep convolutional neural networks (CNNs) used in practice employ potentially hundreds of layers and 1010,000000s of nodes. Such network sizes entail significant computational complexity due to the large number of convolutions that need to be carried out; in addition, a large number of parameters needs to be learned and…

2017-07-10abs ↗pdf ↗

Study proper sampling for X-ray transforms on simple surfaces.

problem Proper discretizing and sampling issues related to geodesic X-ray transforms on simple surfaces.
method Provide minimal sampling rates for faithful reconstruction, quantify sampling quality, and predict artifacts.
result Minimal sampling rates and artifact prediction for geodesic X-ray transforms on simple surfaces.

New method constrains CNN filter frequencies to improve robustness.

problem CNN bias towards low frequency components, leading to poor performance in scenario transformations.
method Frequency domain regularization by constraining filter spectra, training valid frequency range end-to-end.
result Demonstrated effectiveness in defending adversarial perturbations, reducing generalization gap, and improving transfer learning.

Paper presents a unique method to recover signals from their bispectrum.

problem Retrieving signals accurately from their bispectrum.
method Two-step trust region algorithm that minimizes a non-convex objective function.
result Signals with finite spectral or temporal support can be recovered from at least 3B measurements of their bispectrum.

Developed a diffusion model on spherical data, addressing geometric and stochastic challenges.

problem Diffusion models on spherical data face unique geometric and stochastic issues.
method Extended spectral diffusion to spherical harmonics, introducing modified stochastic differential equations.
result Introduced a geometry-dependent inductive bias in spectral diffusion models.

GNNs outperform NNs in interpolating bandlimited functions on Euclidean cubes.

problem Interpolating bandlimited functions on Euclidean cubes using GNNs vs. NNs.
method Investigates optimal GNN configurations and weights for function interpolation.
result GNNs require fewer weights and samples to interpolate bandlimited functions compared to NNs.

New method uses CNN for seismic inversion uncertainty quantification.

problem Uncertainty quantification in seismic inversion for noisy data.
method Plug-and-Play Stein Variational Gradient Descent (PnP-SVGD) with CNN denoiser.
result High-resolution, trustworthy posterior samples for subsurface structures.

Paper advances sparse regularisation theory for measures with new kernel insights.

problem Estimating sparse measures from noisy observations using continuous sparse regularisation.
method Develops new continuous sparse regularisation theory on measures with Beurling-LASSO, introduces kernel switch analysis.
result Proves the ``sinc-4'' kernel satisfies a technical LPC assumption for error bounds.

AaSP improves audio self-supervised learning by addressing aliasing issues.

problem Alias issues in audio spectrogram transformers.
method AaSP combines aliasing-aware patch representation, teacher-student masked modeling, cross-attention predictor, and contrastive regularization.
result AaSP learns more stable representations that integrate high-frequency cues.

Dual-space sampling tackles ill-conditioned inverse problems with Bayesian methods.

problem Bayesian inference in constrained inverse problems with ill-conditioned solutions.
method Dual-space posterior sampling using ADMM and SVGD.
result Well-calibrated uncertainty estimates and posterior contraction with increasing data.

We develop methods to learn dictionaries invariant under group symmetries, useful in cryo-EM and tracking.

problem Learning dictionaries invariant under group symmetries.
method Representation theory, non-abelian Fourier analysis, matrix orbitopes, alternating minimization.
result Effective dictionary learning for SO(3) symmetries with guarantees.