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

Trend · papers per month

61122182243 · Jun 202019922001200920172026
48 results for personalized deal sourcing

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.

The paper tackles personalized policy learning from diverse data sources in a federated setting.

problem Learning personalized decision policies from observational bandit feedback across multiple heterogeneous data sources.
method Introduces a novel regret analysis for distinguishing global and local regret, and presents a federated policy learning algorithm using local policies trained with doubly robust offline policy evaluation strategies.
result Establishes finite-sample upper bounds on global and local regret, characterizing them by source heterogeneity and distribution shift.

The paper analyzes a game where players must balance short-term and long-term interests, leading to cooperative or competitive outcomes.

problem Analyzing time inconsistency in inter-personal decision-making under non-exponential discounting.
method Iterative procedures and Zorn's lemma to find Nash equilibria between players' intra-personal equilibria.
result Inter-personal equilibria exist and depend on the impatience levels of the players.

Paper proposes FedPer to combat statistical heterogeneity in federated learning for personalized tasks.

problem Statistical heterogeneity in federated learning data degrades performance of traditional federated averaging.
method FedPer: a base + personalization layer approach for federated training of deep feedforward neural networks.
result FedPer effectively combats statistical heterogeneity in non-identical data partitions of CIFAR datasets and personalized image aesthetics datasets.

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.

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.

Develops a method to estimate personalized treatment regimes from summary statistics.

problem Estimating optimal treatment regimes for a target population when individual-level data is unavailable.
method A weighting framework that tailors a treatment regime for the target population using summary statistics.
result Consistent and asymptotically normal estimator for optimal treatment regimes.

Tree-based model averaging improves CATE estimation from diverse sites.

problem Limited sample size and privacy concerns prevent accurate personalized treatment effect estimation.
method Tree-based model averaging approach to estimate CATEs from multiple heterogeneous sites.
result Improved accuracy in estimating conditional average treatment effects (CATEs) across sites.

New algorithms protect user data while optimizing personalized decisions.

problem Personalized decision-making with private user data.
method Developed LDP algorithms for stochastic generalized linear bandits using SGD and OLS.
result Achieved the same regret bound as non-privacy settings with LDP.

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.

The paper tackles robust policy learning from multiple data sources.

problem Learning a policy that generalizes across diverse settings from multiple heterogeneous data sources.
method Proposes a minimax regret optimization objective and a policy learning algorithm combining doubly robust offline policy evaluation and no-regret learning.
result Achieves minimal worst-case mixture regret up to a moderated vanishing rate of the total data across all sources.

Online shopping caters to the needs of millions of users daily. Search, recommendations, personalization have become essential building blocks for serving customer needs. Efficacy of such systems is dependent on a thorough understanding of products and their representation. Multiple information sources and data types p…

2019-06-28abs ↗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.

Singing voice conversion is a task to convert a song sang by a source singer to the voice of a target singer. In this paper, we propose using a parallel data free, many-to-one voice conversion technique on singing voices. A phonetic posterior feature is first generated by decoding singing voices through a robust Automa…

2019-03-11abs ↗pdf ↗

Convolutional autoencoders improve personalized recommendations from image-based data.

problem Lack of personalized recommendations in gastronomic platforms using image data.
method Used convolutional autoencoders to extract features from images and improve personalized recommendations.
result Convolutional autoencoders outperform standard deep features in image-based personalized recommendation systems.

PerPCA separates unique and shared features from heterogeneous data.

problem Extracting shared and unique features from data collected from different sources with varying trends.
method Personalized PCA (PerPCA) uses orthogonal global and local principal components to encode both unique and shared features.
result PerPCA can identify and recover both unique and shared features under mild conditions.

Develops c-GNF for personalized social science policy analysis.

problem Challenges in estimating causal effects and counterfactual inference in social sciences.
method causal-Graphical Normalizing Flow (c-GNF) method.
result c-GNF performs well in estimating causal effects and counterfactual inference.

