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

71142212283 · Jun 202019922001200920172026
48 results for conversion rates

A method corrects feedback shift in predicting conversion rates with delayed feedback.

problem Delayed feedback leads to mislabeling of positive instances in training data.
method Uses importance weight approach to correct feedback shift.
result Proposed method outperforms existing methods in offline and online experiments.

Improved conversion rate prediction in online advertising using self-supervised pre-training.

problem Data sparsity and calibration issues in predicting conversions given clicks.
method Self-supervised pre-training on all conversion events to enrich CVR prediction model without compromising calibration.
result Improvements in offline training and online A/B tests, with full deployment to Yahoo native advertising system.

Study uses time series analysis to predict player churn and conversion in games.

problem Predicting player churn and conversion in free-to-play games.
method State Space time series approach with Autoregressive Integrated Moving Average and Unobserved Components models.
result Unobserved Components approach fails to detect marketing campaigns and predicts abandonment poorly.

Predicting conversion rates (CVRs) in display advertising (e.g., predicting the proportion of users who purchase an item (i.e., a conversion) after its corresponding ad is clicked) is important when measuring the effects of ads shown to users and to understanding the interests of the users. There is generally a time de…

2018-02-01abs ↗pdf ↗

DHEN improves CVR prediction for ads with multitask learning and auxiliary loss.

problem Predicting conversion rates in ad-recommendation systems.
method DHEN integrates multiple feature-crossing modules and uses a multitask learning framework, ablation studies, and self-supervised auxiliary loss.
result DHEN achieves state-of-the-art performance in CVR prediction.

In digital advertising, Click-Through Rate (CTR) and Conversion Rate (CVR) are very important metrics for evaluating ad performance. As a result, ad event prediction systems are vital and widely used for sponsored search and display advertising as well as Real-Time Bidding (RTB). In this work, we introduce an enhanced …

2019-07-03abs ↗pdf ↗

This paper introduces a Bayesian framework for optimizing online experiments to maximize profit.

problem Statistical flaws and reliance on proxy metrics in A/B tests compromise their effectiveness.
method Hierarchical Bayesian model for estimating conversion probability and monetary value, decision-theoretic stopping rule.
result The framework ensures experiments conclude when no variant offers a significant profit improvement, conserving resources.

Unified approach for conversational recommendation by integrating attributes and items.

problem Cold-start users' real-time personalization in online recommendation.
method Seamlessly unifies attributes and items in Thompson Sampling framework for interactive decision-making.
result Conversational Thompson Sampling (ConTS) outperforms existing methods in success rate and conversation turns.

In display advertising, predicting the conversion rate (CVR), meaning the probability that a user takes a predefined action on an advertiser's website, is a fundamental task for estimating the value of displaying an advertisement to a user. There are two main challenges in CVR prediction due to delayed feedback. First,…

2019-10-04abs ↗pdf ↗

In order to port the performance of trained artificial neural networks (ANNs) to spiking neural networks (SNNs), which can be implemented in neuromorphic hardware with a drastically reduced energy consumption, an efficient ANN to SNN conversion is needed. Previous conversion schemes focused on the representation of the…

2019-12-30abs ↗pdf ↗

New algorithms achieve uniform stability for empirical risk minimization.

problem Designing uniformly stable optimization algorithms for empirical risk minimization.
method Black-box conversion of smooth optimization algorithms and development of Mirror Descent for smooth optimization.
result Optimal algorithms with uniform stability and convergence rates for smooth optimization.

Enhanced transformer converts whispered speech to natural speech.

problem Machine recognition of whispered speech is challenging.
method Proposes an enhanced transformer architecture trained end-to-end using supervised learning.
result Similar formant distributions of converted speech to groundtruth.

Model improves CVR estimation in recommender systems by mitigating bias and overlooking causal relationships.

problem Data sparsity and sample selection bias in CVR estimation.
method Entire Space Counterfactual Multitask Model (ESCM2^2) incorporating counterfactual risk minimizer.
result Significantly enhances recommendation performance by effectively mitigating bias and overlooking causal relationships.

The general problem of asset pricing when the discount rate differs from the rate at which an asset's cash flows accrue is considered. A pricing kernel framework is used to model an economy that is segmented into distinct markets, each identified by a yield curve having its own market, credit and liquidity risk charact…

