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.

169,051 papers · 148 categories

Trend · papers per month

247493740986 · Jun 202019922001200920182026
48 results for influence networks

Unified approach for influence maximization using diffusion cascade representations.

problem Influence maximization on networks with diffusion cascades.
method Multi-task neural network learning influencer and susceptible vectors; greedy algorithm for influence maximization.
result IMINFECTOR outperforms other methods in efficiency and seed set quality.

Influence functions are inaccurate in deep learning models, especially for deeper networks.

problem Inaccuracies in influence functions in deep learning models.
method Empirical study of influence functions in neural network models trained on various datasets.
result Influence estimates are often erroneous for deeper networks and require regularization.

Aims to optimize influence spread in social networks using bandit algorithms.

problem Maximizing influence spread in unknown social networks.
method Combines Thompson Sampling and Epsilon Greedy algorithms with automatic ensemble learning.
result Demonstrates effectiveness of automatic ensemble learning for combinatorial bandit problems.

New algorithm for competing influence spread in unknown networks.

problem Maximizing influence spread in a social network with unknown probabilities.
method Combinatorial multi-armed bandit (CMAB) framework, Triggering Probability Modulated (TPM) condition, OCIM-TS, OCIM-OFU, OCIM-ETC.
result Sublinear Bayesian and frequentist regret for OCIM-TS and OCIM-OFU, respectively.

We study the problem of explaining a rich class of behavioral properties of deep neural networks. Distinctively, our influence-directed explanations approach this problem by peering inside the network to identify neurons with high influence on a quantity and distribution of interest, using an axiomatically-justified in…

2018-02-11abs ↗pdf ↗

A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.

problem Real-world social networks have inter-community influence that is often overlooked in community-based IM approaches.
method Community-IM++ uses a heuristic based on community-based diffusion degree and progressive budgeting to model and prioritize cross-community diffusion.
result Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime than existing methods.

Efficiently selects seed nodes to maximize content influence in unknown social networks.

problem Maximizing content spread in social networks with unknown network model.
method Formulated as an infinite-horizon discounted MDP, uses model-based reinforcement learning to select seed users adaptively.
result Established a regret bound of O~(T)\widetilde O(\sqrt{T}) for the algorithm.

MIM-Reasoner learns seed users for maximizing influence in multiplex networks.

problem Maximizing influence in multiplex networks with multiple layers of social interactions.
method Combining reinforcement learning with probabilistic graphical models.
result Established a theoretical guarantee for MIM-Reasoner's performance.

We address the problem of gauging the influence exerted by a given country on the global trade market from the viewpoint of complex networks. In particular, we apply the PWP method for computing indirect influences on the world trade network.

2014-11-27abs ↗pdf ↗

Study shows influence functions are poor for neural networks but useful for identifying influential examples.

problem Influence functions misalign with leave-one-out retraining in neural networks.
method Decomposed the discrepancy into five terms and studied their contributions across different architectures and datasets.
result Influence functions are a good approximation to the proximal Bregman response function (PBRF), useful for identifying influential examples.

Study predicts social relationships using triadic influence from social networks.

problem Difficulty in quantifying social relationships and their dynamics.
method Real social networks of 13 schools, neural networks, high-dimensional embedding.
result Triadic influence achieves highest accuracy in predicting student relationships.

New method for fair influence maximization in social networks.

problem Maximizing influence while ensuring fairness across sensitive attributes.
method Co-training an auto-encoder and discriminator to create fair graph embeddings.
result Our method reduces disparity while maintaining competitive influence maximization performance.

We tackle robust influence maximization in social networks with hyperparametric edge probabilities.

problem Maximizing worst-case influence in social networks with hyperparametric edge probabilities.
method Proposed a model with NP-hard proper robust optimization, using sampling and multiplicative weight updates.
result Empirically validated method outperforms state-of-the-art robust influence maximization techniques.

In a stock market, the price fluctuations are interactive, that is, one listed company can influence others. In this paper, we seek to study the influence relationships among listed companies by constructing a directed network on the basis of Chinese stock market. This influence network shows distinct topological prope…

2015-03-03abs ↗pdf ↗

DQ4FairIM uses RL to maximize influence while ensuring fairness across all groups.

problem Fairness in influence maximization in social networks.
method Fairness-aware deep RL method using Structure2Vec network embedding.
result DQ4FairIM achieves higher fairness than fairness-agnostic and fairness-aware baselines.

New IF method improves accuracy in deep neural networks with noisy data.

problem Inaccurate influence estimates in deep neural networks, especially with noisy data.
method Established a connection between influence estimation error, validation set risk, and sharpness, introducing a novel estimation form for flat validation minima.
result Our novel Influence Function approach provides more accurate influence estimates, validated across various tasks.

We optimize discounts to maximize influence spread in social networks.

