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

Trend · papers per month

54108162216 · Jun 202019922001200920172026
48 results for promotion targeting

Dynamic promotion optimization for e-commerce platforms within financial constraints.

problem Balancing promotional costs with incremental revenue for sustainable growth.
method Knapsack Problem formulation for dynamic optimization, Retrospective Estimation, online-dynamic calibration.
result Significant increase in target outcome while staying within financial constraints.

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.

A new filter design improves system identification accuracy.

problem Improving system identification accuracy for various system types.
method Generalized proportionate-type normalized subband adaptive filter (GPtNSAF) using least squares on subband errors with a sparsity penalty.
result GPtNSAF benefits from increasing subbands more than sparsity for quasi-sparse or dispersive systems, and both aspects are complementary for sparse systems.

Study finds inventory inaccuracies are linked to store activity and product perishability.

problem Inventory record inaccuracy in grocery retailing environments.
method Analysis of 24,000 SKUs across 11 stores, field quasi-experiment on audits.
result Inventory audits can boost sales by 11%, especially for perishable items.

Adaptive sampling method improves efficiency in complex target distributions.

problem Efficiency of importance sampling in complex target distributions, especially multimodal distributions in high-dimensional spaces.
method Proposes an adaptive scheme combining global sampling with delayed weighting to promote efficient exploration of target distributions.
result The proposed algorithm is geometrically convergent under mild assumptions and demonstrates improved efficiency in various numerical experiments.

This paper forecasts renewable energy prospects in South America through cross-border interconnection.

problem Lack of renewable energy integration across South American countries.
method Long-term scenario forecasting methodology applied to raw data from typical countries.
result Promoting cross-border interconnection towards renewables can optimize energy supply, reduce costs, and balance the energy matrix.

Tumblr, as a leading content provider and social media, attracts 371 million monthly visits, 280 million blogs and 53.3 million daily posts. The popularity of Tumblr provides great opportunities for advertisers to promote their products through sponsored posts. However, it is a challenging task to target specific demog…

2020-01-02abs ↗pdf ↗

Deep neural networks improve free energy calculations for peptide conformations.

problem Challenges in developing suitable mappings for free energy perturbation.
method Adapted machine learning approach to train deep neural networks for mapping between Boltzmann distributions.
result Accurate free energy differences calculated between thermodynamic states with spring centers separated by 1 Å and sometimes 2 Å.

DG algorithms often fail to generalize well in limited domains, highlighting necessary vs. sufficient conditions.

problem DG algorithms fail to consistently outperform ERM in limited domains.
method Examined necessary and sufficient conditions for DG, proposing a subspace alignment method.
result DG methods focus on sufficient conditions, often neglecting necessary conditions, leading to generalization failures.

GPMD solves regularized RL with linear convergence, promoting structural policies.

problem Regularized reinforcement learning to encourage exploration and structural policies.
method Policy mirror descent with generalized convex regularizers and Bregman divergence.
result GPMD converges linearly to the global solution over a wide range of learning rates.

New framework tackles stochastic latent subgroup heterogeneity in online decision-making.

problem Stochastic latent heterogeneity in online decision-making where individual responses vary with unobserved subgroups.
method Latent heterogeneous bandit framework using EM-greedy algorithm to learn subgroup probabilities and reward parameters.
result Achieves optimal estimation and classification guarantees, revealing a fundamental stochastic barrier in online decision-making.

Computational identification of promoters is notoriously difficult as human genes often have unique promoter sequences that provide regulation of transcription and interaction with transcription initiation complex. While there are many attempts to develop computational promoter identification methods, we have no reliab…

2018-10-02abs ↗pdf ↗

Gradient boosting predicts promotion efficiency using multiple performance indicators.

problem Forecasting promotion efficiency in FMCG retail.
method Gradient boosting applied to six performance indicators for different product groups.
result Models accurately forecast promotion efficiency, optimizing marketing strategies.

Most real-world networks exhibit community structure, a phenomenon characterized by existence of node clusters whose intra-edge connectivity is stronger than edge connectivities between nodes belonging to different clusters. In addition to facilitating a better understanding of network behavior, community detection fin…

2015-06-25abs ↗pdf ↗

AMI framework improves text generation by optimizing mutual information between source and target.

problem Previous MI approaches ignored the backward network, leading to loose variational bounds.
method AMI is a saddle point optimization framework that iteratively promotes and demotes generated instances.
result AMI significantly outperforms baselines on various text generation tasks.

A new method for generating samples without training, using smoothed score matching.

problem Generating samples efficiently and without training.
method Moment-matched score-smoothed overdamped Langevin dynamics (MM-SOLD).
result The method enables fast, robust, training-free sampling with competitive sample fidelity and diversity.

