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.

169,051 papers · 148 categories

Trend · papers per month

78157235313 · Jun 202019922001200920182026
48 results for multiple persons

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.

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.

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.

Develops a personalized reinforcement learning algorithm for dyadic health interventions.

problem Personalizing health interventions for dyadic relationships in mobile health.
method Dyadic Reinforcement Learning (dyadic RL), a Bayesian and hierarchical online algorithm.
result Established a regret bound and demonstrated empirical performance through simulations and real data.

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.

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.

Study uses machine learning to detect pain from brain signals.

problem No validated objective measure of pain exists.
method Multi-task multiple kernel learning for personalized pain recognition.
result Supports use of fNIRS and machine learning for objective pain detection.

Extracts controllable models from videos of real-world activities.

problem Creating realistic and controllable character models from video data.
method Two networks: one for pose and control signal to next pose, and another for pose, new pose, and background to output frame.
result High-quality, controllable character models can be generated from arbitrary videos.

Federated multi-view matrix factorization learns from multiple data sources without centralizing user data.

problem Cold-start federated recommendations and multi-view data structure.
method Federated learning framework extended to multi-view matrix factorization.
result Federated multi-view matrix factorization outperforms simpler methods in cold-start federated recommendations.

MDLdroid improves mobile deep learning for personal sensing with faster training.

problem Continuous local changes and resource constraints in personal mobile sensing affect global model performance.
method ChainSGD-reduce approach to reduce overhead and balance resources.
result 2x to 3.5x faster training on off-the-shelf mobile devices compared to single-device training.

Proposes deep multimodal fusion for biometric identification.

problem Improving biometric identification accuracy with multiple modalities.
method Joint optimization of multiple modality-specific CNNs at different feature abstraction levels.
result Significant improvement in multimodal person identification performance.

People belong to multiple communities, words belong to multiple topics, and books cover multiple genres; overlapping clusters are commonplace. Many existing overlapping clustering methods model each person (or word, or book) as a non-negative weighted combination of "exemplars" who belong solely to one community, with …

2018-06-18abs ↗pdf ↗

MPVAA learns holistic patient representations from mixed healthcare data.

problem Learning personalized patient representations from heterogeneous healthcare data.
method Mixed Pooling Multi-View Attention Autoencoder (MPVAA) that integrates non-linear relationships among multiple data modalities.
result MPVAA generates more effective patient representations than state-of-the-art methods.

Reinforcement Learning improves personalized dialogue systems.

problem Personalized dialogue systems that generalize across users.
method Two RL-based approaches: single learner with user context features, and learner per context segmentation.
result RL methods outperform handcrafted systems in financial product recommendation.

A new approach for learning from expert demonstrations using multiple perspectives.

problem Learning from expert demonstrations with limited information from different perspectives.
method Generative adversarial network-based active learning approach.
result Our approach effectively learns from expert demonstrations and highlights the importance of architectural choices.

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 framework analyzes LLM personalization trade-offs under congestion.

problem Tension between personalization and resource sharing in LLMs.
method Developed a statistical-economic framework to model user incentives.
result Congestion can flip rankings of SFT and ICL, and offers both methods never hurt profits.

This paper improves fairness in recommendation systems by learning individual preferences across multiple dimensions.

problem Fairness in recommender systems, especially in areas with social impact.
method Opportunistic multi-aspect re-ranking approach that learns individual preferences and enhances provider fairness.
result Achieves a better trade-off between accuracy and fairness across multiple fairness dimensions.

Method constructs prediction intervals for time-varying individual treatment effects.

problem Accurately quantify uncertainty of individual treatment effects across multiple decision points.
method Conformal inference techniques for time-varying ITEs with weaker assumptions.
result Guaranteed lower bound for coverage dependent on data non-exchangeability.

A novel Federated Learning scheme using Optimal Transport for personalized model training.

problem Training models with data from clients having non-identically distributed data.
method Personalized Federated Learning scheme based on Optimal Transport (FedOT).
result FedOT scheme effectively transfers data from multiple distributions to a common domain and optimizes the prediction model.

Unified product embeddings improve cross-task performance in e-commerce.

problem Training product embeddings in isolation limits cross-task performance.
method Combining text, clickstream, and image data using denoising auto-encoders, BPR, and Siamese neural networks.
result Unified product embeddings uniformly outperform isolated embeddings across three e-commerce tasks.

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.

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.

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.

Paper proposes personalized climate control for driver comfort.

problem Limited research on in-vehicle climate control and driver preferences.
method IoT platform for data collection, machine learning for driver behavior recognition, and personalized preference recommendation.
result Prototype demonstrates effective and accurate climate control for driver comfort.

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.

Agents learn to play a first-person multiplayer game at human level performance.

problem Training AI agents for complex, multi-agent, real-time environments.
method Population-based deep reinforcement learning with concurrent training of multiple agents.
result Achieved human-level performance in a first-person multiplayer game.

A new method improves recommendation accuracy by learning from multiple networks and time-dependent user preferences.

problem Incomplete user profiles and dynamic user preferences degrade recommender quality.
method A cross-network time-aware recommender that learns from multiple source networks and develops current user models.
result The proposed solution achieves superior performance in accuracy, novelty, and diversity.

Graph neural networks improve cold start for new items in recommender systems.

problem Cold start problem for new items in recommender systems.
method Item hierarchy graphs and bespoke graph neural network architecture.
result Our method achieves better forecasting quality than state-of-the-art with comparable computational time.

Reduces variance in noisy social outcomes to improve policy evaluation and optimization.

problem Improving access to opportunity through personalized treatment decisions.
method Data-driven dimensionality-reduction using reduced rank regression to denoise multiple outcomes.
result Improves estimation error in policy evaluation and optimization, including on real-world data.

Proposes a new CNN approach for multimodal biometric identification.

problem Improving biometric identification accuracy across multiple modalities.
method Uses a bank of modality-specific CNNs, fuses their outputs, and optimizes the system.
result Significantly outperforms unimodal systems and demonstrates reduction in parameters.

The paper improves consumer preference modeling by considering multiple product categories.

problem Estimating consumer preferences across multiple product categories with varying attributes and price sensitivity.
method Extends matrix factorization techniques to account for time-varying product attributes and out-of-stock products, pooling information across categories to estimate heterogeneity in preferences.
result The model improves over traditional approaches, accurately estimating consumer preferences and price sensitivity.

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.

New model for personalized online advertising with multi-user interaction.

problem Realistic online advertising scenarios with multiple users interacting simultaneously.
method Introduces Multi-User Contextual Cascading Bandit (MCCB) model and proposes UCBBP and AUCBBP algorithms.
result Proves UCBBP and AUCBBP achieve optimal regret bounds for multi-user context.

A novel tracking method for dense honeybee colonies using pixel personality.

problem Tracking large numbers of densely-arranged, interacting objects in a 2D environment.
method Segmentation-based object detection followed by adaptive object recognition through visual appearance.
result Reconstructed ~46% of trajectories in 5 minutes and 71% of tracks for at least 2 minutes.

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.