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

6111722 · Feb 202019922001200920172026
48 results for Graph-Augmented Multi-Layer Perceptrons

This study compares GNNs and GA-MLPs, finding GA-MLPs can distinguish graphs but not count walks.

problem Comparing expressive power and graph isomorphism testing capabilities of GNNs and GA-MLPs.
method GA-MLPs augment node features with multi-hop operators and apply MLPs node-wise; GNNs are compared as a baseline.
result GA-MLPs can distinguish almost all non-isomorphic graphs but cannot count attributed walks, unlike GNNs.

New method initializes sigmoidal MLPs for interpretable shapes.

problem Creating interpretable decision boundaries in neural networks.
method Introducing a geometry-aware initialization for sigmoidal multi-layer perceptrons (MLPs) using tropical geometry.
result Sigmoidal MLPs can have decision boundaries aligned with prescribed shapes at initialization.

We consider the problem of reconstructing a signal from multi-layered (possibly) non-linear measurements. Using non-rigorous but standard methods from statistical physics we present the Multi-Layer Approximate Message Passing (ML-AMP) algorithm for computing marginal probabilities of the corresponding estimation proble…

2017-01-24abs ↗pdf ↗

Deep learning outperforms traditional methods in estimating OU process parameters.

problem Parameter estimation of the Ornstein-Uhlenbeck process is challenging.
method Used a multi-layer perceptron to estimate OU process parameters compared to traditional methods like Kalman filter and maximum likelihood estimation.
result Deep learning method outperforms traditional methods in parameter estimation of the OU process.

PiNGDA learns beneficial noise for graph augmentation stability.

problem Challenges in generating effective and stable graph augmentations.
method PiNGDA uses positive-incentive noise to scientifically analyze and generate beneficial graph augmentations.
result PiNGDA improves GCL performance by learning beneficial noise on graph topology and attributes.

Proposes a balanced multi-component and multi-layer neural network for efficient function approximation.

problem Accurately and efficiently approximating complex functions with high degrees of freedom and computational cost.
method Inspired by a multi-component approach, MMNN combines single-layer networks with a multi-layer decomposition strategy.
result Significant reduction in training parameters, more efficient training process, and improved accuracy compared to FCNNs or MLPs.

Efficiently predicts long-time dynamics of quantum spin models using MLP regression.

problem Challenges in calculating long-time expectation values for quantum spin models.
method Utilized a multi-layer perceptron (MLP) model for regression on matrix product states (MPS) expectation values.
result Significantly reduced computational cost for generating long-time dynamics while maintaining high accuracy.

Proposes a new model for high-dimensional data analysis with unknown link function.

problem Estimating link function, component functions, and variable interactions in high-dimensional data.
method Generalized Sparse Additive Model with Unknown Link Function (GSAMUL) using B-spline basis and MLP network for link estimation, with 2,1\ell_{2,1}-norm regularizer for variable selection.
result Can realize both variable selection and hidden interaction.

Model predicts anti-cancer drug responses using gene and molecular data.

problem Expensive and time-consuming cancer drug discovery and tailoring.
method Uses variational autoencoders and multi-layer perceptrons to encode gene expression and drug data.
result High average R2R^{2} of 0.83 and 0.845 in predicting drug responses for breast and pan-cancer cell lines, respectively.

The paper improves ESG taxonomy and classifies sentences as sustainable or unsustainable.

problem Improving ESG taxonomy and classifying sentences based on ESG factors.
method For ESG taxonomy, used Sentence-BERT models. For sentence classification, combined RoBERTa with a multi-layer perceptron.
result Significant performance improvement and high accuracy in classifying sentences.

A new model improves the performance of knowledge distillation in GNNs.

problem Inconsistent performance of existing knowledge distillation techniques in GNNs.
method Proposes a new model, Routing-by-Memory (RbM), a form of Mixture-of-Experts (MoE), to address performance concerns.
result Demonstrates experimentally that RbM achieves considerably more consistent performance across multiple datasets.

Generative source separation methods such as non-negative matrix factorization (NMF) or auto-encoders, rely on the assumption of an output probability density. Generative Adversarial Networks (GANs) can learn data distributions without needing a parametric assumption on the output density. We show on a speech source se…

2017-10-30abs ↗pdf ↗

Image recognition using Deep Learning has been evolved for decades though advances in the field through different settings is still a challenge. In this paper, we present our findings in searching for better image classifiers in offline and online environments. We resort to Convolutional Neural Network and its variatio…

2019-03-18abs ↗pdf ↗

Deep-n-Cheap automates deep learning model search for low complexity.

problem Finding efficient deep learning models for various datasets.
method Automated search framework for architecture and hyperparameters, including search transfer.
result Models offer comparable performance to state-of-the-art but are faster to train.

