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

72143215286 · Jun 202019922001200920172026
48 results for sup-norm convergence

Deep neural networks with adversarial training achieve sup-norm convergence for nonparametric regression.

problem Achieving sup-norm convergence for deep neural network estimators in nonparametric regression.
method Developed an adversarial training scheme to address the sup-norm convergence issue.
result Deep neural network estimators achieve optimal sup-norm convergence with the proposed adversarial training.

The higher order singular value decomposition (HOSVD) of tensors is a generalization of matrix SVD. The perturbation analysis of HOSVD under random noise is more delicate than its matrix counterpart. Recently, polynomial time algorithms have been proposed where statistically optimal estimates of the singular subspaces …

2017-07-05abs ↗pdf ↗

If (M,g)(M,g) is a compact real analytic Riemannian manifold, we give a necessary and sufficient condition for there to be a sequence of quasimodes of order o(λ)o(λ) saturating sup-norm estimates. In particular, it gives optimal conditions for existence of eigenfunctions satisfying maximal sup norm bounds. The condition is …

2013-11-15abs ↗pdf ↗

We show the local wellposedness of biharmonic wave maps with initial data of sufficiently high Sobolev regularity and a blow-up criterion in the sup-norm of the gradient of the solutions. In contrast to the wave maps equation we use a vanishing viscosity argument and an appropriate parabolic regularization in order to …

2019-03-05abs ↗pdf ↗

A key problem in reinforcement learning for control with general function approximators (such as deep neural networks and other nonlinear functions) is that, for many algorithms employed in practice, updates to the policy or QQ-function may fail to improve performance---or worse, actually cause the policy performance …

2016-02-29abs ↗pdf ↗

This paper analyzes how machine learning models resist adversarial attacks in nonparametric regression.

problem Adversarial attacks on machine learning models in nonparametric regression.
method Theoretical analysis of minimax rates of convergence under adversarial sup-norm.
result The minimax rate under adversarial attacks is the sum of two terms: standard rate and deviation of true function.

We complete the quasi-isometric classification of irreducible lattices in semisimple Lie groups over nondiscrete locally compact fields of characteristic zero by showing that any quasi-isometry of a rank one S-arithmetic lattice in a semisimple Lie group over nondiscrete locally compact fields of characteristic zero is…

2005-04-11abs ↗pdf ↗

Analyzes Kodaira-Iitaka dimension and multiplicity using intersection theory.

problem Understanding Kodaira-Iitaka dimension and multiplicity in analytic terms.
method Expresses dimensions and multiplicity in terms of intersection theory of plurisubharmonic envelopes.
result Introduces non-pluripolar numerical Kodaira-Iitaka dimension and shows it dominates the classical dimension.

Self-focal points on ellipsoids of dimension 3 or higher are rare.

problem Existence of self-focal points on Riemannian manifolds of dimension 3 or higher.
method Analyzing geodesics and umbilic points on ellipsoids of various dimensions.
result Ellipsoids of dimension 3 or higher with at least 4 distinct axes have no self-focal points.

General lower bounds on neural network approximation in L^p norm.

problem Fundamental limits of neural network expressivity.
method General lower bound proof on approximation in L^p norm, applied to feed-forward neural networks.
result Neural networks can't approximate certain functions as well as previously thought.

Let YY be a compact, oriented 3-manifold with a contact form aa and a metric ds2ds^2. Suppose that FYF\to Y is a principal bundle with structure group U(2)=SU(2)×±1S1U(2) = SU(2)\times_{\pm1}S^1 such that F/S1F/S^1 is the principal SO(3) bundle of orthonormal frames for TYTY. A unitary connection A0A_0 on the Hermitian line bundle $…

2013-07-17abs ↗pdf ↗

We prove uniform sup-norm estimates for the Monge-Ampere equation with respect to a family of Kahler metrics which degenerate towards a pull-back of a metric from a lower dimensional manifold. This is then used to show the existence of generalized Kahler-Einstein metrics as the limits of the Kahler-Ricci flow for some …

2007-10-05abs ↗pdf ↗

Existence of Q-processes for Brownian motion on hyperbolic spaces with Poissonian potentials shown.

problem Existence of path limits (Q-processes) for Brownian motion on hyperbolic spaces with Poissonian potentials.
method Analysis of stationary random potentials with spectral and sup norm bounds, and use of foliated space defined by the point process.
result Existence of Q-processes for Brownian motion on hyperbolic spaces with Poissonian potentials shown.

The study connects norms and filtrations on section rings of projective manifolds.

problem Understanding norms and filtrations on section rings of polarized projective manifolds.
method Analyzes submultiplicative norms and their equivalence to sup-norms, discusses applications to spectral theory and holomorphic extension.
result Injective and projective tensor norms on symmetric algebras are asymptotically equivalent.

This paper analyzes deep Stable neural networks, showing convergence rates under different growth settings.

problem Analyzing the behavior of deep Stable neural networks as width increases.
method Large-width asymptotic analysis and convergence rates for fully connected feed-forward deep Stable NNs.
result The rescaled deep Stable NN converges weakly to a Stable SP under joint growth, with sup-norm convergence rates established.

New methods for estimating and inferring nonparametric structural functions and elasticities.

