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…
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
48 results for “Promotions”
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.
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.
Promoter is a short region of DNA which is responsible for initiating transcription of specific genes. Development of computational tools for automatic identification of promoters is in high demand. According to the difference of functions, promoters can be of different types. Promoters may have both intra and inter cl…
Understanding and predicting the popularity of online items is an important open problem in social media analysis. Considerable progress has been made recently in data-driven predictions, and in linking popularity to external promotions. However, the existing methods typically focus on a single source of external influ…
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 .
result Established well-posedness and theoretical guarantees for the learning process.
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…
Twitter promotes cryptocurrency pump-and-dumps, affecting trading behavior and returns.
problem The influence of Twitter on cryptocurrency pump-and-dump events.
method Analysis of abnormal returns, trading volume, and tweet activity.
result Investors relying on Twitter information sell later, leading to significant losses.
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…
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.
Paper addresses LSTM stability for thermal systems using infinity-norm.
problem Stability of LSTM networks in thermal systems.
method Derived ISS condition for LSTM, developed training strategy.
result ISS-promoted LSTM outperforms other models in thermal system case study.
Convex optimization with sparsity-promoting convex regularization is a standard approach for estimating sparse signals in noise. In order to promote sparsity more strongly than convex regularization, it is also standard practice to employ non-convex optimization. In this paper, we take a third approach. We utilize a no…
Win-score promotion gates in aggregator-routed RFQ markets: A two-tier stochastic control modelq-fin.RM
Model analyzes RFQ markets using stochastic control to optimize dealer performance and inventory.
problem Optimizing market making in aggregator-routed RFQ markets with varying dealer performance scores.
method Two-tier stochastic control model that separates RFQ-level price competition from macro routing.
result Optimal controls can be expressed through derivatives of reduced Hamiltonians, leading to interpretable mappings from optimal win probabilities to optimal offsets.
Distance metric learning (DML), which learns a distance metric from labeled "similar" and "dissimilar" data pairs, is widely utilized. Recently, several works investigate orthogonality-promoting regularization (OPR), which encourages the projection vectors in DML to be close to being orthogonal, to achieve three effect…
Statistical de Rham Hodge operators, spectral Einstein functionals and the noncommutative residuemath.DG
Promotes spectral functionals to noncommutative fields and proves a theorem.
problem Spectral functionals on noncommutative fields and manifolds with boundary.
method Carries out promotion to spectral functionals, associates with noncommutative residue, and proves theorem.
result Proves Dabrowski-Sitarz-Zalecki type theorem for statistical de Rham Hodge operators on manifolds with boundary.
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.
This work investigates fundamental questions related to learning features in convolutional neural networks (CNN). Empirical findings across multiple architectures such as VGG, ResNet, Inception, DenseNet and MobileNet indicate that weights near the center of a filter are larger than weights on the outside. Current regu…
We propose a method for building an interpretable recommender system for personalizing online content and promotions. Historical data available for the system consists of customer features, provided content (promotions), and user responses. Unlike in a standard multi-class classification setting, misclassification cost…
Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learningcs.LG
Exact solutions reveal how unbalanced initializations promote rapid feature learning in neural networks.
problem Understanding how neural networks efficiently extract features from data.
method Deriving exact solutions to a minimal model of neural networks transitioning between lazy and rich learning regimes.
result Unbalanced layer-specific initialization variances and learning rates determine the degree of feature learning.
Loss Data Analyticsq-fin.RM
Loss Data Analytics is an interactive, online, freely available text. The idea behind the name Loss Data Analytics is to integrate classical loss data models from applied probability with modern analytic tools. In particular, we seek to recognize that big data (including social media and usage based insurance) are here…
Scenario Forecast of Cross-border Electric Interconnection towards Renewables in South Americaeess.SY
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.
We propose to incorporate adversarial dropout in generative multi-adversarial networks, by omitting or dropping out, the feedback of each discriminator in the framework with some probability at the end of each batch. Our approach forces the single generator not to constrain its output to satisfy a single discriminator,…
New algorithms extract Koopman invariant subspaces from large-scale data.
problem Difficulty in discerning the Koopman invariant subspace from many Koopman eigenmodes.
method Multi-task feature learning and pruning procedure to remove spurious modes.
result Effective in approximating Koopman operator for complex flows.
To address three important issues involved in latent variable models (LVMs), including capturing infrequent patterns, achieving small-sized but expressive models and alleviating overfitting, several studies have been devoted to "diversifying" LVMs, which aim at encouraging the components in LVMs to be diverse. Most exi…
We propose to tackle the mode collapse problem in generative adversarial networks (GANs) by using multiple discriminators and assigning a different portion of each minibatch, called microbatch, to each discriminator. We gradually change each discriminator's task from distinguishing between real and fake samples to disc…
Cluster-wise linear regression (CLR), a clustering problem intertwined with regression, is to find clusters of entities such that the overall sum of squared errors from regressions performed over these clusters is minimized, where each cluster may have different variances. We generalize the CLR problem by allowing each…
Promotes Poisson deformations to hyperkähler structures.
problem Deforming hyperkähler cone metrics.
method Twistor methods for universal Poisson deformations.
result Produces incomplete hyperkähler metrics with applications.
Medical image reconstruction is typically an ill-posed inverse problem. In order to address such ill-posed problems, the prior distribution of the sought after object property is usually incorporated by means of some sparsity-promoting regularization. Recently, prior distributions for images estimated using generative …
Unified framework for enforcing, discovering, and promoting symmetry in machine learning.
problem Symmetry in machine learning models and data.
method Unified mathematical framework using Lie derivatives, convex regularization, and nuclear norm relaxation.
result Unified approach to symmetry in machine learning tasks.
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.
Sparse alpha-norm regularization has many data-rich applications in Marketing and Economics. Alpha-norm, in contrast to lasso and ridge regularization, jumps to a sparse solution. This feature is attractive for ultra high-dimensional problems that occur in demand estimation and forecasting. The alpha-norm objective is …
A new framework promotes trustworthy user-generated datasets by ensuring no user benefits from misreporting.
problem Incentivizing data misreporting in user-generated datasets.
method Proposes Licchavi, a global and personalized learning framework with provable strategyproofness guarantees.
result Proves that no user can gain much by replying to Licchavi's queries with deviated answers.
Automated PDE discovery from multiple noisy experiments.
problem Inherent variability in experiments makes single experiment inference unreliable.
method Randomised adaptive group Lasso sparsity estimator in deep learning framework.
result More generalizable PDEs found from multiple datasets.
Sparsity-promoting priors have become increasingly popular over recent years due to an increased number of regression and classification applications involving a large number of predictors. In time series applications where observations are collected over time, it is often unrealistic to assume that the underlying spar…
There is, among the economist ecosystem, the idea of virtuous public spending as a form of promotion of economic growth. If we think on the way GDP is measured, it is not possible to get that conclusion because it becomes circular: measuring the money flow obviously will detect directly the public spending but always m…
SharedMF uses secret sharing to protect privacy in distributed recommendation systems.
problem Privacy issues in multi-source data for recommendation systems.
method Federated learning and secret sharing technology.
result SharedMF achieves faster execution speed and better data adaptability compared to homomorphic encryption methods.
Uplift modeling is an emerging machine learning approach for estimating the treatment effect at an individual or subgroup level. It can be used for optimizing the performance of interventions such as marketing campaigns and product designs. Uplift modeling can be used to estimate which users are likely to benefit from …
G-TRACER optimizes deep learning by promoting flat minima.
problem Promoting generalization in deep learning architectures.
method Geometric TRACE Ratio regularization, curvature-regularized optimizers.
result Converges to a neighborhood of local minima of unregularized objective.
The reasons behind good DNN generalisation remain an open question. In this paper we explore the problem by looking at the Signal-to-Noise Ratio of nodes in the network. Starting from information theory principles, it is possible to derive an expression for the SNR of a DNN node output. Using this expression we constru…
Researchers use GANs to infer physics-based inverse problems, quantifying uncertainty and promoting generalizability.
problem Quantifying uncertainty in physics-based inverse problems.
method Trained conditional Wasserstein GANs with U-Net architecture and conditional instance normalization.
result The approach effectively samples from the posterior and promotes generalizability with out-of-distribution samples.
Gradient descent promotes low-rank solutions in tensor completion.
problem Implicit regularization in tensor factorization using gradient descent.
method Introduced deep Tucker and TensorTrain (TT) unconstrained factorization to address tensor completion.
result Gradient descent promotes solutions with low-rank.
This work introduces two strategies for training network classifiers with heterogeneous agents. One strategy promotes global smoothing over the graph and a second strategy promotes local smoothing over neighbourhoods. It is assumed that the feature sizes can vary from one agent to another, with some agents observing in…
Margin trading and short selling boost green tech innovation in China.
problem Encouraging green technology innovation in Chinese companies.
method Quasi-experimental research using panel data of Chinese listed companies, double difference model.
result Margin trading and short selling increase green tech innovation significantly.
Simulation-Based Benchmarking of Reinforcement Learning Agents for Personalized Retail Promotionscs.AI
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.
Noise in RNNs promotes flatter minima and more stable dynamics.
problem Understanding and optimizing the training of RNNs with noise.
method Formalizing RNNs as stochastic differential equations and analyzing the effect of noise in the hidden states.
result Noise injection in RNNs leads to flatter minima, more stable dynamics, and improved robustness.
Existence of convex body with prescribed generalized curvature measures is discussed, this result is obtained by making use of Guan-Li-Li's innovative techniques. In surprise, that methods has also brought us to promote Ivochkina's estimates for prescribed curvature equation in \cite{I1, I}.
Composite convex optimization problems which include both a nonsmooth term and a low-rank promoting term have important applications in machine learning and signal processing, such as when one wishes to recover an unknown matrix that is simultaneously low-rank and sparse. However, such problems are highly challenging t…
New model identifies cell-specific genes for cancer prognosis.
problem No statistical model to integrate multiscale cancer data.
method Bayesian generalized promotion time cure models (GPTCMs).
result Improves cancer prognosis by identifying cell-specific genes.