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

Trend · papers per month

120241361481 · Jun 202019922001200920172026
48 results for Normalization Techniques

Online Normalization is a new technique for normalizing the hidden activations of a neural network. Like Batch Normalization, it normalizes the sample dimension. While Online Normalization does not use batches, it is as accurate as Batch Normalization. We resolve a theoretical limitation of Batch Normalization by intro…

2019-05-15abs ↗pdf ↗

One of the challenges in the study of generative adversarial networks is the instability of its training. In this paper, we propose a novel weight normalization technique called spectral normalization to stabilize the training of the discriminator. Our new normalization technique is computationally light and easy to in…

2018-02-16abs ↗pdf ↗

We introduce a new normalization technique that exhibits the fast convergence properties of batch normalization using a transformation of layer weights instead of layer outputs. The proposed technique keeps the contribution of positive and negative weights to the layer output balanced. We validate our method on a set o…

2018-12-11abs ↗pdf ↗

In this work, we investigate Batch Normalization technique and propose its probabilistic interpretation. We propose a probabilistic model and show that Batch Normalization maximazes the lower bound of its marginalized log-likelihood. Then, according to the new probabilistic model, we design an algorithm which acts cons…

2018-02-13abs ↗pdf ↗

Training state-of-the-art, deep neural networks is computationally expensive. One way to reduce the training time is to normalize the activities of the neurons. A recently introduced technique called batch normalization uses the distribution of the summed input to a neuron over a mini-batch of training cases to compute…

2016-07-21abs ↗pdf ↗

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

2016-06-02abs ↗pdf ↗

In this article, we first describe a normal form of real-analytic, Levi-nondegenerate submanifolds of CNC^N of codimension d \ge 1 under the action of formal biholomorphisms, that is, of perturbations of Levi-nondegenerate hyperquadrics. We give a sufficient condition on the formal normal form that ensures that the n…

2017-05-11abs ↗pdf ↗

We present a new and shorter proof of Stocking's result that any strongly irreducible Heegaard surface of a closed orientable triangulated 3-manifold is isotopic to an almost normal surface. We also re-prove a result of Jaco and Rubinstein on normal spheres. Both proofs are based on the "reduction" technique introduced…

2003-03-30abs ↗pdf ↗

Normalization methods are a central building block in the deep learning toolbox. They accelerate and stabilize training, while decreasing the dependence on manually tuned learning rate schedules. When learning from multi-modal distributions, the effectiveness of batch normalization (BN), arguably the most prominent nor…

2018-10-12abs ↗pdf ↗

A well-known issue of Batch Normalization is its significantly reduced effectiveness in the case of small mini-batch sizes. When a mini-batch contains few examples, the statistics upon which the normalization is defined cannot be reliably estimated from it during a training iteration. To address this problem, we presen…

2020-02-13abs ↗pdf ↗

We present a short complete proof of the existence of the normal cycle of a compact subanalytic set. The approach is inspired by some old ides of Joseph Fu, uses Morse theoretic techniques and oo-minimal topology.

2010-03-08abs ↗pdf ↗

Develops an oblique projection technique to approximate a foliation for non-normal dynamics.

problem Modeling dynamics far from a primary Spectral Submanifold (SSM) in non-normal systems.
method Oblique projection technique based on experimental data.
result Approximates a stable invariant foliation for non-normal dynamics efficiently.

In this paper, we study normal homogeneous Finsler spaces. We first define the notion of a normal homogeneous Finsler space, using the method of isometric submersion of Finsler metrics. Then we study the geometric properties. In particular, we establish a technique to reduce the classification of normal homogeneous Fin…

2014-11-12abs ↗pdf ↗

New method builds complex networks from attribute interactions without normalization.

problem Improving high-level classification algorithms by capturing hidden attribute interactions.
method Proposes a new complex network building methodology based on attribute-attribute interactions, avoiding normalization.
result Demonstrates improved performance in high-level classification techniques.

PL-MCMC samples from normalizing flows' conditional distributions.

problem Sampling from complex conditional distributions learned by normalizing flows.
method Metropolis-Hastings implementation of PL-MCMC.
result PL-MCMC asymptotically samples from exact conditional distributions.

Spectral normalization stabilizes GANs by controlling gradient explosion and vanishing.

problem Stability and sample quality issues in GAN training.
method Spectral normalization controls gradient explosion and vanishing, improving GAN training stability and sample quality.
result Bidirectional Scaled Spectral Normalization (BSSN) outperforms standard spectral normalization in sample quality and training stability.

New proof of Alesker's Irreducibility Theorem using localization techniques.

problem Representing polynomial valuations on convex bodies.
method Introducing a localization technique for polynomial valuations and reducing to a representation problem for differential forms.
result Smooth and translation invariant valuations are representable by integration with the normal cycle.

Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces. The problem of fast normalizer computation has therefore attracted significant attention in the theoretical and applied machine learning literature. In this paper, we analyze a recently pro…

2015-06-12abs ↗pdf ↗

Spectral clustering is a technique that clusters elements using the top few eigenvectors of their (possibly normalized) similarity matrix. The quality of spectral clustering is closely tied to the convergence properties of these principal eigenvectors. This rate of convergence has been shown to be identical for both th…

2013-10-05abs ↗pdf ↗

In this paper we introduce a novel method of gradient normalization and decay with respect to depth. Our method leverages the simple concept of normalizing all gradients in a deep neural network, and then decaying said gradients with respect to their depth in the network. Our proposed normalization and decay techniques…

2017-12-10abs ↗pdf ↗

In this work we investigate the reasons why Batch Normalization (BN) improves the generalization performance of deep networks. We argue that one major reason, distinguishing it from data-independent normalization methods, is randomness of batch statistics. This randomness appears in the parameters rather than in activa…

2018-11-01abs ↗pdf ↗

Improved binning technique boosts nUV measure performance.

problem Improving the performance of the nUV measure in real applications.
method Introduced the nUV measure, provided theoretical optimal binning techniques, and proposed algorithms for approximate solutions.
result Approximate binning techniques show 4-13% increase in AUC scores with statistical significance.

A new technique normalizes nodes within groups to improve GNN performance.

problem Over-smoothing in deeper GNNs reduces node distinguishability.
method Differentiable group normalization (DGN) to separate node distributions among groups.
result DGN makes GNN models more robust to over-smoothing and achieves better performance with deeper GNNs.

In recent years, data have become increasingly higher dimensional and, therefore, an increased need has arisen for dimension reduction techniques for clustering. Although such techniques are firmly established in the literature for multivariate data, there is a relative paucity in the area of matrix variate, or three-w…

2018-09-07abs ↗pdf ↗

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 ↗

EvoMSN tackles time series forecasting under distribution shifts by evolving multi-scale normalization.

problem Accurate long-term time series forecasting under complex distribution shifts.
method EvoMSN framework with multi-scale statistics prediction and adaptive ensembling for collaborative updating.
result Improves forecasting performance of five mainstream methods on benchmark datasets.

Layer normalization improves federated learning with skewed labels.

problem Label skewness in federated learning datasets.
method Identified feature normalization as key mechanism; applied to latent features before classifier.
result Normalization accelerates global training and improves convergence under extreme label shift.