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

119239358477 · Jun 202019922001200920172026
48 results for Besov Spaces

Bayesian nonparametric LABS model adapts to function smoothness in Besov spaces.

problem Estimating functions with unknown smoothness in Besov spaces.
method Lévy Adaptive B-spline (LABS) regression model with automatic smoothness adaptation.
result LABS posterior contracts around true function in Besov classes at nearly minimax-optimal rates.

This paper studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.

problem Optimizing an unknown function with limited evaluations.
method Studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.
result Minimax rates over Besov spaces are identical to those over the smallest Hölder space into which Besov spaces embed.

New cyclicity measures defined in weighted Besov spaces, with stability and geometric analysis.

problem Characterizing cyclicity in weighted Besov spaces.
method Defining cyclicity indices based on potential theory and capacity, studying stability under perturbations, and linking zero set structure to cyclicity.
result Novel invariants and conditions for cyclicity in various function spaces.

Wavelet-based online learning adapts to noisy Besov spaces with high probability.

problem Minimizing integrated squared error in Besov spaces with noisy observations.
method Adaptive wavelet-based online learning algorithm that dynamically adjusts to gradient noise.
result Achieves minimax-optimal integrated squared error with high probability.

Bayesian neural networks achieve optimal posterior contraction rates in Besov spaces with intrinsic dimensionality.

problem High-dimensional structured estimation problems with unknown smoothness levels.
method Sparse Bayesian neural networks with either sparse or continuous shrinkage priors.
result Optimal posterior contraction rates are achieved, adapting to the unknown smoothness level of the true function.

Study analyzes deep learning's performance on variable exponent Besov space, highlighting adaptivity benefits.

problem Estimation error analysis of deep learning in variable exponent Besov space.
method Analysis of general approximation error and estimation errors of deep learning.
result Adaptivity of deep learning leads to significant improvement in estimation error, especially in high-dimensional spaces.

Deep ReLU networks approximate functions in Sobolev and Besov spaces efficiently.

problem Efficiently approximating functions in Sobolev and Besov spaces using deep ReLU networks.
method Novel bit-extraction technique and VC-dimension method for deriving approximation bounds.
result Sharp upper and lower bounds for LpL_p-approximation of functions in Sobolev and Besov spaces.

Bayesian KANs achieve near-minimax posterior contraction rates in anisotropic Besov spaces.

problem Statistical foundation for Bayesian Kolmogorov-Arnold networks in anisotropic Besov spaces.
method Sparse Bayesian KANs with spike-and-slab priors, hyperprior on model size, and approximation complexity bounds.
result Posterior contraction rates depend on intrinsic anisotropic smoothness and effective dimension of the compositional structure.

Deep ReLU networks can efficiently approximate Sobolev and Besov functions.

problem Approximating functions in Sobolev and Besov spaces using deep neural networks.
method Used deep ReLU neural networks with varied width and depth to approximate functions in Sobolev and Besov spaces.
result Generalized the approximation rate to hold under the Sobolev embedding condition.

Characterizes when differential forms have weak exterior derivatives based on limiting behavior of integration over simplices.

problem Characterizing differential forms with weak exterior derivatives.
method Uses integration over simplices to characterize the limiting behavior of differential forms.
result Proves a direct analogue of the Bourgain-Brezis-Mironescu characterization for differential forms.

Extends Onsager's conjecture to Besov spaces on manifolds with boundary.

problem Proving Onsager's conjecture on Riemannian manifolds with boundary.
method Constructing Hodge-Neumann heat kernel, obtaining off-diagonal decay and local Bernstein estimates.
result Extends Onsager's conjecture to Besov spaces B^3,V13\widehat{B}_{3,V}^{\frac{1}{3}}.

In this paper we propose a function space approach to Representation Learning and the analysis of the representation layers in deep learning architectures. We show how to compute a weak-type Besov smoothness index that quantifies the geometry of the clustering in the feature space. This approach was already applied suc…

2017-10-09abs ↗pdf ↗

