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.

169,051 papers · 148 categories

Trend · papers per month

128257385513 · Jun 202019922001200920182026
48 results for Conditional Layers

This paper extends stability and generalization analysis of GD for multi-layer NNs.

problem Understanding the generalization of multi-layer neural networks trained by GD.
method Comprehensive stability and generalization analysis of GD for multi-layer NNs, focusing on two-layer and three-layer networks.
result Derives excess risk rates of O(1/n)O(1/\sqrt{n}) for GD in two-layer and three-layer NNs under specific conditions.

A neural network derived from first principles using MaxEnt.

problem Developing a neural network from first principles.
method Derived a neural network using the principle of Maximum Entropy, with linear dimension-reducing transformations and conditional mean estimators.
result Unified theoretical justification for activation functions like sigmoid, softplus, and relu.

We introduce a general-purpose conditioning method for neural networks called FiLM: Feature-wise Linear Modulation. FiLM layers influence neural network computation via a simple, feature-wise affine transformation based on conditioning information. We show that FiLM layers are highly effective for visual reasoning - an…

2017-09-22abs ↗pdf ↗

Smectic liquid crystals are materials formed by stacking deformable, fluid layers. Though smectics prefer to have flat, uniformly-spaced layers, boundary conditions can impose curvature on the layers. Since the layer spacing and curvature are intertwined, the problem of finding minimal configurations for the layers bec…

2006-01-20abs ↗pdf ↗

Alternative to convolutions using decision trees for neural networks.

problem Replacing complex convolutions with simpler decision-based layers.
method Binary decisions as indices to conditional distributions, trained using backpropagation.
result Performance similar to conventional neural networks, with runtime improvements.

Gradient descent converges to minimum Bayes risk for two-layer ReLU networks in mean field regime.

problem Training two-layer ReLU networks using gradient descent in the mean field regime.
method Describes a condition for convergence to minimum Bayes risk, extending previous results to ReLU-activated networks.
result The condition for convergence does not depend on initialization and concerns weak convergence of network realization.

Quantitatively assessing relationships between latent variables and observed variables is important for understanding and developing generative models and representation learning. In this paper, we propose latent-observed dissimilarity (LOD) to evaluate the dissimilarity between the probabilistic characteristics of lat…

2016-03-30abs ↗pdf ↗

Study Transformer layers under cross-entropy training using mean field control.

problem Understanding the behavior of Transformer layers in cross-entropy training.
method Continuous-depth mean field control analysis, treating depth as time and layer parameters as controls.
result Derivation of a Pontryagin condition for the limiting population problem, involving the softmax residual.

Symmetric functions learn better with strategic initial conditions.

problem Understanding how to improve learning efficiency for symmetric functions in neural networks.
method Investigates the impact of initial conditions on SGD training for symmetric functions in neural networks with one hidden layer.
result Strategic initial conditions can lead to efficient generalization guarantees for learning symmetric functions.

Improved Q&A model with LSTM and bi-directional attention.

problem Enhancing neural network models for effective question answering.
method Implemented a Bi-directional attention flow layer connected to a Multi-layer LSTM encoder, with a new end-index decoder layer conditioning on start-index output.
result Increased model performance by 15.16% on test set.

Two-layer CNNs can overfit well if initialized correctly.

problem Understanding the conditions for benign overfitting in over-parameterized CNNs.
method Extending analysis to fully trainable two-layer CNNs, examining initialization scaling effects.
result Initialization scaling of the output layer is crucial; large scales lead to fixed output behavior, small scales to complex interactions.

Paper presents ML-VAMP for efficient multi-layer inference with exact performance analysis.

problem Inference in multi-layer deep neural networks with non-convex optimization.
method ML-VAMP algorithm for MAP and MMSE estimates, with performance predictions in high dimensions.
result ML-VAMP achieves Bayes-optimal MSE under certain conditions, providing exact performance characterization.

