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,694 papers · 148 categories

Trend · papers per month

206411617822 · Jun 202019922001200920172026
48 results for less smooth functions

Rational neural networks approximate functions more efficiently with less depth.

problem Choosing optimal nonlinear activation functions in neural networks.
method Rational activation functions with optimal bounds and efficiency proofs.
result Rational neural networks approximate smooth functions more efficiently than ReLU networks with exponentially smaller depth.

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.

Given an associative 3-fold in R^7 which is asymptotically conical with generic rate less than 1, we show that its moduli space of deformations is locally homeomorphic to the kernel of a smooth map between smooth manifolds. Moreover, the virtual dimension of the moduli space is computed and shown to be non-negative for…

2008-02-24abs ↗pdf ↗

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.

Adaptive NN method improves matrix completion for non-smooth data.

problem Matrix completion with non-smooth non-linear functions under high missingness.
method Two-sided nearest neighbors with \Holder function class non-linearity.
result NN error rate matches oracle's for latent factors, non-trivial for wide range of missingness.

We prove that the half-integer valued local index of an isolated umbilic point on a C3+αC^{3+α}-smooth convex surface in Euclidean 3-space is less than two. The approach is to study the co-kernel of an associated Riemann-Hilbert boundary value problem. The link between the local and global is a semi-local technique that …

2012-07-25abs ↗pdf ↗

Study on the nodal set of Dirac equation solutions on manifolds.

problem Understanding the structure of nodal sets of solutions to Dirac equations.
method Proved Hausdorff dimension of nodal sets, extended to locally Lipschitz coefficients, provided stratification results.
result Stratification result for nodal sets, providing new insights even in the smooth case.

Paper introduces a new invariant for virtual knotoids and proves it's a Vassiliev invariant of order one.

problem Tackles the problem of understanding invariants for virtual knotoids.
method Uses a 0-smoothing invariant constructed from local modifications at classical crossings.
result Demonstrates that the 0-smoothing invariant provides less information than the gluing invariant.

Perturbs area-minimizing hypersurfaces to reduce singular set's dimension.

problem Reduces the dimension of the singular set of area-minimizing hypersurfaces.
method Perturbs a smooth hypersurface to minimize the Minkowski dimension of the singular set.
result The singular set of the perturbed minimizing current has Minkowski dimension less than n-9.

New method combines CATE and CQTE to estimate treatment effects across different quantiles.

problem Challenges in estimating CQTE due to its dependence on smoothness of individual quantiles.
method Introduces a new estimand, the conditional quantile comparator (CQC), which retains information about the whole treatment distribution and leverages simplicity.
result Demonstrates improved accuracy in estimating treatment effects across different quantiles compared to existing methods.

Whereas recovery of the manifold from data is a well-studied topic, approximation rates for functions defined on manifolds are less known. In this work, we study a regression problem with inputs on a dd^*-dimensional manifold that is embedded into a space with potentially much larger ambient dimension. It is shown tha…

2019-08-02abs ↗pdf ↗

We are interested in approximation of a multivariate function f(x1,,xd)f(x_1,\dots,x_d) by linear combinations of products u1(x1)ud(xd)u^1(x_1)\cdots u^d(x_d) of univariate functions ui(xi)u^i(x_i), i=1,,di=1,\dots,d. In the case d=2d=2 it is a classical problem of bilinear approximation. In the case of approximation in the L2L_2 space the bili…

2014-09-04abs ↗pdf ↗

New shapes enclose less volume than the sphere, surprising in 3D.

problem Finding the minimal volume enclosed by smooth spheres with bounded curvatures.
method Produced a family of bodies parameterized by ε, each bounded by a smooth topological sphere with principal curvatures in [-1, 1].
result The unit sphere does not enclose the minimal volume among all smooth spheres in R^3 with principal curvatures in [-1, 1].

Bayesian optimization (BO) and its batch extensions are successful for optimizing expensive black-box functions. However, these traditional BO approaches are not yet ideal for optimizing less expensive functions when the computational cost of BO can dominate the cost of evaluating the blackbox function. Examples of the…

2018-11-05abs ↗pdf ↗

Calibrating a Lévy process usually requires characterizing its jump distribution. Traditionally this problem can be solved with nonparametric estimation using the empirical characteristic functions (ECF), assuming certain regularity, and results to date are mostly in 1D. For multivariate Lévy processes and less smooth …

