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.

169,291 papers · 148 categories

Trend · papers per month

58116173231 · Jun 202019922001200920182026
48 results for individual ability

The study examines how individual ability and project benefit influence cooperation in public goods games.

problem Maximizing cooperation in public goods games with varying individual contributions and benefits.
method A generalized public goods game model incorporating individual ability and project benefit.
result The upper limit of individual benefit promotes cooperation, while the upper limit of individual contribution inhibits it.

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.

New approach models individual vitality for better mortality predictions.

problem Limited ability of existing mortality models to capture individual complexity.
method Developed a four-component framework for individual vitality dynamics.
result Demonstrates improved analytical and practical outcomes in life insurance and lifetime decision-making.

Optimizes COVID-19 testing policy using a Multi-Armed Bandit approach.

problem Balancing discovery of positive cases with population surveillance.
method Risk scoring and random sampling based on Multi-Armed Bandit theory.
result Effective prioritization captures 65-92% of positive cases with varying testing capacity.

We develop a model to study the role of rationality in economics and biology. The model's agents differ continuously in their ability to make rational choices. The agents' objective is to ensure their individual survival over time or, equivalently, to maximize profits. In equilibrium, however, rational agents who maxim…

2015-07-14abs ↗pdf ↗

Enhances ML model explanations through Bayesian non-parametric approach.

problem Difficulty in understanding and interpreting ML model decisions.
method Augments a Bayesian non-parametric regression mixture model with elastic nets.
result Empirically outperforms state-of-the-art techniques in explaining individual decisions.

Study develops a new model for predicting individual mobility based on activity patterns.

problem Existing mobility prediction methods overlook underlying activity patterns.
method Activity-based hidden Markov model (IOHMM) using transit smart card data.
result Proposed model achieves similar prediction performance to LSTM but also provides behavioral insights.

New method refines prediction intervals for individual treatment effects using cross-world correlation.

problem Uncertainty in individual treatment effects for high-stakes decisions.
method Introduces cross-world correlation parameter ρ to refine prediction intervals for individual treatment effects.
result Achieves more stable and accurate coverage of prediction intervals for individual treatment effects.

ROOTS learns to represent and render 3D scenes with object-centric models.

problem Learning to represent and render 3D scenes with object-centric compositionality.
method Probabilistic generative model for learning object representations and scene rendering from partial observations.
result The model can infer 3D object representations and render scenes from arbitrary viewpoints.

Extends individual fairness to online decision-making, ensuring fair treatment over time.

problem Ensuring fair treatment of individuals in online decision-making.
method Introduces fairness-across-time (FT) and fairness-in-hindsight (FH) definitions, and designs a new algorithm (CaFE) to achieve sub-linear regret guarantees.
result FH can be embedded as a primary safeguard against unfair discrimination without hindering long-term decision-making.

A new sparse benchmark metabench identifies key abilities from large benchmarks.

problem Redundancy and compression in existing benchmarks.
method Data from 5000+ LLMs to identify most informative items, distilling a sparse benchmark.
result Sparse benchmark metabench captures underlying abilities with high accuracy.

The paper proposes pruning techniques for improving ensemble GP models.

problem Improving the generalization ability and reducing computational burden of GP ensemble models.
method Combining syntax and semantics-based GP models, and using pruning criteria based on correlation and entropy.
result Pruning criteria based on correlation and entropy can improve the generalization ability of the ensemble model.

This research uses machine learning to identify Alzheimer's disease subtypes and predict progression.

problem Heterogeneity in Alzheimer's disease clinical manifestations and progression rate limit personalized care and treatment planning.
method Unsupervised and supervised machine learning approaches applied to ADNI data.
result Identification of patient subtypes and prediction of disease progression zones.

Study uses healthcare claims data to identify Covid-19 risk factors without prior selection.

problem Identify risk factors for severe Covid-19 cases.
method Fine-grained hierarchical information from medical classification systems used to analyze over 33,000 covariates.
result Method has better predictive ability than pre-specified morbidity groups.

LMLFM tackles predictive modeling from longitudinal data with mixed correlations.

problem Learning predictive models from longitudinal data with complex correlations and non-linear interactions.
method Longitudinal Multi-Level Factorization Machine (LMLFM) that selects predictive fixed and random effects.
result LMLFM outperforms state-of-the-art methods in predictive accuracy, variable selection, and scalability.

