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

58115173230 · Jun 202019922001200920172026
48 results for Sobolev regression

Study shows rates for Laplacian-eigenmap methods in nonparametric regression.

problem Minimizing error in nonparametric regression using Laplacian-eigenmap.
method Adaptive and non-adaptive minimax rates using Sobolev space constraints.
result Extends minimax rates to various weighted Laplacian matrices.

Paper tackles functional linear regression using spectral algorithms with discrete observations.

problem Functional linear regression problem with discretely observed data.
method Combines distributed spectral algorithms with Sobolev kernels for regularization.
result Derives matching upper and lower bounds for convergence in Sobolev norm.

Optimal rates for vector-valued regression on various norms.

problem Optimal rates for vector-valued ridge regression on continuous norms.
method Combining standard capacity assumptions with tensor product constructions of vector-valued interpolation spaces.
result Optimal rates for vector-valued ridge regression, independent of output space dimension.

Optimal multiscale learning of linear operators

problem Statistical and computational limits of learning bounded linear operators between Sobolev spaces
method Reformulate as an infinite-dimensional matrix regression problem with heterogeneous multiscale structure
result Establish minimax rates and construct a finite-resolution blockwise least-squares estimator attaining these rates

PCR-LE achieves optimal rates for nonparametric regression over Sobolev spaces.

problem Nonparametric regression over Sobolev spaces with random design.
method PCR-LE using Laplacian Eigenmaps on neighborhood graphs.
result PCR-LE achieves minimax rates of convergence for both estimation and goodness-of-fit testing.

NTK neural networks are robust to adversarial attacks in nonparametric regression.

problem Adversarial robustness of neural networks in nonparametric regression.
method Gradient flow with early stopping for NTK neural networks, proving robustness in Sobolev spaces.
result NTK neural networks achieve optimal adversarial robustness rates in Sobolev spaces.

Scalable kernel methods for large datasets using Fourier representations and NUFFT.

problem Cubic complexity in kernel methods limits their use on large-scale datasets.
method Fourier representation of kernels combined with NUFFT for O(n log n) complexity.
result Achieves minimax convergence rates and processes up to tens of billions of samples.

The paper explores how control variates can reduce variance in Monte Carlo simulations, especially for Sobolev functions.

problem Efficiency of control variates in reducing variance for Monte Carlo simulations.
method Study of a specific quadrature rule using nonparametric regression-adjusted control variates.
result A specific quadrature rule can improve the Monte Carlo rate and achieve the minimax optimal rate under sufficient smoothness assumptions.

Learning rates for least-squares regression are typically expressed in terms of L2L_2-norms. In this paper we extend these rates to norms stronger than the L2L_2-norm without requiring the regression function to be contained in the hypothesis space. In the special case of Sobolev reproducing kernel Hilbert spaces used …

2017-02-23abs ↗pdf ↗

Transformer networks approximate Hölder and Sobolev functions with fixed-depth networks.

problem Nonparametric regression with dependent observations.
method Established novel upper bounds for Transformer networks approximating Hölder and Sobolev functions under various ββ-mixing data assumptions.
result Explicit convergence rates for nonparametric regression problems under ββ-mixing data assumptions.

Kolmogorov-Arnold Networks achieve optimal convergence rates in nonparametric regression.

problem Nonparametric function approximation in multivariate settings.
method Structured additive and multiplicative KANs using B-splines.
result Achieve minimax-optimal convergence rate O(n2r/(2r+1))O(n^{-2r/(2r+1)}) for Sobolev space functions.

New method stabilizes machine learning for physics-informed inverse problems.

problem Reconstructing physical quantities from PDE-compliant measurements.
method Physics-informed learning with smooth inductive bias.
result PDE operators stabilize variance and prevent overfitting in fixed dimensions.

SDORE uses neural networks to estimate regression functions and their gradients, even with limited labeled data.

problem Nonparametric estimation of regression functions and their gradients.
method Semi-supervised deep ReQU neural networks with gradient norm regularization.
result Achieves minimax optimal convergence rates in L2L^{2}-norm and plug-in gradient estimator convergence.

The paper analyzes kernel classifiers' performance in Sobolev spaces and proves their optimality.

problem Theoretical analysis of kernel classifiers' performance in Sobolev spaces.
method Deriving upper and lower bounds on classification excess risk using kernel regression theory and estimating interpolation smoothness.
result The proposed kernel classifier is optimal in Sobolev spaces, with theoretical bounds confirmed by real data.

Kernel ridge regression imputation with consistent variance estimation for handling missing data.

problem Handling missing data in statistical analysis.
method Kernel ridge regression imputation combined with entropy method for variance estimation.
result Root-n consistency of the imputation estimator in a Sobolev space setting.

The paper analyzes how adding gradient data affects overparameterized models' performance.

problem The impact of Sobolev training on high-dimensional predictive models.
method Combining replica method from statistical physics and operator-valued free probability theory.
result Sobolev training does not universally improve performance for target functions described by single-index models.

