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

58115173230 · Jun 202019922001200920172026
48 results for layer growth

This paper analyzes deep Stable neural networks, showing convergence rates under different growth settings.

problem Analyzing the behavior of deep Stable neural networks as width increases.
method Large-width asymptotic analysis and convergence rates for fully connected feed-forward deep Stable NNs.
result The rescaled deep Stable NN converges weakly to a Stable SP under joint growth, with sup-norm convergence rates established.

Method reconstructs aneurysm growth history from patient parameters using physics-informed autoencoder.

problem Predicting arterial aneurysm rupture due to inaccessible growth time series.
method Physics-informed autoencoder combined with neural network for mapping patient parameters to aneurysm growth time history.
result Incorporating physical model constraints improves time series reconstruction, especially in noisy data.

Despite the phenomenal success of deep learning in recent years, there remains a gap in understanding the fundamental mechanics of neural nets. More research is focussed on handcrafting complex and larger networks, and the design decisions are often ad-hoc and based on intuition. Some recent research has aimed to demys…

2019-04-24abs ↗pdf ↗

Study shows how large neural networks avoid overfitting through decoupling of feature learning and complexity growth.

problem Understanding inductive bias and generalization in large neural networks.
method Dynamical mean field theory applied to large two-layer networks.
result Training dynamics of large networks exhibit a separation of timescales, decoupling feature learning and overfitting.

Deep neural networks converge to Gaussian mixtures as layer width increases.

problem Understanding the distribution of outputs from deep neural networks.
method Proof and experiments with a simple model showing the convergence of neural network outputs to Gaussian mixtures.
result Neural networks converge to Gaussian mixtures as the width of the last hidden layer increases.

New theory explains signal propagation in normalization-free transformers.

problem Understanding signal propagation in normalization-free transformers.
method Deriving recurrence relations for activation statistics and APJNs across layers.
result Transformers with elementwise tanh-like nonlinearities exhibit subcritical signal propagation.

Proposes QEP to mitigate quantization error propagation in layer-wise post-training quantization.

problem Growth of quantization errors across layers degrades performance, especially in low-bit regimes.
method Quantization Error Propagation (QEP) framework that explicitly propagates and compensates for quantization errors.
result QEP-enhanced layer-wise PTQ achieves substantially higher accuracy, especially in low-bit regimes.

JFR-rg model explains Japan's stable debt despite high interest rates and low growth.

problem Understanding Japan's stable government debt despite high interest rates and low growth.
method Formalizes financial repression channels through JFR-rg model, incorporating financial repression bias and exchange-rate channel.
result Identifies Normalization Trap and Captive Financial System Parameter, showing debt dynamics under financial repression.

Random Transformers behave like polynomial models in ICL with asymptotic growth.

problem Understanding in-context learning capabilities of pretrained Transformers.
method Asymptotic analysis of a random Transformer with a fixed first layer and a trained second layer, considering growth in context length, input dimension, hidden dimension, and training parameters.
result The random Transformer's ICL error is equivalent to a finite-degree Hermite polynomial model.

Recent DNN pruning algorithms have succeeded in reducing the number of parameters in fully connected layers, often with little or no drop in classification accuracy. However, most of the existing pruning schemes either have to be applied during training or require a costly retraining procedure after pruning to regain c…

2018-03-12abs ↗pdf ↗

Study identifies stable configurations of intertwined threads with repulsive interactions.

problem Stable configurations of entangled systems with repulsive interactions.
method Analysis of steepest descent flow of an energy functional.
result Existence and uniqueness of stable configuration of two layers drifting apart at t1/3t^{1/3} rate.

We propose a neural architecture search (NAS) algorithm, Petridish, to iteratively add shortcut connections to existing network layers. The added shortcut connections effectively perform gradient boosting on the augmented layers. The proposed algorithm is motivated by the feature selection algorithm forward stage-wise …

2019-05-31abs ↗pdf ↗

SGD efficiently learns the XOR function with near-optimal sample complexity.

problem Learning the XOR function with a 2-layer neural network.
method Minibatch SGD on a 2-layer neural network with ReLU activations, focusing on signal-finding and signal-heavy phases.
result Achieves population error o(1)o(1) with dextpolylog(d)d \: ext{polylog}(d) samples.

Study growth patterns in random networks using i.i.d. perturbations.

problem Understanding the growth of affine regions in random piecewise-linear networks.
method Analyzes a random compositional model with i.i.d. perturbations of the tent map, proving submultiplicative pressure and using finite-state defect process for upper-tail lower bounds.
result Proves the existence of a submultiplicative pressure for \(N_n\) and gives exponential upper bounds for \(n^{-1}\log N_n\).

