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

Trend · papers per month

3672108144 · Jun 202019922001200920172026
48 results for ad recommendations

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.

New private learning algorithms improve utility in tasks with public features.

problem Private learning with public features in recommendation and ad prediction.
method Developed algorithms that protect only certain sufficient statistics, improving utility for linear regression and private recommendation benchmarks.
result Achieved state-of-the-art performance on private recommendation benchmarks.

Deep Bayesian Bandits improve personalized ads by balancing exploration and exploitation.

problem Recommender systems favor items already engaged by users, causing new campaigns to remain unexplored.
method Formulated as a contextual bandit, implemented exploration techniques using posterior distribution and bootstrapped models.
result Demonstrated a positive gain in exploration model in offline simulation and online AB setting.

New term ADS describes how machine learning can change user behavior.

problem Machine learning systems can unintentionally change user behavior, affecting performance.
method Introduced `unit tests` and mitigation strategy for hidden incentives in auto-induced distributional shift.
result Meta-learning and Q-learning sometimes fail unit tests but pass with mitigation strategy.

The paper proposes a new recommender system combining ratings and textual reviews.

problem Lack of using textual reviews in recommender systems.
method Combines Latent Factor Model with Latent Dirichlet Allocation for textual reviews.
result Combining textual reviews with ratings improves recommendation quality.

New approach combines semi-supervised learning and bandits for better predictions.

problem Online semi-supervised learning with bandit feedback for applications like clinical trials and ad recommendations.
method Adjusted Graph Convolutional Network (GCN) for contextual bandits, with semi-supervised missing rewards imputation.
result Developed multi-GCN embedded contextual bandit algorithms verified on real-world datasets.

Improves sequential recommendation with relation-aware self-attention.

problem Improving accuracy in sequential recommendation.
method Integrates Transformer's self-attention mechanism with a probabilistic model of recommendation context.
result Significant improvements over recent baseline models.

Singular Value Decomposition (SVD) has been used successfully in recent years in the area of recommender systems. In this paper we present how this model can be extended to consider both user ratings and information from Wikipedia. By mapping items to Wikipedia pages and quantifying their similarity, we are able to use…

2012-12-05abs ↗pdf ↗

Adobe research tackles strategic recommendations using reinforcement learning.

problem Optimizing user interactions for long-term objectives in various use-cases.
method Reinforcement learning applied to modeling user behavior and decision-making.
result Practical solutions implemented for various use-cases, addressing fundamental challenges.

The paper improves recommendation systems by ensuring their outputs are reliable.

problem Recommendation systems often lack reliability guarantees for their outputs.
method The method uses a pre-trained ranking model to create a set of items with rigorous FDR control.
result The approach provides a way to guarantee the reliability of recommendation outputs.

CRL improves recommendation systems by reducing distribution shift.

problem Offline metrics fail to predict online performance due to distribution shift in recommender systems.
method Proposes an information-theoretic disentanglement criterion and a variational lower bound for better generalisation under distribution shift.
result CRL variants deliver substantial online gains in listener engagement compared to baseline models.

Item recommendation is a personalized ranking task. To this end, many recommender systems optimize models with pairwise ranking objectives, such as the Bayesian Personalized Ranking (BPR). Using matrix Factorization (MF) --- the most widely used model in recommendation --- as a demonstration, we show that optimizing it…

2018-08-12abs ↗pdf ↗

The paper tackles robust design selection for online experiments under uncertain interference mechanisms.

problem Designing experiments in ads, recommendations, and member-experience systems when interference mechanisms are unknown.
method Formulates the problem as robust design selection over uncertain exposure mechanisms. Compares designs by worst-case planning risk over an ambiguity set combining various factors.
result Develops a geometry-aware guarantee and robust selector theorem with excess-risk control, exact recovery under separation, and certified shortlists when the risk surface is flat.

This paper studies the evaluation of policies that recommend an ordered set of items (e.g., a ranking) based on some context---a common scenario in web search, ads, and recommendation. We build on techniques from combinatorial bandits to introduce a new practical estimator that uses logged data to estimate a policy's p…

2016-05-16abs ↗pdf ↗

HyperFair integrates fairness in recommender systems using probabilistic soft logic.

problem Ensuring fairness in recommender systems across diverse domains.
method Soft fairness constraints integrated as regularization in a joint inference objective function.
result HyperFair improves fairness of predictions from black-box models and hybrid systems.

The paper shows how ignoring temporal context in recommender systems evaluation leads to false confidence, proposing a method to embed temporal context.

problem The discrepancy between offline and online recommender system performance evaluation.
method Proposes a training procedure to embed temporal context into recommender systems and validates its advantage using multi-objective optimization.
result Including temporal context in recommender systems evaluation can improve recall@20 by up to 20%.

Deep learning predicts M&A events in industry networks.

problem Predicting M&A behaviors in competitive industries with complex interdependencies.
method Temporal Dynamic Industry Network (TDIN) model using temporal point processes and deep learning.
result Effective M&A event prediction and actionable recommendations.

Proposes a differentially private bandit algorithm reducing noise over time.