2018-01-15abs ↗pdf ↗

Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the natural metric in their domain, making the applicability of Banach's theorem li…

2017-02-23abs ↗pdf ↗

The DeepSurv model predicts purchase timing better than other survival models.

problem Predicting the exact purchase timing of consumers.
method Survival models (Kernel SVM, DeepSurv, Survival Random Forest, MTLR) were compared using various consumer attributes.
result DeepSurv model outperformed other models in predicting purchase completion.

Study examines cash conversion cycle in manufacturing firms, finding negative relationships with profitability and size.

problem Understanding cash conversion cycle in manufacturing firms and its impact on profitability and size.
method Empirical study of 30 manufacturing firms in Dhaka Stock Exchanges, categorizing them into six industries, analyzing industry averages and relationships with size and profitability.
result Negative relationship between cash conversion cycle and profitability, especially ROE; negative relationship with firm size in terms of net sales.

Model user preferences for conversational LLMs using weak rewards.

problem Lack of persistent user models in conversational LLMs leading to repeated user restatements.
method Vector-Adapted Retrieval Scoring (VARS) framework that updates user vectors online from weak scalar rewards.
result Full VARS agent achieves strongest overall performance, matches strong Reflection baseline in task success, and reduces user effort.

FedConPE improves conversational recommender systems efficiency and privacy.

problem Efficiently eliciting user preferences in interactive systems with heterogeneous clients.
method Phase elimination-based federated conversational bandit algorithm with adaptive key term construction.
result Minimizes uncertainty across all dimensions in feature space and offers improved efficiency and privacy.

Contextual bandit algorithms provide principled online learning solutions to balance the exploitation-exploration trade-off in various applications such as recommender systems. However, the learning speed of the traditional contextual bandit algorithms is often slow due to the need for extensive exploration. This poses…

2019-06-04abs ↗pdf ↗

The paper analyzes how disturbances affect the convergence of algorithms in complex systems.

problem Analyzing the impact of disturbances on algorithm convergence in complex systems.
method Leveraging converse Lyapunov theorems, the paper derives stability bounds and convergence rates in the presence of disturbances.
result Key inequalities quantify the impact of disturbances on algorithmic performance.

The goal of online display advertising is to entice users to "convert" (i.e., take a pre-defined action such as making a purchase) after clicking on the ad. An important measure of the value of an ad is the probability of conversion. The focus of this paper is the development of a computationally efficient, accurate, a…

2017-10-24abs ↗pdf ↗

Optimizes nonconvex optimization by converting it to static regret minimization.

problem Nonconvex optimization challenges in machine learning.
method Black-box online-to-nonconvex conversion with static regret minimization oracles.
result Achieves optimal convergence rates for nonconvex optimization.

CycleGAN-VC3 improves CycleGAN-VCs for mel-spectrogram conversion.

problem Ambiguity in CycleGAN-VC/VC2 effectiveness for mel-spectrogram conversion.
method Proposes CycleGAN-VC3 with time-frequency adaptive normalization (TFAN).
result CycleGAN-VC3 outperforms or matches CycleGAN-VC2 for mel-spectrogram conversion.

A new algorithm for conversational recommendation systems using dueling bandits in GLMs.

problem Limited user feedback in existing conversational bandit methods.
method Integrates dueling bandits with relative feedback in generalized linear models.
result Theoretical and empirical validation of ConDuel's efficacy.

The paper extracts structured data from physician-patient conversations, reducing clerical burden.

problem Mining insights from physician-patient conversations for electronic health record documentation.
method Created a dataset of transcripts and summaries, extracted noteworthy utterances, and improved model performance.
result Extracting noteworthy utterances significantly boosts model performance for recognizing diagnoses and RoS abnormalities.

Schedule-free SGD is optimal for nonconvex optimization problems.

problem Nonconvex optimization in neural networks.
method Developed a general framework for online-to-nonconvex conversion, which converts schedule-free SGD into an effective nonconvex optimization algorithm.
result Schedule-free SGD achieves optimal iteration complexity for nonsmooth, nonconvex optimization problems.