We study notions of fairness in decision-making systems when individuals have diverse preferences over the possible outcomes of the decisions. Our starting point is the seminal work of Dwork et al. which introduced a notion of individual fairness (IF): given a task-specific similarity metric, every pair of individuals …
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
48 results for “Individualism”
New method certifies individual fairness in representations.
problem Ensuring fairness in data representations without sacrificing utility.
method Mapping similar individuals to close latent representations to certify individual fairness.
result Certifies individual fairness for existing and new data points.
The study analyzes the conflict between group fairness and individual fairness in machine learning.
problem The conflict between group fairness (optimal statistical parity) and individual fairness in machine learning.
method Established sufficient conditions for the compatibility between optimal statistical parity and individual fairness requirements.
result Identified regions along the Pareto frontier that satisfy individual fairness requirements.
Proposes individual fairness for clustering, making data points prefer their own cluster.
problem No fair clustering for clustering data points.
method Introduces a new fairness notion for clustering and studies its feasibility and heuristics.
result Individual fairness for clustering is NP-hard in general but feasible for one-dimensional data.
Algorithm learns similarity metrics for individual fairness.
problem Difficulty in learning similarity metrics for individual fairness.
method Gradient descent and Bradley-Terry model for pairwise comparisons.
result Algorithm converges to ground truth metric for individual fairness.
Proposes a method to learn fair classifiers without restrictive assumptions.
problem Fairness in machine learning decisions for individuals.
method Defines PIU and optimizes to control its upper bound.
result Guarantees fairness for each individual without restrictive assumptions.
This paper introduces individual fairness in clustering using -divergence.
problem Ensuring fair clustering by treating similar individuals similarly.
method Uses -divergence to measure statistical similarity and assigns individuals to probability distributions over cluster centers.
result Provides an algorithm with provable approximation guarantee for clustering with individual fairness constraints.
Does social media information affect individual investor disposition effect? Evidence from Xueqiuq-fin.GN
Social media reduces individual investors' disposition effect through negative information.
problem The disposition effect in individual investors selling profitable assets too early and holding onto losing assets for too long.
method Analysis of post data and trading data from Xueqiu.com.
result Social media information significantly reduces the disposition effect.
There has been much discussion recently about how fairness should be measured or enforced in classification. Individual Fairness [Dwork, Hardt, Pitassi, Reingold, Zemel, 2012], which requires that similar individuals be treated similarly, is a highly appealing definition as it gives strong guarantees on treatment of in…
The paper clarifies the distinction between CATE and ITE under ignorability assumptions.
problem Confusion between CATE and ITE hinders personalized effect estimation.
method Clarifies the distinction between CATE and ITE under ignorability assumptions.
result CATE and ITE are not necessarily the same under ignorability assumptions.
EOI enhances individuality in multi-agent systems.
problem Improving multi-agent cooperation through individuality.
method A probabilistic classifier that predicts agent identity based on observations, with intrinsic rewards and regularizers.
result EOI significantly outperforms existing methods in multi-agent cooperative scenarios.
Deep dynamic modeling with just two time points: Can we still allow for individual trajectories?stat.ML
Deep learning models can infer individual trajectories from sparse data.
problem Learning individual dynamics from limited data points.
method Combining variational autoencoders (VAEs) with ordinary differential equations (ODEs) for dynamic modeling.
result Deep learning can recover individual trajectories from sparse data, but requires careful adaptation.
Fairness State with Plastic Preferencesphysics.soc-ph
The definition of preferences assigned to individuals is a concept that concerns many disciplines, from economics, with the search of an acceptable outcome for an ensemble of individuals, to decision making an analysis of vote systems. We are concerned in the phenomena of good selection and economic fairness. In Arrow'…
Post-processing corrects bias in ML systems without retraining.
problem Correcting bias in ML systems that are already in use.
method Proposes general post-processing algorithms for individual fairness based on graph Laplacian regularization.
result Empirically, post-processing algorithms correct individual biases in large-scale NLP models while preserving accuracy.
Social and individual learning in the Minority Gamephysics.soc-ph
Social learning can make financial markets inefficient, but individual learning can fix this.
problem Inefficiencies in financial markets due to social learning.
method Study of the Minority Game model with social and individual learning mechanisms.
result Individual learning can rescue a population from the inefficiencies caused by social learning.
The paper tackles individualized decision-making under unmeasured confounding, providing a novel minimax solution and a paradox.
problem Unmeasured confounding in causal inference leads to biased estimates and affects individualized decision-making.
method The authors establish a formal link between individualized decision-making under partial identification and classical decision theory, providing a minimax solution and a paradox.
result A novel minimax solution for individualized decision-making/policy assignment is provided, and an interesting paradox is drawn.
Individually Fair Rankingstat.ML
Algorithm ensures fair ranking by minority groups alongside majority groups.
problem Ensuring fair ranking of items from minority groups alongside majority groups.
method Optimal transport-based regularizer for individual fairness and efficient optimization algorithm.
result Certifiably individually fair LTR models are achieved.
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.
fAux tests individual fairness without domain knowledge or out-of-domain samples.
problem Testing for individual fairness in machine learning models.
method Derivative comparison between model predictions and auxiliary model predictions.
result Effectively identifies discrimination on synthetic and real-world datasets.
Social dynamics is concerned primarily with interactions among individuals and the resulting group behaviors, modeling the temporal evolution of social systems via the interactions of individuals within these systems. In particular, the availability of large-scale data from social networks and sensor networks offers an…
We propose a new family of fairness definitions for classification problems that combine some of the best properties of both statistical and individual notions of fairness. We posit not only a distribution over individuals, but also a distribution over (or collection of) classification tasks. We then ask that standard …
For many complex diseases, there is a wide variety of ways in which an individual can manifest the disease. The challenge of personalized medicine is to develop tools that can accurately predict the trajectory of an individual's disease, which can in turn enable clinicians to optimize treatments. We represent an indivi…
Paper introduces Functional Effects Models to account for individual heterogeneity in panel data.
problem Accounting for preference heterogeneity in panel data with machine learning.
method Functional Effects Models using gradient boosting decision trees and deep neural networks to learn individual-specific preference parameters.
result Functional Effects Models outperform traditional models in learning inter-individual heterogeneity and predictive performance.
Classifiers that achieve demographic balance by explicitly using protected attributes such as race or gender are often politically or culturally controversial due to their lack of individual fairness, i.e. individuals with similar qualifications will receive different outcomes. Individually and group fair decision crit…
A generalized public goods game with coupling of individual ability and project benefitphysics.soc-ph
Facing a heavy task, any single person can only make a limited contribution and team cooperation is needed. As one enjoys the benefit of the public goods, the potential benefits of the project are not always maximized and may be partly wasted. By incorporating individual ability and project benefit into the original pu…
Right Decisions from Wrong Predictions: A Mechanism Design Alternative to Individual Calibrationstat.ML
Proposes a compensation mechanism for improving individual forecast confidence.
problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.
Study online learning with individual fairness without known similarity measure.
problem Online learning with individual fairness constraints without a known similarity measure.
method Reduction to standard online classification, leveraging auditor feedback.
result Achieves sub-linear regret and fairness violations with stochastic data.
Proposes a deep learning method for modeling dynamic individual-level latent trajectories with changing parameters.
problem Modeling longitudinal data with changing individual-level dynamics parameters.
method Combines deep learning for dimensionality reduction and differential equations for dynamic modeling, allowing different parameters for sub-periods.
result Successfully identifies dynamic parameters and predictors of resilience.
We revisit the notion of individual fairness proposed by Dwork et al. A central challenge in operationalizing their approach is the difficulty in eliciting a human specification of a similarity metric. In this paper, we propose an operationalization of individual fairness that does not rely on a human specification of …
Sensitivity analysis for individualized effects in OTRs with binary risk factors.
problem Addressing omitted confounding in individualized effects of OTRs.
method Simulation-based sensitivity analysis to simulate unmeasured confounders.
result Benchmarking the strength of omitted confounding for binary risk factors.
New model recommends stocks considering individual preferences and diversification.
problem Inaccurate stock price predictions and ignoring investment theories.
method Portfolio Temporal Graph Network Recommender (PfoTGNRec) incorporating diversification-enhancing sampling.
result PfoTGNRec outperforms state-of-the-art models in real-world data.
Paper proposes a method to optimize policies for diverse individuals using heterogeneous data.
problem Learning optimal policies for a heterogeneous population from pre-collected data.
method Individualized offline policy optimization framework for heterogeneous MDPs.
result The proposed P4L algorithm achieves a fast rate of average regret.
Investigates fairness in pipeline models where individuals may drop out.
problem Fairness in pipeline models where individuals may drop out and subsequent stages depend on remaining individuals.
method Rigorous framework for evaluating fairness guarantees, showing that naïve auditing is insufficient and dependence must exist between stages.
result Fairness in pipelines can be arbitrary, even with just two stages, and requires dependence between stages.
Develops verifiers to check if machine learning models treat similar individuals equally.
problem Ensuring fairness in machine learning models by checking if similar individuals are treated differently.
method Constructs verifiers for proving individual fairness of machine learning models, considering relaxations of the problem.
result Developed verifiers for linear and kernelized polynomial/radial basis function classifiers.
Proposes a new model for estimating individual treatment effects.
problem Estimating individual treatment effects from observational data is challenging.
method Integrates diffusion modeling and conformal inference with propensity score and covariate approximation.
result Establishes rigorous theoretical guarantees and demonstrates competitive performance.
We provide scientific foundations for athletic performance prediction on an individual level, exposing the phenomenology of individual athletic running performance in the form of a low-rank model dominated by an individual power law. We present, evaluate, and compare a selection of methods for prediction of individual …
New method for individual claims reserving using machine learning.
problem Traditional claims reserving methods are limited in individual claim prediction.
method Restructured data utilization for CL prediction, using multi-period factors.
result Neural networks applied for individual claims reserving.
Gradient boosting method enforced with individual fairness.
problem Enforcing fairness in machine learning models.
method Functional gradient descent on robust loss function.
result Algorithm converges globally and generalizes.
Revises individual fairness by finding a fair metric for a model.
problem Difficulties in specifying a suitable fairness metric a priori.
method Introduces minimal metrics and applies randomized smoothing from adversarial robustness.
result Adapting minimal metrics to complex models yields interpretable fairness guarantees.
A distinction has been drawn in fair machine learning research between `group' and `individual' fairness measures. Many technical research papers assume that both are important, but conflicting, and propose ways to minimise the trade-offs between these measures. This paper argues that this apparent conflict is based on…
Paper introduces a method to learn physics between digital twins using imperfect models.
problem Learning physics from imperfect data and low-fidelity models.
method Bayesian Hierarchical modeling with physics-informed Gaussian processes.
result Models learning between digital twins are less uncertain than independent models but not over-confident.
Whereas previous post-processing approaches for increasing the fairness of predictions of biased classifiers address only group fairness, we propose a method for increasing both individual and group fairness. Our novel framework includes an individual bias detector used to prioritize data samples in a bias mitigation a…
New algorithm reduces individual regret and communication costs in cooperative bandits.
problem Optimal individual and group regret in cooperative multi-agent bandits.
method Integrates a new communication policy into a learning algorithm.
result Achieves optimal individual regret and constant communication costs.
The paper tackles individual fairness in ML models, developing statistical methods to detect bias.
problem Detecting and measuring violations of individual fairness in machine learning models.
method Formalizing the problem as adversarial attack, developing inference tools for the adversarial cost function.
result Statistical methods to assess and test hypotheses of model fairness with non-coverage error rate control.
A new method models individual survival curves using conditional normalizing flows.
problem Precise per-individual predictions in survival analysis.
method Conditional normalizing flows for flexible and individualized survival distributions.
result Efficient estimation of individual survival curves without overfitting.
Since many critical decisions impacting human lives are increasingly being made by algorithms, it is important to ensure that the treatment of individuals under such algorithms is demonstrably fair under reasonable notions of fairness. One compelling notion proposed in the literature is that of individual fairness (IF)…
A new privacy accountant for Gaussian differential privacy measures individual privacy losses.
problem Bounding differential privacy loss for each participant in data analysis.
method Developed a privacy accountant for adaptive compositions of randomised mechanisms using Gaussian differential privacy.
result Provided optimal bounds for the Gaussian mechanism and constructed an approximative individual privacy accountant.
We investigate the strength and the direction of information transfer in the U.S. stock market between the composite stock price index of stock market and prices of individual stocks using the transfer entropy. Through the directionality of the information transfer, we find that individual stocks are influenced by the …