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

6481,2961,9442,592 · Jun 202019922001200920172026
48 results for equivalence of norms

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.

The Schatten quasi-norm can be used to bridge the gap between the nuclear norm and rank function, and is the tighter approximation to matrix rank. However, most existing Schatten quasi-norm minimization (SQNM) algorithms, as well as for nuclear norm minimization, are too slow or even impractical for large-scale problem…

2016-06-02abs ↗pdf ↗

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.

In this paper, the Cartan tensors of the (α,β)(α,β)-norms are investigated in details. Then an equivalence theorem of (α,β)(α,β)-norms is proved. As a consequence in Finsler geometry, general (α,β)(α,β)-metrics on smooth manifolds of dimension n4n\geq4 with vanishing Landsberg curvatures must be Berwald manifolds.

2018-12-31abs ↗pdf ↗

A unique Kähler potential on the unit ball is identified with constant differential norm.

problem Finding a unique Kähler potential with constant differential norm on the unit ball.
method Analyzing the Kähler potential of the unit ball and its biholomorphic equivalence to the Siegel domain.
result The Kähler potential of the Siegel domain is unique up to automorphisms with constant differential norms.

Equivalent tests for SGD batch size selection found.

problem Finding equivalent tests for adaptive batch size selection in SGD.
method Norm and inner product/orthogonality tests equivalence demonstration.
result Norm and inner product/orthogonality tests are equivalent under specific conditions.

We introduce the volume entropy semi-norm in real homology and show that it satisfies functorial properties similar to the ones of the simplicial volume. Answering a question of M. Gromov, we prove that the volume entropy semi-norm is equivalent to the simplicial volume semi-norm in every dimension. We also establish a…

2019-09-24abs ↗pdf ↗

The Schatten-pp norm (0<p<10<p<1) has been widely used to replace the nuclear norm for better approximating the rank function. However, existing methods are either 1) not scalable for large scale problems due to relying on singular value decomposition (SVD) in every iteration, or 2) specific to some pp values, e.g., $1/…

2016-11-25abs ↗pdf ↗

We prove a sharp L2H1/2L^2\to H^{1/2} stability estimate for the geodesic X-ray transform of tensor fields of order 00, 11 and 22 on a simple Riemannian manifold with a suitable chosen H1/2H^{1/2} norm. We show that such an estimate holds for a family of such H1/2H^{1/2} norms, not topologically equivalent, but equivalent o…

2018-06-02abs ↗pdf ↗

Differential calculus on metric spaces is contained in the algebraic study of normed groupoids with δδ-structures. Algebraic study of normed groups endowed with dilatation structures is contained in the differential calculus on metric spaces. Thus all algebraic properties of the small world of normed groups with dilat…

2009-11-06abs ↗pdf ↗

We study a regularizer which is defined as a parameterized infimum of quadratics, and which we call the box-norm. We show that the k-support norm, a regularizer proposed by [Argyriou et al, 2012] for sparse vector prediction problems, belongs to this family, and the box-norm can be generated as a perturbation of the fo…

2015-12-27abs ↗pdf ↗

We consider the question of what functions can be captured by ReLU networks with an unbounded number of units (infinite width), but where the overall network Euclidean norm (sum of squares of all weights in the system, except for an unregularized bias term for each unit) is bounded; or equivalently what is the minimal …

2019-02-13abs ↗pdf ↗

We prove that for a so-called sticky process SS there exists an equivalent probability QQ and a QQ-martingale S~\tilde{S} that is arbitrarily close to SS in Lp(Q)L^p(Q) norm. For continuous SS, S~\tilde{S} can be chosen arbitrarily close to SS in supremum norm. In the case where SS is a local martingale we may choo…

2015-09-28abs ↗pdf ↗

The aim of this note is to analyse the structure of the L0L^0-normed L0L^0-modules over a metric measure space. These are a tool that has been introduced by N. Gigli to develop a differential calculus on spaces verifying the Riemannian Curvature Dimension condition. More precisely, we discuss under which conditions an …

2018-03-07abs ↗pdf ↗

In recent years, the nuclear norm minimization (NNM) problem has been attracting much attention in computer vision and machine learning. The NNM problem is capitalized on its convexity and it can be solved efficiently. The standard nuclear norm regularizes all singular values equally, which is however not flexible enou…

2014-05-23abs ↗pdf ↗

Efficiently regularizes deep learning models using Jacobian nuclear norm.

problem Regularizing deep learning models to prevent overfitting and improve generalization.
method Proposes a denoising-style approximation to penalize the Jacobian nuclear norm without computing the Jacobian matrix.
result Demonstrates that penalizing the average squared Frobenius norm of JgJg and JhJh is equivalent to penalizing the Jacobian nuclear norm for function compositions.

The real homology of a compact Riemannian manifold MM is naturally endowed with the stable norm. The stable norm on H1(M,R)H_1(M,\mathbb{R}) arises from the Riemannian length functional by homogenization. It is difficult and interesting to decide which norms on the finite-dimensional vector space H1(M,R)H_1(M,\mathbb{R}) are st…

