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

Trend · papers per month

3775112149 · May 202619922001200920172026
48 results for uniform norm

The paper explores why a specific type of predictor works well in noisy data.

problem Understanding why a specific type of predictor (minimum-norm interpolator) works well in noisy data.
method The paper uses uniform convergence and zero-error predictors in a norm ball to explain the success of the minimum-norm interpolator.
result The minimum-norm interpolator is consistent, and this can be explained by uniform convergence of zero-error predictors in a norm ball.

We introduce a norm on the space of test configurations, which we call the minimum norm. We conjecture that uniform K-stability with respect to this norm is equivalent to the existence of a constant scalar curvature Kähler metric. This notion of uniform K-stability is analogous to coercivity of the Mabuchi functional. …

2014-12-01abs ↗pdf ↗

Matrix completion has been well studied under the uniform sampling model and the trace-norm regularized methods perform well both theoretically and numerically in such a setting. However, the uniform sampling model is unrealistic for a range of applications and the standard trace-norm relaxation can behave very poorly …

2013-03-02abs ↗pdf ↗

Study shows gap between uniform convergence and test error in random feature models.

problem Understanding the gap between uniform convergence and test error in random feature models.
method Analytical expressions for uniform convergence over norm balls, interpolators, and minimum norm interpolator risk derived and proved.
result Uniform convergence over interpolators still gives a non-trivial bound of test error even when classical uniform convergence is vacuous.

Online learning of linear operators between infinite-dimensional spaces is possible but with limitations.

problem Learning linear operators between infinite-dimensional Hilbert spaces in an online setting.
method Online learning approach for linear operators with bounded pp-Schatten norm, proving impossibility for operator norm.
result Separation between online learnability and uniform convergence for bounded linear operators.

Study on neural networks' sample complexity with one hidden layer.

problem Understanding how sample complexity is affected by network architecture and norm constraints.
method Norm-based uniform convergence bounds for scalar-valued one-hidden-layer networks, focusing on spectral and Frobenius norms.
result Spectral norm control is insufficient for uniform convergence guarantees, but Frobenius norm control is sufficient, with conditions.

The uniform boundary condition in a normed chain complex asks for a uniform linear bound on fillings of null-homologous cycles. For the 1\ell^1-norm on the singular chain complex, Matsumoto and Morita established a characterisation of the uniform boundary condition in terms of bounded cohomology. In particular, spaces…

2017-03-03abs ↗pdf ↗

In this paper we study the uniform perfectness, boundedness and uniform simplicity of diffeomorphism groups of compact manifolds with boundary and open manifolds and obtain some upper bounds of their diameters with respect to commutator length, those with support in balls and conjugation-generated norm.

2019-05-19abs ↗pdf ↗

We introduce uniform K-stability and its relationship with the coercivity property of the K-energy functional, for general polarized manifolds. Since the automorphism groups are not necessarily finite, size of the norm measuring uniformity should be reduced with respect to the group action. About this point we explain …

2016-10-25abs ↗pdf ↗

This paper studies the matrix completion problem under arbitrary sampling schemes. We propose a new estimator incorporating both max-norm and nuclear-norm regularization, based on which we can conduct efficient low-rank matrix recovery using a random subset of entries observed with additive noise under general non-unif…

2016-09-24abs ↗pdf ↗

New method turns optimization algorithms into uniformly stable learning algorithms for non-Euclidean norms.

problem Non-Euclidean norms in binary classification problems.
method Black-box reduction method using uniformly convex regularizers.
result Achieves optimal statistical risk bounds on excess risk for non-Euclidean norms.

We prove that Riemannian metrics with a uniform weak norm can be smoothed to having arbitrarily high regularity. This generalizes all previous smoothing results. As a consequence we obtain a generalization of Gromov's almost flat manifold theorem. A uniform Betti number estimate is also obtained.

1995-08-23abs ↗pdf ↗

Smooth DNNs mitigate the curse of dimensionality in uniform convergence for various regression tasks.

problem The curse of dimensionality in uniform convergence of ReLU networks.
method Analysis of smoothly activated deep neural networks (smooth DNNs), establishing pseudo-dimension bounds and non-asymptotic approximation guarantees.
result Smooth DNNs achieve non-asymptotic uniform convergence rates across multiple statistical contexts, mitigating the curse of dimensionality.

In this work we prove convergence results of sequences of Riemannian 44-manifolds with almost vanishing L2L^2-norm of a curvature tensor and a non-collapsing bound on the volume of small balls. In Theorem 1.1, we consider a sequence of closed Riemannian 44-manifolds, whose L2L^2-norm of the Riemannian curvature tenso…

2017-10-25abs ↗pdf ↗

Solves approximation problems for zonoids and neural networks, closing gaps in dimensions 2 and 3.

problem Approximating zonoids and shallow neural networks in uniform norm.
method Combines techniques to solve both problems, closing gaps in dimensions 2 and 3.
result Completes the solution for zonoid approximation in all dimensions and improves neural network approximation rates.

Uniformly finite homology is a coarse homology theory, defined via chains that satisfy a uniform boundedness condition. By construction, uniformly finite homology carries a canonical \ell^\infty-semi-norm. We show that, for uniformly discrete spaces of bounded geometry, this semi-norm on uniformly finite homology in …

2015-02-04abs ↗pdf ↗

We study the effectiveness of non-uniform randomized feature selection in decision tree classification. We experimentally evaluate two feature selection methodologies, based on information extracted from the provided dataset: (i)(i) \emph{leverage scores-based} and (ii)(ii) \emph{norm-based} feature selection. Experimenta…

2014-03-24abs ↗pdf ↗

The paper examines convergence of distances in Lipschitz structures on manifolds.