2018-12-20abs ↗pdf ↗

Learning sparse features can lead to overfitting in neural networks, especially for smooth target functions.

problem Understanding when feature learning in neural networks improves or deteriorates performance.
method Analyzing the effect of feature sparsity on neural network performance and comparing it to lazy training methods.
result Feature learning can lead to overfitting, especially for smooth target functions, due to sparser and less smooth representations.

Advocates against over-smoothing and over-squashing in GNNs, suggesting they are less critical than previously thought.

problem Over-smoothing and over-squashing in Graph Neural Networks (GNNs).
method Challenged the prevailing focus on these phenomena, proposing that performance decreases are due to uninformative receptive fields and localised information distribution.
result Performance decreases are mostly uncorrelated with over-smoothing and over-squashing, and optimal model depths remain small.

Optimal rates for shallow ReLU networks in nonparametric regression.

problem Approximating smooth and non-smooth functions with shallow ReLU networks.
method Analysis of shallow ReLUk^k neural networks, using variation norms and deep learning theory.
result Optimal approximation rates for shallow ReLU networks in nonparametric regression.

In this article, we extend the mean curvature flow with surgery to mean convex hypersurfaces with entropy less than Λn2Λ_{n-2}. In particular, 2-convexity is not assumed. Next we show the surgery flow with just the initial convexity assumption Hx,ν2>0H - \frac{\langle x, ν\rangle}{2} > 0 is possible and as an application we …

2018-04-11abs ↗pdf ↗

We establish conditions for a continuous map of nonzero degree between a smooth closed manifold and a negatively curved manifold of dimension greater than four to be homotopic to a smooth cover, and in particular a diffeomorphism when the degree is one. The conditions hold when the volumes or entropy-volumes of the two…

2007-10-04abs ↗pdf ↗

Proves a conjecture about metrics and minimal area enclosures.

problem Proving a conjecture about metrics and minimal area enclosures.
method Using boundedness of harmonic function u, proving the conjecture for asymptotically flat 3-manifolds.
result Proves the bounded conformal conjecture under the assumption of boundedness of harmonic function u.

Paper optimizes prediction in semi-functional linear models using kernel methods.

problem Optimizing prediction in semi-functional linear models with functional and nonparametric components.
method Double-penalized least squares method in reproducing kernel Hilbert spaces, with regularization parameter selection via generalized cross validation.
result Achieves minimax optimal rates of convergence for both functional and nonparametric components.

Let f:MmNnf:M^m\to N^n be a smooth map between two differential manifolds with NN connected, f(M)f(M) closed and f(M)Nf(M)\neq N. In this short note, we show that either all the points of MM are critical points of ff or the dimension the collection of all critical points of ff is not less than n1n-1. Some consequences of th…

2018-04-28abs ↗pdf ↗

The paper studies gradings on nilpotent Lie algebras linked to smooth algebraic varieties.

problem Understanding gradings on nilpotent Lie algebras associated with algebraic varieties.
method Analyzing lattice structures in nilpotent Lie groups and their fundamental groups.
result Conditions for a lattice to be the fundamental group of a smooth complex algebraic variety.

Ever since the proof of asymptotic normality of maximum likelihood estimator by Cramer (1946), it has been understood that a basic technique of the Taylor series expansion suffices for asymptotics of MM-estimators with smooth/differentiable loss function. Although the Taylor series expansion is a purely deterministic …

2018-09-13abs ↗pdf ↗

The signature of a surface bundle over a surface is known to be divisible by 4. It is also known that the signature vanishes if the fiber genus is less than or equal to 2 or the base genus is less than or equal to 1. In this article, we construct new smooth 4-manifolds with signature 4 which are surface bundles over su…

2015-11-20abs ↗pdf ↗

We give the diffeomorphism classification of complete intersections with S^1-symmetry in dimension less than or equal to 6. In particular, we show that a 6-dimensional complete intersection admits a smooth non-trivial S^1-action if and only if it is diffeomorphic to the complex projective space or the quadric. We also …

2011-08-26abs ↗pdf ↗

We show how to turn any classifier that classifies well under Gaussian noise into a new classifier that is certifiably robust to adversarial perturbations under the 2\ell_2 norm. This "randomized smoothing" technique has been proposed recently in the literature, but existing guarantees are loose. We prove a tight robu…

2019-02-08abs ↗pdf ↗