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% · Sep 199219922001200920172026
48 results for group influence

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.

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.

We investigated the network structures of the Japanese stock market through the minimum spanning tree. We defined grouping coefficient to test the validity of conventional grouping by industrial categories, and found a decreasing in trend for the coefficient. This phenomenon supports the increasing external influences …

2007-08-03abs ↗pdf ↗

Influence functions estimate the effect of removing a training point on a model without the need to retrain. They are based on a first-order Taylor approximation that is guaranteed to be accurate for sufficiently small changes to the model, and so are commonly used to study the effect of individual points in large data…

2019-05-30abs ↗pdf ↗

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.

Mastering the dynamics of social influence requires separating, in a database of information propagation traces, the genuine causal processes from temporal correlation, i.e., homophily and other spurious causes. However, most studies to characterize social influence, and, in general, most data-science analyses focus on…

2018-08-06abs ↗pdf ↗

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.

Finance has benefited from the Wolfram's NKS approach but it can and will benefit even more in the future, and the gains from the influence may actually be concentrated among practitioners who unintentionally employ those principles as a group.

2012-10-04abs ↗pdf ↗

GGDA simplifies DA for large models, speeding up attribution by up to 50x.

problem Computational intensity of existing DA methods limits their applicability to large-scale models.
method Generalized Group Data Attribution (GGDA) framework attributing to groups of training points.
result GGDA achieves up to 50x speedups over standard DA methods while maintaining effectiveness.

Study improves carbon price forecasting using quantile regression and feature selection.

problem Accurately predicting carbon prices influenced by geopolitical, social, and economic factors.
method Collect and analyze various influencing factors, select significant features, and use Sparse Quantile Group Lasso and Adaptive Sparse Quantile Group Lasso for robust predictions.
result Proposed methods outperform existing ones and provide a complete profile of future carbon prices.

This paper reviews the checkered history of predictive distributions in statistics and discusses two developments, one from recent literature and the other new. The first development is bringing predictive distributions into machine learning, whose early development was so deeply influenced by two remarkable groups at …

2017-10-24abs ↗pdf ↗

MRI image quality affects statistical and predictive analysis of brain morphology.

problem Impact of MRI image quality on statistical and predictive analysis of brain morphology.
method Systematic testing of image quality on univariate statistics and machine learning classification using three large datasets.
result Low-quality MRI data significantly affects detecting significant sex/gender differences in smaller samples, but not in larger ones.

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.

Method reduces model bias in water temperature prediction using physics-guided GNNs.

problem Model bias in traditional physics-based models across different income and education levels.
method Physics-guided GNNs with refined neighbor selection and weights.
result Preserves equitable performance across different sensitive groups in the Delaware River Basin.

New model clusters cells and individuals, revealing genetic influences on cell types.

problem Clustering nested data with group-level and observation-level variables.
method Nested Atoms Model (NAM), Bayesian nonparametric approach.
result Identifies clusters of genetically similar individuals with homogeneous cell-type profiles.

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.

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 ↗

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 ↗

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.

Model learns collective and individual dynamics in time series data.

problem Lack of models capturing system-level collective behavior in individual time series.
method Hierarchical switching-state model with latent system-level and entity-level Markov chains.
result Model improves interpretability and forecasting accuracy compared to larger models.

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.

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.

In market modeling, one often treats buyers as a homogeneous group. In this paper we consider buyers with heterogeneous preferences and products available in many variants. Such a framework allows us to successfully model various market phenomena. In particular, we investigate how is the vendor's behavior influenced by…

2007-12-20abs ↗pdf ↗

FAIRIF improves fairness in deep learning models without changing the model architecture.

problem Improving fairness in deep learning models trained on sensitive data.
method Two-stage training algorithm that minimizes loss over a reweighted data set, balancing model performance across demographic groups.
result FAIRIF reduces disparity among different groups in classification settings, improving fairness-utility trade-offs.

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.

The study of fairness in intelligent decision systems has mostly ignored long-term influence on the underlying population. Yet fairness considerations (e.g. affirmative action) have often the implicit goal of achieving balance among groups within the population. The most basic notion of balance is eventual equality bet…

2018-12-07abs ↗pdf ↗

Understanding the causes of crime is a longstanding issue in researcher's agenda. While it is a hard task to extract causality from data, several linear models have been proposed to predict crime through the existing correlations between crime and urban metrics. However, because of non-Gaussian distributions and multic…

2017-12-08abs ↗pdf ↗

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.

GRANITE unifies feature-based explanation methods to reduce disagreement.

problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.

A study on the relation between the smooth structure of a symplectic homotopy K3 surface and its symplectic symmetries is initiated. A measurement of exoticness of a symplectic homotopy K3 surface is introduced, and the influence of an effective action of a K3 group via symplectic symmetries is investigated. It is show…

2007-09-16abs ↗pdf ↗

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.

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.

This study analyzes mutual influence on investment strategies of financial market agents.

problem Mutual influence among agents in financial markets and its impact on investment strategies.
method Formulated optimal investment differential game problem, derived analytical solutions, proposed fast algorithm, and theoretically analyzed mutual influence.
result Agents' optimal strategies converge to the asymptotic strategy when mutual influence is strong and approaches infinity.

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.