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

171342512683 · Jun 202019922001200920172026
48 results for efficient influence curve

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.

Study of spatial curves in generalized Minkowski spaces.

problem Characterizing and invariants of spatial curves in non-Euclidean spaces.
method Derive Frenet-type results and invariants for spatial curves in generalized Minkowski spaces.
result Characterization of cylindrical helices and rectifying curves in generalized Minkowski spaces.

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.

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.

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.

We study the equilibrium positions of three points on a convex curve under influence of the Coulomb potential. We identify these positions as orthotripods, three points on the curve having concurrent normals. This relates the equilibrium positions to the caustic (evolute) of the curve. The concurrent normals can only m…

2015-03-14abs ↗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.

The paper shows how the generalization curve can have multiple peaks, influenced by data and learning algorithm biases.

problem Understanding the generalization behavior of linear regression models under varying parameterizations.
method Analyzes generalization loss in linear regression models with varying parameterizations, both under- and over-parameterized.
result The generalization curve can have an arbitrary number of peaks, and their locations can be controlled.

Adapts randomization for single unit time-series data for optimal treatment.

problem Statistical methods for precision medicine in single unit time-series data.
method Adaptive sequential design, nonparametric model, double robust structure, efficient influence function.
result Valid inference for mean target parameter based on single sample.

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.

Proposes neuron alignment to optimize mode connectivity in neural networks.

problem Understanding and optimizing mode connectivity in deep neural networks.
method Introduces neuron alignment to approximate optimal weight permutations and improve mode connectivity.
result Neuron alignment significantly alleviates robust loss barriers and improves model robustness and accuracy.

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.

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.

In2Core selects a coreset for efficient LLM fine-tuning with reduced data.

problem Costly fine-tuning of large language models due to extensive parameters and data requirements.
method Analyzes model gradients to estimate training sample influence, optimizing for efficiency.
result Achieves similar performance with 50% of training data using In2Core.

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 ↗

Magnetic geodesics describe the trajectory of a particle in a Riemannian manifold under the influence of an external magnetic field. In this article, we use the heat flow method to derive existence results for such curves. We first establish subconvergence of this flow to a magnetic geodesic under certain boundedness a…

2014-11-25abs ↗pdf ↗

Paper assesses how features influence classification of COVID-19 patients.

problem Evaluating the influence of features on classification problems.
method Introduced a measure of feature influence using Shapley value of cooperative games, with axiomatic characterisation.
result Validated the performance of the measure through experiments on COVID-19 patients.

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.

The ROC curve is widely used to assess the quality of prediction/classification/ranking algorithms, and its properties have been extensively studied. The precision-recall (PR) curve has become the de facto replacement for the ROC curve in the presence of imbalance, namely where one class is far more likely than the oth…

2018-10-19abs ↗pdf ↗

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.

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 ↗

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 ↗

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.

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.

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.

New model predicts neural network performance from early training epochs, incorporating architecture impact.

problem Predicting neural network performance from early training epochs, neglecting architecture impact.
method Architecture-aware graph ordinary differential equation model.
result Model outperforms state-of-the-art methods for MLP and CNN learning curves.

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 ↗

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.

Combines structured inference and targeted learning to tackle causal inference challenges.

problem Treatment assignment heterogeneity and lack of counterfactual data.
method Factorizes joint distribution into risk, confounding, instrumental, and miscellaneous factors; applies regularizer derived from influence curve.
result TVAE demonstrates competitive and state-of-the-art performance on benchmark datasets.

Slice Tuner optimizes data acquisition for accurate and fair machine learning models.

problem Acquiring enough data for all slices of data to ensure accurate and fair models.
method Selective data acquisition using convex optimization and iterative learning curve updates.
result Significantly outperforms baselines in model accuracy and fairness.

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.

New method saves computational budget by ranking and transferring learning curves.

problem Expensive automated machine learning methods for hyperparameter and neural architecture optimization.
method Tackles as a ranking and transfer learning problem, optimizing a pairwise ranking loss and leveraging learning curves from other datasets.
result Accelerates neural architecture search by a factor of up to 100 without significant performance degradation.

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.

We consider billiard ball motion in a convex domain of a constant curvature surface influenced by the constant magnetic field. We prove that if the billiard map is totally integrable then the boundary curve is necessarily a circle. This result is a manifestation of the so-called Hopf rigidity phenomenon which was recen…

2012-08-12abs ↗pdf ↗

Given a smooth manifold MM and a totally nonholonomic distribution ΔTMΔ\subset TM of rank dd, we study the effect of singular curves on the topology of the space of horizontal paths joining two points on MM. Singular curves are critical points of the endpoint map F:γγ(1)F:γ\mapstoγ(1) defined on the space ΩΩ of horizonta…

2016-03-29abs ↗pdf ↗

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.

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.