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

2515017521,002 · Jun 202019922001200920172026
48 results for theory-guided neural network

Proposes TgNN-LD to improve neural network effectiveness and efficiency.

problem Limits in maintaining tradeoff between data and domain knowledge.
method Converts loss function to constrained form with PDEs, ECs, and EK as constraints, incorporating Lagrangian variables for equitable tradeoff.
result Improves prediction accuracy and conserves resources.

Efficiently quantifies uncertainty in subsurface flow using neural networks guided by theory.

problem Uncertainty in dynamic subsurface flow predictions.
method Theory-guided Neural Network (TgNN) for efficient uncertainty quantification.
result TgNN surrogate improves efficiency of uncertainty quantification compared to MC method.

TgAE constructs surrogates for inverse modeling with theory-guided training.

problem Creating accurate surrogates for inverse modeling with limited data.
method Theory-guided Auto-Encoder (TgAE) framework based on CNN architecture.
result TgAE surrogate achieves satisfactory accuracy and efficiency in uncertainty quantification and parameter inversion.

Active researches are currently being performed to incorporate the wealth of scientific knowledge into data-driven approaches (e.g., neural networks) in order to improve the latter's effectiveness. In this study, the Theory-guided Neural Network (TgNN) is proposed for deep learning of subsurface flow. In the TgNN, as s…

2019-10-24abs ↗pdf ↗

New framework learns interaction rules from animal trajectories.

problem Challenges in extracting interaction rules from animal movement data.
method Augmented behavioral models with neural networks and theory-guided regularization.
result Improved performance over baselines and novel biological insights.

Deep learning upscales geologic models efficiently.

problem Upscaling large-scale geologic models for efficient simulation.
method Theory-guided convolutional neural network (TgCNN) trained to approximate hydraulic conductivity relationships.
result Deep learning method achieves equivalent upscaling accuracy to numerical methods but with significantly improved efficiency.

A neural network and evolutionary algorithm framework designs nonlinear optical molecules.

problem Designing efficient nonlinear optical materials.
method Multi-stage Bayesian neural network (msBNN) and corrected Lewis-mode group contribution method (cLGC) combined with evolutionary algorithm (EA).
result Accurately and efficiently designs molecules with different optical properties using a small data set.

New method uses MMAF-guided learning for spatio-temporal probabilistic forecasts.

problem Probabilistic forecasting of spatio-temporal data with causal structure.
method Generalized Bayesian methodology, MMAF-guided learning, ensemble of stochastic feed-forward neural networks.
result Forecast performance comparable to, and sometimes better than, deep learning architectures.

New framework for neural network score estimation in diffusion models.

problem Rigorous guarantees for practical score estimation with neural networks.
method Developed a mathematical framework for score estimation with GD-trained neural networks, addressing optimization and generalization.
result Established minimax-optimal generalization bounds for GD-trained neural networks in diffusion models.

IGNIS uses neural networks to estimate copula parameters robustly.

problem Pathological properties of Archimedean copulas make traditional estimators brittle.
method Unified neural estimation framework with multi-input architecture and softplus output layer.
result Accurate and stable estimates for real-world datasets.

New method predicts spatio-temporal data with short and long-range dependence.

problem Uncertainty in predicting the distribution of mixed moving average fields.
method Theory-guided machine learning approach using generalized Bayesian algorithm.
result Fixed-time and any-time PAC Bayesian bounds for ensemble forecasts.

A method to select important experts for Gaussian processes to balance computational efficiency and uncertainty quantification.

problem Balancing computational efficiency and uncertainty quantification in Gaussian processes for big data.
method Using graphical models to select important experts and aggregate their predictions while ensuring uncertainty quantification.
result Substantially reduces computational cost of aggregating dependent experts while ensuring calibrated uncertainty quantification.

Algorithm removes specific training data from models efficiently in high-dimensional settings.

problem Efficiently removing specific training data from high-dimensional models without full retraining.
method Starts from original model parameters, performs Newton steps, adds isotropic Laplacian noise.
result Two Newton steps are sufficient for effective unlearning in high-dimensional problems.

Graphs of neural networks are represented to preserve symmetry, improving performance across various tasks.

problem Lack of equivariance in neural network representations of other neural networks.
method Represent neural networks as computational graphs and use graph neural networks to preserve permutation symmetry.
result Single model encodes diverse neural architectures, outperforming state-of-the-art methods.

Neural networks can approximate functions uniformly across various measures.

problem Universal approximation of functions across different probability measures.
method Proving neural networks are dense in Orlicz spaces, extending classical theorems.
result Neural networks uniformly approximate functions for weakly compact families of measures.

