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

62125187249 · Jun 202019922001200920172026
48 results for Small norm

In this paper we prove several results on the geometry of surfaces immersed in R3\mathbf R^3 with small or bounded L2L^2 norm of A|A|. For instance, we prove that if the L2L^2 norm of A|A| and the LpL^p norm of HH, p>2p>2, are sufficiently small, then such a surface is graphical away from its boundary. We also prove …

2012-07-21abs ↗pdf ↗

We provide a necessary and sufficient condition that LpL^p-norms, 2<p<62<p<6, of eigenfunctions of the square root of minus the Laplacian on 2-dimensional compact boundaryless Riemannian manifolds MM are small compared to a natural power of the eigenvalue λλ. The condition that ensures this is that their L2L^2 norms ove…

2009-07-28abs ↗pdf ↗

New framework assesses regularization norms in ill-posed problems, revealing L2 instability and proposing adaptive fractional RKHS solutions.

problem Comparative analysis of regularization norms in ill-posed problems.
method Small noise analysis framework for Tikhonov and RKHS regularizations.
result Optimal convergence rates achieved with adaptive fractional RKHS, but hyper-parameters decay too fast.

Study on scalar curvature bounds and manifold topological complexity.

problem Understanding the topological complexity of manifolds with scalar curvature constraints.
method Introduced a small scale index theorem to establish bounds for Gromov's simplicial norm.
result Upper bound for Gromov's simplicial norm established in terms of scalar curvature, volume, and injectivity radius.

PSiLON Net uses L1L_1 weight normalization and 1-path-norm regularization for efficient learning and sparsity.

problem Efficient learning and sparsity in neural networks with limited data.
method PSiLON Net employs L1L_1 weight normalization and 1-path-norm regularization to simplify the 1-path-norm and achieve efficient learning and near-sparse parameters.
result PSiLON Net achieves reliable optimization and strong performance in the small data regime.

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 ↗

Noise injection before gradient steps helps in regularization for neural networks.

problem Improving generalization in overparametrized neural networks.
method Injecting small noise perturbations before computing gradient steps, especially in layer-wise fashion.
result Small noise perturbations can explicitly regularize neural networks without variance explosion.

This paper presents a normalization mechanism called Instance-Level Meta Normalization (ILM~Norm) to address a learning-to-normalize problem. ILM~Norm learns to predict the normalization parameters via both the feature feed-forward and the gradient back-propagation paths. ILM~Norm provides a meta normalization mechanis…

2019-04-06abs ↗pdf ↗

