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

4590135180 · Jun 202019922001200920172026
48 results for unit normal

It is important in many applications to be able to extend the (outer) unit normal vector field from a hypersurface to its neighborhood in such a way that the result is a unit gradient field. The aim of the paper is to provide an elementary proof of the existence and uniqueness of such an extension.

2018-02-14abs ↗pdf ↗

The paper defines and studies new types of submanifolds in a unit sphere.

problem Variational problems of curvature tensors for submanifolds.
method Euler-Lagrange equations for Normal-Yang-Mills and Tangent-Yang-Mills submanifolds.
result Infinitely many non-trivial examples of Normal-Yang-Mills and Tangent-Yang-Mills submanifolds are constructed.

Harmonic unit normal sections studied for Grassmannians induced by cross products.

problem Energy of maps assigning unit vectors to subspaces of Grassmannians.
method Analyzing cross products to induce harmonic sections into sphere bundles.
result All unit normal sections of Grassmannians associated with cross products are harmonic.

New Convolutional Unit improves Batch Whitening performance.

problem Improving the efficiency and effectiveness of Batch Whitening.
method Proposes a new Convolutional Unit that aligns with Batch Whitening theory and empirically analyzes the original Convolutional Unit.
result Significantly improved performance on multiple image classification datasets.

Study on neural networks' performance under different normalizations as N grows.

problem Characterizing neural networks' performance under various normalizations.
method Developed an asymptotic expansion to analyze statistical output of shallow neural networks.
result No bias-variance trade-off exists to leading order in N, and variance decreases as normalization approaches mean field.

Deep Learning has revolutionized vision via convolutional neural networks (CNNs) and natural language processing via recurrent neural networks (RNNs). However, success stories of Deep Learning with standard feed-forward neural networks (FNNs) are rare. FNNs that perform well are typically shallow and, therefore cannot …

2017-06-08abs ↗pdf ↗

The paper studies matrix normalization and graph balancing using a new functional and gradient descent.

problem Matrix normalization and graph balancing.
method A new functional called the non-normal energy, and gradient descent.
result Gradient descent of the non-normal energy converges to balanced graphs and preserves spectra and realness of weights.

The paper studies properties of RCD(K,N)\mathrm{RCD}(K,N) spaces and their boundaries.

problem Understanding the boundary structure and unit normal on RCD(K,N)\mathrm{RCD}(K,N) spaces.
method Proves concentration of boundary measure, discusses localization of unit normal, and develops tools for perimeter minimizers.
result Proves that the boundary measure of sets with finite perimeter is concentrated on the nn-regular set Rn\mathcal{R}_n.

The paper investigates how target normalization and momentum affect dying ReLUs in neural networks.

problem Understanding and mitigating the dying ReLU problem in neural networks.
method Empirical analysis and theoretical modeling of a discrete-time linear autonomous system.
result Target variance plays a crucial role in the dying ReLU phenomenon, and momentum exacerbates this issue.

We present a new equation with respect to a unit vector field on Riemannian manifold MnM^n such that its solution defines a totally geodesic submanifold in the unit tangent bundle with Sasaki metric and apply it to some classes of unit vector fields. We introduce a class of covariantly normal unit vector fields and pro…

2005-09-30abs ↗pdf ↗

Variational inference relies on flexible approximate posterior distributions. Normalizing flows provide a general recipe to construct flexible variational posteriors. We introduce Sylvester normalizing flows, which can be seen as a generalization of planar flows. Sylvester normalizing flows remove the well-known single…

2018-03-15abs ↗pdf ↗

The paper characterizes unit balls among Stein spaces with specific groups using Bergman-Einstein metrics.

problem Characterizing unit balls among Stein spaces with specific groups.
method Study of Bergman metric on finite ball quotients and its Kähler-Einstein property.
result The Bergman-Einstein metric exists only on the unit ball itself for finite ball quotients with trivial groups.

In 1963, K.P.Grotemeyer proved an interesting variant of the Gauss-Bonnet Theorem. Let M be an oriented closed surface in the Euclidean space R^3 with Euler characteristic χ(M), Gauss curvature G and unit normal vector field n. Grotemeyer's identity replaces the Gauss-Bonnet integrand G by the normal moment <a,n>^2G, w…

2007-07-12abs ↗pdf ↗

Twisted Alexander invariants of knots are well-defined up to multiplication of units. We get rid of this multiplicative ambiguity via a combinatorial method and define normalized twisted Alexander invariants. We then show that the invariants coincide with sign-determined Reidemeister torsion in a normalized setting, an…