New attack recovers user-level information from large batch images.

problem Recovering private information from user-level gradients in distributed learning.
method Proposes a gradient inversion attack using a denoising diffusion model as a prior.
result Demonstrates recovery of realistic facial images and private attributes.

This paper improves fairness in recommendation systems by learning individual preferences across multiple dimensions.

problem Fairness in recommender systems, especially in areas with social impact.
method Opportunistic multi-aspect re-ranking approach that learns individual preferences and enhances provider fairness.
result Achieves a better trade-off between accuracy and fairness across multiple fairness dimensions.

New algorithm detects interactions for better individual trait prediction.

problem Tackles the challenge of making accurate individual trait predictions using interactions.
method Extends model-based MDR (MB-MDR) to detect and utilize interactions.
result Outperforms other algorithms in detecting and utilizing interactions for better prediction.

An ensemble of randomized NNs improves time series forecasting accuracy.

problem Forecasting time series with multiple seasonality and nonstationarity.
method Randomized neural networks with pattern-based time series representation and diversity control strategies.
result Outperforms statistical and machine learning models in forecasting accuracy.

Bayesian method improves adaptive testing item selection, ensuring full item exposure.

problem Adaptive testing selects items to estimate ability, but must also ensure diverse item exposure.
method Formulated as Bayesian model averaging, deriving optimal item sampling probabilities.
result Stochastic method achieves full item bank exposure without sacrificing accuracy.

CactusNets measure how useful features are for specific classes.

problem Lack of a metric for measuring how applicable learned features are to specific classes.
method Propose a metric for feature applicability and use it to estimate input applicability.
result Developed a new method for unsupervised learning called CactusNet.

Develops a new approach for algorithmic recourse in AI systems.

problem Tackles the problem of providing recommendations for reversing negative AI decisions.
method Introduces a causal framework that models recourse as a process over pre- and post-intervention outcomes, allowing for partial stability and resampling of latent variables.
result Demonstrates the value of the proposed methods on real and semi-synthetic datasets.

Study uses FDA to analyze discount functions of different temperaments.

problem Traditional finance models fail to capture individual differences in investment choices.
method Functional Data Analysis (FDA) to investigate temporal discounting behaviors.
result Heterogeneity within each temperament revealed, suggesting diverse investor profiles.

Paper models treatment effects by clustering patients with distinct survival characteristics.

problem Estimating treatment efficacy in clinical settings with censored outcomes.
method Latent variable approach to model heterogeneous treatment effects.
result The latent structure can mediate base survival rates and reveal actionable phenotypes.

Single directions are key to deep networks' generalization.

problem Understanding why some deep networks generalize well while others do not.
method Examined the reliance on single directions in deep networks and their relation to generalization performance.
result Reliance on single directions is a good predictor of a network's generalization performance.

A multi-task GP model tracks time-varying transition probabilities between two states.

problem Tracking time-varying transition probabilities between 'moves' and 'pauses' states.
method Kernel-based multi-task Gaussian Process model with time-variability and constraints.
result Enforces constraints while learning transition probabilities.

Combines human and model predictions for improved accuracy.

problem Improving classification accuracy when both human and model predictions are imperfect.
method Uses confusion matrices and calibration to combine probabilistic model outputs with human class-level predictions.
result Human-model combinations consistently outperform either alone, with accuracy gains even with limited human input.

Combination of distributional regression algorithms improves uncertainty estimation of satellite precipitation products.

problem Uncertainty estimation in satellite precipitation products.
method Ensemble learning methods combining conditional zero-adjusted probability distributions estimated with GAMLSS, spline-based GAMLSS, and distributional regression forests.
result Stacking of methods outperformed individual methods in most quantile levels using the quantile loss function.

Structured state space models improve ECG classification and reveal new insights.

problem Improving ECG analysis through deep learning.
method Applying structured state space models to capture long-term dependencies in ECG data.
result SSMs lead to significant improvements in ECG classification over current state-of-the-art.

The paper analyzes the benefit-cost ratio for feature selection in machine learning.

problem Tackling the challenge of distinguishing relevant features from noise in feature selection.
method Simulation study with different cost and data settings to analyze the benefit-cost ratio.
result The benefit-cost ratio can overemphasize cheap noise features in scenarios with large cost differences and small effect sizes.