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

3877115153 · Jun 202019922001200920172026
48 results for Customer Context

Paper proposes a new topology for AML analysis using Poincaré embeddings.

problem Complex money laundering schemes and regulatory constraints hinder AML analysis and information sharing.
method Proposes a new topology for AML analysis using Poincaré embeddings.
result Demonstrates improved AML analysis and information sharing through Poincaré embeddings.

Reduce survey questions to scale market research without annoying customers.

problem Performing market research by surveying customers with many questions is inefficient and annoying.
method Used Bayesian networks to model and reduce the number of questions asked to customers.
result Demonstrated the effectiveness of the approach using an example of broadband customer segmentation.

We consider a planning problem where the dynamics and rewards of the environment depend on a hidden static parameter referred to as the context. The objective is to learn a strategy that maximizes the accumulated reward across all contexts. The new model, called Contextual Markov Decision Process (CMDP), can model a cu…

2015-02-08abs ↗pdf ↗

The study explores machine learning for predicting customer propensity-to-pay uncertainty.

problem Improving customer experience, reducing financial hardship, and managing cash flow risks.
method Investigated machine learning models for predicting propensity-to-pay, focusing on uncertainty estimation.
result Novel Bayesian Neural Network model for binary classification of propensity-to-pay.

Dynamic pricing model for airline ancillaries improves revenue and conversion.

problem Inefficient conventional pricing strategies for airline ancillaries.
method Developed a dynamic pricing model using AI, combining forecasting and optimization.
result Deep learning models outperform traditional machine learning techniques in online settings.

Unstructured data refers to information that does not have a predefined data model or is not organized in a pre-defined manner. Loosely speaking, unstructured data refers to text data that is generated by humans. In after-sales service businesses, there are two main sources of unstructured data: customer complaints, wh…

2016-07-26abs ↗pdf ↗

A new pricing strategy learns customer valuations without noise distribution knowledge.

problem Setting optimal prices for products based on customer valuations with unknown noise.
method Developed a novel perturbed linear bandit framework to learn both contextual functions and market noise.
result Proved sub-linear regret bound and demonstrated superior performance on simulations and real data.

Personalized pricing analytics is becoming an essential tool in retailing. Upon observing the personalized information of each arriving customer, the firm needs to set a price accordingly based on the covariates such as income, education background, past purchasing history to extract more revenue. For new entrants of t…

2018-05-03abs ↗pdf ↗

Consider a social network where only a few nodes (agents) have meaningful interactions in the sense that the conditional dependency graph over node attribute variables (behaviors) is sparse. A company that can only observe the interactions between its own customers will generally not be able to accurately estimate its …

2017-11-15abs ↗pdf ↗

The paper proposes a new method for product recommendation that considers revenue contributions and user similarity.

problem High dimensionality and sparsity in user-item data, especially in terms of revenue contributions.
method The approach encodes revenue contributions in the user-item matrix and computes customer similarity using suitable distance measures.
result The method segments users based on revenue-based similarity and supports recommendations aligned with profitability objectives.

Study online pricing with contextual elasticity and heteroscedastic valuation.

problem Online contextual dynamic pricing with customer decision based on features and price.
method Introduced a novel approach to modeling customer demand with feature-based price elasticity and heteroscedastic noise. Proposed an efficient algorithm called Pricing with Perturbation (PwP).
result Proved an O(dTlogT)O(\sqrt{dT\log T}) regret bound for the algorithm, matching a lower bound of Ω(dT)Ω(\sqrt{dT}).

This work explores the idea of a causal contextual multi-armed bandit approach to automated marketing, where we estimate and optimize the causal (incremental) effects. Focusing on causal effect leads to better return on investment (ROI) by targeting only the persuadable customers who wouldn't have taken the action orga…

2018-10-02abs ↗pdf ↗

LLMs learn probability density functions in-context, showing distinct learning trajectories.

problem Density estimation of time series data in LLMs.
method Intensive Principal Component Analysis (InPCA) to visualize and analyze LLMs' learning dynamics.
result LLMs follow similar learning trajectories in a low-dimensional InPCA space, distinct from traditional methods.

Financial institutions use LSTM models to predict customer goals.

problem Predicting customer goals and actions in financial services.
method Used LSTM models with state-space graph embeddings on historical customer traces.
result Demonstrated the effectiveness of LSTM models in predicting customer goals and actions.

Customer momentum is a positive relationship between a firm's returns and past returns of its customers.

problem Understanding the relationship between a firm's returns and its customers' past returns.
method Examined customer momentum using a long-short equally-weighted decile portfolio and Fama-French factor models.
result Customer momentum generates significant monthly returns and is statistically significant.

Automates molecule design with simpler SMILES generation and reinforcement learning.

problem Designing molecules with specific chemical properties.
method Combines context-free grammar for SMILES strings and reinforcement learning with a Transformer model.
result Significantly reduces model steps per atom and beats previous baselines.

Paper proposes a method to aggregate customer engagement data for better ranking of e-commerce results.

problem Cold start problem and under-representation of new or under-impressed products in e-commerce search results.
method Aggregates customer engagements within a day for the same query as input training data for machine learning models.
result Training models on aggregated data leads to better ranking of new and under-impressed products.

Study uses Open Banking data to estimate customer value, showing potential 21% increase.

problem Limited CLV estimation using single-entity data.
method Introduces PCLV framework using Open Banking data for comprehensive customer value estimation.
result Open Banking data can estimate PCLV per competitor, showing a 21.06% increase over Actual CLV.

Predicts customer call intent for auto dealerships using CNN.

problem Understanding customer intent from phone calls for better service.
method Developed a CNN-based supervised learning model for multi-class classification.
result CNN model performs well on customer call intent classification.

This research tackles unsupervised topic extraction in noisy social media data.

problem Capturing customer insights from social media data is challenging due to noise and heterogeneity.
method The research presents three nonparametric approaches based on the Variational Autoencoder framework: Embedded Dirichlet Process, Embedded Hierarchical Dirichlet Process, and time-aware Dynamic Embedded Dirichlet Process.
result The models achieve equal to better performance than state-of-the-art methods in topic extraction from noisy social media data.

Statistical test verifies long-term rating system calibration with overlapping time windows.

problem Verifying supervisory requirements for overlapping time windows in rating systems.
method Analyzes long-run default rate distribution and correlation effects; presents conservative calibration test methods.
result Developed a test for individual and portfolio levels that can handle unknown variance.

It is of high interest for a company to identify customers expected to bring the largest profit in the upcoming period. Knowing as much as possible about each customer is crucial for such predictions. However, their demographic data, preferences, and other information that might be useful for building loyalty programs …

2018-03-28abs ↗pdf ↗

Silent abandonment reduces contact center efficiency by 5%-15%.

problem Measuring customer abandonment and patience in text-based contact centers is challenging due to uncertainty.
method Developed methodologies to identify silent-abandonment customers and estimate customer patience using text analysis and queueing models.
result Silent abandonment accounts for 30%-67% of customer abandonments and reduces system efficiency by 5%-15%.

DALC customizes LSTM models for detectors in large-scale traffic networks.

problem Fine-grained traffic prediction for large-scale transportation networks.
method Formulated as a finite Markov decision process, introduced ALC algorithm for automatic customization, and developed DALC for distributed customization.
result DALC provides higher prediction accuracy than Apache Spark MLlib approaches.

Proposes a variational autoencoder for long-term customer revenue forecasting.

problem Predicting long-term customer revenue from sparse and irregular transaction data.
method Variational Autoencoder (VAE) with flexible latent representation.
result Improves upon latest benchmarks in multiple real-world datasets.