2007-05-16abs ↗pdf ↗

This paper uses a geometric approach to understand how normalization layers affect neural network optimization.

problem Understanding the effect of normalization layers on optimization in neural networks.
method Introduces a spherical framework to study optimization dynamics of neural networks with normalization layers from a geometric perspective.
result Derives the first effective learning rate expression of Adam and shows that SGD with NLs is equivalent to a constrained variant of Adam.

Bayesian neural networks improve uncertainty calibration without sacrificing accuracy.

problem Bayesian neural networks struggle with uncertainty calibration and high-dimensional geometry.
method Model uncertainty only in weight directions using a von Mises-Fisher posterior on the unit sphere, deriving a compact KL term.
result A lightweight, dimension-aware variational unit improves calibration without sacrificing accuracy.

Proposes PER loss to regularize neural network activations to normal distribution.

problem Improving neural network generalization and training speed.
method Regularizes activations to standard normal distribution via projected error function and Wasserstein distance.
result Minimizes Wasserstein distance between activation distribution and standard normal.

The paper develops a method for self-normalized inference in adaptive experiments.

problem Adaptive experiments require a fixed horizon for ATE estimation, but propensities can change.
method The method uses self-normalized martingale limit theory to estimate ATE.
result The Studentized statistic is asymptotically N(0,1) at the prespecified horizon.

We study the long time behavior of the volume preserving pp-flow in Rn+1\mathbb{R}^{n+1} for 1p<n+1n11\leq p<\frac{n+1}{n-1}. By extending Andrews' technique for the flow along the affine normal, we prove that every centrally symmetric solution to the volume preserving pp-flow converges sequentially to the unit ball in the $…

2012-11-29abs ↗pdf ↗

We address the problem of estimating statistics of hidden units in a neural network using a method of analytic moment propagation. These statistics are useful for approximate whitening of the inputs in front of saturating non-linearities such as a sigmoid function. This is important for initialization of training and f…

2018-03-28abs ↗pdf ↗

This paper resolves BIHT convergence, showing normalization is not necessary in noiseless settings but crucial for robustness.

problem Analyzing convergence and robustness of BIHT for 1-bit compressed sensing.
method Characterizes BIHT convergence and robustness, proving necessity of normalization for robustness under sign corruptions.
result Per-iteration normalization is not necessary for optimal recovery in noiseless settings but is crucial for robustness under sign corruptions.

MEMGAN uses memory to improve anomaly detection by isolating abnormal data.

problem Weak guarantees for detecting anomalous data in classical algorithms.
method Memory-augmented Generative Adversarial Networks (MEMGAN) with a memory module.
result MEMGAN provides strong guarantees for anomaly detection with improved reconstruction.

We prove that the Hopf vector field is a unique one among geodesic covariantly normal unit vector fields on spheres such that the submanifold generated by the field is totally geodesic in the unit tangent bundle with Sasaki metric. As application, we give a new proof of stability (instability) of the Hopf vector field …

2005-03-25abs ↗pdf ↗

We prove a Berger type theorem for the normal holonomy group (i.e., the holonomy group of the normal connection) of a full complete complex submanifold of the complex projective space. Namely, if the normal holonomy does not act transitively, then the submanifold is the complex orbit, in the complex projective space, o…

2008-07-22abs ↗pdf ↗

This paper presents a general framework for norm-based capacity control for Lp,qL_{p,q} weight normalized deep neural networks. We establish the upper bound on the Rademacher complexities of this family. With an Lp,qL_{p,q} normalization where qpq\le p^*, and 1/p+1/p=11/p+1/p^{*}=1, we discuss properties of a width-independent ca…

2018-10-03abs ↗pdf ↗

In this paper we propose and investigate a novel nonlinear unit, called LpL_p unit, for deep neural networks. The proposed LpL_p unit receives signals from several projections of a subset of units in the layer below and computes a normalized LpL_p norm. We notice two interesting interpretations of the LpL_p unit. First…

2013-11-07abs ↗pdf ↗

Recent seminal work at the intersection of deep neural networks practice and random matrix theory has linked the convergence speed and robustness of these networks with the combination of random weight initialization and nonlinear activation function in use. Building on those principles, we introduce a process to trans…

2019-05-03abs ↗pdf ↗

Several variants of recurrent neural networks (RNNs) with orthogonal or unitary recurrent matrices have recently been developed to mitigate the vanishing/exploding gradient problem and to model long-term dependencies of sequences. However, with the eigenvalues of the recurrent matrix on the unit circle, the recurrent s…

2019-11-18abs ↗pdf ↗