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

226453679905 · Jun 202019922001200920172026
48 results for normalized weight functions

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.

This paper analyzes how normalization layers improve neural network training.

problem Improving generalization performance and training speed of neural networks.
method Global convergence analysis of two-layer neural networks with ReLU activations and Weight Normalization.
result Introduction of normalization layers changes the optimization landscape, enabling faster convergence.

We prove that square integrable holomorphic functions (with respect to a plurisubharmonic weight) can be extended in a square integrable manner from certain singular hypersurfaces (which include uniformly flat, normal crossing divisors) to entire functions in affine space. This provides evidence for a conjecture regard…

2014-08-26abs ↗pdf ↗

Normalization methods such as batch [Ioffe and Szegedy, 2015], weight [Salimansand Kingma, 2016], instance [Ulyanov et al., 2016], and layer normalization [Baet al., 2016] have been widely used in modern machine learning. Here, we study the weight normalization (WN) method [Salimans and Kingma, 2016] and a variant call…

2019-11-18abs ↗pdf ↗

The paper develops approximations for Pearson's chi-square statistic and applies them to confidence intervals.

problem Finding confidence intervals for strictly convex functions of discrete distribution weights.
method Non-asymptotic local normal approximation for multinomial probabilities, deriving bounds and coupling inequalities.
result Developed methods to find confidence intervals for negative entropy of discrete distributions.

Method measures weight similarity in neural networks using normalization and statistical inference.

problem Quantifying weight similarity in non-convex neural networks.
method Chain normalization rule and hypothesis-training-testing statistical inference.
result Weights of identical neural networks converge to similar local solutions.

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 ↗

Mitigates anomaly score imbalance in long-tailed distributions.

problem Class imbalance in normal data leads to skewed anomaly detection performance.
method Proposes an importance-weighted loss function to balance anomaly scores.
result Improves anomaly detection performance by 0.043 on real-world datasets.

OPAA estimates probability densities using functional analysis.

problem Estimating probability density functions efficiently and accurately.
method OPAA uses a parallelizable algorithm based on functional analysis to estimate probability distributions.
result OPAA provides an efficient method to estimate probability density functions and normalizing weights.

Finet uses FBN for efficient, lightweight neural networks.

problem Building efficient neural networks with limited computational resources.
method Introduces Fine-grained Batch Normalization (FBN) and a novel light-weight network (Finet) that combines FBN with standard convolution.
result Finet achieves state-of-the-art performance on ImageNet classification with reduced computational complexity.

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by non-negative integer weights, 14 for each 3-simplex, that describe how many copies o…

2007-06-05abs ↗pdf ↗

Constructs weight 1/2 multiplier systems for a specific group and relates to geometric edge paths.

problem Constructing weight 1/2 multiplier systems for a specific group.
method Defines an eta function and Rademacher symbol, relates to geometric edge paths in a triangulation of the upper half plane.
result Relates weight 1/2 multiplier systems to geometric edge paths.

Gradient descent on normalized networks reveals sparsity preferences.

problem Understanding the inductive bias of gradient descent on normalized neural nets.
method Analysis of gradient descent on weight-normalized smooth homogeneous neural nets, focusing on SWN and EWN.
result EWN causes weights to be updated in a way that prefers asymptotic relative sparsity.

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 ↗

Nonuniform tubular neighborhoods of curves in Euclidean n-space are studied by using weighted distance functions and generalizing the normal exponential map. Different notions of injectivity radii are introduced to investigate singular but injective exponential maps. A generalization of the thickness formula is obtaine…

2007-05-16abs ↗pdf ↗

FTIP uses normalizing flows to improve posterior inference in function space.

problem Challenges in posterior inference with implicit-process priors.
method FTIP uses normalizing flows to define a richer variational distribution over combination weights.
result FTIP captures asymmetric and multimodal posterior structure better than Gaussian coefficient approximations.

We reduce boundary determination of an unknown function and its normal derivatives from the (possibly weighted and attenuated) broken ray data to the injectivity of certain geodesic ray transforms on the boundary. For determination of the values of the function itself we obtain the usual geodesic ray transform, but for…

