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

Trend · papers per month

126251377502 · Jun 202019922001200920172026
48 results for ad-click prediction

Interprets feature interactions in ad-click prediction models.

problem Improving interpretability of black-box recommender systems.
method Interprets feature interactions from a source model and encodes them in a target model.
result Interpretations significantly outperform existing recommender models.

In the cost per click (CPC) pricing model, an advertiser pays an ad network only when a user clicks on an ad; in turn, the ad network gives a share of that revenue to the publisher where the ad was impressed. Still, advertisers may be unsatisfied with ad networks charging them for "valueless" clicks, or so-called accid…

2018-04-03abs ↗pdf ↗

Feature engineering has been the key to the success of many prediction models. However, the process is non-trivial and often requires manual feature engineering or exhaustive searching. DNNs are able to automatically learn feature interactions; however, they generate all the interactions implicitly, and are not necessa…

2017-08-17abs ↗pdf ↗

User response prediction makes a crucial contribution to the rapid development of online advertising system and recommendation system. The importance of learning feature interactions has been emphasized by many works. Many deep models are proposed to automatically learn high-order feature interactions. Since most featu…

2019-04-02abs ↗pdf ↗

Estimates conversion probabilities from click sequences with privacy constraints.

problem Training models in advertising with limited direct click-conversion links.
method Formalizes learning from attribution sets, constructs unbiased estimator, applies Empirical Risk Minimization.
result Empirical Risk Minimization achieves generalization guarantees and robustness against prior errors.

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 ↗

A new algorithm for social network recommendations using side-observations.

problem Designing recommendation algorithms for users influenced by their social network.
method Contextual bandits with side-observations modeled by a social network graph.
result The proposed algorithm achieves asymptotically optimal regret, matching the lower-bound as ToT o \infty.

Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.

problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.

Self-calibrating conformal prediction improves interval efficiency and offers a practical alternative.

problem Improving the reliability and uncertainty quantification of machine learning predictions.
method Combines Venn-Abers calibration and conformal prediction for binary and regression problems.
result Improves interval efficiency through model calibration and offers practical alternatives.

Study uses deep learning to predict asset prices, finds complex target processes lead to meaningless predictions.

problem Complexity of successful price prediction models hinders understanding.
method Deep learning models for high-frequency price prediction, focusing on volatility and directional prediction.
result Inadequately defined target price process renders predictions meaningless.

The paper emphasizes the importance of joint predictions over marginal predictions for decision-making.

problem The need for accurate joint predictions in decision-making problems.
method The paper analyzes combinatorial decision problems, sequential predictions, and multi-armed bandits, introducing an approximate Thompson sampling algorithm and new regret bounds.
result Accurate joint predictions are essential for good performance in decision-making problems.

Behavior modification improves prediction accuracy by nudging user behavior.

problem Improving prediction accuracy using behavior modification techniques.
method Combining prediction and behavior modification with reinforcement learning algorithms.
result Behavior modification can make predictions more certain but may not generalize.

Prediction problems often admit competing models that perform almost equally well. This effect challenges key assumptions in machine learning when competing models assign conflicting predictions. In this paper, we define predictive multiplicity as the ability of a prediction problem to admit competing models with confl…

2019-09-14abs ↗pdf ↗

Proposes feature conformal prediction for broader application in semantic feature spaces.

problem Establishing valid prediction intervals in semantic feature spaces.
method Extends conformal prediction to semantic feature spaces using deep representation learning.
result Feature conformal prediction outperforms regular conformal prediction under mild assumptions.

Acute kidney injury (AKI) commonly occurs in hospitalized patients and can lead to serious medical complications. In order to optimally predict AKI before it develops at any time during a hospital stay, we present a novel framework in which AKI is continually predicted automatically from EHR data over the entire hospit…

2019-02-26abs ↗pdf ↗

AutoCP automates the construction of accurate prediction intervals.

problem Creating valid and accurate prediction intervals for machine learning models.
method AutoML framework that optimizes prediction interval length for better accuracy and less conservatism.
result AutoCP significantly outperforms benchmark algorithms in constructing accurate prediction intervals.

Proposes a method to apply conformal prediction to probabilistic time series forecasting models.

problem Obtaining accurate prediction regions for multi-step time series forecasting with probabilistic models.
method Conformalises conditional normalising flows to generate potentially disjoint prediction regions.
result Improves predictive efficiency in time series forecasting with multimodal distributions.

ICP improves prediction intervals for continuous outcomes at lower computational cost.

problem Systematic bias in point predictions that undermines their use in decision-making.
method Develops Isotonic Conformal Prediction (ICP) framework to decouple calibration from prediction-set construction.
result SICP and TICP procedures match SC-CP coverage at lower computational cost.

Optimizes predictions for specific tasks using parametrized decision analysis.