Developing a visual platform for faster astronomical source cataloging.

problem Speeding up cataloging of large area surveys in radio astronomy.
method Integration of advanced source finding and classification tools into a visual analytic platform.
result Improvement and acceleration of cataloging process in astronomical surveys.

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.

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 ↗

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.

Person re-identification (re-id), an emerging problem in visual surveillance, deals with maintaining entities of individuals whilst they traverse various locations surveilled by a camera network. From a visual perspective re-id is challenging due to significant changes in visual appearance of individuals in cameras wit…

2014-06-13abs ↗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.

This paper is the first attempt to formalize a new field of economics; studding the Intangibles Goods available on the Internet. We are taking advantage of the digital world's specific rules, in particular the zero marginal cost, to propose a theory of trading & sharing unified. A function based money is created as a w…

2014-05-07abs ↗pdf ↗

Algorithms that fuse multiple input sources benefit from both complementary and shared information. Shared information may provide robustness against faulty or noisy inputs, which is indispensable for safety-critical applications like self-driving cars. We investigate learning fusion algorithms that are robust against …

2019-06-11abs ↗pdf ↗

Study uses LLMs to create personalized treatment plans for rare gynecological tumors.

problem Suboptimal management and poor prognosis due to low incidence and heterogeneity of rare gynecological tumors.
method Developed a digital twin system using LLMs to integrate clinical and biomarker data.
result LLM-enabled digital twins efficiently model individual patient trajectories and identify potential treatment options.

We review two strands of conceptual approaches to the formal representation of a decision maker's non-knowledge at the initial stage of a static one-person, one-shot decision problem in economic theory. One focuses on representations of non-knowledge in terms of probability measures over sets of mutually exclusive and …

2014-07-03abs ↗pdf ↗

We study the effects of non-systematic and systematic mortality risks on the required initial capital in a pension plan, in the presence of financial risks. We discover that for a pension plan with few members the impact of pooling on the required capital per person is strong, but non-systematic risk diminishes rapidly…

2013-07-30abs ↗pdf ↗

A new federated learning method clusters users into multiple models for better data distribution handling.

problem Non-IID data from heterogeneous sources in federated learning.
method Proposes a multi-center aggregation mechanism to learn multiple global models and optimally match users to centers.
result Our method outperforms existing federated learning methods on benchmark datasets.

A federated graph learning approach improves EV charging demand forecasting while protecting against cyberattacks.

problem Cybersecurity risk and data heterogeneity in EV charging demand forecasting.
method Federated Graph Neural Network (GNN) model with global attention mechanism and credit-based function.
result Enhanced robustness and prediction accuracy in EV charging demand forecasting.

This paper presents a novel theoretical study of the general problem of multiple source adaptation using the notion of Renyi divergence. Our results build on our previous work [12], but significantly broaden the scope of that work in several directions. We extend previous multiple source loss guarantees based on distri…

2012-05-09abs ↗pdf ↗

We present PROPS, a lightweight transfer learning mechanism for sequential data. PROPS learns probabilistic perturbations around the predictions of one or more arbitrarily complex, pre-trained black box models (such as recurrent neural networks). The technique pins the black-box prediction functions to "source nodes" o…

2019-03-05abs ↗pdf ↗

The collaborative ranking problem has been an important open research question as most recommendation problems can be naturally formulated as ranking problems. While much of collaborative ranking methodology assumes static ranking data, the importance of temporal information to improving ranking performance is increasi…

2019-08-15abs ↗pdf ↗

Vanguard uses AI to create personalized financial plans.

problem Challenges in choosing features for complex financial planning.
method Reinforcement learning for identifying optimal savings rates.
result Trains algorithms to model financial success trajectories.

Visual relationship detection can bridge the gap between computer vision and natural language for scene understanding of images. Different from pure object recognition tasks, the relation triplets of subject-predicate-object lie on an extreme diversity space, such as \textit{person-behind-person} and \textit{car-behind…

2018-09-11abs ↗pdf ↗