problem Convergence of distances in Lipschitz vector fields and norms on manifolds.
method Analysis of convergence of distances associated to converging structures of Lipschitz vector fields and norms.
result Under mild controllability assumption, distances converge locally uniformly to the limit Carnot-Carathéodory distance.

New method approximates complex kernel norms with random features, making learning tractable.

problem Complexity of learning with kernel methods in high dimensions.
method Random features approximations to Fp\mathcal{F}_p norms, focusing on p>1p>1.
result For p>1p>1, the number of random features required is polynomial in the sample size, making learning tractable.

Paper tackles low-rank matrix recovery with column 2,0\ell_{2,0}-norm regularization.

problem Low-rank matrix recovery problems with column sparsity constraints.
method Developed alternating majorization-minimization (AMM) methods with extrapolation and hybrid AMM.
result Global convergence analysis and superior performance in matrix completion problems.

New method for differentially private optimization with general Lipschitz conditions.

problem Differentially private optimization under general Lipschitz conditions.
method Generalized Lipschitz condition for per-sample gradients, tuning clip norm based on minimum per-sample Lipschitz constant.
result Efficacy of the recommended clip norm tuning method verified on 8 datasets.

Study spectral distribution of twisted Laplacian on high genus hyperbolic surfaces.

problem Estimating spectral distribution of twisted Laplacian on hyperbolic surfaces.
method Estimate spectral distribution by supremum norm of harmonic form; show small supremum norm for high genus surfaces; prove uniform Weyl law.
result Prove uniform Weyl law for real parts of spectrum on high genus hyperbolic surfaces.

We study the relationship between two norms on the first cohomology of a hyperbolic 3-manifold: the purely topological Thurston norm and the more geometric harmonic norm. Refining recent results of Bergeron, Şengün, and Venkatesh as well as older work of Kronheimer and Mrowka, we show that these norms are roughly propo…

2015-10-21abs ↗pdf ↗

We consider in this paper the problem of noisy 1-bit matrix completion under a general non-uniform sampling distribution using the max-norm as a convex relaxation for the rank. A max-norm constrained maximum likelihood estimate is introduced and studied. The rate of convergence for the estimate is obtained. Information…

2013-09-24abs ↗pdf ↗

We present Rotated Adaptive Tetra-iterated Quantizer (RATQ), a fixed-length quantizer for gradients in first order stochastic optimization. RATQ is easy to implement and involves only a Hadamard transform computation and adaptive uniform quantization with appropriately chosen dynamic ranges. For noisy gradients with al…

2019-08-22abs ↗pdf ↗

The paper studies Blaschke products, proving uniformization and non-degeneracy of pressure metrics.

problem Analytic aspects of Blaschke products and their moduli space.
method Definition of complex structure and proof of uniformization theorem.
result Pressure semi-norms are non-degenerate outside the super-attracting locus.

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 ↗

Equivalence of norms on manifolds with curvature bounds established.

problem Establishing equivalence of norms on manifolds with bounded sectional curvature.
method Using spectral projector and thickness condition for subsets.
result Constant in equivalence depends only on manifold dimension, curvature bounds, and frequency threshold.

Multiple kernel learning (MKL), structured sparsity, and multi-task learning have recently received considerable attention. In this paper, we show how different MKL algorithms can be understood as applications of either regularization on the kernel weights or block-norm-based regularization, which is more common in str…

2010-11-13abs ↗pdf ↗

The paper provides a new uniform tail bound for empirical processes.

problem Developing a uniform tail bound for empirical processes indexed by a class of functions.
method Introducing a deflation step to the standard generic chaining argument, and using a natural seminorm based on Cramér functions.
result Established a new uniform tail bound for empirical processes.

Unified method to calculate Gromov norm for Kähler classes of bounded symmetric domains.

problem Calculating the Gromov norm of Kähler classes for all bounded symmetric domains.
method Combination of ideas from Domin-Toledo and Toledo, aided by the Polydisc Theorem.
result Unified and simplified calculation of Gromov norm for all bounded symmetric domains.

This work analyzes how to choose regularization norms for adversarial training in high dimensions.

problem Choosing the right regularization norm for adversarial training in high-dimensional settings.
method Derives asymptotic descriptions and uniform convergence bounds for robust, regularized empirical risk minimizers.
result Characterizes the relationship between perturbation size and optimal regularization choice.

This paper compares two invariants of foliated manifolds which seem to measure the non-Hausdorffness of the leaf space: the transversal length on the fundamental group and the foliated Gromov norm on the homology. We consider foliations with the property that the set of singular simplices transverse to the foliation sa…

2003-03-19abs ↗pdf ↗

New approach to adversarial robustness with non-uniform perturbations.

problem Real-world adversaries craft adversarial examples with non-uniform perturbations.
method Proposes non-uniform perturbations based on feature dependencies and data distribution.
result Shows improved robustness to real-world attacks compared to uniform perturbations.

Paper addresses concentration of distances for fractional quasi p-norms, identifying conditions for concentration and anti-concentration.

problem Understanding concentration of distances for fractional quasi p-norms in high dimensions.
method Analyzes conditions for concentration and anti-concentration of distances for fractional quasi p-norms.
result Identifies conditions for concentration and anti-concentration of fractional quasi p-norms, ruling out some approaches and specifying conditions for control.

Improved 2-bit covariance estimator with reduced operator norm error and no tuning needed.

problem Improving 2-bit covariance estimation with reduced operator norm error and no tuning needed.
method Proposed a new 2-bit covariance matrix estimator using triangular dithering scales.
result Improved operator norm error rate that depends on effective rank of covariance matrix, closing theoretical gap.