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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Smoothing Estimates

Estimates time-varying network connections using multi-stage smoothing.

problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.

Smoothed SGD improves quantile estimation without crossing curves.

problem Estimating quantiles without crossing estimated curves.
method Smoothed SGD algorithm with Bahadur representation and Gaussian approximation.
result Smoothed SGD provides non-asymptotic tail probability bounds and a Gaussian approximation for quantile estimates.

A boosting method improves nonparametric density estimation without smoothing assumptions.

problem Overfitting in nonparametric data fitting.
method Introduces a boosting algorithm for univariate nonparametric maximum likelihood estimation.
result Demonstrates the effectiveness of the boosting approach through simulations and real data experiments.

We generalize stochastic smoothing for gradient estimation of non-differentiable functions.

problem Gradient estimation for non-differentiable functions.
method Developed a general framework for relaxation and gradient estimation of non-differentiable black-box functions using stochastic smoothing with reduced assumptions.
result Empirically validated the effectiveness of variance reduction strategies for various non-differentiable tasks.

Non-parametric estimation of a multivariate density estimation is tackled via a method which combines traditional local smoothing with a form of global smoothing but without imposing a rigid structure. Simulation work delivers encouraging indications on the effectiveness of the method. An application to density-based c…

2016-10-07abs ↗pdf ↗

Post-estimation smoothing improves prediction accuracy with structural indices.

problem Using natural structural indices in machine learning without losing robustness.
method A post-estimation smoothing operator that separates from the original predictor.
result Post-estimation smoothing improves accuracy over original predictors under simple conditions.

New matching estimators correct bias in multivariate settings without smoothing parameters.

problem Bias in nearest-neighbor and matching estimators in multiple dimensions.
method Polynomial least squares fits on Voronoi tessellations.
result Novel estimators converge at n\sqrt{n} rate under mild smoothness assumptions.

The paper provides gradient estimates for nonlinear heat-type equations on smooth metric measure spaces.

problem Proving gradient estimates for nonlinear heat-type equations on smooth metric measure spaces.
method Using Hamilton type and Li-Yau type estimates, the paper proves gradient estimates on positive solutions to generalized nonlinear parabolic equations on smooth metric measure spaces with compact boundary.
result Gradient estimates for nonlinear heat-type equations on smooth metric measure spaces.

Label smoothing improves model robustness against misspecification.

problem Improving model robustness against model misspecification.
method Introducing modified label smoothing (MLSLR) that maintains consistent probability estimation while modifying the loss function.
result MLSLR exhibits higher robustness against model misspecification than conventional label smoothing.

Sparse Polyak improves high-dimensional statistical estimation.

problem High-dimensional statistical estimation problems with growing problem dimension.
method Sparse Polyak modifies Polyak's adaptive step size to estimate restricted Lipschitz smoothness.
result Sparse Polyak achieves optimal statistical precision with fewer iterations.

The paper proves gradient estimates for nonlinear parabolic equations on smooth metric measure spaces.

problem Proving gradient estimates for nonlinear parabolic equations on smooth metric measure spaces.
method Using Souplet-Zhang type estimates and properties of Bakry-Emery Ricci tensor and weighted mean curvature.
result Gradient estimates for nonlinear parabolic equations on smooth metric measure spaces with Dirichlet boundary condition.

The paper provides new gradient estimates for solutions to a nonlinear elliptic equation on smooth metric measure spaces.

problem Gradient estimates for solutions to a specific nonlinear elliptic equation on smooth metric measure spaces.
method Nash-Moser iteration technique to obtain local gradient estimates.
result New local gradient estimates for positive solutions to the equation.

The paper establishes bounds on the smoothness parameter in Gaussian process interpolation.

problem Estimating the smoothness parameter in Gaussian process models.
method Approximation theory in Sobolev spaces and general theorems on parameter estimation.
result Maximum likelihood estimation recovers the true smoothness for certain classes of functions.

Paper optimizes statistical estimation for randomized smoothing to reduce adversarial robustness certification time.

problem Efficiently estimating robustness of points against adversarial attacks.
method Developed estimation procedures using confidence sequences and randomized Clopper-Pearson intervals.
result Achieved optimal sample complexities and stronger certificates with reduced computational burden.

Smoothing splines provide a powerful and flexible means for nonparametric estimation and inference. With a cubic time complexity, fitting smoothing spline models to large data is computationally prohibitive. In this paper, we use the theoretical optimal eigenspace to derive a low rank approximation of the smoothing spl…

2019-11-23abs ↗pdf ↗

Improved MLMC method for robust and efficient probability and density estimation.

problem Stability and poor complexity of MLMC for low-regularity functionals.
method Numerical smoothing combined with MLMC for deterministic quadrature methods.
result Significant improvement in strong convergence and robustness of MLMC method.

Improved estimators for causal inference using cross-fitting and undersmoothing.

problem Estimating expected conditional covariance in causal inference.
method Double cross-fit doubly robust (DCDR) estimators with undersmoothing for non-smooth nuisance functions.
result DCDR estimators achieve n\sqrt{n}-consistency and asymptotic normality under minimal conditions.

The estimation of probabilities of network edges from the observed adjacency matrix has important applications to predicting missing links and network denoising. It has usually been addressed by estimating the graphon, a function that determines the matrix of edge probabilities, but this is ill-defined without strong a…

2015-09-29abs ↗pdf ↗

