Study analyzes factors influencing healthcare providers' engagement with SMS campaigns.
problem Understanding what drives healthcare providers to engage with SMS campaigns.
method Used logistic regression, random forest, and neural network models to analyze data.
result Identified key factors influencing engagement with SMS campaigns.
Proposes a greedy algorithm for telecom offers to retain subscribers.
problem Maximizing revenue while preventing churn in telecom subscribers.
method Combinatorial algorithm for offer optimization under heterogeneous incentives.
result Efficient and accurate solution for large subscriber bases.
In this paper, a novel architecture of Recurrent Neural Network (RNN) is designed and experimented. The proposed RNN adopts a computational memory based on the concept of stigmergy. The basic principle of a Stigmergic Memory (SM) is that the activity of deposit/removal of a quantity in the SM stimulates the next activi…
Introduces SM-games to analyze machine learning interactions.
problem Lack of understanding and control in n-player games.
method Introduces SM-games with pairwise zero-sum interactions.
result SM-games are amenable to first-order optimization methods.
Spectral mixture (SM) kernels comprise a powerful class of generalized kernels for Gaussian processes (GPs) to describe complex patterns. This paper introduces model compression and time- and phase (TP) modulated dependency structures to the original (SM) kernel for improved generalization of GPs. Specifically, by adop…
Study geodesic flows, billiards, and metrics on manifolds.
problem Inverse scattering and billiard dynamics on Riemannian manifolds.
method Lyapunov function, harmonizing metrics, isoperimetric inequalities, Santaló-Chernov formulas.
result Holography theorems and formulas for geodesic and billiard dynamics.
For a given smooth compact manifold M, we introduce an open class G(M) of Riemannian metrics, which we call \emph{metrics of the gradient type}. For such metrics g, the geodesic flow vg on the spherical tangent bundle SM→M admits a Lyapunov function (so the vg-flow is traversing). It turns ou…
HapNet predicts marketing campaign effects using a hierarchical structure.
problem Complex and challenging effect prediction for marketing campaigns.
method Hierarchical Capsule Prediction Network (HapNet).
result HapNet outperforms state-of-the-art methods in both synthetic and real data.
New taxonomy for structured missingness in large-scale databases.
problem Handling missing values in structured data.
method Introducing a new taxonomy for Structured Missingness (SM) and embedding it within existing mechanisms.
result Demonstrated the impact of Structured Missingness on inference and prediction.
Improves learning of spectral mixture kernels with approximate Bayesian inference.
problem Difficult optimization of large number of SM kernel parameters.
method Approximate Bayesian inference using variational distribution of spectral points and random Fourier features.
result Accelerates convergence and leads to better optimal parameters.
Optimizes RTB campaigns by selecting user profiles and website configurations.
problem Maximizing impressions and profitability in RTB campaigns.
method Optimizes user profiles and website configurations, combines with other strategies.
result As the required number of visits increases, average profitability decreases.
We establish, via geometric quantization of the supercotangent bundle sM of (M,g), a correspondence between its conformal geometry and those of the spinor bundle. In particular, the Kosmann Lie derivative of spinors is obtained by quantization of the comoment map, associated to the new Hamiltonian action of conf(M,g) o…
Adaptive filters are applied in several electronic and communication devices like smartphones, advanced headphones, DSP chips, smart antenna, and teleconference systems. Also, they have application in many areas such as system identification, channel equalization, noise reduction, echo cancellation, interference cancel…
Score matching fails to train VAEs robustly, revealing autoencoding loss insights.
problem Catastrophic failure of variational score matching on VAE models.
method Analysis of existing variational score matching objectives and their equivalence to autoencoding losses.
result Score matching methods fail to produce robust VAE models, predicting poor performance.
Paper introduces a new distributional successor measure for reinforcement learning.
problem Learning the distributional consequences of behavior in reinforcement learning.
method Formulates distributional successor measure as a distribution over distributions, proposes algorithm to learn it from data.
result Demonstrates zero-shot risk-sensitive policy evaluation.
Let M be a compact smooth Riemannian n-manifold with boundary. We combine Gromov's amenable localization technique with the Poincaré duality to study the {\sf traversally generic} geodesic flows on SM, the space of the spherical tangent bundle. Such flows generate stratifications of SM, governed by rich univers…
This paper enhances uplift modeling for multi-treatment marketing campaigns.
problem Optimizing marketing strategies by selecting individuals likely to respond to different treatments.
method Leveraging score ranking and calibration techniques.
result Improves overall performance of marketing campaigns.
This study shows neural nets can approximate Turing machines with meaningful statistical properties.
problem Theoretical limitations in approximating Turing machines with neural networks.
method Formal definition of statistically meaningful approximation, analysis of boolean circuits and Turing machines using neural nets.
result Transformers can statistically meaningfully approximate Turing machines with polynomial sample complexity.
The paper tackles the issue of preferential attachment in targeted display advertising by developing domain-adaptation approaches.
problem Skewed distribution of data leads to preferential attachment towards high-budget partners.
method Develops domain-adaptation approaches to predict interested users for low-budget partners.
result Proposed approaches outperform other domain-adaptation methods across different points of campaigns.
Real time bidding (RTB) enables demand side platforms (bidders) to scale ad campaigns across multiple publishers affiliated to an RTB ad exchange. While driving multiple campaigns for mobile app install ads via RTB, the bidder typically has to: (i) maintain each campaign's efficiency (i.e., meet advertiser's target cos…
Semi-Implicit Variational Inference (SIVI) is improved with SIVI-SM using score matching.
problem Intractable densities in variational distributions hinder SIVI training.
method SIVI-SM uses score matching to handle intractable densities in a minimax formulation.
result SIVI-SM outperforms ELBO-based SIVI methods in Bayesian inference tasks.
New method detects adversarial attacks in industrial systems.
problem Adversarial attacks compromise machine learning models in industrial control systems.
method Introduces domain adaptation layer and Monte Carlo simulation for proactive defense.
result Approximates Bayes optimal mitigation for improved detection model health.
Study uses causal machine learning to assess coupon campaign impact on retailer sales.
problem Assessing the causal effect of a coupon campaign on retailer sales.
method Causal machine learning algorithms, subgroup analysis, optimal policy learning.
result Only two coupon categories (drugstore and other food) have a significant positive impact on sales.
Study optimizes classifiers for credit card mail campaigns and default prediction.
problem Optimizing classifiers for credit card mail campaigns and default prediction.
method Three distinct models: response, risk, and response-risk. Optimized various performance metrics.
result Random Forest classifier achieves highest accuracy (83.2%) in multi-class response-risk model.
Efficiently approximates higher-order derivatives for generative models.
problem Expensive computation of higher-order derivatives in generative models.
method Rewrite SM objective in terms of directional derivatives and use finite difference for efficient approximation.
result Comparable results to gradient-based methods but significantly more computationally efficient.
This paper optimizes ad bids and daily budgets for multiple campaigns in pay-per-click advertising.
problem Optimizing ad bids and daily budgets for multiple campaigns in pay-per-click advertising.
method Formulated as a combinatorial semi-bandit problem, solved using Gaussian Processes and four algorithms.
result Regret upper bounded as O(sqrt{T}), where T is the time horizon.
The study shows conditions for thermostats to have no conjugate points.
problem Conditions for thermostats to have no conjugate points.
method Analyzes smooth functions and properties of thermostats.
result Proves conditions for thermostats to be projectively Anosov and have no conjugate points.
The paper introduces revenue uplift modeling to maximize marketing profits.
problem Maximizing incremental sales versus maximizing incremental revenue in marketing campaigns.
method Response transformation and two-stage models to decompose campaign profit.
result Revenue uplift modeling can improve campaign profit substantially.
The paper tackles budget allocation for multiple campaigns using a novel combinatorial bandit approach.
problem Maximizing cumulative returns with limited budgets across various ad lines.
method Formulated as a multi-task combinatorial bandit problem, integrates Bayesian hierarchical models, and uses Thompson sampling.
result Demonstrates robustness and adaptability in maximizing overall cumulative returns.
SM-netFusion estimates brain network atlas by considering multiple topological measures.
problem Limited BNA estimation methods that overlook topological measures and lack discriminative power.
method Supervised multi-topology network cross-diffusion framework using degree, closeness, and eigenvector centrality measures.
result SM-netFusion produces more centered and representative templates, and improves classification accuracy.
Smart Meters (SMs) are able to share the power consumption of users with utility providers almost in real-time. These fine-grained signals carry sensitive information about users, which has raised serious concerns from the privacy viewpoint. In this paper, we focus on real-time privacy threats, i.e., potential attacker…
Paper proposes a method to estimate truncated density models using Score Matching.
problem Estimating parameters of truncated probability densities.
method Score Matching with a novel weight function derived from Stein discrepancy.
result The proposed method minimizes a weighted Fisher divergence and corrects outlier-trimming bias.
A Qini-based uplift model improves retention marketing campaign performance.
problem Isolating the marketing effect of a campaign and identifying responsive customers.
method Qini-based uplift regression model using logistic regression.
result Qini-optimized uplift models improve performance and provide interpretable models.
New methods help calibrate complex ABMs more efficiently.
problem Calibrating parameters in complex ABMs is challenging.
method Integrates different sampling methods and surrogate models.
result Surrogate assisted methods perform better than standard methods.
We propose an computational framework for real-time risk assessment and prioritizing for random outcomes without prior information on probability distributions. The basic model is built based on satisficing measure (SM) which yields a single index for risk comparison. Since SM is a dual representation for a family of r…
PolicySynth improves synthetic data alignment with real data for better campaign decisions.
problem Synthetic data used in decision support systems often leads to incorrect decisions.
method PolicySynth framework that conditions synthetic data on churn scorer to align with real data decisions.
result PolicySynth achieves high strategy simulation fidelity (0.923-0.960) on churn and acquisition datasets.
Scalable hybrid HMM with Gaussian Process for time-series data clustering.
problem Large number of parameters and long sequences in time-series data make HMM-GPSM training difficult.
method Stochastic Variational Inference (SVI) for long sequences and reparameterized random Fourier features (R-RFF) for large data points.
result Significant reduction in training time and improved hidden-state estimation accuracy.
Extending braid group representations to singular braid monoids and groups.
problem Extending braid group representations to singular braid monoids and groups.
method Investigating the extension of representations from braid groups to singular braid monoids and groups, and computing defects.
result Constructing a linear representation of the singular braid group that is an extension of the Lawrence-Krammer-Bigelow representation and computing its defect.
New method uses SURE to denoise signals, outperforming NPMLE.
problem Learning to optimally denoise signals corrupted by Gaussian noise.
method Hyvärinen's score matching (SM) is shown equivalent to SURE minimization.
result SURE achieves nearly parametric rates of convergence in empirical Bayes settings.
Activists align with large fund preferences for success.
problem Aligning with large fund preferences increases activist success.
method Analyzed previous proxy voting behavior to estimate preferences and correlated them with activist success.
result Campaigns with higher alignment receive more votes and are more successful.
Paper addresses CPA line forecasting in online advertising mid-flight.
problem Forecasting ad campaign performance mid-flight considering bidding mechanisms.
method Generates relationships between metrics and optimization signals, estimates sensitivity, and characterizes advertiser spends vs. eCPA.
result Demonstrates promising accuracy in forecasting against actual deliveries.
Optimizes user marketing campaigns to balance cost and effectiveness.
problem Lack of methods to optimize marketing campaigns considering cost and effectiveness.
method Proposes a treatment effect optimization algorithm using deep learning to balance cost and effectiveness.
result Demonstrates superior performance in cost-efficiency and real-world business value.
Proves lower bounds on Hausdorff dimension of projections of invariant sets.
problem Lower bounds on Hausdorff dimension of projections of invariant sets.
method Transversal property of geodesics, (k+1)-linear curved Kakeya estimate, Bourgain-Guth argument. result Proves a lower bound on the Hausdorff dimension of projections of invariant sets.
The paper tackles decision making problems with funnel structure in email marketing campaigns.
problem Decision making challenges in systems with funnel structure, where fewer observations are received from deeper layers.
method Formulated as a contextual bandit with funnel structure and developed a multi-task learning algorithm.
result Our algorithms offer significant improvement over previous methods in email marketing campaigns.
This paper addresses the problem of inferring a regular expression from a given set of strings that resembles, as closely as possible, the regular expression that a human expert would have written to identify the language. This is motivated by our goal of automating the task of postmasters of an email service who use r…
Framework detects influential actors in disinformation networks.
problem Identifying and countering hostile influence operations on social media.
method Combines NLP, ML, graph analytics, and causal inference.
result 96% precision, 79% recall, 96% PR-curve area for IO detection.
Enhances GPLVM for multi-view data with scalable latent representation learning.
problem Limited kernel expressiveness and computational inefficiency in multi-view GPLVM.
method Introduces a new duality between spectral density and kernel function, uses NG-SM kernel, and applies random Fourier feature approximation for scalability.
result Consistently outperforms state-of-the-art models in learning meaningful latent representations across diverse datasets.
Mobile payment incentives optimized using merchant transaction networks.
problem Optimizing marketing campaigns with limited budgets.
method Graph representation learning on transaction networks.
result Effective modeling of merchant sensitivity to incentives.