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.
Personalized adaptation improves building-specific energy forecasting.
problem Building-specific temporal behavior is lost in fully shared adapters, and local adaptation discards cross-building transfer.
method Proposes a personalized federated sparse adaptation framework with a heterogeneous temporal mixture-of-experts (MoE) adapter.
result Personalization consistently outperforms Global FL-MoE and Local MoE across 50 buildings and three TSFM backbones.
Guarantees for third-person imitation learning from offline data.
problem Improving generalizability in imitation learning.
method Problem-dependent statistical learning guarantees for third-person imitation from offline observation.
result Strong performance guarantees for transferred policies in the offline setting.
IntelligentPooling learns personalized mHealth policies from limited data.
problem Challenges in personalizing mHealth policies with limited user data and noise.
method Adaptive use of other users' data to learn personalized policies.
result Achieves 26% lower regret compared to state-of-the-art approaches.
Personalized navigation system for visually impaired users improves accuracy and adaptability.
problem Inconsistent navigation guidance for visually impaired users.
method Model-based reinforcement learning framework with weighted experts model for personalization and transfer learning.
result Improved long-term human behavior prediction and quick adaptation for new users.
Adaptive system diversifies and personalizes visual browsing for better user engagement.
problem Poor performance of search queries in ambiguous or inspirational browsing scenarios.
method Bayesian regression for scoring relevance, submodular diversification, and personalized category preferences learned from user behavior.
result Significant improvement in click-through-rate and session duration on live traffic.
Experiment sets personalized emotion baselines for real-life prediction.
problem Establishing reliable ground-truth estimates for real-life emotion recognition.
method Controlled experiment with adaptive stimuli selection and user feedback.
result 85% accuracy in predicting emotional state with few features.
System learns to combine multiple model components for personalized text generation.
problem Adapting and biasing language models for personal preferences.
method Combines model-defined components, learns activation and probability combination from unlabeled text.
result Directly generates text with personalized components from unlabeled data.
A new algorithm learns optimal personalized treatment plans online with low regret.
problem Learning optimal dynamic treatment regimes in an online setting.
method Developed a novel algorithm balancing exploration and exploitation for rate-optimal regret.
result Guaranteed rate-optimal regret for linear transition and reward models.
PCL tackles collaborative learning for diverse agents, reducing sample complexity.
problem Balancing collaborative speedup with personalization for heterogeneous agents.
method AffPCL, with bias and importance correction mechanisms.
result AffPCL reduces sample complexity by a factor of max { n − 1 , δ } \max\{n^{-1}, δ\} max { n − 1 , δ } , where n n n is the number of agents and δ ∈ [ 0 , 1 ] δ\in[0,1] δ ∈ [ 0 , 1 ] measures heterogeneity. A simple unsupervised approach for cross-domain person re-identification.
problem Challenges in domain adaptation for person re-identification.
method Self-similarity Grouping (SSG) approach to learn pseudo identities from unlabeled samples.
result Significant improvement in mAP performance compared to state-of-the-art methods.
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.
Adaptive clustering and personalization algorithms minimize regret in multi-agent stochastic linear bandits.
problem Minimizing regret in a multi-agent stochastic linear bandits framework with user heterogeneity.
method Proposes a novel algorithm that refines cluster identities and minimizes regret, adapting to cluster separation and user parameter deviations.
result Regret scales as O ( T / N ) \mathcal{O}(\sqrt{T/N}) O ( T / N ) for well-separated clusters and O ( T 1 2 + ε / ( N ) 1 2 − ε ) \mathcal{O}(T^{\frac{1}{2} + \varepsilon}/(N)^{\frac{1}{2} -\varepsilon}) O ( T 2 1 + ε / ( N ) 2 1 − ε ) for poorly separated clusters. Personalized Gaussian Process predicts Alzheimer's disease progression better than traditional methods.
problem Predicting Alzheimer's disease progression accurately for individual patients.
method A personalized Gaussian Process model (pGP) that adapts to each patient's data over time.
result The pGP model outperforms traditional Gaussian Process models in forecasting future clinical status and cognitive scores.
Federated Learning can benefit from Model Agnostic Meta Learning for personalized models.
problem Personalizing models for diverse devices in Federated Learning.
method Interpreted Federated Averaging as a meta learning algorithm and applied MAML principles.
result Personalized models trained with Federated Averaging are easier to fine-tune and achieve higher accuracy.
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.
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…
RL platform enhances user journeys in healthcare apps.
problem Improving user experience and personalization in healthcare apps.
method Reinforcement learning framework for adaptive interventions.
result Significant increase in basket size through personalized recommendations.
Personalized federated learning adapts models to each user's data.
problem Training models across users without data exchange leads to a common model, not personalized.
method Develops a personalized federated learning approach using Model-Agnostic Meta-Learning (MAML).
result Personalized models can be adapted by a few gradient descent steps on local data.
CoLoRA leverages task similarity to boost fine-tuning efficiency.
problem Efficiently fine-tuning large foundation models with scarce labeled data.
method CoLoRA trains a shared adapter for task similarity and personalized adapters for user-specific tasks.
result CoLoRA significantly boosts fine-tuning performance when tasks are similar.
Curiosity-driven recommendations improve personalized learning efficiency and enjoyment.
problem Improving personalized learning through adaptive strategies.
method Curiosity-driven reinforcement learning with actor-critic neural networks.
result Demonstrated through numeric analyses, the proposed method enhances learning efficiency and enjoyment.
Group personalization improves FL performance in heterogeneous client data.
problem Mitigating client drift in federated learning with heterogeneous data.
method Fine-tuning a global FL model over homogeneous groups of clients, then personalizing each group's model.
result The proposed method achieves superior personalization performance compared to other FL approaches.
IA-BMA adapts model weights to inputs for better predictions.
problem Predicting with multiple models in heterogeneous settings.
method Input adaptive Bayesian Model Averaging (IA-BMA) with an input adaptive prior and amortized variational inference.
result IA-BMA consistently delivers more accurate and better-calibrated predictions.
Unified proof for scalable personalized federated learning.
problem Personalized federated learning under asynchronous updates.
method Unified proof for asynchronous federated learning with bounded staleness applied to MAML and ME personalization frameworks.
result Unified proof for convergence to first-order stationary point for smooth and non-convex functions.
LP-FT improves personalized model training in FL by balancing generalization and personalization.
problem Federated Learning struggles with balancing global generalization and local personalization due to non-identical data distributions.
method Adapting Linear Probing followed by full Fine-Tuning (LP-FT) to the FL setting.
result LP-FT outperforms standard fine-tuning in balancing personalization and generalization across various datasets and PFT variants.
Personalized model improves ADAS-Cog13 cognitive score forecasting.
problem Improving accuracy in predicting cognitive changes in Alzheimer's Disease.
method Meta-Weighted Gaussian Process Experts (pGPE) model for personalized forecasting.
result Meta-weighting of expert models leads to significant improvements in forecasting accuracy.
The paper presents a method for personalized exercise recommendations that improves learner skill gain.
problem Adapting to individual needs in large, diverse groups of learners in digital environments.
method Contextual Thompson Sampling to select exercises that advance learner skill.
result The method recommends exercises associated with greater skill improvement and adapts to learner differences.
Robo-advisor improves investment advice through client interaction.
problem Offering personalized financial advice to clients.
method Adaptive mean-variance portfolio optimization with client interaction.
result Optimal investment strategy includes both myopic and intertemporal hedging terms.
Adaptive time decay functions improve financial product recommendation accuracy.
problem Inaccurate recommendations due to static historical data in finance.
method Time-dependent collaborative filtering with personalized decay functions.
result Significant improvements over state-of-the-art benchmarks in financial product recommendation.
Adapts attention to supervised learning for personalized predictions.
problem Personalized predictions for each data point with model simplicity.
method Local model fitting with attention weighting for tabular data.
result Attention weighting improves predictive performance and preserves interpretability.
A new method for tighter privacy loss accounting in adaptive analyses.
problem Ensuring individual privacy in adaptive analyses while staying within a privacy budget.
method A personalized privacy loss estimate and a Rényi differential privacy filter.
result Personalized privacy loss accounting can be practical and tighter than existing methods.
Personalized education at scale improves student outcomes.
problem Traditional personalized education is expensive and inequitable.
method Adapting educational presentations using RL, semi-supervised learning, NLP, and CV.
result Personalized education at scale can improve student outcomes.
Model user preferences for conversational LLMs using weak rewards.
problem Lack of persistent user models in conversational LLMs leading to repeated user restatements.
method Vector-Adapted Retrieval Scoring (VARS) framework that updates user vectors online from weak scalar rewards.
result Full VARS agent achieves strongest overall performance, matches strong Reflection baseline in task success, and reduces user effort.
Dynamic question ordering improves survey completion and imputation quality.
problem Engage respondents and collect complete information for accurate imputations.
method Personalized question order based on earlier responses to maximize survey completion and imputation quality.
result Personalized question order increases survey completion and imputation quality.
FAWMF adapts weights for implicit feedback recommendation efficiently.
problem Challenges in treating unobserved data as negative in implicit feedback recommendation.
method FAWMF uses a variational auto-encoder with a parameterized neural network to adaptively assign personalized data confidence weights, and fBGD for efficient learning.
result FAWMF and fBGD outperform existing methods in real-world datasets.
New algorithm for real-time personalized health interventions.
problem Lack of methodological guidance for JITAI.
method Formulates JITAI as contextual bandit problem, uses actor-critic approach.
result Developed online actor-critic algorithm for JITAI.
New AI model optimizes personalized care for elderly residents.
problem Limited care workforce impacts health outcomes and quality of life.
method Bandit algorithms for personalized care planning.
result Improves care quality and health outcomes through personalized care planning.
Personalizes pre-trained models for nonparametric regression with limited data.
problem Improving data efficiency in nonparametric regression with few samples.
method Develops a theoretical framework and algorithms for few-shot personalization of black-box models.
result Achieves minimax optimal rate for personalization in nonparametric regression.
RB-Modulation trains free diffusion models without external adapters.
problem Training-free personalization of diffusion models with style and content control.
method Stochastic optimal control with a style descriptor and cross-attention aggregation.
result Precise content and style extraction and control without external adapters.
ACNet improves CNNs by adaptively connecting feature nodes.
problem Improving traditional CNNs for better performance and handling non-Euclidean data.
method Adaptively connects feature nodes to switch between global and local inference.
result ACNet achieves state-of-the-art performance and overcomes limitations of MLP and CNN.
CSEAL uses cognitive structure to personalize learning paths.
problem Personalized learning paths based on learners' evolving knowledge levels and item structures.
method CSEAL integrates knowledge levels and item structures using a Markov Decision Process and actor-critic algorithm.
result CSEAL effectively personalizes learning paths, improving learning outcomes.
GAMBITTS uses GenAI for adaptive interventions, improving decision-making.
problem Adaptive interventions with GenAI-generated content.
method Generator-mediated bandit-Thompson sampling (GAMBITTS).
result GAMBITTS outperforms standard bandit methods in mobile health interventions.
SPIRE enables efficient federated learning for diffusion models by separating client-specific embeddings from a shared backbone.
problem Large diffusion models are impractical for federated learning due to their size.
method SPIRE separates the network into a global backbone and client-specific embeddings, enabling efficient finetuning.
result SPIRE achieves parameter-efficient finetuning, updating only a small fraction of weights.
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 i l d e Δ ildeΔ i l d e Δ being the constraint-aware sub-optimality gap. A new method for online personalized learning reduces gradient variance by dynamically selecting peers.
problem Online personalized decentralized learning with statistically heterogeneous clients.
method Gradient-based collaboration criterion allowing clients to dynamically select peers with similar gradients.
result The method acts as a variance reduction method, achieving optimal performance in certain conditions.
A new algorithm for personalized recommendations adapts to changing user interests.
problem Adapting to time-varying user interests in recommendation systems.
method Contextual bandit approach with models for disjoint and hybrid payoffs.
result Sublinear regret in time length T for abrupt reward changes.
A nonparametric pricing policy learns customer preferences from covariates without prior assumptions.
problem Lack of historical data limits personalized pricing for new businesses.
method Nonparametric pricing policy that clusters customers based on covariates and preferences.
result Regret of order O ( log ( T ) 2 T ( 2 + d ) / ( 4 + d ) ) O(\log(T)^2 T^{(2+d)/(4+d)}) O ( log ( T ) 2 T ( 2 + d ) / ( 4 + d ) ) for a finite horizon T T T . FiT combines transfer and meta-learning for efficient few-shot image classification.
problem Few-shot image classification in personalized and federated learning settings.
method Combines transfer learning and meta-learning with fixed pretrained backbones and fine-tuned FiLM adapter layers.
result Achieves state-of-the-art accuracy on VTAB-1k benchmark with fewer than 1% of updateable parameters.