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.

168,742 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Model Influence

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.

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…

2019-03-01abs ↗pdf ↗

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.

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.

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.

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…

2019-04-18abs ↗pdf ↗

Proposes second-order influence functions for identifying influential groups in test-time predictions.

problem Identifying influential groups in test-time predictions for black-box models.
method Second-order approximations of the effect of removing a group of training samples on model predictions.
result Improves the correlation between computed influence values and ground truth values for linear models.

DataInf efficiently approximates data influence in large models, improving transparency and identifying mislabeled data.

problem Efficiently estimating data influence in large-scale models like LoRA-tuned LLMs and diffusion models.
method DataInf uses a closed-form expression to approximate influence scores efficiently.
result DataInf outperforms existing methods in computational and memory efficiency, accurately identifying influential data points.

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.

The paper extends influence functions to sequence tagging tasks for better model interpretability.

problem Lack of interpretability methods for sequence tagging models.
method Define and compute influence of training instance segments on test segment predictions.
result The segment influence method tracks with true influence and identifies annotation errors.

Improved scalability and interpretability in training data attribution.

problem Identifying which training data drives specific behaviors, especially unintended ones.
method Leveraging interpretable structures within the model to attribute model behavior to semantic directions, not individual test examples.
result Simple probe-based attribution methods are first-order approximations of Concept Influence that achieve comparable performance while being over an order-of-magnitude faster.

In this paper, we study the problem of robust influence maximization in the independent cascade model under a hyperparametric assumption. In social networks users influence and are influenced by individuals with similar characteristics and as such, they are associated with some features. A recent surging research direc…

2019-03-09abs ↗pdf ↗

The paper simplifies influence computations for large-scale machine learning models.

problem Improving training efficiency and accuracy in large-scale models.
method Study influence functions, define memorization, simplify computations.
result Influence functions can be practical for large-scale models, indicating memorization.

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.

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.

Improves understanding of PWS by calculating influence of sources and data.

problem Understanding the influence of each component in PWS.
method Proposes source-aware Influence Function (IF) to decompose and calculate influence.
result Improves end model's generalization performance and identifies mislabeling.

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.

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.

How can we explain the predictions of a black-box model? In this paper, we use influence functions -- a classic technique from robust statistics -- to trace a model's prediction through the learning algorithm and back to its training data, thereby identifying training points most responsible for a given prediction. To …

2017-03-14abs ↗pdf ↗

Data-trained predictive models see widespread use, but for the most part they are used as black boxes which output a prediction or score. It is therefore hard to acquire a deeper understanding of model behavior, and in particular how different features influence the model prediction. This is important when interpreting…

2016-02-23abs ↗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.

Study examines influence diagnostics in high-dimensional M-estimation.

problem Understanding influence diagnostics in high-dimensional settings.
method Characterized the distribution of leave-one-out influences in high-dimensional Gaussian M-estimation.
result The distribution of influences converges to a limiting measure in high-dimensional settings.

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.

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.

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.

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 ↗

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.

Better Hessian approximations improve influence function attributions in deep learning.

problem Influence functions are difficult to compute due to ill-conditioned Hessians, leading to poor data attribution performance.
method Investigated the impact of Hessian approximation quality on influence-function attributions in a controlled setting.
result Better Hessian approximations consistently yield better influence score quality.

Gradient rollback explains neural models by identifying influential training examples.

problem Explain predictions of neural black-box models, especially in applications requiring user trust.
method Gradient rollback, a general approach for influence estimation applicable to neural models with limited parameter updates.
result Gradient rollback provides faithful explanations for neural models, including knowledge graph embedding methods.

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 ↗

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.

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.

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.

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.

Causal influence measures for machine learnt classifiers shed light on the reasons behind classification, and aid in identifying influential input features and revealing their biases. However, such analyses involve evaluating the classifier using datapoints that may be atypical of its training distribution. Standard me…

2018-03-28abs ↗pdf ↗