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.
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.
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.
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.
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.
Method estimates group structure in panel data using variance information.
problem Estimating group structure in panel data with unknown groups.
method Proposes a method to estimate unobserved groupings for panel data models using variance information.
result Superior performance compared to existing methods in simulations and empirical applications.
New method extracts joint and individual signals from multi-view data.
problem Extract joint and individual signals from multi-view data.
method Double-matched matrix decomposition with optimization and iterative algorithm.
result Superior signal estimation performance compared to single-matching methods.
Proposes a model to handle mobile health data with irregular measurements.
problem Handling heterogeneous, multi-resolution data in mobile health.
method Individualized dynamic latent factor model for irregular multi-resolution time series data.
result Superior performance compared to existing methods in simulation and smartwatch data applications.
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.
Locally private Naive Bayes works for personal data.
problem Training Naive Bayes on personal data with privacy concerns.
method Local differential privacy, dimensionality reduction, and perturbation techniques.
result Naive Bayes accuracy maintained under local differential privacy.
Paper operationalizes individual fairness using side-information and a unified representation.
problem Difficulty in eliciting a human specification of a similarity metric for individual fairness.
method Proposes a Pairwise Fair Representation (PFR) model that learns from fairness graph and side-information.
result Unified PFR model effectively operationalizes individual fairness without human specification.
ContiVAE estimates individual dose-response curves from unobserved confounders using observational data.
problem Estimating causal effects of continuous treatments considering unobserved confounders.
method Variational auto-encoder with a Tilted Gaussian prior distribution modeling hidden confounders as latent variables.
result ContiVAE outperforms existing methods by up to 62% in predicting individual dose-response curves.
FAST-DAD distills complex ensemble models into faster, more accurate individual models.
problem Deploying complex AutoML ensemble predictors on tabular data is slow, large, and opaque.
method Data augmentation strategy based on Gibbs sampling from a self-attention pseudolikelihood estimator.
result FAST-DAD distillation produces significantly better individual models than standard training.
Efficient biclustering of tensor data for identifying similar signal patterns over time.
problem Identifying similar signal patterns over time in multi-dimensional data.
method Spectral decomposition to build biclusters.
result Quality of biclusters evaluated using synthetic and real data.
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.
Paper tackles estimating individual treatment effects from observational data.
problem Estimating the difference between outcomes with and without treatment from single observation.
method Formulated as inference from hidden variables, uses a model of four causal populations, proposes ECM algorithm.
result ECM algorithm provides better performance compared to baseline methods on synthetic and real-world data.
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.
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 methods predict walking patterns from accelerometer data.
problem Predicting individuals from walking data.
method Machine learning, inferential methods, multivariate functional regression.
result Prediction accuracy varies from 41% to 98%.
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.
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…
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.
Modeling individual cardiovascular responses from wearable sensor data.
problem Capturing and understanding cardiovascular responses to physical activity and sleep changes.
method Attentional convolutional neural network to learn signatures from minute-level sensor data.
result Generated signatures generalize and outperform baseline models in predicting cardiovascular variables.
New learning scheme outperforms ERM in individual data settings.
problem Learning from individual data samples.
method Information-theoretic approach using self-information loss.
result pNML scheme outperforms ERM in specific test challenges.
New method aligns brain data across individuals for better brain decoding.
problem Inter-individual variability in brain response patterns limits decoder generalization.
method SpectralOT method that embeds cortical geometry into Laplace-Beltrami eigenmodes.
result SpectralOT strikes balance between aligning functional features and preserving anatomical structure.
Framework infers coordination strategies from movement data.
problem Inferring individual movement strategies from group data.
method Formalizes Coordination Strategy Inference Problem; provides methodology to infer strategies.
result Framework accurately infers strategies in simulated and real-world datasets.
Study integrates diverse data sources to predict mental health conditions.
problem Predict individuals' mental health conditions using a heterogeneous network approach.
method Leverage a heterogeneous information network (HIN) to model social interaction, health data, and survey data. Apply recommender system (RS) and node classification (NC) paradigms to predict mental health states.
result RS and NC methods outperform traditional logistic regression models in predicting mental health conditions.
TCFimt forecasts causal effects of multiple interventions from individual data.
problem Estimating causal effects of temporal multi-interventions from individual data.
method TCFimt uses adversarial tasks in seq2seq framework to alleviate bias and contrastive learning to decouple effects.
result TCFimt outperforms state-of-the-art methods in predicting future outcomes and choosing optimal treatments.
Matrix estimation improves individual fairness without sacrificing performance.
problem Ensuring fairness in algorithmic decision-making.
method Using singular value thresholding (SVT) to preprocess data.
result SVT pre-processing improves IF guarantees and maintains performance.
The article presents methods to select models from behavioral learning data, with applications to contextual bandits.
problem Model selection for behavioral learning data, especially in non-stationary environments.
method Two model selection methods: a general hold-out procedure and an AIC-type criterion, adapted for non-stationary dependent data.
result Theoretical error bounds for these methods are close to those of the standard i.i.d. case.
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.
Unified theory for semiparametric data fusion with individual-level data.
problem Handling data fusion problems, especially in settings with diverse data sources and designs.
method Extending a comprehensive theory to handle conditional and marginal distribution alignments, providing universal results for influence functions and efficient influence functions.
result Paves the way for machine-learning debiased, semiparametric efficient estimation.
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.
Two simple methods learn fair metrics from data to improve fairness in ML tasks.
problem Lack of widely accepted fair metrics for many ML tasks hinders individual fairness adoption.
method Presented two simple ways to learn fair metrics from various data types.
result Fair training with learned metrics improves fairness on three ML tasks.
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.
Heteroskedasticity biases uplift model rankings, leading to inefficient treatment allocation.
problem Bias in uplift model rankings due to heteroskedasticity.
method Theoretical analysis and simulation on real-world data.
result Heteroskedasticity can cause individuals with high treatment effects to be ranked at the bottom, leading to inefficient treatment allocation.
New method improves fairness in biased predictions.
problem Improving fairness in biased classifier predictions.
method Individual bias detector prioritizes data samples for a bias mitigation algorithm.
result Superior performance in individual and group fairness on real-world datasets.
This work develops a model to distinguish network and covariate information.
problem Identifying unique network and covariate information.
method Low-rank model with two-step estimation: spectral method followed by refinement.
result The method accurately recovers joint and individual components.
The paper explores methods to personalize deep learning models.
problem Optimizing deep learning models for individual performance.
method Curriculum learning and data augmentation techniques.
result Personalized methods improve performance on individual data but degrade on general datasets.
CRISP predicts individual-level COVID-19 risk based on contact data.
problem Estimating individual-level infection risk during the pandemic.
method Probabilistic graphical model using SEIR framework with contact data.
result Model accurately predicts infection spread and recovery times.
We consider the problem of fitting a linear model to data held by individuals who are concerned about their privacy. Incentivizing most players to truthfully report their data to the analyst constrains our design to mechanisms that provide a privacy guarantee to the participants; we use differential privacy to model in…
A method for identifying joint and individual subspaces from multi-view data.
problem Unclear conditions for reliably identifying joint and individual subspaces from noisy, high-dimensional measurements.
method Rigorously quantifies conditions based on signal rank, principal angles, and noise levels. Characterizes spectrum perturbations of product of projection matrices.
result Estimates joint and individual subspaces more accurately than existing approaches in simulations and real-world applications.
Estimates individual treatment effects using gradient interpolation and kernel smoothing.
problem Estimating individualized continuous treatment effects in observational data.
method Augment training data with independently sampled treatments and inferred counterfactual outcomes using gradient interpolation and kernel smoothing.
result Our method outperforms state-of-the-art methods on counterfactual estimation error.
Optimizes personalized medicine prediction by individual tuning.
problem Predicting individual drug responses using genomic information.
method Introduces a new ridge estimator and tuning parameter calibration scheme.
result Optimal in terms of oracle inequalities, fast, and highly effective.
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.
Research in several fields now requires the analysis of data sets in which multiple high-dimensional types of data are available for a common set of objects. In particular, The Cancer Genome Atlas (TCGA) includes data from several diverse genomic technologies on the same cancerous tumor samples. In this paper we introd…
Technical report predicts eating and food purchasing behaviors of free-living individuals.
problem Predicting eating and food purchasing behaviors of free-living individuals.
method Applied multiple machine learning algorithms (Logistic Regression, RBF-SVM, Random Forest, Gradient Boosting) to minute-level features from sensors and environmental context.
result Gradient Boosting model had the highest mean accuracy score (0.7289) for predicting eating events before 0 to 4 minutes.
Optimizes contrastive learning with individualized temperatures for better performance on imbalanced datasets.
problem The common practice of using a global temperature parameter ignores the varying semantic similarity across different anchor data.
method Proposes a new robust contrastive loss inspired by distributionally robust optimization (DRO) and an efficient stochastic algorithm for automatic temperature individualization.
result Our method automatically learns a suitable temperature for each sample, improving performance on imbalanced datasets.