Study on functions computed by deep-layered machines finds same distribution in neural networks and Boolean circuits.

problem Understanding the space of functions computed by deep-layered machines.
method Investigation of Boolean functions on random-layered machines, including neural networks and Boolean circuits.
result The space of functions computed at large depth limit is characterized and the macroscopic entropy of Boolean functions is either monotonically increasing or decreasing with depth.

New method recovers signals from compressed measurements using generative networks with contractive layers.

problem Signal recovery from compressed measurements with generative network priors.
method Developed a new matrix concentration inequality (R2WDC) to relax expansivity conditions for generative networks.
result Signals in the range of a Gaussian generative network can be recovered from few linear measurements with contractive layers.

Under several geometric conditions imposed below, the existence of the discrete spectrum below the essential spectrum is shown for the Dirichlet Laplacian on the quantum layer built over a spherically symmetric hypersurface with a pole embedded in the Euclidean space R4. At the end of this paper, we also show the advan…

2012-03-25abs ↗pdf ↗

Gradient descent with logistic loss can make two-layer networks interpolate binary classification data.

problem Training two-layer networks for binary classification.
method Gradient descent with logistic loss applied to two-layer networks.
result Gradient descent can drive training loss to zero under certain conditions.

Batch normalization in the last layer reduces sharpness in wide neural networks.

problem Pathological sharpness in wide neural networks.
method Quantifying the geometry of the parameter space using Fisher information matrix and analyzing deep neural networks with random initialization.
result Batch normalization in the last layer significantly decreases pathological sharpness under specific conditions.

Gradient descent proves global convergence for 4-layer matrix factorization.

problem Global convergence of gradient descent on four-layer matrix factorization under random initialization.
method New techniques to show saddle-avoidance properties and extend eigenvalue theories.
result Polynomial-time global convergence guarantee for randomly initialized gradient descent on four-layer matrix factorization.

Introduces Causal Energy Minimization to understand Transformer layers.

problem Empirical parameterization of Transformer blocks remains largely unexplored.
method Causal Energy Minimization framework that recasts Transformer layers as optimization steps on conditional energy functions.
result Identifies design space for Transformer layers including weight sharing and energy-based interpretations.

Integrates differentiable decision trees into neural networks for faster training and inference.

problem Combining differentiability and conditional computation in tree ensembles for neural networks.
method Sparse activation function and specialized forward/backward propagation algorithms for efficient training and inference.
result 10x speed-ups and 20x reduction in parameters compared to existing methods, while maintaining performance.

In this work we compute lower Lipschitz bounds of p\ell_p pooling operators for p=1,2,p=1, 2, \infty as well as p\ell_p pooling operators preceded by half-rectification layers. These give sufficient conditions for the design of invertible neural network layers. Numerical experiments on MNIST and image patches confirm tha…

2013-11-16abs ↗pdf ↗

Hybrid deep architectures with reasoning layers show promising convergence and generalization properties.

problem Understanding the theoretical foundations of hybrid deep architectures with reasoning layers.
method Analyzing the interplay between algorithm layers and neural components in deep architectures.
result Properties of algorithm layers are closely related to the approximation and generalization abilities of end-to-end models.

We analyze the loss landscape and expressiveness of practical deep convolutional neural networks (CNNs) with shared weights and max pooling layers. We show that such CNNs produce linearly independent features at a "wide" layer which has more neurons than the number of training samples. This condition holds e.g. for the…

2017-10-30abs ↗pdf ↗

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.

Proves invertibility of layer potentials for generalized Stokes operators on smooth domains.

problem Invertibility of layer potentials for generalized Stokes operators on smooth domains.
method Developed algebra toolkit to handle layer operators' limit and jump relations; proved Fredholm property and invertibility.
result Proves invertibility of layer potentials for generalized Stokes operators on smooth domains.

