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

305989118 · Jun 202019922001200920172026
48 results for mimetic initialization

In this paper higher order mimetic discretizations are introduced which are firmly rooted in the geometry in which the variables are defined. The paper shows how basic constructs in differential geometry have a discrete counterpart in algebraic topology. Generic maps which switch between the continuous differential for…

2011-11-18abs ↗pdf ↗

We give a stochastic microscopic modelling of stock markets driven by continuous double auction. If we take into account the mimetic behavior of traders, when they place limit order, our virtual markets shows the power-law tail of the distribution of returns with the exponent outside the Levy stable region, the short m…

2006-07-23abs ↗pdf ↗

We propose a tensor neural network (tt-NN) framework that offers an exciting new paradigm for designing neural networks with multidimensional (tensor) data. Our network architecture is based on the tt-product (Kilmer and Martin, 2011), an algebraic formulation to multiply tensors via circulant convolution. In this $t…

2018-11-15abs ↗pdf ↗

We design non-singular cloaks enabling objects to scatter waves like objects with smaller size and very different shapes. We consider the Schrodinger equation which is valid e.g. in the contexts of geometrical and quantum optics. More precisely, we introduce a generalized non-singular transformation for star domains, a…

2010-06-03abs ↗pdf ↗

New method for better initial centers in clustering with improved accuracy and privacy.

problem Improving the quality of clustering centers in metric spaces.
method HST initialization based on metric embedding tree structure, combined with efficient search algorithm and DP extension.
result HST initialization produces better initial centers than kk-median++ with comparable efficiency and improved privacy.

In this paper, we firstly give a brief introduction of expectation maximization (EM) algorithm, and then discuss the initial value sensitivity of expectation maximization algorithm. Subsequently, we give a short proof of EM's convergence. Then, we implement experiments with the expectation maximization algorithm (We im…

2013-05-03abs ↗pdf ↗

The paper establishes principles for initializing and designing GNNs with ReLU activations to avoid oversmoothing and correlation collapse.

problem Oversmoothing and correlation collapse in deep ReLU GNNs.
method The paper derives and validates three principles for initialization and architecture selection in finite width graph neural networks with ReLU activations.
result Correct initialization, residual aggregation operators, and residual connections significantly improve early training dynamics in deep ReLU GNNs.

New distributed clustering algorithms show resilience to initialization issues.

problem Resilience of distributed gradient-based clustering algorithms to center initialization.
method Distributed gradient-based clustering algorithms with novel center initialization.
result The algorithms are more resilient to initialization compared to baseline methods.

Initializing the weights and the biases is a key part of the training process of a neural network. Unlike the subsequent optimization phase, however, the initialization phase has gained only limited attention in the literature. In this paper we discuss some consequences of commonly used initialization strategies for va…

2019-03-27abs ↗pdf ↗

Standard practice in training neural networks involves initializing the weights in an independent fashion. The results of recent work suggest that feature "diversity" at initialization plays an important role in training the network. However, other initialization schemes with reduced feature diversity have also been sh…

2019-12-11abs ↗pdf ↗

The dying ReLU refers to the problem when ReLU neurons become inactive and only output 0 for any input. There are many empirical and heuristic explanations of why ReLU neurons die. However, little is known about its theoretical analysis. In this paper, we rigorously prove that a deep ReLU network will eventually die in…

2019-03-15abs ↗pdf ↗

Paper proves rigidity of initial data sets with boundary and capillary MOTS.

problem Rigidity of initial data sets with boundary and capillary MOTS.
method Estimates area of MOTS, proves rigidity for 3D, extends to high dimensions using Yamabe constant.
result Rigidity results for initial data sets with boundary and capillary MOTS.

Study evaluates initialization strategies for infinite hidden Markov models.

problem Limited attention to initialization in infinite hidden Markov models.
method Systematically evaluated distance-based clustering, model-based, and uniform initializations.
result Distance-based clustering initializations consistently outperform other methods.

This paper presents a phase diagram for two-layer neural networks under different initialization scales.

problem Understanding the behavior of neural networks under varying scales of initialization.
method Analysis of a phase diagram for two-layer neural networks.
result Condensation of weight vectors on isolated orientations during training.

A new neural network initialization method is proposed for faster and more accurate training.

problem Efficient initialization for training multi-layer feedforward neural networks.
method Initialization based on Stein's identity, using eigenvectors of cross-moment matrix.
result The SteinGLM method is faster and more accurate than other initialization methods.

Two new scalable K-means initialization methods proposed for large-scale clustering.

problem Efficient initialization for large-scale clustering problems.
method Divide-and-conquer approach and random projection method for multiple lower-dimensional subspaces.
result The proposed methods outperform state-of-the-art in large-scale clustering tasks.

Article strengthens initial data rigidity theorem to show unique spacetime extension.

problem Initial data rigidity in spacetime geometry.
method Showed initial data sets carry a lightlike parallel vector field, leading to unique spacetime extension.
result Local uniqueness of spacetimes extending initial data sets under dominant energy condition.

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.

New method shows random, diverse initializations are not essential for deep neural networks.

problem The necessity of random, diverse initializations in deep neural networks.
method Constructed a deep convolutional network with identical features by initializing weights to 0, enabling signal propagation and stable gradients.
result Random, diverse initializations are not necessary for training neural networks.

Deep neural networks achieve state-of-the-art performance for a range of classification and inference tasks. However, the use of stochastic gradient descent combined with the nonconvexity of the underlying optimization problems renders parameter learning susceptible to initialization. To address this issue, a variety o…

2020-01-28abs ↗pdf ↗

Our study analyzes how neural network initialization affects privacy and utility in overparameterized models.

problem Privacy and utility trade-off in overparameterized neural networks.
method Analytical proof of KL divergence privacy bound, focusing on initialization, width, and depth.
result Privacy bound improvement with increasing depth under certain initializations, degradation under others.

Optimizes deep neural network initialization variance for better performance.

problem Improving deep neural network performance through optimal initialization variance.
method Using SGD dynamics and Fokker-Planck equations, we study the relationship between initialization and expected loss function.
result An optimal condition for initialization variance that leads to lower training loss and higher test accuracy.