Kolmogorov-Arnold Networks improve deep learning adaptivity and can approximate Besov functions optimally.

problem Improving deep learning adaptivity and understanding approximation rates.
method Analyzing Besov norms and using Res-KANs for approximation.
result KANs can optimally approximate Besov functions at the optimal rate.

Study on stochastic covariant derivatives in curved space-time.

problem Analyzing covariant derivatives in curved space-time under stochastic processes.
method Using Itô-Wiener processes and stochastic calculus, including Besov spaces, Schrödinger operators, and white noise.
result Developed a framework for stochastic geodesics and white noise in fractoid spaces.

Deep ReLU networks can approximate and learn smooth functions efficiently.

problem Efficiently approximating and learning smooth functions using deep ReLU neural networks.
method Extending recent results to anisotropic and mixed smooth function classes, establishing approximation rates.
result Deep ReLU networks achieve minimax optimal rates up to logarithmic factors for various smooth function classes.

Deep learning models can adaptively estimate functions with varying smoothness using regularization.

problem Estimating functions with heterogeneous smoothness in Besov or BV classes.
method Introduced a Parallel NN variant of deep ReLU networks with 2\ell_2 regularization equivalent to promoting p\ell_p-sparsity.
result Achieves minimax rates for Besov and BV classes with exponentially closer performance as depth increases.

Study minimax rates for density estimation under Huber contamination and Besov IPM losses.

problem Minimax convergence rates of nonparametric density estimation under Huber contamination model with outliers.
method Re-scaled thresholding wavelet series estimator and GAN architectures.
result Achieves minimax optimal convergence rates under Besov IPM losses.

Paper analyzes sample complexity for offline RL with deep ReLU networks.

problem Theoretical analysis of sample complexity for offline RL with deep ReLU networks.
method Establishes sample complexity for offline RL with deep ReLU networks, considering Besov dynamic closure and correlated structure.
result First theoretical characterization of sample complexity for offline RL with deep neural network function approximation.

Diffusion models achieve nearly optimal distribution estimation in various spaces.

problem Theoretical limitations of diffusion modeling for distribution estimation.
method Analysis of approximation and generalization abilities of diffusion models in Besov spaces.
result Diffusion models achieve nearly minimax optimal estimation rates in total variation and Wasserstein distances.

New spatiotemporal Besov process improves CT image reconstruction and other inverse problems.

problem Handling abrupt changes and sharp contrasts in spatiotemporal data.
method Generalized Besov process (STBP) with Q-exponential process for temporal correlation.
result STBP outperforms traditional methods in dynamic reconstruction and inverse problems.

We study the expressivity of deep neural networks. Measuring a network's complexity by its number of connections or by its number of neurons, we consider the class of functions for which the error of best approximation with networks of a given complexity decays at a certain rate when increasing the complexity budget. U…

2019-05-03abs ↗pdf ↗

The paper studies harmonic map heat flow stability and decay rates.

problem Analyzing stability and decay rates of harmonic map heat flow solutions.
method Use of homogeneous Besov space B˙p,dp(Rd)\dot{B}^{\frac{d}{p}}_{p,\infty}(\mathbb{R}^d) for small initial data and self-similar decay assumption.
result Decay rates for solutions of the harmonic map flow of the form ablau(t)L(Rd)Ct12\| abla u(t) \|_{L^\infty(\mathbb{R}^d)}\leq Ct^{-\frac12} and self-similar decay under stronger initial conditions.

ConvResNets approximate Besov functions and classify on low-dimensional manifolds.

problem Lack of statistical theories for deep learning on high-dimensional data.
method Exploits low-dimensional geometric structures of real-world data sets using ConvResNets.
result ConvResNets can approximate Besov functions and learn classifiers with optimal excess risk.

Study on distributed nonparametric function estimation with optimal rate and cost of adaptation.

problem Optimal rate of convergence and cost of adaptation in distributed nonparametric function estimation.
method Distributed minimax estimation and adaptive estimation under communication constraints for Gaussian sequence model and white noise model.
result Established minimax rate of convergence and exact communication cost for adaptation.