The muti-layer information bottleneck (IB) problem, where information is propagated (or successively refined) from layer to layer, is considered. Based on information forwarded by the preceding layer, each stage of the network is required to preserve a certain level of relevance with regards to a specific hidden variab…

2017-11-14abs ↗pdf ↗

We give the first provably efficient algorithm for learning a one hidden layer convolutional network with respect to a general class of (potentially overlapping) patches. Additionally, our algorithm requires only mild conditions on the underlying distribution. We prove that our framework captures commonly used schemes …

2018-02-07abs ↗pdf ↗

New model for multi-layer categorical data improves latent class analysis.

problem Traditional latent class analysis for single-layer categorical data is insufficient for multi-layer data.
method Developed a multi-layer latent class model (multi-layer LCM) and three spectral methods for estimation.
result The debiased sum of Gram matrices method performs best in estimating latent classes.

New model predicts radiative properties of nanoparticle layers with high accuracy and uncertainty.

problem Predicting radiative properties of nanoparticle embedded layers accurately and with uncertainty.
method Conditional normalizing flows learn conditional distributions of optical outputs given input parameters.
result The model achieves high predictive accuracy and reliable uncertainty estimates.

Two-layer ReLU networks can overfit without harm, study finds.

problem Understanding when and how two-layer ReLU networks can overfit without harming generalization.
method Established algorithm-dependent risk bounds for two-layer ReLU convolutional neural networks with label-flipping noise.
result Gradient descent-trained ReLU networks can achieve near-zero training loss and Bayes optimal test risk.

Optimal scaling found to depend on operator norm across large models and datasets.

problem Lack of unifying principle for optimal hyperparameter scaling across models and datasets.
method Discovered that optimal scaling is conditioned on the operator norm of the output layer.
result The optimal learning rate/batch size pair (η,B)(η^{\ast}, B^{\ast}) consistently has the same operator norm value.

Paper uses SSC for identifying layers with identical community structures in DIMPLE networks.

problem Identifying layers with identical community structures in DIMPLE networks.
method Sparse Subspace Clustering (SSC) for identifying groups of layers with identical community structures.
result SSC leads to strongly consistent between-layer clustering under mild conditions.

New conditions ensure deep neural networks can approximate any function on non-Euclidean spaces.

problem Understanding how to modify neural network architectures to approximate functions on non-Euclidean spaces.
method Developed conditions for feature and readout maps that preserve universal approximation capabilities.
result Modified architectures can deterministically approximate any classifier on non-Euclidean spaces.

Layer-wise preconditioning methods improve neural network optimization and feature learning.

problem Suboptimal feature learning in standard optimization algorithms.
method Layer-wise preconditioning methods that introduce preconditioners per axis of each layer's weight tensors.
result Layer-wise preconditioning is necessary for provable feature learning in linear and single-index models.

DeepDrum generates drum rhythms under musical constraints.

problem Generating rhythms that adhere to musical style and constraints.
method Adaptive Neural Network with Conditional Layers containing musical parameters and instrumentation.
result DeepDrum effectively generates rhythms that resemble learned styles while conforming to given constraints.

Traditionally, when generative models of data are developed via deep architectures, greedy layer-wise pre-training is employed. In a well-trained model, the lower layer of the architecture models the data distribution conditional upon the hidden variables, while the higher layers model the hidden distribution prior. Bu…

2014-05-06abs ↗pdf ↗

Wide neural networks with weight decay exhibit neural collapse.

problem Proving neural collapse in wide neural networks trained with weight decay.
method Generic guarantees on neural collapse for wide networks with weight decay, proving low training error and balancedness, and bounded conditioning.
result First proof of neural collapse in end-to-end training of wide neural networks with weight decay.

Paper presents an ADMM-based approach to efficiently integrate quadratic programming layers into neural networks.

problem Integrating quadratic programs into neural networks for optimization.
method An ADMM-based network layer architecture for solving quadratic programs efficiently.
result The ADMM layer is approximately an order of magnitude faster than existing methods for medium scaled problems.