2008-06-21abs ↗pdf ↗

We introduce and study deformation Tb,φT_{{\bf b},φ} of Minkowski norms in Rn\mathbb{R}^n, determined by a set b=(β1,,βp){\bf b}=(β_1,\ldots,β_p) of linearly independent 1-forms and a smooth positive function φφ of pp variables. In particular, the Tb,φT_{{\bf b},φ}-image of a Euclidean norm αα is a Minkowski norm, whose indicat…

2019-10-04abs ↗pdf ↗

Study shows how feature weighting affects neural network regularization.

problem Understanding how feature weighting influences neural network regularization.
method Derived equivalence paths connecting different weighting matrices and ridge regularization levels.
result Ridge estimators trained on weighted features are asymptotically equivalent when evaluated against test vectors.

The paper studies the metric and algebraic structures on section rings of projective manifolds.

problem Understanding the relationship between metric and algebraic structures on section rings.
method Analyzes the section ring of projective manifolds and ample line bundles, proving approximate isometry properties under various norms.
result Characterizes L2L^2-norms associated with continuous plurisubharmonic metrics and refines the theorem of Phong-Sturm.

Develops exact convex optimization formulations for neural networks.

problem Training two-layer neural networks with rectified linear units.
method Uses semi-infinite duality and minimum norm regularization to develop exact convex optimization formulations.
result Shows equivalence of ReLU networks trained with weight decay to block 1\ell_1 penalized convex models.

We study contractivity properties of gradient flows for functions on normed spaces or, more generally, on Finsler manifolds. Contractivity of the flows turns out to be equivalent to a new notion of convexity for the functions. This is different from the usual convexity along geodesics in non-Riemannian Finsler manifold…

2010-09-13abs ↗pdf ↗

We give a complete characterization of those f:[0,1]Xf: [0,1] \to X (where XX is a Banach space which admits an equivalent Fréchet smooth norm) which allow an equivalent C2C^2 parametrization. For X=RX=\R, a characterization is well-known. However, even in the case X=R2X=\R^2, several quite new ideas are needed. Moreover, the …

2006-03-31abs ↗pdf ↗

Let AA be an expanding d×dd\times d matrix with integer entries and DZd{\mathcal D}\subset {\mathbb Z}^d be a finite digit set. Then the pair (A,D)(A, {\mathcal D}) defines a unique integral self-affine set K=A1(K+D)K=A^{-1}(K+{\mathcal D}). In this paper, by replacing the Euclidean norm with a pseudo-norm ww in terms of AA, we…

2017-04-24abs ↗pdf ↗

Muon dynamics study uses spectral Wasserstein flow for optimization stability.

problem Optimizing deep learning models with gradient normalization.
method Introduces Spectral Wasserstein distances for matrix flows, proving equivalence with Benamou--Brenier formulation.
result Gradient-flow interpretation of mean-field normalized training dynamics.

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 ↗

We prove that the Yamabe invariant of any simply connected smooth manifold of dimension n greater than four is non-negative. Equivalently that the infimum of the L^{n/2} norm of the scalar curvature, over the space of all Riemannian metrics on the manifold, is zero.

1998-08-14abs ↗pdf ↗

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.

The problem of classifying Einstein solvmanifolds, or equivalently, Ricci soliton nilmanifolds, is known to be equivalent to a question on the variety of n-dimensional complex nilpotent Lie algebra laws. Namely, one has to determine which GL(n)-orbits in this variety have a critical point of the squared norm of the mom…

2011-05-23abs ↗pdf ↗

This study uses neural networks to solve interpolation problems with sparse, infinitely wide layers.

problem Exact data interpolation using sparse, infinitely wide neural networks.
method Atomic norm framework to derive convex hulls and equivalent convex formulations.
result Simple characterizations of convex hulls for different constraints on network weights and biases.

In this paper we investigate panel regression models with interactive fixed effects. We propose two new estimation methods that are based on minimizing convex objective functions. The first method minimizes the sum of squared residuals with a nuclear (trace) norm regularization. The second method minimizes the nuclear …

2018-10-25abs ↗pdf ↗

This thesis presents the Conditional Value-at-Risk concept and combines an analysis that covers its application as a risk measure and as a vector norm. For both areas of application the theory is revised in detail and examples are given to show how to apply the concept in practice. In the first part, CVaR as a risk mea…

2015-10-31abs ↗pdf ↗

Bounded symmetric domains are biholomorphic to tube domains over Finsler symmetric cones.

problem Characterizing biholomorphic mappings between tube domains and bounded symmetric domains.
method Analyzing properties of Finsler symmetric cones and unital JB-algebras.
result Tube domains over Finsler symmetric cones are biholomorphic to bounded symmetric domains.

We present an algorithm for L1-norm kernel PCA and provide a convergence analysis for it. While an optimal solution of L2-norm kernel PCA can be obtained through matrix decomposition, finding that of L1-norm kernel PCA is not trivial due to its non-convexity and non-smoothness. We provide a novel reformulation through …

2017-09-28abs ↗pdf ↗