Depth is a key component of Deep Neural Networks (DNNs), however, designing depth is heuristic and requires many human efforts. We propose AutoGrow to automate depth discovery in DNNs: starting from a shallow seed architecture, AutoGrow grows new layers if the growth improves the accuracy; otherwise, stops growing and …

2019-06-07abs ↗pdf ↗

This paper explains how low-precision arithmetic causes loss spikes in deep learning models.

problem Loss spikes during long-term training of deep neural networks.
method Analyzes the impact of floating-point precision limits on gradient updates and feature means.
result Numerical Feature Inflation (NFI) explains loss spikes and rapid parameter norm growth.

Long short-term memory (LSTM) has been widely used for sequential data modeling. Researchers have increased LSTM depth by stacking LSTM cells to improve performance. This incurs model redundancy, increases run-time delay, and makes the LSTMs more prone to overfitting. To address these problems, we propose a hidden-laye…

2018-05-30abs ↗pdf ↗

Gradient descent trains both layers of a ReLU network to fit a linear model.

problem Training dynamics of a ReLU network to fit a linear target function.
method Jointly training both layers of a one-hidden-layer ReLU network in a realizable setting with Gaussian inputs and labels.
result Gradient descent from a small random initialization converges to a global minimizer at a linear rate with optimal sample complexity.

NeuroFabric proposes a method to optimize sparse network training topologies.

problem Long training times in deep neural networks due to high memory and compute requirements.
method Developed a new sparse neural network initialization scheme and evaluated various topologies.
result Identified a single optimal topology that maximizes accuracy across different datasets.

The universal approximation property of various machine learning models is currently only understood on a case-by-case basis, limiting the rapid development of new theoretically justified neural network architectures and blurring our understanding of our current models' potential. This paper works towards overcoming th…

2019-10-08abs ↗pdf ↗

Abstract Coxeter groups have growth rates that are Perron numbers.

problem Understanding growth rates of Coxeter groups.
method Defined a class of Coxeter groups, \infty--spanned, and analyzed their growth rates.
result For \infty--spanned Coxeter groups, geodesic growth rate strictly dominates word growth rate and appears to be a Perron number.

Study of deep Stable neural networks with various activation functions.

problem Characterizing the infinitely wide limits of deep Stable neural networks.
method Investigation of large-width properties of deep Stable NNs with a generalized central limit theorem for heavy tails.
result Extension of characterization to a broader class of activation functions, including sub-linear, asymptotically linear, and super-linear functions.

Historical economic growth in Asia (excluding Japan) is analysed. It is shown that Unified Growth Theory is contradicted by the data, which were used (but not analysed) during the formulation of this theory. Unified Growth Theory does not explain the mechanism of economic growth. It explains the mechanism of Malthusian…

2015-12-16abs ↗pdf ↗

Study confined subgroups in groups with contracting elements, showing their growth rate is strictly greater than half of the ambient growth rate.

problem Understanding the growth rate of confined subgroups in groups with contracting elements.
method Through boundary actions, analyzing the Hopf decomposition and quotient growth.
result Confined subgroups have a growth rate strictly greater than half of the ambient growth rate.

Growth rate of the world Growth Domestic Product (GDP) is analysed to determine possible pathways of the future economic growth. The analysis is based on using the latest data of the World Bank and it reveals that the growth rate between 1960 and 2014 was following a trajectory approaching asymptotically a constant val…

2015-10-26abs ↗pdf ↗

Data describing historical economic growth are analysed. Included in the analysis is the world and regional economic growth. The analysis demonstrates that historical economic growth had a natural tendency to follow hyperbolic distributions. Parameters describing hyperbolic distributions have been determined. A search …

2015-09-09abs ↗pdf ↗

New multigrid approach reduces CNN parameters by focusing on structured convolutions.

problem Redundancy in standard CNNs leads to high parameter count.
method Replace standard convolutions with structured multilevel convolutions.
result Linearly proportional number of parameters to network width, no loss in accuracy.

The study provides volume growth estimates for specific types of manifolds.

problem Estimating volume growth for Ricci solitons and quasi-Einstein manifolds.
method Similar to classical results, the study proves volume growth estimates for gradient Ricci solitons and quasi-Einstein manifolds.
result Sharp volume growth estimates for gradient shrinking Ricci solitons and upper bound volume growth estimates for quasi-Einstein manifolds.

Residual networks' depth is mathematically equivalent to expanding an implicit ensemble size.

problem Understanding why deep residual networks are effective.
method Formal analysis of residual networks as ensembles of shallow models.
result Increasing network depth is equivalent to expanding the size of an implicit ensemble, revealing a hierarchical structure.

Study growth rates of subgroups in groups with a constricting element.

problem Understanding growth rates of subgroups in groups with a constricting element.
method Examining the spectrum of relative and quotient exponential growth rates of quasi-convex subgroups.
result Determine when growth rates of subgroups are strictly smaller or coincide with the group's growth rate.