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.
New framework for online influencer selection considering cost constraints.
problem Real-world social advertising budget limitations and cost variability of influencers.
method Introduces a budgeted framework for online influence maximization using an algorithm with semi-bandit feedback.
result Improves the state of the art regret bound for cardinality constraint setting.
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.
RelatIF selects more intuitive training examples for explaining model predictions.
problem Influence functions identify outliers as explanatory examples, leading to poor explanations.
method RelatIF separates global and local influence, optimizing for local relative to global effects.
result Examples selected by RelatIF are more intuitive than those from influence functions.
New measure of feature influence in classification problems considering feature dependencies.
problem Measuring the influence of features in classification problems with dependencies.
method Developed a new measure based on cooperative game theory, providing axiomatic characterization and demonstrating its equivalence to the Banzhaf-Owen value.
result The proposed influence measure effectively characterizes feature importance in classification problems with feature dependencies.
New research investigates why influence functions are fragile and proposes new validation procedures.
problem Understanding and mitigating the fragility of influence functions in deep learning model explanations.
method Verification of influence functions using various conditions and procedures, including convexity and non-convexity.
result Validation procedures may cause the observed fragility of influence functions.
FININ predicts financial markets by modeling news interactions and influence.
problem Complex diffusion of financial news into market prices.
method FININ is a novel model that captures news links and interactions, integrating market data and news articles.
result FININ outperforms advanced models with a 0.429 and 0.341 improvement in daily Sharpe ratio for S&P 500 and NASDAQ 100 respectively.
There is an especially strong need in modern large-scale data analysis to prioritize samples for manual inspection. For example, the inspection could target important mislabeled samples or key vulnerabilities exploitable by an adversarial attack. In order to solve the "needle in the haystack" problem of which samples t…
New method estimates data influence efficiently by leveraging test samples.
problem Efficiently estimating influence of training data on model predictions.
method Mirrored Influence Hypothesis, forward pass for test samples.
result Significant improvement in efficiency over existing methods.
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 present the Bayesian Echo Chamber, a new Bayesian generative model for social interaction data. By modeling the evolution of people's language usage over time, this model discovers latent influence relationships between them. Unlike previous work on inferring influence, which has primarily focused on simple temporal…
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.
Influence functions help study large language model generalization, revealing surprising decay patterns.
problem Understanding and mitigating risks in large language models (LLMs).
method Eigenvalue-corrected Kronecker-Factored Approximation (EK-FAC) to scale influence functions to LLMs.
result Influences decay to near-zero when key phrases order is flipped, revealing a surprising limitation.
Retraining stabilizes model influence on data.
problem Performativity in predictive models leads to feedback loops.
method Developed the stable signal principle to address retraining dynamics.
result Repeated risk minimization converges geometrically to stable signal direction.
New bandit algorithms adapt to evolving user interests influenced by social circles.
problem Adapting to evolving user interests in recommendation systems.
method Online recommendation algorithms tailored for social influence, based on LinREL and Thompson Sampling.
result Our adaptations maintain asymptotic regret bounds similar to non-social cases.
This work introduces a novel modified Replicator Dynamics model, which includes external influences on the population. This framework models a realistic market into which companies, the external dynamic influences, invest resources in order to bolster their product's standing and increase their market share. The dynami…
Paper presents a new way to estimate model changes without full model evaluation.
problem Efficiently estimating changes in model parameters and outputs due to data point removal.
method Dual representation of influence functions for linearizable models, reducing computational complexity.
result The dual representation can be an efficient alternative to original influence functions, especially for large models.
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.
New algorithm for optimizing statistical utilities in bandits.
problem Optimizing statistical functionals of long-run reward distributions.
method Influence-function calculus for stochastic gradient estimation, entropic mirror-ascent algorithm.
result Regret bounds that separate optimization and estimation errors.
HawkesLLM models text generation with temporal influence, improving semantic alignment under limited memory.
problem Path-dependent uncertainty in agentic text-simulation systems.
method HawkesLLM framework separates temporal influence modeling from text generation, using a multivariate Hawkes process and a language model.
result HawkesLLM improves late-stage semantic alignment under a compact prompt-memory budget.
A new framework for structured bandits using influence diagrams and variational Thompson sampling.
problem Complex statistical dependencies in structured bandit problems.
method Influence diagram framework, variational Thompson sampling, tracking structured posterior distribution.
result Empirically evaluated algorithms perform as well as or better than existing baselines.
We propose a unified mechanism for achieving coordination and communication in Multi-Agent Reinforcement Learning (MARL), through rewarding agents for having causal influence over other agents' actions. Causal influence is assessed using counterfactual reasoning. At each timestep, an agent simulates alternate actions t…
The presence of significant cross-correlations between the synchronous time evolution of a pair of equity returns is a well-known empirical fact. The Pearson correlation is commonly used to indicate the level of similarity in the price changes for a given pair of stocks, but it does not measure whether other stocks inf…
A new method, VIF, calculates influence for non-decomposable losses efficiently.
problem Efficiently calculating influence for complex machine learning models with non-decomposable losses.
method Revisiting influence function from robust statistics, proposing Versatile Influence Function (VIF) for any non-decomposable loss.
result VIF method is up to 10^3 times faster than brute-force methods and closely matches influence results.
Captures data influence changes during training.
problem Traditional influence functions fail for modern training methods.
method Formalized trajectory-specific LOO influence, using data value embedding.
result Data influence varies by training stage, early and late stages have greater impact.
Proposes a new framework to disentangle event influences in MTPP.
problem Underexplored how individual events influence overall dynamics over time.
method Decoupled MTPP framework using Neural Ordinary Differential Equations (Neural ODEs).
result Significantly improves performance on real-life datasets compared to state-of-the-art methods.
New stable HOIF estimators for statistical functionals.
problem Constructing numerically stable HOIF estimators for statistical functionals.
method Developed new sHOIF estimators with provable guarantees.
result 2nd order sHOIF estimators were validated in synthetic experiments.
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.
Establishes statistical and computational bounds for influence diagnostics.
problem Identifying influential datapoints or subsets in machine learning models.
method Finite-sample statistical bounds and computational complexity for influence functions and approximate maximum influence perturbations.
result Established statistical and computational guarantees for influence diagnostics.
When assets are correlated, benefits of investment diversification are reduced. To measure the influence of correlations on investment performance, a new quantity - the effective portfolio size - is proposed and investigated in both artificial and real situations. We show that in most cases, the effective portfolio siz…
Develops new methods to evaluate data influence in SAM for improved model training.
problem Challenges in mislabeled noisy data and privacy concerns in SAM.
method Two innovative data valuation methods based on influence functions (IF) for SAM.
result Demonstrates effectiveness in identifying mislabeled data and enhancing interpretability.
New method detects anomalies in systems influenced by their environment.
problem Detecting anomalies in systems under environmental influence.
method Adversarial learning and time series representation learning.
result Successfully addresses label sparsity and subjectivity in anomaly detection.
Dynamic Influence Tracker measures changing sample importance during model training.
problem Static influence measurements during training overlook how sample importance varies over time.
method Dynamic Influence Tracker (DIT) captures time-varying sample influence across arbitrary time windows.
result DIT reveals distinct learning phases with shifting priorities and detects corrupted samples more efficiently.
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…
Paper introduces Influence Function to assess OOD generalization stability.
problem Assessing OOD generalization accuracy when target domains are unknown.
method Introduced Influence Function from robust statistics to monitor model stability.
result Accuracy on test domains and Influence Function variance can distinguish OOD algorithms and generalization quality.
Previous work has shown that popular trending events are important external factors which pose significant influence on user search behavior and also provided a way to computationally model this influence. However, their problem formulation was based on the strong assumption that each event poses its influence independ…
We address the problem of influence maximization when the social network is accompanied by diffusion cascades. In prior works, such information is used to compute influence probabilities, which is utilized by stochastic diffusion models in influence maximization. Motivated by the recent criticism on the effectiveness o…
Motivated by the need to audit complex and black box models, there has been extensive research on quantifying how data features influence model predictions. Feature influence can be direct (a direct influence on model outcomes) and indirect (model outcomes are influenced via proxy features). Feature influence can also …
Complete criterion for VoI in multi-decision influence diagrams established.
problem Analyzing safety and fairness properties of AI systems using influence diagrams.
method Introduced ID homomorphisms and Tree of Systems to prove properties of multi-decision influence diagrams.
result First complete graphical criterion for VoI in influence diagrams with multiple decisions.
Improved data attribution for high-dimensional models.
problem Inaccurate influence functions in high-dimensional settings.
method Rescaled influence functions (RIF) for more precise data attribution.
result RIFs offer significantly better predictions in practice.
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.
New method reveals how training data influence diffusion model outputs.
problem Difficulty in assessing training data impact on diffusion model outputs.
method Use of ensembles trained on carefully engineered splits of training data to identify influential training examples.
result Demonstrated the viability of ensembles as generative models and validity of assessing influence.
New estimator stabilizes higher-order influence functions for stable statistical inference.
problem Numerical instability in estimating inverse population Gram matrix.
method Proposes a new stabilized higher-order estimator without sample splitting.
result Stabilized estimator exhibits more stable performance and similar statistical guarantees.
New estimator stabilizes higher-order influence functions for bilinear forms.
problem Stability issues in estimating bilinear forms using higher-order influence functions.
method Proposes a new stabilized higher-order estimator for a class of bilinear forms without sample splitting.
result New estimator exhibits more stable finite-sample performance compared to the empirical higher-order estimator.
New method predicts model output distributions to improve data attribution.
problem Traditional training data attribution ignores randomness in model training.
method Distributional Training Data Attribution (d-TDA) using influence functions.
result Influence functions are effective and emerge naturally from d-TDA.
We consider the problem of selecting a seed set to maximize the expected number of influenced nodes in the social network, referred to as the \textit{influence maximization} (IM) problem. We assume that the topology of the social network is prescribed while the influence probabilities among edges are unknown. In order …
Understanding neural networks is becoming increasingly important. Over the last few years different types of visualisation and explanation methods have been proposed. However, none of them explicitly considered the behaviour in the presence of noise and distracting elements. In this work, we will show how noise and dis…
Quantum theory challenges traditional cause-effect relations, showing causal influences even without Bell inequality violations.
problem Challenging traditional concepts of cause-effect relations in quantum mechanics.
method Introducing a general framework to estimate causal influences without interventions or classical/quantum assumptions.
result Every pure bipartite entangled state violates classical bounds on causal influence, negating the idea that Bell inequalities are the only signature of incompatibility.