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

Trend · papers per month

4998147196 · May 202619922001200920172026
48 results for influence score

New method reveals true causal functions in nonlinear time series, not just scores.

problem Causal discovery in nonlinear time series often uses scalar edge scores, which hide true function-valued causal influence.
method Formalized function-valued causal influence for additive, contribution-decomposable architectures. Introduced a practical framework based on ICE for estimating causal response functions directly from trained models.
result Edges with indistinguishable scalar scores can exhibit qualitatively different functional behaviors.

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.

This paper improves credit scoring models using a novel dataset distillation technique.

problem Limited scalability of pretrained models for tabular credit scoring datasets.
method Integrates class imbalance-aware dataset distillation with pretrained models.
result Improved AUC by 2.5% in financial datasets.

Big data from phone calls improves credit scoring models and profits.

problem Improving credit scoring models to enhance financial inclusion.
method Combining call-detail records and traditional data to build scorecards using social network analytics.
result Combining call-detail records with traditional data significantly increases model performance and profit.

INFUSER improves reasoning by co-evolving a generator and solver with adaptive curriculum.

problem Improving reasoning in language models with minimal external supervision.
method INFUSER uses a Generator and Solver to co-evolve iteratively, rewarding the Generator with an influence score and the Solver with correctness rewards.
result INFUSER outperforms self-evolution baselines by over 20% on Olympiad and SuperGPQA benchmarks.

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.

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 addresses bias amplification in prediction and decision-making using causal analysis.

problem Bias amplification in automated systems, especially after thresholding.
method Introduces margin complement and causal decomposition of prediction disparities.
result Disparity in predictor Y^\widehat Y can be decomposed into causal influences of XX on SS and MM.

We propose ββ-graph embedding for robustly learning feature vectors from data vectors and noisy link weights. A newly introduced empirical moment ββ-score reduces the influence of contamination and robustly measures the difference between the underlying correct expected weights of links and the specified generative m…

2019-02-22abs ↗pdf ↗

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.

In this paper, we consider a statistical problem of learning a linear model from noisy samples. Existing work has focused on approximating the least squares solution by using leverage-based scores as an importance sampling distribution. However, no finite sample statistical guarantees and no computationally efficient o…

2015-07-21abs ↗pdf ↗

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.

This paper addresses the problem of inferring sparse causal networks modeled by multivariate auto-regressive (MAR) processes. Conditions are derived under which the Group Lasso (gLasso) procedure consistently estimates sparse network structure. The key condition involves a "false connection score." In particular, we sh…

2011-06-03abs ↗pdf ↗

Two new outlyingness scores improve outlier detection in high-dimensional data.

problem Detecting outliers in high-dimensional data with varying cluster shapes and intensities.
method Outlyingness scores (OOS and IOS) based on Cluster Catch Digraphs (CCDs).
result Both OOS and IOS outperform CCD-based methods in identifying global and local outliers, especially IOS.

Framework detects and mitigates data-poisoning attacks in causal effect estimation.

problem Vulnerability to append-only attacks in observational causal analyses.
method Develops a data-poisoning audit for augmented inverse-probability-weighted estimation.
result Proposes a greedy scan to compute exact worst-case movement at every append budget.

This research analyzes and accelerates score-based diffusion models using discretization and Hessian information.

problem Theoretical foundations and convergence analysis of score-based diffusion models.
method Investigation of various discretization schemes, including Euler, exponential integrators, and midpoint randomization. Proposal of an accelerated sampler based on local linearization method.
result Hessian-based approach achieves faster convergence rates of order $\widetilde{\mathcal{O}}\left(\frac{1}{\varepsilon} ight)$, significantly improving upon vanilla diffusion models.

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 ↗

Proposes a method to infer the distributional impacts of predictive models on stakeholders.

problem The influence of predictive models on target variable distribution, leading to performative prediction.
method Modeling agents' responses as a cost-adjusted utility maximization problem and using optimal transport to align pre- and post-model distributions.
result Provides estimates for the cost associated with these responses and demonstrates the quality of these estimates.

Novel framework for contextual anomaly detection models uncertainty.

problem Identifying anomalies in target variables influenced by contextual variables.
method Normalcy score (NS) framework using heteroscedastic Gaussian process regression.
result NS outperforms state-of-the-art methods in detection accuracy and interpretability.

Active learning aims to obtain a classifier of high accuracy by using fewer label requests in comparison to passive learning by selecting effective queries. Many active learning methods have been developed in the past two decades, which sample queries based on informativeness or representativeness of unlabeled data poi…

2015-07-15abs ↗pdf ↗

Introduces privilege scores to measure and interpret protected attribute-related privilege in machine learning models.

problem Lack of explicit formulation of non-neutrality in fairness-aware machine learning methods.
method Privilege scores (PS) and privilege score contributions (PSCs) to measure and interpret protected attribute-related privilege.
result Demonstrates the broad applicability of PS and PSCs in gender and racial privilege in mortgage and college admissions applications.

The α\alpha-Alternator adapts to varying noise levels in sequences, improving robustness and performance.

problem Current models assume uniform noise levels, limiting performance on noisy temporal data.
method Introduces α\alpha-Alternator using Vendi Score to dynamically adjust noise sensitivity.
result Outperforms Alternators and state-of-the-art models in trajectory prediction, imputation, and forecasting.

Conditional forecasts improve performative prediction accuracy.

problem Performative predictions undermine standard forecasting methods.
method Condition forecasts on covariates to make them forecast-invariant.
result Proper scoring rules fail under conditioning, but two solutions are identified.

Data poisoning attacks can manipulate recommender systems to recommend target items.

problem Attacks on recommender systems to influence top-N item recommendations.
method Formulated as an optimization problem, solved using influence function to select influential users.
result Effective data poisoning attacks that outperform existing methods.

Nonparametric method measures influence of training images on diffusion model outputs.

problem Quantifying influence of individual training examples on diffusion model outputs.
method Patch-level similarity between generated and training images, using optimal score function.
result Strong attribution performance, matching gradient-based approaches and outperforming baselines.

Study uses Granger causality to show investor sentiment influences stock prices.

problem Understanding the relationship between investor sentiment and stock market movements.
method Applied Granger causality to analyze the relationship between close price index and sentiment score.
result Sentiment analysis shows a positive correlation with stock price movements.

A novel diffusion method for Bayesian posterior sampling with theoretical guarantees.

problem Efficiently sampling from complex posterior distributions in Bayesian inversion.
method Diffusion-based posterior sampling using Langevin dynamics and PnP framework.
result The method converges even for multi-modal posterior distributions with theoretical error bounds.

Bayesian approach scores influential training examples for model predictions.

problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.

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.

INFUSER improves reasoning by self-evolving with a generator and solver that co-learn from unstructured documents.

problem Improving reasoning through self-evolution
method INFUSER uses a generator and solver co-evolving in a document pool to improve reasoning.
result INFUSER outperforms strong self-evolution baselines on Olympiad and SuperGPQA benchmarks.

Semiparametric method removes bias in functional bilevel gradient estimation.

problem First-order bias in plug-in hypergradient when lower-level problem is nonparametric.
method Semiparametric debiasing theory based on efficient influence function leads to cross-fitted orthogonal hypergradient estimator.
result Asymptotic normality and uniform control over outer parameter established for the estimator.

Study uses BNs to predict cryptocurrency prices, improving accuracy with discretisation.

problem Predicting price movements in volatile cryptocurrency markets.
method Discretisation-aware Bayesian Networks with three methods and multiple bin counts.
result Equal interval with two bins provides best predictive performance.