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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for anisotropic Besov spaces

Deep learning performs well on high-dimensional data with anisotropic smoothness.

problem Understanding the performance of deep learning on high-dimensional datasets with varying smoothness.
method Investigated approximation and estimation errors in anisotropic Besov spaces.
result Deep learning's performance depends on the average smoothness, avoiding curse of dimensionality.

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 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.

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 ↗

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.

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 ↗

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.

The study provides theoretical guarantees for the statistical performance of optimal decision trees.

problem Theoretical limits on the statistical performance of globally optimal decision trees.
method Sharp oracle inequalities and uniform concentration framework based on Rademacher complexity.
result Derivation of minimax optimal rates for piecewise sparse heterogeneous anisotropic Besov space.

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.

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 ↗

In this paper, we consider the problem of "hyper-sparse aggregation". Namely, given a dictionary F={f1,...,fM}F = \{f_1, ..., f_M \} of functions, we look for an optimal aggregation algorithm that writes f~=j=1Mθjfj\tilde f = \sum_{j=1}^M θ_j f_j with as many zero coefficients θjθ_j as possible. This problem is of particular interest when…

2009-12-08abs ↗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.

In this note, we give a classification of complete anisotropic isoparametric hypersurfaces, i.e., hypersurfaces with constant anisotropic principal curvatures, in Euclidean spaces, which is in analogue with the classical case for isoparametric hypersurfaces in Euclidean spaces. On the other hand, by an example of local…

2010-08-11abs ↗pdf ↗

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 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.

Paper extends capillary convex body results to anisotropic setting with Alexandrov-Fenchel inequalities.

problem Extending capillary convex body results to anisotropic setting.
method Developed theory for anisotropic capillary convex bodies in half-space and established Alexandrov-Fenchel inequality for mixed volumes.
result Established a general Alexandrov-Fenchel inequality for mixed volumes of anisotropic capillary convex bodies, weakening and extending previous results.

A new metric evaluates generative models by comparing real and generated samples.

problem Evaluating the quality of generative models.
method Relative Density Ratio (RDR) function, optimization on variational form of φ-divergence.
result The RDR function provides a clear, interpretable, and numerically stable evaluation metric.

Motivated by the study of wave fronts in anisotropic media, we propose an incidence geometry of anisotropic spheres in a Finsler-Minkowski space. An anisotropic version of the Laguerre functional is considered. In some circumstances, this functional can be used to determine that two wavefronts observed at distinct time…

2014-03-31abs ↗pdf ↗

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.

In this paper, we study the anisotropic Minkowski problem. It is a problem of prescribing the anisotropic Gauss-Kronecker curvature for a closed strongly convex hypersurface in Euclidean space as a function on its anisotropic normals in relative or Minkowski geometry. We first formulate such problem to a Monge-Ampére t…

2012-03-06abs ↗pdf ↗

In this paper, we introduce the anisotropic Sobolev capacity with fractional order and develop some basic properties for this new object. Applications to the theory of anisotropic fractional Sobolev spaces are provided. In particular, we give geometric characterizations for a nonnegative Radon measure μμ that naturall…

2014-10-02abs ↗pdf ↗

An introduction into the theory of locally anisotropic spaces (modelled as vector bundles provided with compatible nonlinear and distinguished linear connections and metric structures and containing as particular cases different types of Kaluza--Klein and/or extensions of Lagrange and Finsler spaces) is presented. The …

1996-04-05abs ↗pdf ↗

In this paper we consider the evolution of a graph-like hypersurface by anisotropic mean curvature flow, under some restrictions on the anisotropic area integrand. We find interior estimates (in both time and space) on the gradient of such hypersurfaces, depending only on the height of the graph and the anisotropic are…

2005-10-02abs ↗pdf ↗

The study proves that certain minimal surfaces are flat under specific conditions.

problem Characterizing minimal surfaces in anisotropic spaces.
method Proving a Bernstein theorem for ΦΦ-anisotropic minimal hypersurfaces.
result The only entire smooth solutions to the ΦΦ-anisotropic minimal hypersurfaces equation are linear functions.

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.

The study finds surfaces with constant anisotropic mean curvature foliated by circles in Euclidean space.

problem Existence and geometric description of surfaces with constant anisotropic mean curvature.
method Analyzes surfaces with constant anisotropic mean curvature of the Dirichlet energy, proving existence and classifying them.
result Existence and geometric description of surfaces foliated by circles with zero anisotropic mean curvature.