problem Privacy concerns in interactive recommendation systems.
method Tree-based mechanism to add Laplace or Gaussian noise to model parameters, focusing on dynamic global sensitivity.
result Demonstrates (ε,δ)(ε, δ)-differential privacy with reduced noise and improved regret.

Paper introduces a trading agent using LLMs for risk assessment and trading recommendations.

problem Developing a trading agent that can handle financial risks effectively.
method Extending CPPO algorithm with LLM-generated risk assessment and trading signals from financial news.
result Backtesting shows improved performance of the trading agent compared to benchmarks.

Database activity monitoring (DAM) systems are commonly used by organizations to protect the organizational data, knowledge and intellectual properties. In order to protect organizations database DAM systems have two main roles, monitoring (documenting activity) and alerting to anomalous activity. Due to high-velocity …

2019-10-23abs ↗pdf ↗

This paper improves context-aware recommender systems by selecting and incorporating relevant low-dimensional contextual information.

problem Generating accurate recommendations is not enough; contextual information can cause issues like battery drain and privacy.
method Developed a feature-selection algorithm based on genetic algorithms to reduce context dimensions while maintaining explainability.
result The approach improves accuracy and transparency in recommendations, outperforming state-of-the-art models.

The cross-domain recommendation technique is an effective way of alleviating the data sparse issue in recommender systems by leveraging the knowledge from relevant domains. Transfer learning is a class of algorithms underlying these techniques. In this paper, we propose a novel transfer learning approach for cross-doma…

2018-04-18abs ↗pdf ↗

A new method for precise user targeting in advertising using hyperbolic manifold learning.

problem Improving user satisfaction in targeted advertising by overcoming skepticism and spam perception.
method Proposes a Multi-Manifold Learning framework to learn hierarchical user and ad representations in the hyperbolic space.
result Demonstrates improved performance in user targeting and prediction accuracy on both public datasets and a large-scale commercial system.

In E-commerce advertising, where product recommendations and product ads are presented to users simultaneously, the traditional setting is to display ads at fixed positions. However, under such a setting, the advertising system loses the flexibility to control the number and positions of ads, resulting in sub-optimal p…

2018-09-10abs ↗pdf ↗

Many prediction domains, such as ad placement, recommendation, trajectory prediction, and document summarization, require predicting a set or list of options. Such lists are often evaluated using submodular reward functions that measure both quality and diversity. We propose a simple, efficient, and provably near-optim…

2013-05-11abs ↗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.

We develop a learning principle and an efficient algorithm for batch learning from logged bandit feedback. This learning setting is ubiquitous in online systems (e.g., ad placement, web search, recommendation), where an algorithm makes a prediction (e.g., ad ranking) for a given input (e.g., query) and observes bandit …

2015-02-09abs ↗pdf ↗

Machine learning suffers from poor design, data, and evaluation practices.

problem Ad hoc design, poor data hygiene, and lack of statistical rigor in model evaluation.
method Examines the entire machine learning process from design to evaluation, highlighting common pitfalls and providing recommendations.
result Common pitfalls in machine learning research and development are identified and actionable recommendations are provided.

ShadowSync separates background synchronization for scalable distributed training.

problem Reducing synchronization overhead in distributed training for high scalability.
method Separates synchronization from training and runs it in the background.
result Achieves both high throughput and excellent model quality at scale.

Contextual multi-armed bandit (MAB) algorithms have been shown promising for maximizing cumulative rewards in sequential decision tasks such as news article recommendation systems, web page ad placement algorithms, and mobile health. However, most of the proposed contextual MAB algorithms assume linear relationships be…

2019-01-31abs ↗pdf ↗

Method prevents model divergence in rapidly changing ad markets.

problem Model divergence due to rapid ad turnover and discontinuity.
method Dual ascent optimization with latent vector constraints.
result Significant reduction in diverging instances and improved user experience/revenue.

Researchers develop a method to measure treatment effects in settings with shared states.

problem Measuring treatment effects in settings with shared states like prices, recommendations, or social signals.
method Double machine learning (DML) theorem with conditions for efficient inference under shared-state interference.
result Efficient estimation of average direct effect (ADE) and global average treatment effect (GATE) in various models.

New framework for evaluating ad auctions using stochastic modeling.

problem Challenges in evaluating deterministic ad auctions.
method Repurposed bid landscape model to approximate propensity scores, enabling robust OPE estimators.
result Remarkable alignment with online A/B test results, achieving 92% MDA in CTR prediction.

We study fairness in collaborative-filtering recommender systems, which are sensitive to discrimination that exists in historical data. Biased data can lead collaborative-filtering methods to make unfair predictions for users from minority groups. We identify the insufficiency of existing fairness metrics and propose f…

2017-05-24abs ↗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 ↗

DHEN improves CVR prediction for ads with multitask learning and auxiliary loss.

problem Predicting conversion rates in ad-recommendation systems.
method DHEN integrates multiple feature-crossing modules and uses a multitask learning framework, ablation studies, and self-supervised auxiliary loss.
result DHEN achieves state-of-the-art performance in CVR prediction.