Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

3547091,0631,417 · Jun 202019922001200920172026
48 results for personalized modeling

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.

Framework generates personalized insulin treatment strategies using deep models.

problem Developing optimal personalized treatment strategies for diabetes patients.
method Combines deep generative time series models with decision theory.
result Demonstrated improved personalized insulin treatment strategies for diabetes patients.

Federated learning is a distributed, on-device computation framework that enables training global models without exporting sensitive user data to servers. In this work, we describe methods to extend the federation framework to evaluate strategies for personalization of global models. We present tools to analyze the eff…

2019-10-22abs ↗pdf ↗

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.

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.

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.

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.

A new federated multi-armed bandit framework with personalization balances generalization and personalization.

problem Balancing generalization and personalization in federated multi-armed bandits.
method Proposed a Personalized Federated Upper Confidence Bound (PF-UCB) algorithm to achieve a O(log(T))O(\log(T)) regret.
result PF-UCB achieves an O(log(T))O(\log(T)) regret regardless of personalization degree and has similar instance dependency to lower bound.

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.

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.

FSPO optimizes synthetic preferences for LLM personalization.

problem Personalizing large language models for diverse users.
method FSPO reframes reward modeling as a meta-learning problem, using few labeled preferences and synthetic data.
result FSPO achieves high winrates in personalized responses, both synthetic and real.

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.

We discuss training techniques, objectives and metrics toward personalization of deep learning models. In machine learning, personalization addresses the goal of a trained model to target a particular individual by optimizing one or more performance metrics, while conforming to certain constraints. To personalize, we i…

2019-09-06abs ↗pdf ↗

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…

2019-01-03abs ↗pdf ↗

Personalized models using group attributes reduce performance, study finds.

problem Reducing performance of models using group attributes like race or gender.
method Formal conditions and collective preference guarantees to ensure fair use.
result Models personalized with group attributes reduce performance at a group level.

Personalized federated learning for diverse client objectives.

problem Training a single global model across diverse local datasets is not optimal.
method Efficiently calculates optimal weighted model combinations for each client based on their specific objectives.
result Our method outperforms existing alternatives and enables new personalized features.

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…

2020-01-07abs ↗pdf ↗

Boosting-inspired framework for federated learning with progressive model personalization.

problem Statistical heterogeneity across clients in federated learning.
method Construct an ensemble of personalized models, progressively increasing the depth of the personalized component while controlling its effective complexity.
result Consistently outperforms state-of-the-art PFL methods under heterogeneous data distributions.

This paper analyzes the trade-off between accuracy and communication in personalized federated learning.

problem The accuracy-communication trade-off in personalized federated learning.
method The paper provides a quantitative characterization of the personalization degree on the trade-off, establishing minimax optimality.
result The paper offers theoretical insights for choosing the personalization degree and validates the results on synthetic and real-world datasets.

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.

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.

In this paper, we propose a novel model RevGAN that automatically generates controllable and personalized user reviews based on the arbitrarily given sentimental and stylistic information. RevGAN utilizes the combination of three novel components, including self-attentive recursive autoencoders, conditional discriminat…

2019-09-30abs ↗pdf ↗

Personalized federated learning improves model accuracy and fairness by leveraging shared representations and local memorization.

problem Sub-optimal performance of federated learning when client data distributions are heterogeneous.
method Proposes a personalization mechanism based on local memorization of shared representations from a collectively trained global model.
result Significantly higher accuracy and fairness compared to state-of-the-art methods.

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…

2019-12-17abs ↗pdf ↗

FGPR uses averaging and SGD for federated GP\mathcal{GP} regression, excelling in personalization and multi-fidelity modeling.

problem Privacy-preserving multi-fidelity data modeling and personalization.
method Federated Gaussian process framework with averaging and SGD for local computations.
result FGPR converges to a critical point of the full log-likelihood function, excels in personalization and multi-fidelity modeling.

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 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.

Study shows how online personalization can lead to unfair models due to biased user responses.

problem Fairness issues in online personalization systems due to biased user responses.
method Formulated a regularization-based approach to mitigate biases in machine learning models.
result Demonstrated that online personalization can cause models to learn unfair behavior from biased user responses.

A microeconomic model is developed, which accurately predicts the shape of personal income distribution (PID) in the United States and the evolution of the shape over time. The underlying concept is borrowed from geo-mechanics and thus can be considered as mechanics of income distribution. The model allows the resoluti…

2009-03-02abs ↗pdf ↗

Personalizes query completion in digital commerce with image-based vectors.

problem High bounce rate and low recurring users in query completion.
method Injects dense vectors from product images into a noisy channel model.
result Image-based personalization improves query completion and user experience.

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.

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.

The paper tackles carousel personalization in music streaming apps using contextual bandits.

problem Selecting relevant items to display in carousels for personalized content recommendation.
method Modeling carousel personalization as a contextual multi-armed bandit problem with multiple plays, cascade-based updates and delayed batch feedback.
result Empirically shows the effectiveness of the framework in capturing characteristics of real-world carousels.

The paper explores fairness, welfare, and equity in personalized pricing across various applications.

problem Interplay of fairness, welfare, and equity in personalized pricing based on customer features.
method Comprehensive literature review and observational metrics without underlying valuation distribution assumptions.
result Personalized pricing can expand access, improve welfare, and increase revenue or budget utilization.

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.

Investor finds a fair outcome in complex financial markets.

problem Finding a fair outcome in complex financial markets.
method Recalled and proved the existence of personal equilibrium in a multistep, generically incomplete financial market model.
result Personal equilibrium exists in a multistep, generically incomplete financial market model under appropriate assumptions.

Personal income distributions in Japan are analyzed empirically and a simple stochastic model of the income process is proposed. Based on empirical facts, we propose a minimal two-factor model. Our model of personal income consists of an asset accumulation process and a wage process. We show that these simple processes…

2005-05-25abs ↗pdf ↗

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.

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.