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,694 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for Influence Estimation

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 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.

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.

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.

Estimates spatio-temporal Hawkes processes using tensor recovery.

problem Estimating influence functions for spatio-temporal Hawkes processes.
method Formulates influence function as a tensor kernel, assumes low-rank structure, solves as convex optimization problem.
result Provides theoretical guarantees and demonstrates efficiency with simulations.

In a diffusion process on a network, how many nodes are expected to be influenced by a set of initial spreaders? This natural problem, often referred to as influence estimation, boils down to computing the marginal probability that a given node is active at a given time when the process starts from specified initial co…

2019-12-29abs ↗pdf ↗

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.

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 ↗

Prediction-powered causal inference achieves smaller asymptotic variance than traditional methods.

problem Estimating causal and structural parameters in a semi-supervised setting.
method Combining efficient influence function with debiased machine learning and semi-supervised Riesz regression.
result Asymptotic variances of estimators match the derived efficiency bound.

Proposes a new estimator for causal mediation with continuous treatments.

problem Estimation of direct and indirect effects with continuous treatments.
method Kernel smoothing approach with cross-fitting for non-parametric estimation.
result Multiply robust and asymptotically normal estimator for continuous treatments.

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.

We consider the problem of \emph{influence maximization}, the problem of maximizing the number of people that become aware of a product by finding the `best' set of `seed' users to expose the product to. Most prior work on this topic assumes that we know the probability of each user influencing each other user, or we h…

2015-02-27abs ↗pdf ↗

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.

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.

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.

Customer Satisfaction is the most important factors in the industry irrespective of domain. Key Driver Analysis is a common practice in data science to help the business to evaluate the same. Understanding key features, which influence the outcome or dependent feature, is highly important in statistical model building.…

2018-05-25abs ↗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.

Efficient estimators for smooth Hilbert-valued parameters with theoretical guarantees.

problem Estimating smooth Hilbert-valued parameters with theoretical guarantees.
method Pathwise differentiable Hilbert-valued parameters, efficient influence functions, regularized one-step estimators.
result Theoretical guarantees for efficient estimators even when nuisance functions are arbitrary.

We study the problem of online influence maximization in social networks. In this problem, a learner aims to identify the set of "best influencers" in a network by interacting with it, i.e., repeatedly selecting seed nodes and observing activation feedback in the network. We capitalize on an important property of the i…

2019-06-09abs ↗pdf ↗

The paper establishes a central limit theorem for estimating the influence parameter in a partially observed Hawkes process system.

problem Estimating the influence parameter in a partially observed Hawkes process system.
method Central limit theorem applied to an estimator of the influence parameter in a partially observed system of Hawkes processes.
result Establishes a central limit theorem for the estimator of the influence parameter under the subcritical condition.

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.

Framework calculates positional influence in causal residual Transformers.

problem Understanding positional influence in causal residual Transformers.
method Adjoint-sensitivity framework for positional influence in causal residual Transformers.
result Exact evolution of adjoint-energy influence density and decomposition into residual transmission, nonlocal Volterra, and local channels.

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 …

2019-11-25abs ↗pdf ↗

HyperINF improves influence function estimation for large models with better accuracy and efficiency.

problem Inaccurate and computationally expensive influence function estimation for large-scale models.
method HyperINF leverages Schulz's iterative algorithm and GFIM for low-rank approximation of Hessian matrix.
result HyperINF achieves superior accuracy and performance compared to existing methods on LoRA-tuned 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.

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.

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.

Introduces a new feature importance measure using Gram-Schmidt decorrelation.

problem Determining feature influence strength and nature in datasets.
method Gram-Schmidt decorrelation and random forest regression.
result Empirical comparison of new estimators with established methods.

ULFS-KDPE estimates parameters efficiently without influence functions.

problem Estimating pathwise differentiable parameters in nonparametric models.
method Kernel debiased plug-in estimator based on universal least favorable submodel.
result Semiparametric efficiency achieved without influence function derivation.

Study shows peers' graduation improves residents' success in TCs.

problem Identifying peer influence in therapeutic communities adjusting for latent homophily.
method Used data on affirmations and exit dates to form peer networks, modeled latent homophily, and proposed bias correction methods.
result Positive effect of peers' graduation on residents' graduation, varying by gender, race, and role model definition.

Subsampling methods have been recently proposed to speed up least squares estimation in large scale settings. However, these algorithms are typically not robust to outliers or corruptions in the observed covariates. The concept of influence that was developed for regression diagnostics can be used to detect such corrup…

2014-06-12abs ↗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.

We quantify how co-jumps impact correlations in currency markets. To disentangle the continuous part of quadratic covariation from co-jumps, and study the influence of co-jumps on correlations, we propose a new wavelet-based estimator. The proposed estimation framework is able to localize the co-jumps very precisely th…

2016-02-17abs ↗pdf ↗