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

Trend · papers per month

71143214285 · Jun 202019922001200920172026
48 results for topological layers

This paper introduces a new method for neural networks that doesn't need a global coordinate system.

problem The lack of a global coordinate system in neural networks limits their performance and explainability.
method Proposes a learnable topological layer that works in a general metric space (Hilbert space) without requiring a Euclidean space.
result The proposed method eliminates the need for a costly parametrization stage and achieves optimal network performance.

We propose PLLay, a novel topological layer for general deep learning models based on persistence landscapes, in which we can efficiently exploit the underlying topological features of the input data structure. In this work, we show differentiability with respect to layer inputs, for a general persistent homology with …

2020-02-07abs ↗pdf ↗

Topology applied to real world data using persistent homology has started to find applications within machine learning, including deep learning. We present a differentiable topology layer that computes persistent homology based on level set filtrations and edge-based filtrations. We present three novel applications: th…

2019-05-29abs ↗pdf ↗

Given a complete non-compact surface embedded in R^3, we consider the Dirichlet Laplacian in a layer of constant width about the surface. Using an intrinsic approach to the layer geometry, we generalise the spectral results of an original paper by Duclos et al. to the situation when the surface does not possess poles. …

2003-02-11abs ↗pdf ↗

Single wide layer followed by a pyramidal structure ensures global convergence in deep networks.

problem Ensuring global convergence in deep neural networks with limited width constraints.
method Proves that a single wide layer followed by a pyramidal structure guarantees global convergence for over-parameterized networks.
result Single wide layer of width NN suffices for global convergence in deep networks with constant-width remaining layers.

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.

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 ↗

Efficiently learns linear non-Gaussian DAGs with noisy nodes.

problem Learning DAGs with non-Gaussian noise and diverging number of nodes.
method Proposes a novel method using topological layers for bottom-up reconstruction and consistent parent-child relations.
result Topological layers can be exactly reconstructed and parent-child relations established without faithfulness assumption.

In established network architectures, shortcut connections are often used to take the outputs of earlier layers as additional inputs to later layers. Despite the extraordinary effectiveness of shortcuts, there remain open questions on the mechanism and characteristics. For example, why are shortcuts powerful? Why do sh…

2018-11-22abs ↗pdf ↗

Lie groupoid equivariant neural networks are a new type of neural network.

problem Designing neural networks that respect the structure of Lie groupoids.
method Introducing Lie groupoid equivariant convolutions and layers, and showing their equivalence to Lie algebroid-equivariant networks.
result Lie groupoid equivariant neural networks are equivalent to certain Lie algebroid-equivariant networks.

The interbank market has a natural multiplex network representation. We employ a unique database of supervisory reports of Italian banks to the Banca d'Italia that includes all bilateral exposures broken down by maturity and by the secured and unsecured nature of the contract. We find that layers have different topolog…

2013-11-19abs ↗pdf ↗

Combines gradient-based and competitive learning for unsupervised feature extraction.

problem Handling input data without supervision and replicating input manifold topology.
method Integrates gradient-based and competitive learning approaches to learn topological structures.
result The dual competitive layer outperforms the vanilla layer in high-dimensional datasets.

Proposes deep graph persistence to address neural persistence issues in deep learning.

problem Variance of weights and lack of spatial structure in deep neural networks impact neural persistence.
method Extends neural persistence to the whole network, considering interactions between layers.
result Deep graph persistence alleviates variance-related issues and captures persistent paths through the network.

An asset network systemic risk (ANWSER) model is presented to investigate the impact of how shadow banks are intermingled in a financial system on the severity of financial contagion. Particularly, the focus of this study is the impact of the following three representative topologies of an interbank loan network betwee…

2014-09-30abs ↗pdf ↗

Improved bounds on neural network regions using activation histograms.

problem Bounding the number of affine regions in ReLU networks.
method Analysis of algebraic topology problem, extension of framework to subnetwork composition.
result Slightly tighter bounds and insights into parameter initialization.

Efficient memory layer improves graph neural networks for graph classification and regression.

