MFNs parameterize non-local interactions through matrix equivariant functions, improving graph neural network performance.
problem Challenges in modeling non-local interactions in graphs, such as oversmoothing and oversquashing.
method Matrix Function Neural Networks (MFNs) using resolvent expansions for non-local interactions.
result Achieves state-of-the-art performance in graph benchmarks and captures intricate non-local interactions.
A new method for finding efficient neural interaction functions in collaborative filtering.
problem Finding consistent good performance for complex interactions in collaborative filtering.
method Proposes a search algorithm for simple neural interaction functions (SIF) in CF, using a structured multi-layer perceptron.
result Demonstrates much better prediction performance and distinct IFCs for different data sets and tasks.
Paper improves neural interaction modeling using nonlinear Hawkes processes.
problem Inability of classic Hawkes process to model inhibitory interactions.
method Augmented auxiliary latent variables and EM algorithm for efficient inference.
result Demonstrates accurate and efficient estimation of neural interaction dynamics.
Graph neural network predicts vehicle interactions and trajectories for autonomous driving.
problem Predicting future motion of vehicles in traffic scenes.
method Graph neural network that jointly predicts interaction modes and 5-second future trajectories.
result Jointly predicting trajectories and interaction modes leads to lower trajectory error.
Interpreting neural networks is a crucial and challenging task in machine learning. In this paper, we develop a novel framework for detecting statistical interactions captured by a feedforward multilayer neural network by directly interpreting its learned weights. Depending on the desired interactions, our method can a…
New method trains deep neural networks for non-interacting kinetic-energy functionals in DFT.
problem Lack of exact relationship between electron density and non-interacting kinetic energy.
method Variational principle to regularize machine-learned density functionals.
result Excellent results on kinetic-energy functionals for various systems.
Study reveals self-attention's role in learning and generalizing interactions.
problem Understanding self-attention's theoretical role in neural architectures.
method Interacting entities analysis, including multi-agent RL and genetic sequences.
result Self-attention efficiently represents, learns, and generalizes pairwise interactions.
NeuralCD diagnoses student proficiency in exercises using neural networks.
problem Capturing complex student-exercise interactions for accurate cognitive diagnosis.
method Proposes NeuralCD framework using neural networks to learn complex interactions between students and exercises, incorporating monotonicity for interpretability.
result Demonstrates effectiveness of NeuralCD framework on real-world datasets, achieving both accuracy and interpretability.
Ensembles of neural networks learn better by sharing information.
problem Improving performance of neural networks through collective learning.
method Modeling neural networks as socially interacting agents aiming to maximize their own performance and functional relations to others.
result Optimal collective performance emerges from local interactions between networks, leading to specialization and higher confidence.
Deep Causal Graphs model complex causal relationships using neural networks.
problem Limited applicability of parametric causal models to real-life datasets with non-linear relationships.
method Deep Causal Graphs, an abstract specification for neural networks to model causal distributions.
result Demonstrates expressive power in modelling complex interactions and provides true causal counterfactuals.
GAMI-Net improves neural network interpretability while maintaining accuracy.
problem Lack of interpretability in neural network models.
method GAMI-Net is a disentangled feedforward network with multiple additive subnetworks designed for capturing main effects and pairwise interactions, considering sparsity, heredity, and marginal clarity.
result GAMI-Net achieves superior interpretability and competitive prediction accuracy compared to explainable boosting machine and other models.
SEM-DNN learns reciprocal interactions from observational data without external instruments.
problem Estimating bidirectional interactions from endogenous data.
method Heteroscedastic neural simultaneous-equation estimator (SEM-DNN) that learns reciprocal structural interactions.
result SEM-DNN recovers structural effects more reliably than other methods under increasing information.
GENN predicts drug interactions by modeling correlations between link labels.
problem Predicting drug-drug interactions with consideration of link type correlations.
method GENN uses graph energy neural networks to model link type correlations in DDI prediction.
result GENN outperforms baseline models by 13.77% and 5.01% in PR-AUC on two real-world datasets.
A new method detects interactions in neural networks using topological analysis.
problem Detecting interactions between input features in neural networks.
method Topological analysis of neural network connectivity to quantify interaction strength.
result The PID algorithm outperforms state-of-the-art baselines in interaction detection tasks.
CREIMBO models diverse brain activity by identifying hidden neural sub-circuits and their non-stationary interactions.
problem Lack of alignment in neural recordings limits analysis of brain-wide dynamics.
method CREIMBO learns a unified model of neural dynamics by assuming multiple hidden global sub-circuits representing ensemble interactions.
result CREIMBO discovers session-specific neural ensembles and their non-stationary interactions, revealing cross-subject neural mechanisms.
Lecture notes on reinforcement learning using statistical methods.
problem Addressing the exploration-exploitation dilemma in decision making.
method Frequentist and Bayesian approaches, function approximation, neural networks.
result Unified framework for decision making and estimation.
The paper extends a neural model to estimate uncertainty in multi-interaction trajectory reconstruction.
problem Lack of uncertainty estimation in neural models for multi-interaction trajectory reconstruction.
method Extended Factorised Neural Relational Inference model to output mean and standard deviation for each component of the phase space vector, using various loss functions.
result Demonstrated the importance of physical meaning of variables and existence of local minima during training.
PIN models feature interactions using a neural network that mimics decision trees.
problem Modeling feature interactions in tabular data for predictive modeling.
method Tree-like Pairwise Interaction Network (PIN) architecture that captures pairwise feature interactions through a shared feed-forward neural network.
result PIN outperforms traditional and modern neural networks benchmarks in predictive accuracy.
AriaNN enables private deep learning with minimal interaction and reduced key sizes.
problem Private deep learning with minimal interaction and reduced key sizes.
method Semi-honest 2-party computation protocol with function secret sharing, optimized primitives for neural network operations.
result Efficient private comparison for ReLU operations with reduced key size and improved performance.
DVAO predicts volumetric ambient occlusion for real-time volume rendering.
problem Predicting per-voxel ambient occlusion in volumetric data sets.
method Deep learning neural network that considers global information through transfer function.
result DVAO supports real-time volume interaction and generalizes to various modalities.
Estimates mean dimension of neural networks to reveal interaction effects.
problem Understanding interaction effects in neural networks.
method Estimation procedure for mean dimension from datasets, analyzing layer-by-layer evolution and impact of activation functions.
result Mean dimension reveals differences in interaction magnitude across neural network architectures.
Computational approaches to drug discovery can reduce the time and cost associated with experimental assays and enable the screening of novel chemotypes. Structure-based drug design methods rely on scoring functions to rank and predict binding affinities and poses. The ever-expanding amount of protein-ligand binding an…
Neural networks learn to mimic brain neurons with two-input activation functions, improving performance and robustness.
problem Training neural networks to mimic the complex interactions of brain neurons.
method Developed a network-in-network architecture with two-input activation functions, optimized hyperparameters, and compared to conventional ReLU networks.
result Two-input activation functions can learn soft XOR functions, improving network performance and robustness.
New framework for detecting complex interactions in multivariate data.
problem Insufficient pairwise measures fail to capture multivariate data complexities.
method Lattice theory and operator functions to derive higher-order information-theoretic measures.
result Streitberg Information fully characterizes all interactions among d variables. CBNNs model survival with time-varying interactions, outperforming other methods.
problem Complex covariate effects and time-varying interactions in survival analysis.
method Combines case-base sampling with neural networks to model time-varying effects and complex baseline hazards.
result CBNNs outperform regression and neural network-based survival methods in simulations and real data applications.
New method for interpreting complex ML models.
problem Interpreting complex black-box ML models.
method Functional decomposition of black-box predictions into simpler subfunctions.
result Main effects provide insights into feature contributions and interactions.
Paper proposes FINN for better CTR prediction by modeling feature interactions.
problem Improving CTR prediction in advertising and recommendation systems.
method Proposes Feature Interaction based Neural Network (FINN) to model feature interactions.
result FINN outperforms other deep models in CTR prediction tasks.
Study of local optima in neural networks for feature interactions.
problem NNs struggle with local optima in feature interactions for small datasets.
method Proposed a node pruning and feature selection algorithm to improve NN performance.
result NNs have many non-equivalent local optima in XOR-like data with irrelevant variables.
Automates finding interactions in GLMs using neural networks.
problem Time-consuming and expert-dependent search for GLM interactions.
method Neural networks and model-specific interaction detection method.
result Computational speed improvement over traditional methods.
A graph neural network detects beneficial feature interactions for recommender systems.
problem Feature interactions are crucial but not all are beneficial for recommendation accuracy.
method Graph neural network with L0 activation regularization for edge prediction.
result The model outperforms baselines and automatically identifies beneficial feature interactions.
The abstract proposes a neural network theory using quantum field theory.
problem Understanding the behavior of neural networks in the asymptotic and non-asymptotic limits.
method Mapping neural networks to Wilsonian effective field theory, using Gaussian processes and Feynman diagrams.
result Established a direct connection between overparameterization and simplicity of neural network likelihoods.
This work uses decision trees to encode relevant features and their interactions into neural networks, improving model performance.
problem Overfitting in neural networks with many irrelevant variables.
method Defines a mapping to encode decision tree extracted relationships into a neural network.
result The approach outperforms fully connected neural networks and tree-based methods.
NeurISE uses neural nets to learn graphical models efficiently.
problem Efficiently learning graphical models with high-order terms.
method NeurISE, a neural net-based algorithm that approximates interaction screening objective function.
result NeurISE can find parsimonious representations without prior information.
Shared workspace improves neural module coordination in deep learning.
problem Pairwise interactions in deep learning models lack global coordination.
method Introduce a shared global workspace with bandwidth limitations among neural modules.
result Capacity limitations encourage specialization and synchronization.
Deep model learns protein interfaces from high-order interactions.
problem Predicting protein interfaces from amino acid pairs.
method Graph neural networks and convolutional neural networks for 2D dense predictions.
result Our method consistently improves interface prediction performance.
Recent advances in neural networks have inspired people to design hybrid recommendation algorithms that can incorporate both (1) user-item interaction information and (2) content information including image, audio, and text. Despite their promising results, neural network-based recommendation algorithms pose extensive …
Modeling interacting objects with latent Gaussian process ODEs.
problem Time uncertainty-aware modeling of continuous-time dynamics of interacting objects.
method A new model using latent Gaussian process ordinary differential equations to infer independent dynamics and interactions.
result Our model improves long-term predictions and successfully encapsulates independent dynamics and interactions.
New method explains feature interactions in neural networks.
problem Understanding feature interactions in deep networks.
method Integrated Hessians, an extension of Integrated Gradients.
result Integrated Hessians explains pairwise feature interactions efficiently and accurately.
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.
Interactive framework improves understanding of deep neural networks.
problem False sense of comprehension from static explanation methods.
method Interactive framework allowing exhaustive inspection and testing of decisions.
result Interactive approach leads to better understanding of complex decision boundaries.
Simplicial neural networks extend graph neural networks to handle higher-order interactions.
problem Handling higher-order interactions in complex data structures.
method Define a convolution operation for simplicial complexes and use it to construct convolutional neural networks.
result SNNs effectively impute missing data in coauthorship complexes.
SIAN bridges simple models to neural networks by identifying necessary feature combinations.
problem The gap between simple models and powerful neural networks in performance.
method Feature interaction detection and sparse selection algorithm.
result Competitive performance across multiple tabular datasets with optimal tradeoff.
Estimating global pairwise interaction effects, i.e., the difference between the joint effect and the sum of marginal effects of two input features, with uncertainty properly quantified, is centrally important in science applications. We propose a non-parametric probabilistic method for detecting interaction effects of…
FI-GNNs learn expressive node representations from sparse features.
problem Sparse and high-dimensional node features limit GNN performance.
method Plug-and-play GNN framework that highlights informative feature interactions.
result FI-GNNs learn highly expressive node representations on feature-sparse graphs.
The paper explains DNNs by quantifying interactions among input variables.
problem Understanding and explaining the complex behavior of deep neural networks.
method The paper defines and quantifies the significance of interactions among multiple input variables using the Shapley value.
result The proposed method effectively explains the behavior of DNNs by assigning attribution values to input variables.
BGNN improves GNN by modeling interactions between neighbor nodes.
problem Existing GNN models fail to capture interactions between neighbor nodes, leading to suboptimal performance.
method Proposes a new graph convolution operator that augments the weighted sum with pairwise interactions of neighbor nodes.
result Empirical results show BGNN models outperform traditional GNN models in node classification accuracy.
o1Neuro neural network approximates complex functions and converges quickly.
problem Approximating complex functions and ensuring convergence in neural networks.
method Sparse indicator activation neurons, population and sample level convergence properties.
result o1Neuro achieves optimal model approximation and convergence with high probability.
Researchers analyze neural process architectures and their representational capacities.
problem Understanding what functions can be represented by different neural process architectures.
method Analyzing four types of neural process architectures: CNPs, ANPs, TNPs, and their latent variants.
result Prove these architectures form a strict hierarchy and characterize their representational capabilities.