We prove the local existence of unique smooth solutions of the Donaldson geometric flow on the space of symplectic forms on a closed smooth four-manifold, representing a fixed cohomology class. It is a semiflow on the Besov space B21,p(M,Λ2)B^{1,p}_2(M, Λ^2) for p>4p > 4. The Donaldson geometric flow was introduced by Simon Dona…

2015-12-31abs ↗pdf ↗

The Volterra square-root process shows non-uniqueness of limiting distributions and regularity of its law.

problem Non-uniqueness of limiting distributions in the Volterra square-root process.
method Establishing existence of limiting distributions using integrability of the Volterra convolution kernel and exponential-affine transformation.
result The limiting distributions of the Volterra square-root process depend on the initial state and belong to weighted Besov spaces.

No trapped surfaces can form under low-regularity bounds in certain spacetimes.

problem Existence of trapped surfaces in low regularity solutions to Einstein's equations.
method Analyzing the initial data in Besov B2,13/2B^{3/2}_{2,1} norm and extending to H3/2H^{3/2} smallness.
result No trapped surfaces can exist initially when the Cauchy data are close to Minkowski spacetime data.

Paper proves higher-order flow matching preserves optimality in generative modeling.

problem Theoretical guarantees for higher-order flow matching in generative modeling.
method Neural network approximations with controlled depth, width, and sparsity.
result Proves worst case optimality for second-order flow matching.

Paper studies optimal federated learning for nonparametric regression with privacy constraints.

problem Federated learning for nonparametric regression with heterogeneous differential privacy constraints.
method Proposes distributed privacy-preserving estimators and investigates their risk properties.
result Establishes matching minimax lower bounds for global and pointwise estimation.

The paper defines function spaces on manifolds with bounded or singular geometries.

problem Defining function spaces on manifolds with various geometries.
method Introduces and analyzes Sobolev, Besov, and Bessel potential spaces on uniformly regular and singular Riemannian manifolds.
result Demonstrates maximal regularity for a linear parabolic problem on singular manifolds.

Estimates mixing coefficients of geometrically ergodic Markov processes from a single sample path.

problem Estimating mixing coefficients of geometrically ergodic Markov processes.
method Proposes methods to estimate β\beta-mixing coefficients from a single sample path under standard smoothness conditions.
result Obtains a rate of convergence of order \(\mathcal{O}(\log(n) n^{-[s]/(2[s]+2)})\) for the expected error of the estimator.

A rather complete investigation of anisotropic Bessel potential, Besov, and Hölder spaces on cylinders over (possibly) noncompact Riemannian manifolds with boundary is carried out. The geometry of the underlying manifold near its 'ends' is determined by a singularity function which leads naturally to the study of weigh…

2012-04-03abs ↗pdf ↗

This paper investigates the nonparametric regression problem using SVMs with anisotropic Gaussian RBF kernels. Under the assumption that the target functions are resided in certain anisotropic Besov spaces, we establish the almost optimal learning rates, more precisely, optimal up to some logarithmic factor, presented …

2018-10-04abs ↗pdf ↗

Deep neural networks approximate functions in shift-invariant spaces with controlled error.

problem Approximating functions in shift-invariant spaces with neural networks.
method Using deep ReLU neural networks, estimating approximation error bounds based on network width and depth.
result Deep neural networks achieve optimal approximation rates for Sobolev spaces up to a logarithmic factor.

We develop a geometric invariant Littlewood-Paley theory for arbitrary tensors on a compact 2 dimensional manifold. We show that all the important features of the classical LP theory survive with estimates which depend only on very limited regularity assumptions on the metric. We give invariant descriptions of Sobolev …

2003-09-29abs ↗pdf ↗

Develops local elliptic regularity for geometrically-natural operators with low regularity coefficients.

problem Local elliptic regularity for operators with low regularity coefficients in Sobolev-type spaces.
method Rescaling estimates and multiplication results for function spaces.
result Unified set of interior estimates and regularity inference for operators with Sobolev-type coefficients.