New collaborative algorithm improves personalized mean estimation in online settings.
problem Online estimation of means from multiple, possibly overlapping distributions.
method Novel collaborative strategy for active querying and mean estimation.
result Algorithm improves mean estimates through communication among agents.
Private mean estimation with multiple samples requires a certain number of people to maintain privacy.
problem Private mean estimation with person-level differential privacy for multiple samples.
method The approach involves estimating the mean up to a distance α in ℓ_2-norm under ε-differential privacy, using algorithms based on the clip-and-noise framework and new analyses.
result The necessary and sufficient number of people to estimate the mean up to distance α in ℓ_2-norm is given by a specific formula.
This study optimizes model averaging for personalized collaborative learning.
problem Differences in data or objectives between nodes in federated learning.
method Weighted averaging between local and global models for scalar mean estimation.
result There is always some positive model averaging that reduces expected squared error.
In this paper we tackle the problem of estimating the power-law tail exponent of income distributions by using the Hill's estimator. A subsample semi-parametric bootstrap procedure minimising the mean squared error is used to choose the power-law cutoff value optimally. This technique is applied to personal income data…
Estimates personalized treatment response curves using covariates.
problem Flexible estimation of personalized treatment response curves.
method Sieve based nonparametric estimator of smoothed regimen-response curve function.
result Asymptotic linearity and undersmoothing criteria for efficient estimation.
Generative framework unifies and improves personalized learning and estimation methods.
problem Statistical heterogeneity in client data motivates personalized learning models.
method Generative framework unifies and suggests new personalized learning and estimation algorithms.
result AdaPeD algorithm numerically outperforms known algorithms.
Study improves privacy in cross-silo federated learning by personalizing data.
problem Privacy concerns in cross-silo federated learning.
method Introduced sample-level differential privacy for silos, analyzed mean-regularized multi-task learning.
result Mean-regularized multi-task learning is a strong baseline for cross-silo federated learning under stronger privacy requirements.
New approach for pricing evaluation improves on existing methods.
problem Improving off-policy evaluation for personalized pricing.
method Balanced policy evaluation framework with worst-case optimization.
result Empirical advantage over existing methods in pricing applications.
Explanation in machine learning and related fields such as artificial intelligence aims at making machine learning models and their decisions understandable to humans. Existing work suggests that personalizing explanations might help to improve understandability. In this work, we derive a conceptualization of personali…
OTSS learns personalized decision weights from logged decisions and outputs.
problem Learning context-specific decision weights from logged decisions and outputs.
method Output-targeted soft-segmentation model that deploys personalized decision-ready weight vectors.
result OTSS achieves the lowest mean regret in benchmark settings.
New algorithms allocate sampling budget to estimate group means without exploration.
problem Allocate sampling budget to estimate means of multiple groups.
method Design exploration-free non-adaptive and adaptive algorithms.
result Prove tighter regret bounds for multi-group mean estimation.
Study tackles contamination and heterogeneity in multi-task learning, improving robustness and personalization.
problem Challenges in integrating related tasks due to contamination and heterogeneity.
method Proposes a filtering-based robust multi-task gradient descent method to estimate global and clean task-specific minimizers.
result Demonstrates improved robustness and personalization compared to existing methods.
Develops deep jump learning for continuous treatment OPE.
problem Estimating mean outcomes under new treatment rules using historical data from different rules.
method Adaptive deep discretization of continuous treatment space using deep learning and multi-scale change point detection.
result Validated method through theoretical results, simulations, and real application to Warfarin Dosing.
Proposes a deep spectral Q-learning for mobile health data.
problem Personalized treatment assignment for patients with time-varying covariates.
method Integrates PCA with deep Q-learning for mixed frequency data.
result Mean return converges to optimal under estimated optimal policy.
FMP improves personalized ASR models on private devices.
problem Limited accuracy and privacy in federated fine-tuning of ASR models.
method FMP estimates global and personalized marginal distributions and adjusts NNLM probabilities.
result FMP achieves modest WER reductions on ASR rescoring tasks.
Real-time personalization for HAR models learns from new users without prior data.
problem Poor performance of HAR models on new users without labeled data.
method Incremental online domain adaptation using batch normalization.
result Personalized HAR models adapt to new users in real-time.
DeepCoDA provides personalized interpretability for complex health data.
problem Interpreting complex health data, especially compositional data, is challenging.
method DeepCoDA framework for high-dimensional compositional data, personalized interpretability through patient-specific weights.
result DeepCoDA maintains state-of-the-art performance and provides coherent, personalized interpretations.
New method evaluates personalized treatment in critical care, robust to death.
problem Truncation by death in critical care makes traditional DTR evaluation ineffective.
method Principal stratification-based approach, focusing on always-survivor value function, with a semiparametrically efficient, multiply robust estimator.
result Demonstrates robustness and efficiency of the method for personalized treatment optimization.
New methods optimize personalized treatment assignment in trials with many arms.
problem Poor performance of standard methods in trials with many treatment arms.
method Regularized and clustered joint assignment forest algorithm.
result Gains in predicting arm-wise outcomes and utility gains from personalization.
New method for personalized pricing using invalid instrumental variables.
problem Personalized pricing under endogeneity with limited standard methods.
method PRINT method for continuous treatment, solving conditional moment restrictions.
result Established optimal pricing strategy under endogeneity with invalid instrumental variables.
IPGP framework improves psychological assessment by integrating shared and unique traits.
problem Tackles the debate on shared vs unique personality traits across individuals.
method Uses Gaussian process coregionalization model for non-Gaussian ordinal data, with stochastic variational inference for scalability.
result Improves prediction and estimation of individualized factor structures compared to existing methods.
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.
The paper compares clustering techniques for personalized food kits.
problem Designing food kits that match individual consumer preferences.
method Comparative analysis of clustering techniques using conjoint analysis data.
result SVD clustering outperforms k-means in personalized food kit design.
Algorithm generates private continuous-time data for sensitive domains.
problem Private generation of continuous-time data for sensitive domains.
method Mean-field Langevin dynamics and noisy particle gradient descent.
result Strong privacy guarantees for one-time data contributions.
This paper improves federated learning for industrial predictive analytics by accommodating client heterogeneity.
problem Traditional federated models assume homogeneity in degradation processes, which doesn't apply to industrial settings.
method Personalized federated prognostic model using proximal gradient descent algorithm for joint parameter estimation.
result The proposed model enhances performance and provides comprehensive failure time distributions.
Uplift modeling is aimed at estimating the incremental impact of an action on an individual's behavior, which is useful in various application domains such as targeted marketing (advertisement campaigns) and personalized medicine (medical treatments). Conventional methods of uplift modeling require every instance to be…
Efficient Bayesian FL method improves predictive accuracy and uncertainty estimates.
problem Federated Learning with model and predictive uncertainty and personalization.
method Second-order optimization approach for Bayesian FL.
result Improved predictive accuracies and uncertainty estimates.
Develops c-GNF for personalized social science policy analysis.
problem Challenges in estimating causal effects and counterfactual inference in social sciences.
method causal-Graphical Normalizing Flow (c-GNF) method.
result c-GNF performs well in estimating causal effects and counterfactual inference.
PerSense assesses personality traits from text for commonsense reasoning.
problem Estimating human personality traits from text for mental health analysis.
method Aggregated Probability Density Functions (PDF) and Machine Learning (ML) models.
result PerSense algorithms achieve comparable results to ground truth data, with high accuracy for personality assessment and commonsense prediction.
The average and median income dependence on work experience and time is analyzed and modeled for the USA. The original data set providing the mean and median income estimates in 10 year long intervals spans a long time period of almost 35 years ? from 1967 to 2003. A microeconomic model linking personal income, populat…
Object tracking is an ubiquitous problem that appears in many applications such as remote sensing, audio processing, computer vision, human-machine interfaces, human-robot interaction, etc. Although thoroughly investigated in computer vision, tracking a time-varying number of persons remains a challenging open problem.…
Tree-based model averaging improves CATE estimation from diverse sites.
problem Limited sample size and privacy concerns prevent accurate personalized treatment effect estimation.
method Tree-based model averaging approach to estimate CATEs from multiple heterogeneous sites.
result Improved accuracy in estimating conditional average treatment effects (CATEs) across sites.
QR-learner estimates individual treatment effects using external data.
problem Limited power to detect individual treatment effects in randomized trials.
method Model-agnostic learner that estimates conditional average treatment effects (CATE) using external data.
result QR-learner reduces mean squared error and can recover true CATE.
Continuous, ubiquitous monitoring through wearable sensors has the potential to collect useful information about users' context. Heart rate is an important physiologic measure used in a wide variety of applications, such as fitness tracking and health monitoring. However, wearable sensors that monitor heart rate, such …
The Black-Litterman model combines investors' personal views with historical data and gives optimal portfolio weights. In this paper we will introduce the original Black-Litterman model (section 1), we will modify the model such that it fits in a Bayesian framework by considering the investors' personal views to be a d…
Optimizes LLM prompts using logged user feedback.
problem Naive approaches to optimizing LLM prompts suffer from high variance and bias.
method Kernel-based off-policy gradient method leveraging sentence similarity.
result Substantially reduces variance and suppresses bias in optimizing prompts.
Kernel method optimizes personalized dose rules for patients.
problem Finding optimal individualized dose rules for patients.
method Kernel assisted learning method for estimating optimal dose rules.
result The method identifies the optimal individualized dose rule and produces favorable outcomes.
Two algorithms improve Federated RL in diverse environments.
problem Collaborative learning in environments with varying dynamics.
method Proposed two federated RL algorithms, QAvg and PAvg, and a personalization heuristic.
result Achieved better performance and generalization in diverse environments.
The paper analyzes how investors' wealth can decline collectively under partial information.
problem Investors' wealth can decline collectively under partial information.
method The paper derives a Nash equilibrium for mean-variance portfolio selection under relative performance criteria, considering both full and partial information.
result Relative performance criteria can lead to downward self-reinforcement of investors' wealth, which is more pronounced under partial information.
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.
CAPITAL algorithm identifies optimal patient subgroups for better treatment.
problem Identify maximum number of patients benefiting from better treatment.
method Constrained Policy Tree Search (CAPITAL) algorithm to find optimal subgroup selection rule (SSR).
result Maximizes the number of patients with enhanced treatment effects.
A new method models user-specific parameters as a low-rank plus sparse component for efficient personalization.
problem Efficient personalization of machine learning models for individual users.
method Meta-learning approach that models network weights as a sum of low-rank and sparse components.
result The proposed method, AMHT-LRS, achieves nearly optimal sample complexity for estimating the low-rank and sparse components.
New meta-learners estimate time-varying treatment effects without model assumptions.
problem Estimating treatment effects over time in personalized medicine.
method Model-agnostic meta-learners for weighted pseudo-outcome regressions.
result Comprehensive theoretical analysis and practical insights for choosing meta-learners.
New algorithms protect user data while optimizing personalized decisions.
problem Personalized decision-making with private user data.
method Developed LDP algorithms for stochastic generalized linear bandits using SGD and OLS.
result Achieved the same regret bound as non-privacy settings with LDP.
Efficient algorithm for learning from indirect feedback in complex decision-making scenarios.
problem Learning from indirect feedback in realistic scenarios with personalized mechanisms.
method IGW algorithm for policy optimization, extending reward-estimator construction from single-step to multi-step.
result Achieves sublinear regret guarantee for contextual episodic MDPs with personalized feedback.
Proposes first privacy-preserving method for estimating Hawkes processes.
problem Estimating point process models with sensitive personal data raises privacy concerns.
method Proposes differential privacy for event stream data and two optimization algorithms.
result Efficiently estimates Hawkes process models with privacy and utility guarantees.
In designing personalized ranking algorithms, it is desirable to encourage a high precision at the top of the ranked list. Existing methods either seek a smooth convex surrogate for a non-smooth ranking metric or directly modify updating procedures to encourage top accuracy. In this work we point out that these methods…
Item recommendation is the task of predicting a personalized ranking on a set of items (e.g. websites, movies, products). In this paper, we investigate the most common scenario with implicit feedback (e.g. clicks, purchases). There are many methods for item recommendation from implicit feedback like matrix factorizatio…