Paper proposes new density estimators for high-dimensional data.

problem Prohibitive computational cost and slow convergence rate in high-dimensional density estimation.
method Adaptive hyperbolic cross density estimators in mixed smooth Sobolev spaces.
result Proposed estimators do not suffer curse of dimensionality under Integral Probability Metrics.

A new clustering method uses nonparametric smoothing to estimate cluster membership functions.

problem Clustering with flexible, nonparametric estimation.
method Nonparametric smoothing to estimate cluster membership functions without explicit modelling assumptions.
result The method automatically determines the number of clusters and level of flexibility.

Spatial smoothing improves BNNs' accuracy, uncertainty, and robustness without increasing computational cost.

problem Large ensembles in BNNs increase computational cost and reduce performance.
method Spatial smoothing adds blur layers to convolutional neural networks to ensemble neighboring feature map points.
result Spatial smoothing improves BNNs' performance with fewer ensembles and enhances robustness.

Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain smoothed analysis estimates for elements in this class depending only on geometric inva…

2006-05-24abs ↗pdf ↗

We establish fundamental results for a parabolic flow of Riemannian metrics introduced by Bahuaud-Helliwell in arXiv:1010:4287v1 which is based on the Fefferman-Graham ambient obstruction tensor. First, we obtain local L2L^2 smoothing estimates for the curvature tensor and use them to prove pointwise smoothing estimate…

2015-06-05abs ↗pdf ↗

Many problems on signal processing reduce to nonparametric function estimation. We propose a new methodology, piecewise convex fitting (PCF), and give a two-stage adaptive estimate. In the first stage, the number and location of the change points is estimated using strong smoothing. In the second stage, a constrained s…

2018-03-14abs ↗pdf ↗

Proves smoothness and estimates for special Lagrangian solutions with semi-convexity.

problem Smoothness and estimates for special Lagrangian solutions.
method Viscosity solutions, smoothness, interior derivative estimates, sharpness of conditions.
result New Liouville theorem and effective Hessian estimates for special Lagrangian solutions.

Optimizes spectral density estimation for stationary and nonstationary processes.

problem Estimating spectral density of time series with complex structure.
method Optimally adaptive Bayesian spectral density estimation using smoothing spline covariance structure.
result Optimal eigendecomposition provides superior performance compared to alternative covariance functions.

Develops a novel ML smoothing method for incomplete data in state-space models.

problem Estimating states in stochastic systems with incomplete information.
method Introduces score function and conditional observed information matrices for incomplete data, and uses them to derive the ML smoother.
result The ML smoother provides more accurate state estimates with lower standard errors compared to the standard ML state estimator.

Smooth solutions found for modified mean curvature flow in Riemannian manifolds.

problem Existence of smooth solutions for modified mean curvature flow.
method A priori estimates for modified mean curvature flow in Riemannian manifolds with Killing vector field.
result Existence of smooth, entire, longtime solutions for modified mean curvature flow with smooth initial data.

The paper proposes a decoupled approach to efficiently estimate CoVaR, a measure of systemic financial risk.

problem Estimating CoVaR, a measure of systemic financial risk, is challenging due to zero-probability events and portfolio repricing.
method The paper introduces a decoupled approach using smoothing techniques and a functional perspective to model CoVaR.
result The decoupled estimator achieves a rate of convergence of approximately OmP(Γ1/2)O_{ m P}(Γ^{-1/2}).

We define a diffeomorphism invariant of smooth 4-manifolds which we can estimate for many smoothings of R^4 and other smooth 4-manifolds. Using this invariant we can show that uncountably many smoothings of R^4 support no Stein structure. (Gompf has constructed uncountably many smoothings of R^4 which do support Stein …

1997-12-06abs ↗pdf ↗

New method for adaptive estimation and inference in econometric models without knowing smoothness.

problem Adaptive estimation and inference in ill-posed linear inverse problems with unknown smoothness.
method Discrepancy principle-based framework for adaptive hyperparameter selection.
result Achieves optimal rates in weak and strong metrics for linear functionals.

In the previous paper, we considered a link diagram invariant of Hass and Nowik type using regular smoothing and unknotting number, to estimate the number of Reidemeister moves needed for unlinking. In this paper, we introduce a new link diagram invariant using irregular smoothing, and give an example of a knot diagram…

2011-03-26abs ↗pdf ↗

Proves existence of smooth convex solutions to capillary curvature equations.

problem Proving existence of smooth convex solutions to capillary curvature equations.
method Gradient estimate for capillary curvature equations in half-space.
result Existence of even, smooth, strictly convex solutions for all 1<p<k+11<p<k+1 and θ(0,π/2)θ\in(0,π/2).

In this paper, we consider the following general evolution equation ut=Δfu+aulogαu+bu u_t=Δ_fu+au\log^αu+bu on smooth metric measure spaces (Mn,g,efdv)(M^n, g, e^{-f}dv). We give a local gradient estimate of Souplet-Zhang type for positive smooth solution of this equation provided that the Bakry-Émery curvature bounded from below. When ff

2016-10-11abs ↗pdf ↗

A non-Bayesian, regression-based or generalized least squares (GLS)-based approach is formally proposed to estimate a class of time-varying AR parameter models. This approach has partly been used by Ito et al. (2014, 2016a,b), and is proven to be efficient because, unlike conventional methods, it does not require Kalma…

2017-07-21abs ↗pdf ↗