We consider surfaces with boundary satisfying a sixth order nonlinear elliptic partial differential equation corresponding to extremising the L2L^2-norm of the gradient of the mean curvature. We show that such surfaces with small L2L^2-norm of the second fundamental form and satisfying so-called `flat boundary conditio…

2018-12-12abs ↗pdf ↗

Paper introduces a new GG^\star regret measure for online convex optimization with smooth losses.

problem Online convex optimization with smooth losses.
method Introduces a new GG^\star regret measure that depends on the cumulative squared gradient norm.
result The GG^\star regret can be arbitrarily sharper than existing measures when losses have vanishing curvature.

Let (M,g)(M,g) be a noncompact complete nn-manifold with harmonic curvature and positive Sobolev constant. Assume that L2L_2 norms of Weyl curvature and traceless Ricci curvature are finite. We prove that (M,g)(M,g) is Einstein if n5n \ge 5 and Ln/2L_{n/2} norms of Weyl curvature and traceless Ricci curvature are small enough…

2009-11-13abs ↗pdf ↗

We prove an inequality between the LL^{\infty}-norm of the contact Hamiltonian of a positive loop of contactomorphims and the minimal Reeb period. This implies that there are no small positive loops on hypertight or Liouville fillable contact manifolds. Non-existence of small positive loops for overtwisted 3-manifolds…

2016-02-03abs ↗pdf ↗

Estimates for the norm of the second fundamental form, A|A|, play a crucial role in studying the geometry of surfaces. In fact, when A|A| is bounded the surface cannot bend too sharply. In this paper we prove that for an embedded geodesic disk with bounded L2L^2 norm of A|A|, A|A| is bounded at interior points, pro…

2010-07-20abs ↗pdf ↗

We propose a new point of view for regularizing deep neural networks by using the norm of a reproducing kernel Hilbert space (RKHS). Even though this norm cannot be computed, it admits upper and lower approximations leading to various practical strategies. Specifically, this perspective (i) provides a common umbrella f…

2018-09-30abs ↗pdf ↗

CNN layers with large norms are still robust to adversarial attacks.

problem Understanding the relationship between layer norms and adversarial robustness in CNNs.
method Theoretical analysis of 1\ell_1 and \ell_\infty norms, norm decay method, adversarial training frameworks.
result Adversarially robust CNNs can have comparable or larger layer norms than non-adversarially robust ones.

In this paper we present several curvature estimates and convergence results for solutions of the Ricci flow. The curvature estimates depend on smallness of certain local space-time integrals of the norm of the Riemann curvature tensor, while the convergence results require finiteness of space-time integrals of the nor…

2005-09-07abs ↗pdf ↗

The study shows how to regularize weakly harmonic maps using Sobolev norms and Coulomb frames.

problem Regularity of weakly harmonic maps between Riemannian manifolds.
method New structure equations and Coulomb-frame methods combined with Hardy-BMO duality.
result Sufficient conditions on Sobolev norms ensure full regularity of weakly harmonic maps.

The study analyzes robustness of estimators in linear models with adversarial errors.

problem Analyzing robustness of estimators in linear models with adversarial errors.
method Develops a general theory for minimum norm interpolating estimators and RERM in linear models without conditions on errors.
result Quantitative bound for the prediction error relating it to Rademacher complexity, norm of minimum norm interpolator of errors, and subdifferential size.

HBR improves normative modeling of neuroimaging data across multiple sites.

problem Dealing with nuisance variation in neuroimaging data across different sites.
method Hierarchical Bayesian regression (HBR) for multi-site normative modeling.
result HBR provides more accurate normative ranges compared to existing methods.

Batch normalization (batch norm) is often used in an attempt to stabilize and accelerate training in deep neural networks. In many cases it indeed decreases the number of parameter updates required to achieve low training error. However, it also reduces robustness to small adversarial input perturbations and noise by d…

2019-05-06abs ↗pdf ↗

New insights into network generalization show learning rate affects both norm and sharpness.

problem Understanding the generalization of overparameterized networks.
method Empirical analysis and theoretical proof of the trade-off between norm and sharpness.
result Learning rate influences both norm and sharpness, neither alone minimizes generalization error.

Near-interpolating models grow norms quickly, affecting generalization.

problem Understanding the trade-off between interpolation and generalization in near-interpolating models.
method Random matrix theory and eigendecay analysis of data covariance matrix.
result Near-interpolating models exhibit rapid norm growth and worse generalization trade-offs.

On a closed balanced manifold, we show that if the Chern scalar curvature is small enough in a certain Sobolev norm then a slightly modified version of the Chern-Yamabe flow~\cite{Angella:2015aa} converges to a solution of the Chern-Yamabe problem. We also prove that if the Chern scalar curvature, on closed almost-Herm…

2017-06-15abs ↗pdf ↗

New algorithms improve approximation of matrix norms, with applications in statistics and machine learning.

problem Improving approximation of matrix norms for 2ightarrowq2 ightarrow q in polynomial time.
method Polynomial-time multiplicative approximation algorithms for 2ightarrowq2 ightarrow q norm, leveraging sum-of-squares certificates.
result Achieved polynomially improved approximation factors, notably d1/8d^{1/8} for q=4q=4.

Small mass implies a bilipschitz diffeomorphism to flat space

problem Given a 33-dimensional asymptotically flat manifold with non-negative scalar curvature and L2L^2-norm of the curvature tensor at most 11, if the mass is small, is there a bilipschitz diffeomorphism from the manifold to the flat Euclidean space?
method Using previous work
result A strong positive answer to the problem

Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial selection problem is often turned into a convex optimization problem by replacing the cardinality function by its convex envelope (tightest c…

2010-08-25abs ↗pdf ↗

We consider closed immersed hypersurfaces evolving by surface diffusion flow, and perform an analysis based on local and global integral estimates. First we show that a properly immersed stationary (ΔH \equiv 0) hypersurface in \R^3 or \R^4 with restricted growth of the curvature at infinity and small total tracefree c…

2012-05-26abs ↗pdf ↗