problem Efficiently learning node representations and graph coarsening for arbitrary graph topology.
method Introduces a memory layer for GNNs that learns node representations and graph coarsening, and two new networks: MemGNN and GMN.
result Proposed models achieve state-of-the-art results in graph classification and regression benchmarks.

This paper presents a new artificial neuron model capable of learning its receptive field in the topological domain of inputs. The model provides adaptive and differentiable local connectivity (plasticity) applicable to any domain. It requires no other tool than the backpropagation algorithm to learn its parameters whi…

2018-08-31abs ↗pdf ↗

The paper examines how neural network topology affects adversarial robustness.

problem Understanding how neural network topology influences adversarial robustness.
method Investigated the graph of input traversing all layers of a neural network, comparing clean and adversarial inputs.
result Under-optimized edges in neural network graphs are a source of adversarial vulnerability and can be used to detect adversarial inputs.

Poor approximators found in neural networks and random feature models.

problem Understanding why certain neural networks and models perform poorly in approximating functions.
method Established a scale separation of Kolmogorov width type and applied it to neural networks and random feature models.
result Reproducing kernel Hilbert spaces and two-layer neural networks are poor L2L^2-approximators for certain functions.

We introduce a new function-preserving transformation for efficient neural architecture search. This network transformation allows reusing previously trained networks and existing successful architectures that improves sample efficiency. We aim to address the limitation of current network transformation operations that…

2018-06-07abs ↗pdf ↗

This work bridges competitive learning with gradient-based learning for faster feature extraction.

problem Lack of powerful feature extractors in competitive learning methods.
method Introduces gradient-based competitive layers for feature extraction.
result Demonstrates theoretical equivalence and faster convergence of gradient-based competitive layers.

Paper estimates neural network size needed for topology learning.

problem Estimating the smallest neural network size for topology learning.
method Using algebraic topology and Lie theory, the paper introduces a procedure based on persistent homology to determine the required dimension.
result The derived dimension is the smallest capable of capturing the topology of the data manifold.

Fog learning distributes ML model training across heterogeneous devices and networks.

problem Challenges with conventional federated learning in heterogeneous networks.
method Intelligent distribution of ML model training across nodes from edge devices to cloud servers.
result Enhanced federated learning with multi-layer hybrid framework considering network, heterogeneity, and proximity.

This paper improves deep forest models with soft routing and topology learning.

problem Expensive computational costs and lack of interpretability in deep neural networks.
method Soft routing in probabilistic trees and topology learning for joint optimization.
result Empowered deep forests achieve better performance with reduced model complexity.

Global convergence proved for three-layer neural networks in mean field regime.

problem Optimization efficiency of multilayer neural networks in the mean field regime.
method Developed a rigorous framework for mean field limit of three-layer networks using stochastic gradient descent and neuronal embedding.
result Global convergence guarantee for unregularized feedforward three-layer networks in the mean field regime.

The paper proves skip connections help neural networks avoid shallow local minima.

problem Understanding how skip connections affect the loss landscape of deep neural networks.
method Theoretical analysis of the topology of loss landscapes of deep ReLU neural networks with skip connections.
result Skip connections help control the connectedness of sub-level sets, avoiding shallow local minima.

The worldwide trade network has been widely studied through different data sets and network representations with a view to better understanding interactions among countries and products. Here we investigate international trade through the lenses of the single-layer, multiplex, and multi-layer networks. We discuss diffe…

2018-09-19abs ↗pdf ↗

We propose Sparse Neural Network architectures that are based on random or structured bipartite graph topologies. Sparse architectures provide compression of the models learned and speed-ups of computations, they can also surpass their unstructured or fully connected counterparts. As we show, even more compact topologi…

2017-06-18abs ↗pdf ↗

Z-GCNETs uses topological data to improve time series forecasting.

problem Improving time series forecasting accuracy.
method Integrates topological data into graph convolutional networks (GCNs) using zigzag persistence.
result Z-GCNETs outperforms 13 state-of-the-art methods in traffic forecasting and Ethereum price prediction.