This paper analyzes shallow ReLU networks in L^p and Sobolev spaces, focusing on approximation and generalization.

problem Approximation and generalization of shallow ReLU networks in L^p and Sobolev spaces.
method Spherical harmonic analysis and embeddings into spectral Barron spaces for L^p spaces, path-norm control for Sobolev spaces.
result Minimax-optimal rates for nonparametric regression with shallow ReLU networks under path-norm control.

Bayesian framework for sphere regression using Gaussian fields.

problem Nonparametric regression on the sphere with Gaussian priors.
method Isotropic Gaussian field priors, harmonic structure, exact posterior distributions, optimal spectral truncation, posterior contraction rates.
result Sharp posterior contraction rates for Gaussian priors with polynomially decaying angular power spectra.

Novel algorithm speeds up computation of Sobolev IPM for graph-based probability measures.

problem Efficient computation of Sobolev IPM for graph-based probability measures.
method Established relation between Sobolev norm and weighted LpL^p-norm, proposed novel regularization, leveraged graph structure.
result Proposed regularized Sobolev IPM provides closed-form expression for fast computation.

We propose a new Integral Probability Metric (IPM) between distributions: the Sobolev IPM. The Sobolev IPM compares the mean discrepancy of two distributions for functions (critic) restricted to a Sobolev ball defined with respect to a dominant measure μμ. We show that the Sobolev IPM compares two distributions in hig…

2017-11-14abs ↗pdf ↗

Explains optimal functional inequalities, focusing on Sobolev and fractional Sobolev.

problem Optimal functional inequalities and their stability.
method Compactness theorems, characterization of optimizers, and quantitative stability analysis.
result Characterization and stability of optimizers for Sobolev inequalities and their fractional generalizations.

Noiseless KRR achieves optimal rates and exhibits saturation effects.

problem Understanding optimal rates and saturation phenomena in noiseless kernel ridge regression.
method Comprehensive study of noiseless KRR, establishing minimax optimal rates and uncovering phenomena of extra-smoothness and saturation.
result Noiseless KRR achieves minimax optimal rates and exhibits saturation effects.

Log Sobolev and Michael Simon inequalities for tensor fields on curved manifolds.

problem Establishing inequalities for tensor fields on curved manifolds.
method Applying the ABP method to symmetric tensor fields on manifolds with nonnegative sectional curvature.
result Log Sobolev and Michael Simon inequalities for tensor fields.

Paper proposes a method for early stopping in regression using reproducing kernels.

problem Early stopping for iterative learning algorithms in nonparametric regression.
method Data-driven rule based on minimum discrepancy principle, validated by fixed-point analysis of localized Rademacher complexities.
result The proposed rule is minimax-optimal and performs comparably to cross-validation.

In this paper we study the problem of deriving further Sobolev inequalities from a given Sobolev inequality. We use several different methods, including Bessel potentials and Riesz transforms. We apply the results to the Ricci flow to extend the author's results on the W1,2W^{1,2} Sobolev inequality along the Ricci flow …

2007-09-04abs ↗pdf ↗

Proves Sobolev inequality on manifolds with specific curvature properties.

problem Proving Sobolev inequality on manifolds with asymptotically nonnegative Bakry-Émery Ricci curvature.
method Density and Bakry-Émery Ricci curvature.
result Proves Sobolev inequality on manifolds with asymptotically nonnegative Bakry-Émery Ricci curvature.

Paper connects Fenchel-Willmore and Sobolev inequalities for submanifolds in curved spaces.

problem Developing inequalities for submanifolds in curved spaces.
method Connecting Fenchel-Willmore and logarithmic Sobolev inequalities for mean-convex submanifolds.
result Established extensions of Fenchel-Willmore inequality and derived new Sobolev-type inequalities.

Study shows how close functions are to optimal in Riemannian manifolds.

problem Understanding how close functions are to optimal in Riemannian manifolds.
method Analyzes quantitative stability of Sobolev inequalities on compact Riemannian manifolds.
result Functions that nearly saturate a critical Sobolev inequality are quantitatively close to extremal functions.

The paper examines stability of Sobolev inequalities on manifolds with Ricci curvature bounds.

problem Stability of Sobolev inequalities on Riemannian manifolds with Ricci curvature lower bounds.
method Generalized Lions' concentration compactness and rigidity results of Sobolev inequalities on singular spaces.
result Almost extremal functions are close to extremal functions on the round sphere and Euclidean Sobolev inequality.

Generalizes Sobolev IPM for graph-based measures using Orlicz geometric structure.

problem Limitation of Le et al. (2025) framework to LpL^p geometry.
method Generalizes Sobolev IPM through Orlicz geometric structure, employing convex functions to capture nuanced geometric relationships.
result GSI-M reduces to a simple univariate optimization problem, achieving remarkable computational efficiency.