problem Maximizing influence spread in social networks with fractional discounts.
method Developed an efficient (1-1/e)-approximation algorithm for NP-hard problem.
result Achieved an approximation of 1-1/e for influence maximization.

Shapley Homology measures sample influence on neural networks' manifold topology.

problem Assumption of iid samples simplifies manifold analysis in machine learning.
method Shapley Homology framework quantifies sample influence on neural networks' manifold topology.
result Higher influence scores correlate with greater impact on neural network accuracy.

Improved neural model for social recommendation by integrating social and interest networks.

problem Data sparsity and lack of higher-order relationships in social recommendation.
method DiffNet++ models neural influence diffusion and interest diffusion in a unified framework using a multi-level attention network.
result Extensive experiments on real-world datasets show the effectiveness of DiffNet++.

We consider the problem of influence maximization in fixed networks for contagion models in an adversarial setting. The goal is to select an optimal set of nodes to seed the influence process, such that the number of influenced nodes at the conclusion of the campaign is as large as possible. We formulate the problem as…

2016-11-01abs ↗pdf ↗

I-GCN improves GCNs' robustness against adversarial attacks.

problem Adversarial attacks degrade GCNs' performance in security-critical applications.
method Influence mechanism divides node effects into introverted and extroverted influences.
result I-GCN achieves higher accuracy rates than state-of-the-art methods in defending against adversarial attacks.

Predicting event attendance using social influence from social networks.

problem Predicting people's participation in real-world events.
method Modeling social influence, using non-geotagged posts and social group structures, applying graph embedding techniques, and training a neural network.
result The proposed classifier achieves 89% accuracy on the VFestival dataset, outperforming state-of-the-art methods.

Optimal intervention in economic networks modeled as influence maximization, with hard computational problems.

problem Optimal intervention in economic networks modeled as influence maximization.
method Transformed into influence maximization-like form, with theoretical and practical implications.
result Optimal intervention is NP-hard and cannot be approximated to a constant factor in polynomial time.

Researchers study how teachers' advising relationships influence their perceptions of satisfaction and students, not policy influence.

problem Understanding the relationship between teachers' advising relationships and their perceptions of satisfaction and students.
method Proposed a novel joint model of network and item responses (JNIRM) with correlated latent variables.
result Teachers' advising relationships contribute more to satisfaction and students than to influence over educational policies.

Model financial markets with social media influences using hierarchical networks.

problem Understanding social media's impact on financial markets.
method Agent-based model with hierarchical influence network.
result Model accurately simulates real-world financial market behaviors.

Many networks are complex dynamical systems, where both attributes of nodes and topology of the network (link structure) can change with time. We propose a model of co-evolving networks where both node at- tributes and network structure evolve under mutual influence. Specifically, we consider a mixed membership stochas…

2011-06-14abs ↗pdf ↗

This paper develops upper and lower bounds on the influence measure in a network, more precisely, the expected number of nodes that a seed set can influence in the independent cascade model. In particular, our bounds exploit nonbacktracking walks, Fortuin-Kasteleyn-Ginibre (FKG) type inequalities, and are computed by m…

2017-05-24abs ↗pdf ↗

Paper tackles hyper-gradient estimation in decentralized FL over time-varying networks.

problem Excessive communication costs and inability to use robust networks.
method Introduces an optimality condition and uses Push-Sum for averaging model parameters and gradients over time-varying directed networks.
result Derives a hyper-gradient estimator that operates over time-varying directed networks and converges to the true hyper-gradient.

Simple linear models reveal complex cryptocurrency networks.

problem Understanding complex causal networks in cryptocurrency markets.
method Multivariate linear models to infer financial networks from cryptocurrency price series.
result Simple linear models can create informative cryptocurrency networks reflecting economic intuition.

Proposes a method to explain deep neural networks by identifying representer points in the training set.

problem Explaining the predictions of deep neural networks.
method Identifying representer points in the training set to decompose neural network predictions.
result Provides a deeper understanding of neural network predictions through positive and negative representer values.

Study analyzes Echo State Network parameters for Rossler attractor dynamics.

problem Understanding the influence of network type on Echo State Network performance.
method Experimental analysis of Echo State Network parameters using Rossler attractor.
result Exploration of how network type affects Echo State Network performance.

Information diffusion and virus propagation are fundamental processes taking place in networks. While it is often possible to directly observe when nodes become infected with a virus or adopt the information, observing individual transmissions (i.e., who infects whom, or who influences whom) is typically very difficult…

2010-06-01abs ↗pdf ↗

Improves understanding of neural network predictions using influence functions.

problem Challenges in understanding neural network predictions.
method Utilized NTK theory to calculate influence functions for over-parameterized neural networks.
result Proved that the approximation error of IF can be arbitrarily small in the over-parameterized regime.