NPS is widely used but flawed, harming companies and customers.
problem NPS lacks desirable characteristics for market research metrics.
method No specific method mentioned; focuses on NPS's shortcomings.
result NPS has done significant harm to companies and customers.
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.
RNN-MAS predicts YouTube video popularity by integrating multiple sources of external influence.
problem Predicting popularity in asynchronous social media streams with multiple external influences.
method Recurrent Neural Network (RNN) for modeling asynchronous streams, integrating multiple sources of external influence.
result RNN-MAS outperforms state-of-the-art YouTube popularity prediction system by 17%.
New method generates novel samples from closed-form diffusion models.
problem Closed-form SGMs memorize training data and cannot generate novel samples.
method Explicitly smooth closed-form score, use nearest-neighbor estimator.
result Efficient method generates novel samples without training.
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.
Paper develops machine learning algorithms to learn optimal integer weights for clinical risk scores.
problem Deriving optimal integer weights for clinical risk scores without computational burden.
method Flexible greedy optimization strategy to directly optimize a value function.
result Constructed an integer-weighted comorbidity score for measuring post-discharge mortality risk.
SIC measures dependency between variables, promoting feature selection.
problem Measuring and selecting features in high-dimensional data.
method Gradient regularized Integral Probability Metric (IPM) with sparsity inducing penalties.
result SIC can be used for reliable and interpretable feature selection.
PePR scores assess DL model performance per resource unit, promoting smaller, more efficient models.
problem Limited access to large-scale resources hinders medical image analysis research.
method Introduced PePR score to measure DL model performance per resource unit.
result Small-scale, specialized models outperform large-scale models in resource-constrained settings.
Kernel-Gradient Drifting improves generative modeling for non-Euclidean data.
problem Challenges in generative modeling for non-Euclidean data.
method Replaces Euclidean displacement with kernel-induced directions, exposing score-based structure.
result Kernel-gradient drifting enables state-of-the-art one-step generation for non-Euclidean data.
Bayesian approach scores influential training examples for model predictions.
problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.
AI improves MSME credit scoring using bank statement data.
problem Lack of access to financing for MSMEs due to traditional credit scoring methods.
method Developed a cash flow-based pipeline using bank statement data for machine learning credit scoring.
result Bank statement features significantly improve credit scoring models, achieving AUROC of 0.806.
This work uncovers algorithm-dependent regularisation in diffusion models.
problem Understanding and improving generalisation in high-dimensional diffusion models.
method Algorithmic stability and score stability analysis.
result Identifies multiple sources of implicit regularisation unique to diffusion models.
New method reduces parameters for symmetric/antisymmetric relations in KBC.
problem Increased parameters for symmetric/antisymmetric relations in embedding-based KBC methods.
method L1 regularizer for Complex Embeddings to promote symmetry/antisymmetry.
result The proposed method outperforms baseline methods on the FB15k dataset.
SFG improves on-manifold sampling without labels or additional training.
problem Guiding score-based models on manifolds without labeled data or extra training.
method Developed saddle-free guidance (SFG) that uses curvature of log density estimates.
result SFG achieves state-of-the-art metrics in image generation without labeled data or additional training.
PromID predicts human promoter positions with high accuracy.
problem Difficulties in identifying human promoter sequences.
method Deep learning approach predicting exact TSS positions.
result Significantly reduces false positive predictions.
We propose a new IRT model that directly factors test items without factor analysis.
problem Existing multidimensional IRT methods require factorization, which is posthoc and linear.
method We use a sparsity-promoting horseshoe prior to factorize items directly within the IRT model.
result Our model performs factorization directly and consistently selects the correct number of factors.
This work introduces COLA, a strategy to aggregate conformal prediction sets efficiently.
problem Efficiently combining multiple conformity scores to reduce prediction set size.
method Introduces COnfidence-Level Allocation (COLA) to optimally allocate confidence levels across sets.
result COLA achieves smaller prediction sets than state-of-the-art methods while maintaining valid coverage.
The study improves the assessment of fairness in face recognition using ROC curves and statistical guarantees.
problem Improving the assessment of fairness in face recognition systems.
method Proves asymptotic guarantees for empirical ROC curves and fairness metrics, and introduces a recentering technique to avoid bootstrap pitfalls.
result Demonstrates the practical relevance of the methods for assessing fairness in face recognition systems.
iPromoter-BnCNN identifies and classifies six types of sigma promoters.
problem Accurate classification of sigma promoters remains challenging.
method Convolutional Neural Network (CNN) combining local features.
result Supremacy on 5-fold cross-validation and independent test datasets.
Proposes a new method to explain model predictions for consumer recourse.
problem Current explanation methods fail to provide meaningful recourse to decision subjects.
method Develops feature responsiveness scores to highlight actionable features.
result Standard practices can undermine decision subjects by highlighting unresponsive features.
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.
A new method for uplift modeling using learning-to-rank techniques.
problem Improving customer targeting in marketing and retention.
method Unified formalization of uplift measures, learning-to-rank with PCG metric, LambdaMART optimization.
result Improved results compared to standard learning-to-rank metrics and state-of-the-art uplift modeling.
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.
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.
Pairwise quantile regression tackles similarity scoring in biometric systems.
problem Analyzing errors in similarity scoring for facial recognition.
method Established theoretical guarantees for pairwise quantile regression solutions, leveraging sharp concentration results for U-processes. result Proved generalization bounds and identified conditions for fast learning rates.
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 B. 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…
Proposes sparse QSVM for better generalization and interpretability.
problem Overfitting and difficulty in interpreting full quadratic classifiers.
method Enforces ℓ0-norm constraint to promote sparsity and develops a penalty decomposition algorithm. result The proposed model enhances generalization and produces sparse solutions.
Regularizes predictions to encourage beneficial user actions.
problem Learning models affect user actions, but provide no guarantees.
method Introduces look-ahead regularization to anticipate and encourage beneficial actions.
result Effective in promoting beneficial user actions in real and synthetic data.
LOCO-Reg improves CNN accuracy by promoting feature cohesion near filter centers.
problem Current regularization schemes in CNNs violate the principle that weights near the center of a filter are larger than weights on the outside.
method Introduces Locality-Promoting Regularization (LOCO-Reg) to correct this issue.
result LOCO-Reg yields accuracy gains across multiple architectures and datasets.
C-t3VAE improves class representation in long-tailed generative models.
problem Latent geometric bias in VAEs under class imbalance.
method Per-class Student's t-distribution priors, closed-form objective, equal-weight latent mixture.
result Consistently lower FID scores and better class-balanced generation for severely imbalanced datasets.
Proposes landmark selection for kernel methods.
problem Selecting important landmarks from large training sets.
method Deterministic and randomized adaptive algorithm for landmark selection.
result Landmarks are related to the minima of kernelized Christoffel functions.
Online reviews provide viewpoints on the strengths and shortcomings of products/services, influencing potential customers' purchasing decisions. However, the proliferation of non-credible reviews -- either fake (promoting/ demoting an item), incompetent (involving irrelevant aspects), or biased -- entails the problem o…
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.
Reverses simplification of risk measurement, focusing on portfolio covariance.
problem Risk measurement for unbenchmarkable global funds.
method Principal Component Analysis (PCA) with AI-generated labels, density-based clustering, and risk scores.
result Reveals true risk factors and identifies slow capital destroyers.
This paper addresses challenges in distance metric learning by promoting orthogonality and providing theoretical guarantees.
problem Challenges in distance metric learning, including non-convex optimization, lack of theoretical understanding, and generalization issues.
method Develops convex relaxations of non-convex problems, provides theoretical analysis on orthogonality, and offers a direct link to generalization performance.
result Convex methods promote balancedness, compactness, and generalization more effectively and efficiently.
The study optimizes free trial lengths to boost subscriptions and consumer loyalty.
problem Optimizing free trial lengths to maximize customer acquisition and retention.
method A large-scale field experiment with personalized policy design and evaluation.
result Personalized free trial policies outperform uniform trial lengths.
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.
New approach stabilizes GANs by leveraging implicit competitive regularization.
problem Stability issues in GAN training due to discriminator's exploitation of generator errors.
method Competitive Gradient Descent (CGD) for opponent-aware modeling of generator and discriminator.
result Significant improvement in GAN training stability without explicit regularization.
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…
IAGAN method improves medical image reconstruction by incorporating adaptive GAN priors.
problem Reconstructing high-fidelity medical images from incomplete data.
method Image-adaptive GAN-based reconstruction method (IAGAN).
result IAGAN can recover fine structures relevant for medical diagnosis.
Alpha-norm regularization simplifies marketing demand forecasting.
problem Ultra high-dimensional problems in demand estimation and forecasting.
method Nonconvex alpha-norm objective with coordinate descent and proximal operators.
result Alpha-norm regularization provides accurate out-of-sample estimates for promotion effects.
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.
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.
SBS policy improves crypto market forecasts by 0.15% with minimal model changes.
problem Improving crypto market forecasting models while minimizing model state transitions.
method Shadow Before Swap (SBS) policy that warm-refits and evaluates challenger models.
result Reduces NLL by 0.1472% relative to continuous maintenance in historical data.
CD estimates demand by separating promotions from a stable base, reducing inventory costs.
problem Operational volatility in demand forecasts leads to excessive safety stock and inventory costs.
method Contextual Deconvolution (CD) decomposes demand into a smooth base and promotion-driven shocks.
result CD reduces inventory costs by stabilizing demand forecasts, but under-provisions event spikes.
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…