Enhances social spam detection using multi-level dependency of relational sequences.
problem Social spam detection in multi-relation social networks.
method Developed the Multi-level Dependency Model (MDM) to exploit long-term and short-term dependencies in user relational sequences.
result MDM improves social spam detection accuracy on a real-world multi-relational social network.
Dependent MMD coresets help compare multiple related datasets.
problem Comparing multiple related datasets for insights into model generalization.
method Dependent MMD coresets for collections of datasets.
result Dependent MMD coresets facilitate comparison and understanding of multiple related datasets.
Improved GNN handles long-range dependencies in multi-relational graphs.
problem Vanishing gradients in GNNs for multi-relational graphs.
method Proposes a Gated Graph Neural Network with improved long-range dependency handling.
result Outperforms popular GNN models in synthetic tasks.
Bayesian networks, and especially their structures, are powerful tools for representing conditional independencies and dependencies between random variables. In applications where related variables form a priori known groups, chosen to represent different "views" to or aspects of the same entities, one may be more inte…
Paper shows how scattering maps of Schrödinger equations relate to metrics.
problem Relating scattering maps of time-dependent Schrödinger equations to metrics.
method Analyzes scattering maps for specific classes of metrics and diffeomorphisms.
result Scattering maps differ by a compact operator if and only if metrics are related by diffeomorphism.
Graph WaveNet models spatial-temporal graphs by learning hidden dependencies and long sequences.
problem Capturing hidden spatial dependencies and long-range temporal sequences in graphs.
method Graph WaveNet integrates adaptive dependency matrix learning and stacked dilated 1D convolution.
result Graph WaveNet outperforms existing methods on public traffic network datasets.
The paper proves freeness of low-rank subgroups in one-relator groups with negative immersions.
problem Proving freeness of low-rank subgroups in one-relator groups.
method Dependence theorem for free groups, freeness theorem, negative immersions.
result One-relator groups have negative immersions when primitivity rank is greater than 2.
Time-related features improve time series forecasting models.
problem Lack of explicit time-related encoding in current forecasting models limits their ability to capture cyclical and seasonal trends.
method Introducing Time Stamp Forecaster (TimeSter) to encode time-related features and integrating it with a linear backbone.
result TimeLinear model reduces MSE by 23% on benchmark datasets, improving performance with exceptional efficiency.
In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently, ignoring the correlation…
A new algorithm tackles delayed combinatorial semi-bandit with causal relations.
problem Optimizing decisions in a non-stationary environment with delayed and causally related rewards.
method Formalized as a non-stationary delayed combinatorial semi-bandit problem, the approach models causal relations with a directed graph in a stationary structural equation model. The agent learns these relations from delayed feedback to optimize decisions.
result Proved a regret bound for the proposed algorithm's performance.
New findings show Shannon information measures fail to accurately assess multivariate dependencies.
problem Accurately measuring information flow in complex systems.
method Demonstrated that Shannon information measures fail to distinguish between dyadic and polyadic relationships.
result Shannon information measures are inadequate for discovering meaningful dependency structures in joint probability distributions.
Researchers formalize PD and PFI to relate them to data generating process.
problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.
We introduce the nonparametric metadata dependent relational (NMDR) model, a Bayesian nonparametric stochastic block model for network data. The NMDR allows the entities associated with each node to have mixed membership in an unbounded collection of latent communities. Learned regression models allow these memberships…
Bayesian model captures complex activity styles with interval relations.
problem Challenges in recognizing complex activities due to uncertainty and diversity.
method Proposes a Bayesian model using Allen's interval relations and latent variables from the Chinese restaurant process.
result Model captures all possible styles of complex activities as unique distributions over atomic actions and relations.
In this paper we study a collection of jet geometrical concepts, we refer to d-tensors, relativistic time dependent semisprays, harmonic curves and nonlinear connections on the 1-jet space J1(R;M), necessary to the construction of a Miron's-like geometrization for Lagrangians depending on a relativistic time. The geome…
Model predicts spatial-temporal series with latent dynamical component.
problem Forecasting and discovering spatial-temporal relations in series.
method Recurrent neural network with latent dynamical component and various prior hypotheses.
result Model outperforms baselines in various forecasting tasks.
We study the dependence of the eta invariant ηD on the spin structure, where D is a twisted Dirac operator on a (4k+3)-dimensional spin manifold. The difference between the eta invariants for two spin structures related by a cohomolgy class which is the reduction of a $H^1(M,\Za)$-class is shown to be a half integ…
GMNN combines conditional random fields and graph neural networks for relational data.
problem Semi-supervised object classification in relational data.
method Combines conditional random fields and graph neural networks. Uses variational EM algorithm for training.
result GMNN achieves state-of-the-art results on object classification, link classification, and unsupervised node representation learning.
This research uses empirical copulas to price quanto options, showing significant differences from traditional models.
problem The dependence relation between currency and asset prices affects quanto option pricing.
method Empirical copulas are used to model the dependence between currency and asset prices.
result Empirical copulas provide non-negligible pricing differences compared to traditional models.
Study geometric equivalence of smooth map germs.
problem Equivalence relations among smooth map germs with respect to G-structures.
method Generalization of right-left equivalence (A-equivalence) to include geometric structures.
result Interesting applications of these equivalence relations.
Gromov's universal filling inequalities relate the filling radius and the filling volume of a Riemannian manifold to its volume. The main result of the present article is that in dimensions at least three the optimal constants in the filling inequalities depend only on dimension and orientability, not on the manifold i…
CeCNN predicts SE and AL from UWF images, improving myopia screening.
problem Predicting axial length and spherical equivalence from UWF fundus images.
method Copula-enhanced Convolutional Neural Network (CeCNN) for multiresponse regression.
result CeCNN improves prediction of SE and AL compared to baseline CNNs.
New model for clustering dependent community Hawkes processes in temporal networks.
problem Modeling strong dependence and community structure in temporal networks.
method Dependent Community Hawkes (DCH) models combining stochastic block models and Hawkes processes.
result Spectral clustering error bound derived for DCH models.
Unified framework for simple question answering using subgraph ranking and joint-scoring.
problem Simple question answering with knowledge graphs is challenging.
method Unified framework focusing on subgraph selection and fact selection, with novel ranking and joint-scoring methods.
result Achieved state-of-the-art accuracy of 85.44% on SimpleQuestions dataset.
We analyze the statistical dependency structure of the S&P 500 constituents in the 4-year period from 2007 to 2010 using intraday data from the New York Stock Exchange's TAQ database. With a copula-based approach, we find that the statistical dependencies are very strong in the tails of the marginal distributions. This…
This paper presents theory for Normalized Random Measures (NRMs), Normalized Generalized Gammas (NGGs), a particular kind of NRM, and Dependent Hierarchical NRMs which allow networks of dependent NRMs to be analysed. These have been used, for instance, for time-dependent topic modelling. In this paper, we first introdu…
Graphical model predicts rare disease physicians, improving accuracy.
problem Identifying rare disease physicians from imbalanced patient data.
method Factor Graph Approach modeling physician and patient features.
result Graphical model outperforms existing targeting methodologies.
New models infer causal effects from graph-based time-series data.
problem Inferring causal effects from graph-based relational time-series data.
method Proposes causal inference models leveraging graph topology and time-series data.
result Relational time-series causal inference models accurately estimate local causal effects of individual nodes.
A novel GAN framework improves multi-class classification by modeling label dependencies.
problem Improving multi-class classification performance through label dependency exploitation.
method Generative adversarial networks (GANs) where the discriminator learns label dependency and the generator learns to create dependent label sets.
result The discriminator significantly enhances generalization for various classification models.
MTHetGNN models complex relations in multivariate time series forecasting.
problem Complex relations among variables in multivariate time series forecasting.
method Designs a relation embedding module and a temporal embedding module, using graph neural networks and CNNs.
result Achieves state-of-the-art results in multivariate time series forecasting.
New method improves graph neural networks by considering different types of relations in sampling.
problem Current graph neural networks ignore relation types in biomedical graphs, leading to suboptimal performance.
method Proposes relation-dependent sampling for multi-relational graphs to balance relation frequency and importance.
result State-of-the-art graph neural networks achieve better accuracy and efficiency with relation-dependent sampling.
We analyze families of non-autonomous systems of first-order ordinary differential equations admitting a common time-dependent superposition rule, i.e., a time-dependent map expressing any solution of each of these systems in terms of a generic set of particular solutions of the system and some constants. We next study…
We propose the time-dependent generalization of an `ordinary' autonomous human biomechanics, in which total mechanical + biochemical energy is not conserved. We introduce a general framework for time-dependent biomechanics in terms of jet manifolds derived from the extended musculo-skeletal configuration manifold. The …
Proposes RT decomposition for better multi-relational link prediction.
problem Improving multi-relational link prediction in knowledge graphs.
method Relational Tucker3 (RT) decomposition, decouples entity and relation embeddings, allows parameter sharing, and learns sparsity patterns.
result RT decomposition can outperform existing sparse models in multi-relational link prediction.
The current research on credit risk is primarily focused on modeling default probabilities. Recovery rates are often treated as an afterthought; they are modeled independently, in many cases they are even assumed constant. This is despite of their pronounced effect on the tail of the loss distribution. Here, we take a …
In this paper we introduce a new multivariate dependence measure based on comonotonicity by means of product moment which motivated by the recent papers of Koch and Schepper (ASTIN Bulletin 41 (2011) 191-213) and Dhaene et al. (Journal of Computational and Applied Mathematics 263 (2014) 78-87). Some differences and rel…
Gradients are natural first order differential operators depending on Riemannian metrics. The principal symbols of them are related to the enveloping algebra and higher Casimir elements. We give certain relations in the enveloping algebra, which induce not only identities for higher Casimir elements but also all Bochne…
New inequalities for learning from graph-dependent data with stability bounds.
problem Learning from dependent data with graph dependency.
method Proved McDiarmid-type concentration inequalities for graph-dependent variables, showed concentration relies on forest complexity.
result Proved stability bounds for learning from graph-dependent data.
Let M be a compact 3-manifold with a triangulation τ. We give an inequality relating the Euler characteristic of a surface F normally embedded in M with the number of normal quadrilaterals in F. This gives a relation between a topological invariant of the surface and a quantity derived from its combinatorial …
Paper introduces MSPD for multivariate risk processes with dependencies.
problem Computing risk valuations with dynamic dependencies between frequency and severity.
method Combines Poisson imbedding, pseudo-chaotic expansion, and Malliavin calculus.
result Explicit general correlation formula for MSPDs.
The theme is the influence of the spin structure on the Dirac spectrum of a spin manifold. We survey examples and results related to this question.
dGAP learns feature dependencies and predicts targets simultaneously.
problem Learning task-agnostic statistical dependencies and missing explicit feature dependencies.
method Jointly optimizes a neural dependency graph and target prediction loss.
result dGAP can recover correct feature dependencies and improve prediction accuracy.
Proposes a GNN framework for multivariate time series forecasting.
problem Lack of exploiting latent spatial dependencies in multivariate time series forecasting.
method Automatically extracts graph structures from multivariate time series data, integrates external knowledge, and uses mix-hop and dilated inception layers for capturing dependencies.
result Outperforms state-of-the-art methods on 3 out of 4 benchmark datasets.
Investigates relationships between concordance measures and non-exchangeability in copulas.
problem Understanding the relationship between concordance measures and non-exchangeability in copulas.
method Examines five concordance measures (Spearman's rho, Kendall's tau, Gini's gamma, Blomqvist's beta, and footrule) and their connection to non-exchangeability in copulas.
result New method proposed for exploring the relationship between copula properties and measures of dependence.
HIRM models noisy, sparse, heterogeneous relational data using hierarchical clustering and Dirichlet processes.
problem Modeling noisy, sparse, and heterogeneous relational data.
method Hierarchical Chinese restaurant process and Dirichlet process mixture for clustering and modeling relation values.
result HIRM generalizes standard models and discovers relational structure in real-world datasets.
A new framework combines CNN and GRU for better structural damage detection.
problem Improving damage detection in structural engineering using machine learning.
method Hierarchical CNN and Gated Recurrent Unit (GRU) framework to model spatial and temporal relations.
result The proposed HCG framework significantly outperforms existing methods for structural damage detection.
CDSSL improves representation quality by integrating linear and nonlinear dependencies.
problem Scarcity of labeled data and neglect of nonlinear dependencies in SSL.
method CDSSL combines linear correlations and nonlinear dependencies using HSIC in RKHS.
result CDSSL enhances representation quality on diverse benchmarks.
Transformers reduce redundancy by focusing on invariant relational quantities.
problem Substantial internal redundancy in Transformer models due to coordinate-dependent representations and continuous symmetries.
method Reformulate representations, attention mechanisms, and optimization dynamics in terms of invariant relational quantities, eliminating redundant degrees of freedom by construction.
result Architectures that operate directly on relational structures, providing a principled geometric framework for reducing parameter redundancy and analyzing optimization.