2013-10-08abs ↗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 ↗

Paper explores weighted averaging schemes for SGD, achieving asymptotic normality and optimality.

problem Improving convergence of SGD in various settings.
method Develops a general weighted averaging scheme for SGD and establishes asymptotic normality.
result Establishes asymptotic normality and optimality of weighted averaged SGD solutions.

Enhances DNN robustness and accuracy with L2,L_{2,\infty} normalization.

problem Improving the robustness and accuracy of deep neural networks.
method Introducing L2,L_{2,\infty} normalization of weight matrices in DNNs with Relu activation.
result Lower bound for robustness measure in terms of L2,L_{2,\infty} norm and upper bound for Rademacher complexity.

In this study, we consider classification problems based on neural networks in data-imbalanced environment. Learning from an imbalanced data set is one of the most important and practical problems in the field of machine learning. A weighted loss function based on cost-sensitive approach is a well-known effective metho…

2019-11-25abs ↗pdf ↗

Batch Normalization is a commonly used trick to improve the training of deep neural networks. These neural networks use L2 regularization, also called weight decay, ostensibly to prevent overfitting. However, we show that L2 regularization has no regularizing effect when combined with normalization. Instead, regulariza…

2017-06-16abs ↗pdf ↗

This paper reveals periodic behavior in neural network training with BN and weight decay.

problem Understanding the dynamics of neural network training with BN and weight decay.
method Rigorous investigation of empirical and theoretical mechanisms.
result Periodic behavior in training is a generalization of previously opposing perspectives.

Study on volumes of random inscribed polytopes in projective geometries.

problem Estimating volumes of random inscribed polytopes in projective geometries.
method Central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
result Established central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.

A new clustering method for functional data using skewed distributions.

problem Clustering functional data with skewed distributions.
method Mixtures of functional linear regression models and three skewed multivariate distributions (variance-gamma, skew-t, normal-inverse Gaussian).
result The proposed method funWeightClustSkew performs well on simulated and real data.

The paper integrates behavioral distortions into portfolio optimization using implied probability weighting functions.

problem Behavioral distortions in probability weighting affect portfolio optimization under different return distributions.
method Developed a unified framework to extract probability weighting functions from optimal portfolios modeled under Gaussian and NIG distributions.
result Increasing tail fatness amplifies behavioral distortions, and shifts in risk-free rates alter the curvature of these distortions.

In this paper we describe a procedure for refining the given triangulation of a 3-manifold that scales the PL-metric according to a given weight function while creating no new normal surfaces. It is known that an incompressible surface FF in a triangulated 3-manifold MM is isotopic to a normal surface that is of mini…

2008-10-01abs ↗pdf ↗

In recent studies, several asymptotic upper bounds on generalization errors on deep neural networks (DNNs) are theoretically derived. These bounds are functions of several norms of weights of the DNNs, such as the Frobenius and spectral norms, and they are computed for weights grouped according to either input and outp…

2019-05-22abs ↗pdf ↗

Batch normalization improves deep networks by aligning their decision boundaries with data.

problem Improving the performance and generalization of deep networks.
method Theoretical analysis of batch normalization as a function approximation technique for continuous piecewise affine splines.
result Batch normalization adapts the geometry of a deep network's partition to match the data, improving learning and generalization.

This paper examines weight initialization for 1-Lipschitz networks to improve robustness against adversarial attacks.

problem Improving the robustness of deep neural networks against adversarial attacks.
method Examined weight parametrization of AOL and SLL networks, calculated weight variance bounds, and demonstrated weight decay.
result Weight initialization causes deep 1-Lipschitz networks to decay to zero, and weight variance does not affect output variance distribution.

Theoretical justification for deep networks' performance with regularization techniques.

problem Understanding the performance of deep networks trained with the square loss.
method Analysis of gradient flow and theoretical justification of regularization techniques.
result Convergence to solutions with smaller Frobenius norms leads to better classification error bounds.