The paper models user-advertiser interactions using point processes.
problem Causal inference problems in user-advertiser interaction.
method Temporal marked point processes and neural point processes.
result Neural point processes as practical solutions.
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.
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.
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.
TRNN combines tensor geometry with neural network nonlinearity for HD data.
problem Modeling high-dimensional data with preserved tensor geometry and nonlinear interactions.
method Introduces TRNN that integrates tensor geometry and neural network nonlinearity.
result TRNN preserves tensor geometry while offering nonlinearity.
IAL uses interactive learning to improve model performance with minimal human feedback.
problem Overfitting and high human interaction cost in training neural networks.
method IAL framework with NAP attention generator and reranking algorithm.
result IAL significantly outperforms baselines with less retraining and human interaction.
In this study, we analyzed the activity of monkey V1 neurons responding to grating stimuli of different orientations using inference methods for a time-dependent Ising model. The method provides optimal estimation of time-dependent neural interactions with credible intervals according to the sequential Bayes estimation…
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.
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.
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.
A new graph model HMG and neural network HMGNN improve molecule property predictions.
problem Predicting quantum mechanical properties of molecules with limited consideration of many-body interactions.
method Introducing heterogeneous molecular graphs (HMG) and building HMGNN on neural message passing scheme.
result HMGNN achieves state-of-the-art performance in 9 out of 12 tasks on the QM9 dataset.
Predicts student performance in interactive online question pools using GNNs.
problem Predicting student performance in interactive online question pools with evolving knowledge.
method Proposes R^2GCN, a GNN model for heterogeneous networks to predict student performance.
result Achieves higher accuracy in student performance prediction than traditional methods.
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.
New neural networks model complex phenomena with fewer parameters.
problem Challenges in studying higher-order interactions in neural networks.
method Introducing curved neural networks using the maximum entropy principle.
result Curved neural networks accelerate memory retrieval and exhibit explosive phase transitions.
User interfaces provide an interactive window between physical and virtual environments. A new concept in the field of human-computer interaction is a soft user interface; a compliant surface that facilitates touch interaction through deformation. Despite the potential of these interfaces, they currently lack a signal …
INP accelerates stochastic simulations using deep Bayesian active learning.
problem Computational expense of stochastic simulations at fine-grained resolution.
method Interactive Neural Process (INP) framework combining spatiotemporal surrogate model and active learning acquisition function.
result STNP outperforms baselines in accelerating stochastic simulations and LIG achieves state-of-the-art for Bayesian active learning.
A neural network predicts drug interactions using attention mechanisms.
problem Predicting drug-drug interactions from massive combinations of drugs.
method Siamese self-attention multi-modal neural network integrating drug characteristics.
result The model achieves AUPR scores ranging from 0.77 to 0.92 on various benchmark datasets.
Cognitive diagnosis is a fundamental issue in intelligent education, which aims to discover the proficiency level of students on specific knowledge concepts. Existing approaches usually mine linear interactions of student exercising process by manual-designed function (e.g., logistic function), which is not sufficient …
New benchmarks improve model performance by accounting for isomorphism classes in multi-relational datasets.
problem Synthetic multi-relational datasets lack isomorphism class awareness, leading to overestimation of model performance.
method Proposed isomorphism-aware synthetic benchmarks and a prioritisation scheme to improve model performance and stability.
result Isomorphism classes can be utilised to improve model performance, stability during training, and reduce training time.
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.
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.
New RL framework models continuous-time dynamics using neural ODEs.
problem Modeling continuous-time dynamics in semi-Markov decision processes.
method Model-based reinforcement learning with neural ODEs.
result High-performing policies developed with minimal data.
Proposes a new model for complex multivariate event data.
problem Modeling complex multivariate event data with spatio-temporal dynamics.
method Integrates spatial information into latent state evolution through learned temporal and spatial decay dynamics.
result Successfully recovers sensible temporal and spatial intensity structure in multivariate spatio-temporal point patterns.
New method learns dynamic brain communication patterns across regions.
problem Current methods struggle with time-varying brain communications and scalability.
method Adaptive Delay Model (ADM) using Markovian Gaussian Processes.
result Captures dynamic neural communication patterns over time.
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.
While existing work on neural architecture search (NAS) tunes hyperparameters in a separate post-processing step, we demonstrate that architectural choices and other hyperparameter settings interact in a way that can render this separation suboptimal. Likewise, we demonstrate that the common practice of using very few …
Discovering causal genetic variants from large genetic association studies poses many difficult challenges. Assessing which genetic markers are involved in determining trait status is a computationally demanding task, especially in the presence of gene-gene interactions. A non-parametric Bayesian approach in the form o…
Computational modeling of human multimodal language is an emerging research area in natural language processing spanning the language, visual and acoustic modalities. Comprehending multimodal language requires modeling not only the interactions within each modality (intra-modal interactions) but more importantly the in…
Existing applications include a huge amount of knowledge that is out of reach for deep neural networks. This paper presents a novel approach for integrating calls to existing applications into deep learning architectures. Using this approach, we estimate each application's functionality with an estimator, which is impl…
Improved drug-protein interaction prediction using FTL method.
problem Predicting drug-protein interactions from noisy data with uncertain labels.
method Filtered Transfer Learning (FTL) method that fine-tunes a deep neural network across multiple tiers of data confidence.
result FTL method outperforms deep neural networks trained on single confidence ranges.
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.
Gaussian process framework learns interaction kernels in multi-species particle systems.
problem Learning interaction kernels in multi-species interacting particle systems from trajectory data.
method Nonparametric Bayesian approach with Gaussian processes.
result Established rigorous statistical guarantees for recoverability and optimality of interaction kernels.
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 model estimates higher-order interactions in stochastic processes using lower-dimensional projections.
problem Estimating higher-order interaction effects in stochastic processes with limited data.
method Additive Poisson Process (APP) combines information geometry and generalized additive models to model intensity functions in lower dimensions.
result The model can estimate higher-order intensity functions with sparse data.
We introduce a class of hybrid marked point processes, which encompasses and extends continuous-time Markov chains and Hawkes processes. While this flexible class amalgamates such existing processes, it also contains novel processes with complex dynamics. These processes are defined implicitly via their intensity and a…
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.
New attention mechanism improves meta-transfer learning in dynamic tasks.
problem Underfitting in meta-transfer learning with dynamic tasks.
method Proposed Recurrent Memory Reconstruction (RMR) attention mechanism.
result ASNP-RMR significantly outperforms baselines in various tasks.
Neural model accelerates SDDP for stochastic optimization.
problem Exponential complexity of SDDP limits its applicability to low-dimensional problems.
method Trainable neural model maps problem instances to a low-dimensional piecewise linear value function.
result ν-SDDP significantly reduces problem solving cost without sacrificing solution quality.
One of the core tasks in multi-view learning is to capture relations among views. For sequential data, the relations not only span across views, but also extend throughout the view length to form long-term intra-view and inter-view interactions. In this paper, we present a new memory augmented neural network model that…
BGNNs model particle-boundary interactions efficiently.
problem Efficiently modeling geometric boundaries in 3D simulations.
method Introduce Boundary Graph Neural Networks (BGNNs) to dynamically modify graph structures.
result BGNNs accurately reproduce 3D granular flows without handcrafted conditions.
Scalable Gaussian Process Operator tackles high-dimensional PDEs.
problem Scaling Gaussian Process Operators to high-dimensional, data-intensive regimes.
method Nearest-neighbor-based local kernel approximations, sparse kernel approximation, structured Kronecker factorizations, operator-aware kernel structures, task-informed mean functions.
result Consistently achieves high accuracy across varying discretization scales.
Study on predictable forward processes in trading without frequent evaluations.
problem Trading performance evaluation times not matching trading times.
method Solving a linear functional equation to construct predictable forward processes.
result Predictable forward processes are inherently myopic and optimal strategies do not use future information.
A new method for embedding sparse high-order interactions.
problem Learning embeddings from sparse high-order interaction events.
method Hybridizing sparse hypergraph and matrix Gaussian processes.
result Strong asymptotic bounds on sparsity ratio.
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.
We have recently seen many successful applications of recurrent neural networks (RNNs) on electronic medical records (EMRs), which contain histories of patients' diagnoses, medications, and other various events, in order to predict the current and future states of patients. Despite the strong performance of RNNs, it is…
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.
Proposes online learning for Hawkes processes with network structure and event interaction.
problem Modeling complex interactions and latent structures in network events.
method Online learning approach for mixture of multivariate Hawkes processes.
result Efficacy demonstrated on synthetic and real-world data.
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.