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

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for Besov Dynamic Closure

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.

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.

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.

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

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.

Derivation of reduced order representations of dynamical systems requires the modeling of the truncated dynamics on the retained dynamics. In its most general form, this so-called closure model has to account for memory effects. In this work, we present a framework of operator inference to extract the governing dynamic…

2018-03-25abs ↗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.

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.

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.

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.

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.

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

The study connects lamination and orbit closures in hyperbolic manifolds.

problem Understanding the geometric and dynamical properties of horocycle orbit closures in Z\mathbb{Z}-covers of compact hyperbolic manifolds.
method Exposes connections between distance minimizing laminations and horospherical orbit closures in Z\mathbb{Z}-covers of compact hyperbolic manifolds. Provides novel constructions and explicit descriptions.
result Even slight perturbations to hyperbolic metrics can drastically change horocycle orbit closures.

A new method predicts non-Markovian closure terms for complex systems.

problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.

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.

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.

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.

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 stationary measures and orbit closures for non-abelian actions on surfaces.

problem Classify stationary measures and orbit closures for non-abelian action on a surface.
method Use a finite verifiable average growth condition and results from Brown and Rodriguez Hertz.
result Show that under certain conditions, the only nonatomic stationary measure is the given smooth invariant measure, and every orbit closure is either finite or dense.

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 ↗

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.

Researchers develop methods to learn neuron dynamics from colored noise.

problem Learning nonlocal stochastic neuron dynamics from colored noise.
method Proposed two methods for closing Fokker-Planck equations: nonlocal large-eddy-diffusivity closure and data-driven sparse regression.
result Mutual information and total correlation between stimulus and neuron states calculated for FHN neuron.

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.

New surfaces with special geodesic and horocycle behaviors discovered.

problem Understanding geodesic and horocycle dynamics on hyperbolic surfaces.
method Constructing geometrically infinite hyperbolic surfaces with tailored recurrence properties.
result First examples of non-trivial minimal horocyclic orbit closures and infinite locally-finite conservative horocyclic invariant measures.

Combines ML and KB modeling for large chaotic systems.

problem Predicting large, complex, spatiotemporal systems with limited data.
method Parallel ML prediction and hybrid approach combining ML and KB.
result Excellent performance and reduced training data needed.

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.

MARL improves LBM stability and accuracy across scales.

problem Stability and accuracy issues in under-resolved LBM simulations.
method Multi-Agent Reinforcement Learning (MARL) to dynamically control local relaxation parameters.
result MARL closures stabilize simulations and recover spectra of fully resolved models.

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

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.

Algorithm converts plat to standard closure of braids in 3D and related spaces.

problem Converting plat to standard closure of braids in different spaces.
method Algorithmic approach for plat to standard closure conversion in \(\mathbb{R}^3\), handlebodies, and thickened surfaces.
result Algorithm is quadratic for plat to standard closure and linear for standard to plat closure.

The paper studies knitted surfaces and surface-links, showing their isotopy and closure properties.

problem Understanding the isotopy and closure properties of knitted surfaces and surface-links.
method Analyzing the structure and closure of knitted surfaces and surface-links in R4\mathbb{R}^4.
result Any surface-link is ambient isotopic to the closure of a 2-dimensional knit.