Optimal rates for shallow ReLU networks in nonparametric regression.

problem Approximating smooth and non-smooth functions with shallow ReLU networks.
method Analysis of shallow ReLUk^k neural networks, using variation norms and deep learning theory.
result Optimal approximation rates for shallow ReLU networks in nonparametric regression.

Novel framework explains generalization in deep neural networks.

problem Understanding and improving generalization in deep neural networks.
method Topological Quantum Neural Networks as the semi-classical limit of Deep Neural Networks.
result Demonstrates that the perceptron, viewed as the semi-classical limit, achieves similar results to standard neural networks without training.

Investigates how neural network graph structure impacts predictive performance.

problem Lack of understanding between neural network graph structure and predictive performance.
method Developed relational graph representation to analyze neural networks, identifying a 'sweet spot' for improved performance.
result Identified a 'sweet spot' in relational graph structure that significantly improves neural network predictive performance.

Equivariant neural networks use symmetry to interpret complex data.

problem Interpreting and understanding the behavior of equivariant neural networks.
method Decompose layers into simple representations and analyze nonlinear activation functions.
result Equivariant neural networks can be interpreted using a filtration generalizing Fourier series.

Two new criteria help understand the advantage of deep neural networks.

problem Understanding the advantage of deepening neural networks.
method Proposed two new criteria to evaluate the expressivity of functions computable by deep neural networks.
result Increasing layers is more effective than increasing units in improving the expressivity of deep neural networks.

Paper benchmarks quantum neural networks against classical ones for binary classification tasks.

problem Comparing quantum neural networks with classical ones for binary classification.
method Evaluated with two toy examples, focusing on model complexity and training data size.
result EQNN and QNN outperform ENN and DNN for smaller parameter sets and training data samples.

New proof shows neural networks can represent all multivariate functions.

problem Representing all multivariate functions with neural networks.
method Proved that three-layer neural networks can represent both continuous and discontinuous functions.
result Three-layer neural networks can represent all multivariate functions, including discontinuous ones.

New learning rules for wide neural networks without backpropagation.

problem Training wide neural networks efficiently and without backpropagation.
method Input-weight alignment driven by gradient descent in the NTK regime.
result Biologically-motivated learning rules equivalent to backpropagation in wide networks.

Neural networks improve nonparametric regression with measurement errors.

problem Nonparametric regression with measurement errors.
method Proposes a neural network design using FNN, normalizing flow, and inference network.
result Neural network approach is more flexible and superior or comparable to classical methods.

Graph Metanetworks process diverse neural architectures efficiently.

problem Processing diverse neural architectures efficiently.
method Builds metanetworks using graph neural networks to process graphs representing input neural networks.
result Proves GMNs are expressive and equivariant to parameter permutation symmetries.

A powerful network teaches a weak one, improving its performance.

problem Improving the performance of a weak neural network using a more powerful one.
method During training, a weak network learns features from a strong network to minimize feature distance.
result A weak neural network can increase its performance by learning from a more powerful network.

Affine spiking neural networks learn efficiently and generalize well.

problem Learning with spiking neural networks, especially with positive weights.
method Affine encoders and decoders, continuous parameter dependence, gradient-based training.
result Affine spiking neural networks can approximate shallow ReLU networks and generalize well.

Research on neural networks has gained significant momentum over the past few years. Because training is a resource-intensive process and training data cannot always be made available to everyone, there has been a trend to reuse pre-trained neural networks. As such, neural networks themselves have become research data.…

2019-07-26abs ↗pdf ↗

Adapting robust statistics to neural networks, researchers found neural networks can be more robust with certain loss functions.

problem The robustness of neural networks in complex learning tasks.
method Adapting the regression breakdown point from robust statistics to neural networks and comparing different configurations and contamination settings.
result Neural networks can benefit from robust loss functions, as demonstrated in extensive simulations.

Paper introduces a noise-robust classification method using hypergraph neural networks.

problem Noisy label learning problem in image datasets.
method PCA for dimensionality reduction, then applies graph-based semi-supervised learning methods including hypergraph neural network.
result Our proposed hypergraph neural network achieves the best performance when noise level increases.

Paper introduces new neural network models and theories.

problem Understanding neural networks beyond over-parameterized regime.
method Develops two exact models and a novel representor theory.
result Provides insights into neural network training and kernel evolution.

Neural Ordinary Differential Equation (Neural ODE) has been proposed as a continuous approximation to the ResNet architecture. Some commonly used regularization mechanisms in discrete neural networks (e.g. dropout, Gaussian noise) are missing in current Neural ODE networks. In this paper, we propose a new continuous ne…

2019-06-05abs ↗pdf ↗