It is well-known that the distribution over functions induced through a zero-mean iid prior distribution over the parameters of a multi-layer perceptron (MLP) converges to a Gaussian process (GP), under mild conditions. We extend this result firstly to independent priors with general zero or non-zero means, and secondl…

2019-11-29abs ↗pdf ↗

This study approximates neural network features for modeling relations and attention mechanisms.

problem Approximating neural network features for modeling relations and attention mechanisms.
method Analyzes inner products of multi-layer perceptrons for universal approximation of symmetric and asymmetric relation functions.
result Universal approximation of relation functions and attention mechanisms using inner products of neural networks.

GraphACL learns graph representations without augmentation or homophily assumptions.

problem Learning graph representations on heterophilic graphs (nodes with different labels and features).
method Asymmetric Contrastive Learning for Graphs (GraphACL) considers an asymmetric view of neighboring nodes.
result GraphACL significantly outperforms state-of-the-art methods on both homophilic and heterophilic graphs.

Dropout is a very effective method in preventing overfitting and has become the go-to regularizer for multi-layer neural networks in recent years. Hierarchical mixture of experts is a hierarchically gated model that defines a soft decision tree where leaves correspond to experts and decision nodes correspond to gating …

2018-12-25abs ↗pdf ↗

This review tackles long horizon forecasting in time series analysis using deep learning.

problem Long horizon forecasting in time series analysis.
method Incorporates deep learning techniques such as trend, seasonality, Fourier and wavelet transforms, and various model architectures.
result LHF is an error propagation problem, with models like xLSTM and Triformer showing better performance.

Meta-learning consists in learning learning algorithms. We use a Long Short Term Memory (LSTM) based network to learn to compute on-line updates of the parameters of another neural network. These parameters are stored in the cell state of the LSTM. Our framework allows to compare learned algorithms to hand-made algorit…

2016-10-19abs ↗pdf ↗

Hypernetworks are neural networks that generate weights for another neural network. We formulate the hypernetwork training objective as a compromise between accuracy and diversity, where the diversity takes into account trivial symmetry transformations of the target network. We explain how this simple formulation gener…

2018-01-06abs ↗pdf ↗

Neural networks allow Q-learning reinforcement learning agents such as deep Q-networks (DQN) to approximate complex mappings from state spaces to value functions. However, this also brings drawbacks when compared to other function approximators such as tile coding or their generalisations, radial basis functions (RBF) …

2018-06-20abs ↗pdf ↗

Graph generation is an extremely important task, as graphs are found throughout different areas of science and engineering. In this work, we focus on the modern equivalent of the Erdos-Renyi random graph model: the graph variational autoencoder (GVAE). This model assumes edges and nodes are independent in order to gene…

2020-02-14abs ↗pdf ↗

Bayesian optimization has recently emerged as a popular and efficient tool for global optimization and hyperparameter tuning. Currently, the established Bayesian optimization practice requires a user-defined bounding box which is assumed to contain the optimizer. However, when little is known about the probed objective…

2015-08-14abs ↗pdf ↗

In order to classify linearly non-separable data, neurons are typically organized into multi-layer neural networks that are equipped with at least one hidden layer. Inspired by some recent discoveries in neuroscience, we propose a new model of artificial neuron along with a novel activation function enabling the learni…

2020-02-02abs ↗pdf ↗

Proof of learning rate transfer in MLPs with μμP parameterization.

problem Understanding and optimizing learning rates in neural networks with different parameterizations.
method Theoretical analysis and empirical validation of learning rate transfer in MLPs with μμP, SP, and NTP parameterizations.
result The optimal learning rate converges to a non-zero constant as width goes to infinity under μμP, explaining learning rate transfer.

Paper tackles many-class few-shot learning with class hierarchy, improving accuracy.

problem Many-class few-shot learning problem in practical applications.
method Leverages class hierarchy to train a coarse-to-fine classifier using memory-augmented hierarchical-classification network (MahiNet).
result MahiNet outperforms state-of-the-art models on MCFS problems in both supervised and meta-learning settings.

This study compares mtl architectures for renewable power generation forecasting.

problem Forecasting expected power generation for renewable power plants.
method Comparative study of mtl architectures including Hard parameter sharing, cross-stitch network, sluice network, and task embedding.
result Emerging Relation Network (ERN) and task embedding provide significant improvements in forecasting.

DMIDAS improves long-term forecasting accuracy in healthcare and electricity data.

problem Challenging long-term forecasting accuracy and computational complexity.
method Smoothness regularization and mixed data sampling techniques integrated into NBEATS architecture.
result Improves prediction accuracy by 5% on long forecasting horizons (1000 timestamps) compared to state-of-the-art models.