problem Optimizing predictions for specific decision tasks of interest.
method Designs a class of parametrized actions for Bayesian decision analysis.
result Derives efficient and interpretable solutions for various action parametrizations and loss functions.

This paper discusses a counterpart of conformal prediction for e-values, conformal e-prediction. Conformal e-prediction is conceptually simpler and had been developed in the 1990s as a precursor of conformal prediction. When conformal prediction emerged as result of replacing e-values by p-values, it seemed to have imp…

2020-01-16abs ↗pdf ↗

RFpredInterval package builds prediction intervals for random forests and boosted forests.

problem Quantifying uncertainty in random forest and boosted forest point predictions.
method 16 methods to build prediction intervals with random forests and boosted forests.
result The proposed method outperforms existing methods in building prediction intervals.

FPPI selectively uses predictions to improve inference efficiency.

problem Improving statistical inference with limited labeled data and heterogeneous prediction quality.
method Filtered Prediction-Powered Inference (FPPI) framework.
result FPPI achieves strictly improved asymptotic efficiency compared to existing methods.

COP improves online conformal prediction by incorporating data patterns, leading to tighter prediction sets.

problem Overly conservative prediction sets in online conformal prediction methods when data distribution shifts.
method Conformal Optimistic Prediction (COP) incorporating estimated cumulative distribution function of non-conformity scores.
result COP produces tighter prediction sets with valid coverage guarantees, outperforming other methods.

Most existing examples of full conformal predictive systems, split-conformal predictive systems, and cross-conformal predictive systems impose severe restrictions on the adaptation of predictive distributions to the test object at hand. In this paper we develop split-conformal and cross-conformal predictive systems tha…

2019-02-18abs ↗pdf ↗

Prediction is arguably one of the most basic functions of an intelligent system. In general, the problem of predicting events in the future or between two waypoints is exceedingly difficult. However, most phenomena naturally pass through relatively predictable bottlenecks---while we cannot predict the precise trajector…

2018-08-23abs ↗pdf ↗

New method improves predictive systems with better theoretical guarantees.

problem Constructing predictive systems with out-of-sample calibration guarantees.
method Residual Distribution Predictive Systems (RDPs) that nest conformal predictive systems and offer flexibility.
result Empirically, RDPs perform competitively with conformal predictive systems and can be implemented with various regression methods.

Prediction of future observations is an important and challenging problem. The two mainstream approaches for quantifying prediction uncertainty use prediction regions and predictive distributions, respectively, with the latter believed to be more informative because it can perform other prediction-related tasks. The st…

2020-01-24abs ↗pdf ↗

Variational Prediction simplifies Bayesian inference without test time costs.

problem Bayesian inference's computational costs and posterior predictive distribution marginalization.
method Variational Prediction learns a variational approximation to the posterior predictive distribution using a variational bound.
result Directly learns a variational approximation to the posterior predictive distribution without test time marginalization costs.

The study examines how hyperparameters affect prediction discrepancies in machine learning models.

problem Prediction inconsistencies across different machine learning models trained on the same dataset.
method Investigation of six models (Elastic Net, Decision Tree, k-NN, SVM, RF, XGBoost) on 21 benchmark datasets, focusing on key hyperparameters.
result Hyperparameter tuning improves model performance but increases prediction discrepancies, especially in Extreme Gradient Boosting.

Long-term lane change prediction model predicts maneuvers with 75% accuracy.

problem Predicting long-term lane changes for safer autonomous driving.
method Introduced three models: logistic regression, MLP, and RNN. Used NGSIM dataset with new labeling scheme.
result Developed model predicts 75% of lane changes with an average advanced time of 8.05 seconds.

Generalizes conformal prediction to multiple learnable parameters for efficient prediction sets.

problem Learning valid and efficient prediction sets with low-capacity function classes.
method Constrained empirical risk minimization (ERM) with gradient-based optimization of differentiable surrogate losses and Lagrangians.
result Achieves approximate valid population coverage and near-optimal efficiency within class.

Paper discusses optimal CP for second-order predictions.

problem How to incorporate second-order predictions into conformal prediction.
method Introduces Bernoulli prediction sets (BPS) for second-order predictions and applies conformal risk control for compromised validity.
result BPS provides the smallest prediction sets with conditional coverage.

JANET improves time series prediction with adaptive uncertainty regions.

problem Time series data's lack of exchangeability and multi-step prediction challenges.
method Proposes JANET, a framework for joint adaptive prediction regions with controlled error rates.
result Demonstrates superior performance in multi-step prediction tasks across diverse datasets.

The Neural Testbed evaluates joint predictions of neural agents, revealing their limitations.

problem Evaluating the quality of joint predictions generated by neural agents.
method Developed an open-source benchmark (The Neural Testbed) to assess agents' marginal and joint predictions.
result Popular Bayesian deep learning agents perform poorly on joint predictions, even with accurate marginal predictions.