Conditional generative adversarial networks (cGAN) have led to large improvements in the task of conditional image generation, which lies at the heart of computer vision. The major focus so far has been on performance improvement, while there has been little effort in making cGAN more robust to noise. The regression (o…

2018-05-22abs ↗pdf ↗

Paper develops a method to learn optimal sparsity-promoting regularizers for linear inverse problems.

problem Solving linear inverse problems with sparse solutions.
method Bilevel optimization framework to select an optimal synthesis operator BB.
result Established well-posedness and theoretical guarantees for the learning process.

New method improves text classification without labeled target data.

problem Improving text classification under domain shift without labeled target data.
method Diversity-based generalization using multi-head attention with diversity constraints.
result Method matches state-of-the-art performance without labeled target data.

Defense against user shilling attacks in collaborative filtering using edge reweighting.

problem Vulnerability of collaborative filtering to profile injection attacks.
method Adversarial robustness based edge reweighting to attenuate non-robust edges.
result Effective defense against various types of attacks demonstrated through experiments.

A variation of the Minority Game has been applied to study the timing of promotional actions at retailers in the fast moving consumer goods market. The underlying hypotheses for this work are that price promotions are more effective when fewer than average competitors do a promotion, and that a promotion strategy can b…

2004-10-27abs ↗pdf ↗

A new portfolio method uses NMF for risk budgeting, outperforming classical methods.

problem Portfolio diversification and risk management in crypto and traditional assets.
method Risk factor budgeting using convex Non-negative Matrix Factorization (NMF).
result Our method outperforms classical portfolio allocations in diversification and risk profile.

When society maintains a competitive system to promote an abstract goal, competition by necessity relies on imperfect proxy measures. For instance profit is used to measure value to consumers, patient volumes to measure hospital performance, or the Journal Impact Factor to measure scientific value. Here we note that \t…

2018-03-01abs ↗pdf ↗

This paper optimizes attacks on stochastic bandits and proposes defenses against them.

problem Optimizing adversarial attacks on stochastic bandit algorithms.
method Designs optimal attack strategies and proposes defense algorithms.
result Optimal attack strategies and defense algorithms achieve near perfect performance.

We introduce a new representation learning approach for domain adaptation, in which data at training and test time come from similar but different distributions. Our approach is directly inspired by the theory on domain adaptation suggesting that, for effective domain transfer to be achieved, predictions must be made b…

2015-05-28abs ↗pdf ↗

Restricted Boltzmann Machines (RBMs) are one of the fundamental building blocks of deep learning. Approximate maximum likelihood training of RBMs typically necessitates sampling from these models. In many training scenarios, computationally efficient Gibbs sampling procedures are crippled by poor mixing. In this work w…

2014-10-01abs ↗pdf ↗

Net-Promoter Score (NPS) is now ubiquitous as an easily-collected market research metric, having displaced many serious market research processes. Unfortunately, this has been its sole success. It possesses few, if any, of the characteristics that might be regarded as highly desirable in a high-level market research me…

2018-06-12abs ↗pdf ↗

SPADE improves demand forecasting accuracy by 4.5% for post-promotion periods.

problem Overreacting to peak events in demand forecasting leads to biased forecasts.
method SPADE splits forecasting into two tasks: one for peak events and another for post-peak events, using masked convolution filters and a specialized Peak Attention module.
result Overall PPE improvement of 4.5%, 30% improvement for most affected forecasts after promotions and holidays, and 3.9% improvement in PE accuracy.

The damaging effects of hate speech on social media are evident during the last few years, and several organizations, researchers and social media platforms tried to harness them in various ways. Despite these efforts, social media users are still affected by hate speech. The problem is even more apparent to social gro…

2019-12-05abs ↗pdf ↗

Proposes novel losses for fine-grained categorical domain adaptation.

problem Fine-grained alignment of categories across domains in unsupervised domain adaptation.
method Joint category-domain classifier with adversarial training losses for both domain and category levels, and vicinal domain adaptation.
result Achieves state-of-the-art performance on benchmark datasets.

Paper addresses LSTM stability for thermal systems using infinity-norm.

problem Stability of LSTM networks in thermal systems.
method Derived ISS_{\infty} condition for LSTM, developed training strategy.
result ISS_{\infty}-promoted LSTM outperforms other models in thermal system case study.

Top-performing deep architectures are trained on massive amounts of labeled data. In the absence of labeled data for a certain task, domain adaptation often provides an attractive option given that labeled data of similar nature but from a different domain (e.g. synthetic images) are available. Here, we propose a new a…

2014-09-26abs ↗pdf ↗