problem Estimating and inferring nonparametric structural functions and their derivatives.
method Data-driven sieve dimension choice and uniform confidence bands construction.
result Optimal estimation and inference procedures with minimax rates of convergence.

Study on QQ-function estimation for continuous state-action MDPs, deriving rates and conditions.

problem Estimating QQ-function in off-policy evaluation for continuous state-action Markov decision processes.
method Reformulated as nonparametric instrumental variables (NPIV) problem, derived minimax lower bounds, proposed sieve two-stage least squares estimator.
result First minimax lower bounds for QQ-function and its derivatives in sup-norm and L2L^2-norm, same as classical nonparametric regression.

Study Hamiltonian diffeomorphisms on symplectic manifolds and properties of invariant convex functions.

problem Properties of invariant convex functions under Hamiltonian diffeomorphisms.
method Analysis of the adjoint action and properties of invariant convex functions.
result Continuous convex functions invariant under Hamiltonian diffeomorphisms are also invariant under strict rearrangements.

We consider the problem of online nonparametric regression with arbitrary deterministic sequences. Using ideas from the chaining technique, we design an algorithm that achieves a Dudley-type regret bound similar to the one obtained in a non-constructive fashion by Rakhlin and Sridharan (2014). Our regret bound is expre…

2015-02-26abs ↗pdf ↗

We analyze the differential relation corresponding to integrability of almost complex structures, reformulated as a directed immersion relation by Demailly and Gaussier. Combining results of Clemente [3], we show that applying h-principle techniques yields the following statement: for an almost complex manifold with ar…

2019-03-24abs ↗pdf ↗

We prove new improved endpoint, LpcL^{p_c}, pc=2(n+1)n1p_c=\tfrac{2(n+1)}{n-1}, estimates (the "kink point") for eigenfunctions on manifolds of nonpositive curvature. We do this by using energy and dispersive estimates for the wave equation as well as new improved LpL^p, 2<p<pc2<p< p_c, bounds of Blair and the author \cite{BSTop}, \…

2015-12-11abs ↗pdf ↗

Machine learning and statistics typically focus on building models that capture the vast majority of the data, possibly ignoring a small subset of data as "noise" or "outliers." By contrast, here we consider the problem of jointly identifying a significant (but perhaps small) segment of a population in which there is a…

2016-08-18abs ↗pdf ↗

We establish a uniform estimate for the injectivity radius of the past null cone of a point in a general Lorentzian manifold foliated by spacelike hypersurfaces and satisfying an upper curvature bound. Precisely, our main assumptions are, on one hand, upper bounds on the null curvature of the spacetime and the lapse fu…

2010-08-30abs ↗pdf ↗

Study robust distribution estimation with Wasserstein distance, achieving optimal risk.

problem Robust distribution estimation under adversarial corruption.
method Combining partial OT and minimum distance estimation, proving structural properties and deriving a novel dual form.
result Achieves minimax-optimal robust estimation risk in many settings.

Bounds on Gaussian approximation for neural networks with novel smoothing techniques.

problem Approximating the distribution of wide random neural networks.
method Stein's method, Gaussian smoothing, Laplacian operators, Cameron-Martin space.
result First bounds on Gaussian approximation of wide random neural networks.

Theory of MoE Transformers' generalization and scaling.

problem Understanding the generalization and scaling of Mixture-of-Experts (MoE) Transformers.
method Developed a theory that separates active capacity from routing combinatorics, derived a sup-norm covering-number bound, and proved a constructive approximation theorem.
result Generalization and scaling laws for MoE Transformers, showing how active capacity and routing structure affect performance.

New algorithm for robust density estimation in corrupted data.

problem Density estimation in the presence of adversarial corruption.
method Proposes an algorithm for constructing a density estimator within a star-shaped density class, derived minimax bounds for estimation.
result Obtained minimax upper and lower bounds for density estimation under adversarial corruption.

This paper aims at formulating the issue of ranking multivariate unlabeled observations depending on their degree of abnormality as an unsupervised statistical learning task. In the 1-d situation, this problem is usually tackled by means of tail estimation techniques: univariate observations are viewed as all the more …

2017-05-03abs ↗pdf ↗

New algorithm for active bipartite ranking with continuous distributions.

problem Active ranking of bipartite data with continuous conditional distributions.
method Developed a novel algorithm called smooth-rank to minimize the distance between estimated and optimal ROC curves.
result Smooth-rank algorithm is PAC-(ε,δ)(ε,δ) and outperforms existing methods in empirical tests.

This is an intuitive survey of extrinsic and intrinsic notions of convergence of manifolds complete with pictures of key examples and a discussion of the properties associated with each notion. We begin with a description of three extrinsic notions which have been applied to study sequences of submanifolds in Euclidean…

2010-06-02abs ↗pdf ↗

The abstract discusses convergence properties of Lipschitz functions and sets defined by equations.

problem Convergence of Lipschitz functions and sets defined by equations.
method Painlevé-Kuratowski convergence applied to Lipschitz functions and sets defined by equations.
result Generalizations and reverses of classical theorems on convergence of functions and sets.

The objective of this paper is to introduce the notion of generalized almost statistical (briefly, GAS) convergence of bounded real sequences, which generalizes the notion of almost convergence as well as statistical convergence of bounded real sequences. As a special kind of Banach limit functional, we also introduce …

2019-11-15abs ↗pdf ↗