System interprets complex treatment effects for personalized policies.
problem Complex, hard-to-understand treatment effect models.
method Scalable, interpretable personalized experimentation system.
result Learned explanations and generated interpretable policies.
Estimates personalized policies robust to shifts in target populations.
problem Estimating policies that perform well in diverse target populations.
method Develops methods for estimating robust policies considering shifts in outcomes and characteristics.
result Welfare-maximizing policies are robust to certain shifts in potential outcomes.
Existing Recommender Systems mainly focus on exploiting users' feedback, e.g., ratings, and reviews on common items to detect similar users. Thus, they might fail when there are no common items of interest among users. We call this problem the Data Sparsity With no Feedback on Common Items (DSW-n-FCI). Personality-base…
pFedMe uses Moreau envelopes to improve personalized FL performance.
problem Statistical diversity among clients limits FL performance.
method pFedMe employs Moreau envelopes as clients' regularized loss functions in a bi-level optimization problem.
result pFedMe achieves state-of-the-art convergence rates and superior empirical performance.
Recent advances in spoken language technologies and the introduction of many customer facing products, have given rise to a wide customer reliance on smart personal assistants for many of their daily tasks. In this paper, we present a system to reduce users' cognitive load by extending personal assistants with long-ter…
Wi-Fi signals-based person identification attracts increasing attention in the booming Internet-of-Things era mainly due to its pervasiveness and passiveness. Most previous work applies gaits extracted from WiFi distortions caused by the person walking to achieve the identification. However, to extract useful gait, a p…
Personalized sleep staging achieved with single-night data using KL-divergence regularization.
problem Improving automatic sleep staging accuracy with limited single-night data.
method KL-divergence regularization for transfer learning from a pretrained model to a personalized model.
result Personalized sleep staging accuracy of 79.6% with KL-divergence regularization.
This paper improves federated learning by selecting between global and personalized models based on uncertainty.
problem Inherent heterogeneity and diverse data distributions in federated learning.
method Introduces a new approach to federated learning that models predictive uncertainties to select between global and personalized models.
result The model performs better on out-of-distribution data and on par with state-of-the-art personalized federated learning algorithms in standard scenarios.
A new framework designs experiments for better decision-making.
problem Suboptimal experimental designs for downstream decision-making.
method Amortized decision-aware Bayesian Experimental Design (BED) with Transformer Neural Decision Process (TNDP).
result TNDP effectively designs experiments and facilitates accurate decision-making.
GEAR uses auxiliary data to estimate optimal decisions in studies with limited primary outcomes.
problem Estimating optimal decisions when primary outcomes are not available in experimental samples.
method GEAR uses augmented inverse propensity weighting to estimate optimal decisions based on auxiliary data.
result GEAR estimators and value estimators have established asymptotic properties and are validated in simulations and a real application.
Paper proposes a novel MTL framework for personalized modeling of diverse individuals.
problem Personalized modeling of heterogeneous subpopulations with high-dimensional data.
method Low-rank tensor decomposition for multi-task learning.
result Superior performance compared to benchmarks in diverse subpopulation scenarios.
Aims to improve personalized treatment decisions through Bayesian experimental design.
problem Evaluating and improving personalized treatment decisions in contexts like customer service.
method Model-agnostic Bayesian Experimental Design to efficiently gather data and avoid highly sub-optimal treatments.
result Our method achieves superior performance in evaluating and improving treatment decisions compared to traditional approaches.
FLowDUP trains personalized models with unlabeled clients in low dimensions.
problem Training personalized models on clients with only unlabeled data.
method FLowDUP uses a forward pass with unlabeled data and a transductive PAC-Bayesian bound to generate personalized models in a low-dimensional subspace.
result FLowDUP enables efficient communication and computation with personalized models generated from unlabeled data.
Paper tackles gene mutation prediction for HCC using multi-instance multi-label learning.
problem Gene mutation prediction in hepatocellular carcinoma for personalized treatments.
method Multi-instance multi-label learning with oversampling for data imbalance.
result Proposed approach shows superiority in gene mutation prediction.
A new system combines vision and language for person re-identification.
problem Real-world surveillance lacks visual data for person re-identification.
method Two-stream CNN framework with shared logits, CCA for modalities, multi-modal testing protocol.
result 22% improvement in re-identification performance with multi-modal queries.
Person recognition aims at recognizing the same identity across time and space with complicated scenes and similar appearance. In this paper, we propose a novel method to address this task by training a network to obtain robust and representative features. The intuition is that we directly compare and optimize the cosi…
The electronic calendar is a valuable resource nowadays for managing our daily life appointments or schedules, also known as events, ranging from professional to highly personal. Researchers have studied various types of calendar events to predict smartphone user behavior for incoming mobile communications. However, th…
Federated MTL learns personalized models under mixed distributions.
problem Heterogeneity of local data distributions leads to poor global model performance.
method Proposes federated MTL under mixture of distributions, using penalized optimization and federated EM-like algorithms.
result Models with higher accuracy and fairness than state-of-the-art methods.
A new algorithm improves federated learning by combining knowledge distillation and weighted combination loss.
problem Non-IID client data in federated learning leads to model drift and poor generalization.
method pFedKD-WCL integrates knowledge distillation with bi-level optimization to address non-IID challenges.
result pFedKD-WCL outperforms state-of-the-art algorithms in accuracy and convergence speed.
Optimizes recommendation models using skew normal distribution.
problem Improving personalized recommendation systems.
method Develops a new optimization criterion based on skew normal distribution.
result Significantly outperforms state-of-the-art models.
Convolutional autoencoders improve personalized recommendations from image-based data.
problem Lack of personalized recommendations in gastronomic platforms using image data.
method Used convolutional autoencoders to extract features from images and improve personalized recommendations.
result Convolutional autoencoders outperform standard deep features in image-based personalized recommendation systems.
An algorithm for efficient experimentation in a dynamic environment with personalized preferences and context drifts.
problem Efficiently recommending decisions to users with personalized preferences in a context where the environment is changing over time.
method Dri-MED, inspired from the linear version of the MED strategy, adapted to handle non-stationary heteroskedastic noise.
result The instance-dependent regret scales as $ ilde{\mathcal O}\left(\fracκ{ ildeΔ}d^2(\log(T)
ight)$, with ildeΔ being the constraint-aware sub-optimality gap. Proposes efficient data acquisition for personalized treatment effects from observational data.
problem Efficiently acquiring outcomes for personalized treatment effects in observational studies.
method Introduces causal, Bayesian acquisition functions to select points with overlapping support.
result Demonstrates improved sample efficiency and accuracy in learning personalized treatment effects.
Noise makes data unlearnable by tricking models.
problem Unauthorized exploitation of personal data by deep learning models.
method Error-minimizing noise to reduce training examples' learnability.
result Error-minimizing noise can make training examples unlearnable by deep learning models.
We describe a method for selecting relevant new training data for the LSTM-based domain selection component of our personal assistant system. Adding more annotated training data for any ML system typically improves accuracy, but only if it provides examples not already adequately covered in the existing data. However, …
PFedRL-Rep learns shared and personalized policies for heterogeneous environments.
problem Poor performance of single policy in heterogeneous environments.
method Develops PFedRL-Rep framework with shared feature representation and personalized weights.
result Proves linear convergence speedup with respect to the number of agents.
Graph neural networks improve cold start for new items in recommender systems.
problem Cold start problem for new items in recommender systems.
method Item hierarchy graphs and bespoke graph neural network architecture.
result Our method achieves better forecasting quality than state-of-the-art with comparable computational time.
New algorithms improve efficiency in learning from personalized rewards.
problem Learning from personalized rewards in recommendation systems.
method Developed provably efficient algorithms with sublinear regret for context-dependent feedback.
result Introduced a Lipschitz reward estimator that improves generalization performance.
Personalized interventions in social services, education, and healthcare leverage individual-level causal effect predictions in order to give the best treatment to each individual or to prioritize program interventions for the individuals most likely to benefit. While the sensitivity of these domains compels us to eval…
Footfall based biometric system is perhaps the only person identification technique which does not hinder the natural movement of an individual. This is a clear edge over all other biometric systems which require a formidable amount of human intervention and encroach upon an individual's privacy to some extent or the o…
The causal effect of a treatment can vary from person to person based on their individual characteristics and predispositions. Mining for patterns of individual-level effect differences, a problem known as heterogeneous treatment effect estimation, has many important applications, from precision medicine to recommender…
Recommender systems are widely used to predict personalized preferences of goods or services using users' past activities, such as item ratings or purchase histories. If collections of such personal activities were made publicly available, they could be used to personalize a diverse range of services, including targete…
XploVAE improves recommendation by balancing known and novel items.
problem Balancing known and novel items for better recommendations.
method Constructs user-specific subgraphs for exploitation and exploration, learns personalized item embeddings.
result Demonstrates effectiveness on various real-world datasets.
Predicting the patient's clinical outcome from the historical electronic medical records (EMR) is a fundamental research problem in medical informatics. Most deep learning-based solutions for EMR analysis concentrate on learning the clinical visit embedding and exploring the relations between visits. Although those wor…
A new algorithm optimizes local objectives in federated learning with heterogeneous clients.
problem Optimizing local objectives in federated learning with heterogeneous client data.
method Proposes PF-PNE algorithm with double elimination strategy.
result PF-PNE algorithm optimizes local objectives with arbitrary heterogeneity and protects client data confidentiality.
On most sponsored search platforms, advertisers bid on some keywords for their advertisements (ads). Given a search request, ad retrieval module rewrites the query into bidding keywords, and uses these keywords as keys to select Top N ads through inverted indexes. In this way, an ad will not be retrieved even if querie…
People belong to multiple communities, words belong to multiple topics, and books cover multiple genres; overlapping clusters are commonplace. Many existing overlapping clustering methods model each person (or word, or book) as a non-negative weighted combination of "exemplars" who belong solely to one community, with …
A new clustering framework optimizes customer search data for personalized travel recommendations.
problem Personalized travel recommendations based on customer search data.
method Multi-objective optimization-based clustering ensemble framework.
result Optimizes diversity in clustering ensemble search space and automatically determines the number of clusters.
Humans are able to imagine a person's voice from the person's appearance and imagine the person's appearance from his/her voice. In this paper, we make the first attempt to develop a method that can convert speech into a voice that matches an input face image and generate a face image that matches the voice of the inpu…
This paper improves privacy and fairness in federated learning by protecting sensitive data and ensuring group fairness.
problem Privacy and fairness issues in federated learning.
method Introduces group privacy through d-privacy, a localized form of differential privacy. result The method provides better group fairness than a global model in federated learning.
The growing trend of using wearable devices for context-aware computing and pervasive sensing systems has raised its potentials for quick and reliable authentication techniques. Since personal writing habitats differ from each other, it is possible to realize user authentication through writing. This is of great signif…
New insights into negative sampling for graph representation learning.
problem Challenges in generating high-quality graph representations for large node sets.
method Theoretical analysis and derivation of negative sampling distribution correlation, proposing MCNS method.
result The negative sampling distribution should be positively but sub-linearly correlated to the positive sampling distribution.
Neyman's framework evaluates personalized treatment rules using experiments.
problem Evaluating the efficacy of individualized treatment rules derived by machine learning.
method Neyman's repeated sampling framework applied to cross-fitted ITRs.
result Ex-post evaluation of ITRs can be more efficient than random assignment.
FedGradNorm improves federated MTL by balancing task learning speeds.
problem Statistical and data heterogeneity in federated MTL.
method Dynamic-weighting normalization of gradient norms.
result FedGradNorm achieves faster training performance and balanced datasets.
Though used extensively, the concept and process of machine learning (ML) personalization have generally received little attention from academics, practitioners, and the general public. We describe the ML approach as relying on the metaphor of the person as a feature vector and contrast this with humanistic views of th…
We consider a problem of ranking and selection via simulation in the context of personalized decision making, where the best alternative is not universal but varies as a function of some observable covariates. The goal of ranking and selection with covariates (R&S-C) is to use simulation samples to obtain a selection p…
New method learns credit prices offline without interaction.
problem Dynamic pricing of consumer credit.
method Offline deep reinforcement learning with Q-Learning.
result Effective personalized pricing policy learned without online interaction.
Adaptive personalized federated learning improves local model personalization.
problem Maximizing global model performance limits local model personalization.
method APFL algorithm trains local models while contributing to global model, with optimal mixing parameter and communication-efficient optimization.
result Demonstrates effectiveness of personalization schema and correctness of generalization theories.