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.
POSL is an online learning algorithm for personalized predictions.
problem Real-time personalized predictions for streaming data.
method Online Super Learner algorithm that optimizes predictions with respect to baseline covariates.
result POSL provides reliable predictions and adapts to changing data environments.
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.
Paper introduces RTT2Vec for real-time grocery recommendations, achieving 9.4% uplift over baselines.
problem Personalized grocery recommendations to improve user experience and sales.
method RTT2Vec deep architecture for real-time recommendations, approximate inference technique.
result 9.4% uplift in prediction metrics over baseline models.
Personalized activity recognition improves performance for diverse users.
problem Poor performance of impersonal algorithms for individual users.
method Personalized activity recognition using deep embeddings from a fully convolutional neural network with triplet loss.
result Novel subject triplet loss provides the best performance overall.
CoNDA improves domain classification for IPDAs by incorporating new and personalized domains.
problem Continuous learning for new and personalized domains in IPDAs.
method Neural network based approach for incremental learning.
result CoNDA achieves high accuracy and outperforms baselines.
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. BanditLP optimizes personalized recommendations for large-scale systems.
problem Optimizing personalized recommendations for large-scale systems with constraints.
method Unified neural Thompson Sampling for learning and large-scale linear programming for action selection.
result Consistent gains over strong baselines in experiments and business win in LinkedIn's email marketing system.
Ditto improves fairness and robustness in federated learning.
problem Fairness and robustness in statistically heterogeneous federated learning networks.
method Personalized federated learning framework (Ditto) with a scalable solver.
result Ditto achieves competitive performance and superior fairness and robustness compared to existing methods.
Paper analyzes minimax risks of personalized federated learning algorithms.
problem Statistical heterogeneity among clients in federated learning.
method Minimax analysis of FedAvg and local training approaches.
result Threshold for optimality between FedAvg and local training depends on data heterogeneity.
Patient2Vec learns personalized deep EHR representations for better health outcomes prediction.
problem Complexities in EHR data hinder machine learning applications.
method Patient2Vec: A personalized deep learning framework for longitudinal EHR data.
result Patient2Vec achieves AUC of 0.799 in predicting future hospitalizations, outperforming baseline methods.
Paper tackles variable-length, incomplete wearable sensor data to improve personalized insights.
problem Variable-length and incomplete time series data from wearable sensors.
method HeartSpace integrates a time series encoding module and pattern aggregation network, along with a Siamese-triplet network for representation learning.
result Empirical evaluation shows significant performance gains in personality prediction, demographics inference, and user identification.
Proposes a method to learn from historical data for personalized decision-making.
problem Sample hunger in sequential decision-making algorithms for personalized medicine.
method Identifiable latent bandit framework using nonlinear independent component analysis.
result Optimal decision-making with shorter exploration time than classical bandits.
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.
Personal VAD detects target speaker voice activity efficiently.
problem Efficiently detect target speaker voice activity for reduced computational cost and battery usage.
method Trains a neural network conditioned on speaker embedding or verification score, outputs probabilities for three speech classes.
result Trained model with 130K parameters outperforms combined standard VAD and speaker recognition networks.
Mobile app improves speech recognition of names with user feedback.
problem Improving speech recognition of proper names on mobile devices.
method Data synthesis and user feedback for keyword-dependent metrics.
result User feedback can significantly improve speech recognition of names.
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. ConCare personalizes healthcare predictions by capturing EMR features.
problem Predicting patient outcomes from EMR data with personalization.
method Captures personal characteristics and time-aware distribution in EMR data.
result Improves healthcare prediction accuracy through personalized health context.
Proposes SROF for row-wise fusion in federated learning for multivariate responses.
problem Heterogeneous client models with shared variable-level structure.
method Sparse Row-wise Fusion (SROF) regularizer and RowFed algorithm.
result Empirically shows consistent error reduction and stronger variable-level cluster recovery.
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.
PROPS personalizes complex models for sequential data.
problem Personalizing complex models for sequential data.
method Pin black-box predictions to a hidden Markov model and learn probabilistic perturbations.
result PROPS achieves good customization with minimal data.
Deep learning predicts VR head movements for better 360-degree videos.
problem Predicting head movements in 360-degree VR videos.
method Deep learning network using position data and video content for long-term prediction.
result 16.1% improvement in prediction accuracy compared to baseline.
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.
Efficiently models agent dependencies in large social networks.
problem Challenges in incorporating inter-agent dependencies in social reinforcement learning models.
method Clusters users based on payoff and contribution, combines cluster-level policies with personalized agent-level policies, and uses dynamic clustering.
result Our approach learns more accurate policy estimates and converges more quickly than existing methods.
pFedGP uses Gaussian processes for personalized federated learning with improved kernel learning.
problem Learning personalized models across clients with limited data.
method pFedGP uses Gaussian processes with deep kernel learning, including a shared neural network kernel and inducing points.
result pFedGP achieves well-calibrated predictions and significantly outperforms baseline methods.
The paper proposes a policy learning framework for interpretable personalization.
problem Effective personalization of goods and services to improve revenues and maintain competitive edge.
method Policy learning with linear decision boundaries using causal inference and Bayesian optimization.
result The learned policy improves net sales revenue by 88.2% and provides insights into important features.
MobileNet-v2 improves re-ID on edge devices with mixed precision.
problem Real-time person re-identification in edge devices with limited resources.
method Mixed precision training (FP32 and FP16) for MobileNet-v2 on edge nodes.
result Mixed precision training improves inference throughput and reduces power consumption.
Algorithm learns from human demonstrations to schedule tasks efficiently.
problem Efficient resource scheduling in dynamic environments.
method Personalized apprenticeship learning framework infers decision-making criteria from heterogeneous human demonstrations.
result Achieves high accuracy in synthetic and real-world domains, outperforming baselines.
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.
Method predicts brain structure progression in Alzheimer's from baseline MRI.
problem Predicting longitudinal brain structure changes in Alzheimer's disease.
method Large deformation diffeomorphic metric mapping (LDDMM) with personalized trajectories.
result Method successfully predicts brain structure changes from baseline data.
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.
Improved action detection for multi-person videos using attention filtering.
problem Difficulty in distinguishing relevant parts of multi-person videos for action detection.
method Fovea attention filtering and generalized binary loss function.
result 20% relative improvement in mAP over baseline in AVA dataset.
Machine learning improves CAD management outcomes.
problem Current CAD guidelines do not account for patient-specific characteristics.
method Developed binary classifiers and regression models using patient data.
result Improved health outcomes by 24.11% compared to standard care.
Flatland is a simple 2D environment for reinforcement learning.
problem Testing and prototyping reinforcement learning agents.
method Simple, lightweight, customizable environment with physical properties.
result Baseline reinforcement learning agents can solve a navigation task in Flatland.
Estimates individual causal effects in the presence of unobserved confounders.
problem Learning CATE under unconfoundedness violations.
method Develops a functional interval estimator that predicts bounds on individual causal effects.
result Sharp interval estimator converges to tightest bounds on CATE.
Safe algorithm for contextual linear bandits reduces regret.
problem Safety in personalized ad recommendation.
method Conservative Linear UCB (CLUCB) algorithm that maintains performance above a baseline.
result Upper-bound on regret with terms for standard UCB and conservative loss.
Smartphones can estimate heart rate from other sensor data.
problem Gaps in heart rate data from wearable sensors.
method Regression, SVM, and random forest algorithms to estimate heart rate from smartphone data.
result Smartphone data can improve heart rate estimation from wearable sensors.
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.
Study tackles policy learning from unconfounded data, accounting for hidden confounding.
problem Learning personalized policies from observational data with hidden confounding.
method Minimizes worst-case regret over uncertainty set for propensity weights.
result Ensures safety and best-possible uniform control on population regrets.
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.
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.
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. The paper tracks multiple speakers using audio and visual data.
problem Tracking multiple speakers with audio and visual data.
method Generative model with variational inference for latent variables.
result The proposed method outperforms baseline methods in real-world scenarios.
Deep learning predicts Alzheimer's Disease progression with high accuracy.
problem Predicting multiple aspects of Alzheimer's Disease progression.
method Unsupervised deep learning on 1908 patients' 18-month clinical data.
result Model accurately predicts ADAS-Cog scores and identifies word recall as a predictor.
Proposes PFWCP for multi-agent tasks with privacy and validity guarantees.
problem Challenges in uncertainty quantification for multi-agent settings.
method Personalized federated weighted conformal prediction (PFWCP) combining local density ratio weighting and weighted quantile aggregation.
result Asymptotically valid coverage guarantees for each agent in heterogeneous settings.
Clust-PSI-PFL uses PSI to improve accuracy and fairness in federated learning.
problem Non-IID data biases federated learning performance.
method Clust-PSI-PFL uses clustering and PSI to form homogeneous groups of clients.
result Clust-PSI-PFL delivers up to 18% higher global accuracy and improves client fairness.
RoME optimizes mobile health interventions by modeling user and time-specific effects.
problem Challenges in optimizing mobile health interventions due to participant heterogeneity, nonstationarity, and nonlinear relationships.
method RoME uses a Robust Mixed-Effects contextual bandit algorithm with random effects, network cohesion penalties, and debiased machine learning.
result RoME achieves robust regret bounds even with complex baseline rewards, demonstrating superior performance in simulations and studies.
The paper explores how machine learning personalization aligns with humanistic views of the person.
problem Aligning machine learning personalization with humanistic views of the person.
method Explicating the concept of personalization and contrasting it with humanistic views of the person.
result Proposes dimensions for evaluating the degree of personalization of ML personalized scores.