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,695 papers · 148 categories

Trend · papers per month

80159239318 · Jun 202019922001200920172026
48 results for personalized practice

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.

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.

Statistical test evaluates if personalizing interventions is cost-effective.

problem Balancing the benefits of personalizing interventions with their potential costs.
method Developed a statistical hypothesis test to assess the performance of personalized interventions.
result The test shows that personalized interventions can outperform standard approaches under certain conditions.

FedSplit improves federated learning for heterogeneous data.

problem Data heterogeneity in federated learning degrades convergence and performance.
method FedSplit splits data into shared and personalized groups, optimizing a novel objective function.
result FedSplit converges faster and performs better than standard federated learning.

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.

The prediction of workers' safety behaviour can help identify vulnerable workers who intend to undertake unsafe behaviours and be useful in the design of management practices to minimise the occurrence of accidents. The latest literature has evidenced that there is within-population diversity that leads people's intend…

2019-12-11abs ↗pdf ↗

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.

Machine learning models are increasingly used to automate decisions that affect humans - deciding who should receive a loan, a job interview, or a social service. In such applications, a person should have the ability to change the decision of a model. When a person is denied a loan by a credit score, for example, they…

2018-09-18abs ↗pdf ↗

Bayesian Supervised Causal Clustering identifies patient subgroups for personalized decision-making.

problem Finding patient subgroups with similar characteristics for personalized decision-making.
method Bayesian Supervised Causal Clustering (BSCC) that identifies homogenous subgroups based on treatment effects.
result BSCC identifies subgroups with similar covariate profiles and treatment effects.

This paper addresses privacy issues in personalized pricing using nonparametric demand models.

problem Privacy violation in personalized pricing algorithms with unknown nonparametric demand models.
method Develops algorithms to make pricing decisions and learn demand while ensuring central and local differential privacy.
result Proves near-optimal regret bounds for algorithms with CDP and LDP guarantees.

Paper proposes a method to encrypt faces while maintaining visual similarity.

problem Protecting personal data from unauthorized face recognition.
method Targeted identity-protection iterative method (TIP-IM) to generate adversarial identity masks.
result TIP-IM provides 95%+ protection success rate against face recognition models.

Improved person detection in occluded conditions with AOS images.

problem Inaccurate classification of partially occluded people, animals, or objects.
method Combining multi-perspective images captured by Airborne Optical Sectioning (AOS) to achieve better precision and recall.
result Precision/recall of 96/93% for automated person detection.

This study benchmarks AI agents for personalized retail promotions using simulations.

problem Optimizing coupon targeting for sparse customer purchase events.
method Comprehensive simulations of customer shopping behaviors; training RL agents on batch data.
result Contextual bandit and deep RL methods outperform static policies in sparse reward environments.

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.

A framework to compare federated learning algorithms in high-dimensional settings.

problem Comparing the performance of federated learning algorithms in high-dimensional settings.
method Formulating federated learning as a multi-criterion objective and analyzing a linear regression model.
result Federated Averaging with simple client fine-tuning achieves the same asymptotic risk as more intricate approaches and outperforms without personalization.

AI platforms disrupt investment by personalizing deal sourcing and insights.

problem Lack of scalable, personalized, and privacy-compliant deal sourcing and insights solutions.
method Development of in-house AI platforms that interact directly with funds and learn from interactions.
result AI platforms provide smarter, personalized use cases for funds, offering a competitive advantage.

Causal inference deals with identifying which random variables "cause" or control other random variables. Recent advances on the topic of causal inference based on tools from statistical estimation and machine learning have resulted in practical algorithms for causal inference. Causal inference has the potential to hav…

2015-12-17abs ↗pdf ↗

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.

We study the problem of learning personalized decision policies from observational data while accounting for possible unobserved confounding. Previous approaches, which assume unconfoundedness, i.e., that no unobserved confounders affect both the treatment assignment as well as outcome, can lead to policies that introd…

2018-05-22abs ↗pdf ↗

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.

Consider an assistive system that guides visually impaired users through speech and haptic feedback to their destination. Existing robotic and ubiquitous navigation technologies (e.g., portable, ground, or wearable systems) often operate in a generic, user-agnostic manner. However, to minimize confusion and navigation …

2018-04-11abs ↗pdf ↗

PhysioMTL learns personalized HRV rhythms from wearable data, improving prediction and counterfactual analysis.

problem Challenges in interpreting HRV measurements due to variability and stressors.
method PhysioMTL combines Optimal Transport and MTL to learn personalized diurnal rhythms from heterogeneous data.
result PhysioMTL outperforms other methods in predicting unseen subjects and generating counterfactual effects.

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 ↗

Study improves conformal prediction for EEG classification in healthcare, enhancing coverage.

problem Uncertainty quantification in clinical predictions, especially in distribution-shifted settings.
method Personalized calibration strategies to improve coverage of prediction sets.
result Coverage improved by over 20 percentage points with comparable prediction set sizes.

Proposes a method for generating prediction intervals in dose-response models using conformal prediction.

problem Uncertainty quantification in continuous treatments for personalized healthcare decisions.
method Causal dose-response problem framed as covariate shift, using weighted conformal prediction with propensity estimation and kernel functions.
result Demonstrates the significance of covariate shift assumptions for robust prediction intervals.

New models automate support group formation in online health communities.

problem Challenges in traditional support group formation methods for scalability, static categorization, and insufficient personalization.
method Two novel machine learning models: gDMR and gSTM, integrating user content, demographics, and network data.
result Models outperform baselines in predictive accuracy, semantic coherence, and internal group consistency.

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.

New study shows personalized content recommendations can lead to polarization of user preferences.

problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.

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.

The paper develops personalized DAG models for web user behavior.

problem Understanding user behavior transitions between websites with user heterogeneity and network dependency.
method Personalized Binomial DAG models with network-structured covariates, embedding network structure into a dimension-reduced covariate, learning node neighborhoods, and exploring variance-mean relation.
result The proposed algorithm outperforms state-of-the-art competitors in heterogeneous data.

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}) for well-separated clusters and O(T12+ε/(N)12ε)\mathcal{O}(T^{\frac{1}{2} + \varepsilon}/(N)^{\frac{1}{2} -\varepsilon}) for poorly separated clusters.

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 ↗