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

140281421561 · Jun 202019922001200920172026
48 results for next novel basket recommendation

Develops M2 model for next-basket recommendation considering user preferences, item popularity, and transition patterns.

problem Next-basket recommendation problem considering user preferences, item popularity, and transition patterns.
method Mixed model with preferences, popularities, and transitions (M2) using ed-Trans for transition patterns among items.
result Significantly outperforms state-of-the-art methods on all datasets in all tasks, with up to 22.1% improvement.

This study tackles mutual fund portfolio prediction, focusing on novel items.

problem Predicting novel items in mutual fund portfolios is challenging and less explored.
method Created a comprehensive benchmark dataset and evaluated various recommender system models.
result Autoencoder-based approaches outperform state-of-the-art models in predicting novel items.

Complementary products recommendation is an important problem in e-commerce. Such recommendations increase the average order price and the number of products in baskets. Complementary products are typically inferred from basket data. In this study, we propose the BB2vec model. The BB2vec model learns vector representat…

2018-09-25abs ↗pdf ↗

The paper proposes a new method for product recommendation that considers revenue contributions and user similarity.

problem High dimensionality and sparsity in user-item data, especially in terms of revenue contributions.
method The approach encodes revenue contributions in the user-item matrix and computes customer similarity using suitable distance measures.
result The method segments users based on revenue-based similarity and supports recommendations aligned with profitability objectives.

Determinantal point processes (DPPs) have received significant attention in the recent years as an elegant model for a variety of machine learning tasks, due to their ability to elegantly model set diversity and item quality or popularity. Recent work has shown that DPPs can be effective models for product recommendati…

2018-05-24abs ↗pdf ↗

Study efficient numerical methods for American basket options.

problem Valuation of American basket options.
method Partial differential complementarity problems (PDCPs) and efficient discretization.
result Approximations of American basket options are close and converge favourably.

In this paper, we present iPrescribe, a scalable low-latency architecture for recommending 'next-best-offers' in an online setting. The paper presents the design of iPrescribe and compares its performance for implementations using different real-time streaming technology stacks. iPrescribe uses an ensemble of deep lear…

2019-05-31abs ↗pdf ↗

SANST uses self-attentive networks with spatial and temporal embeddings for better POI recommendations.

problem Next point-of-interest (POI) recommendation for users based on their history.
method SANST incorporates spatio-temporal patterns into self-attentive networks.
result SANST outperforms state-of-the-art models by up to 13.65% in nDCG@10.

Recommending the right products is the central problem in recommender systems, but the right products should also be recommended at the right time to meet the demands of users, so as to maximize their values. Users' demands, implying strong purchase intents, can be the most useful way to promote products sales if well …

2019-02-12abs ↗pdf ↗

ComiRec framework predicts user interests for personalized recommendations.

problem Predicting user interests from sequential behavior data.
method ComiRec framework captures multiple user interests and balances recommendation accuracy and diversity.
result ComiRec achieves significant improvements over state-of-the-art models in sequential recommendation.

In many online applications interactions between a user and a web-service are organized in a sequential way, e.g., user browsing an e-commerce website. In this setting, recommendation system acts throughout user navigation by showing items. Previous works have addressed this recommendation setup through the task of pre…

2018-09-07abs ↗pdf ↗

Which song will Smith listen to next? Which restaurant will Alice go to tomorrow? Which product will John click next? These applications have in common the prediction of user trajectories that are in a constant state of flux over a hidden network (e.g. website links, geographic location). What users are doing now may b…

2015-11-03abs ↗pdf ↗

OMBA learns product and user representations for better online market basket analysis.

problem Limited ability to uncover rarely occurring and temporal associations in MBA.
method Jointly learns product and user representations, captures temporal dynamics, scalable online method.
result OMBA outperforms state-of-the-art methods by 21% on real-world datasets.

In recent years, the Word2Vec model trained with the Negative Sampling loss function has shown state-of-the-art results in a number of machine learning tasks, including language modeling tasks, such as word analogy and word similarity, and in recommendation tasks, through Prod2Vec, an extension that applies to modeling…

2018-05-22abs ↗pdf ↗

Convolutional Neural Networks (CNNs) have been recently introduced in the domain of session-based next item recommendation. An ordered collection of past items the user has interacted with in a session (or sequence) are embedded into a 2-dimensional latent matrix, and treated as an image. The convolution and pooling op…

2018-08-15abs ↗pdf ↗

In the paper, we characterize the asymptotic behavior of the implied volatility of a basket call option at large and small strikes in a variety of settings with increasing generality. First, we obtain an asymptotic formula with an error bound for the left wing of the implied volatility, under the assumption that the dy…

2014-06-02abs ↗pdf ↗

Quantum state preparation framework speeds up basket option pricing.

problem Limited practical benefit of quantum amplitude estimation due to state-preparation depth.
method Structure-aware tensor-train rank-based variational state preparation.
result State-preparation depth scaling replaced with linear scaling, maintaining low basket-pricing errors.

Flat plumbing basket surfaces of links were introduced to study the geometry of the complement of the links. In present article, we study links of the flat plumbing basket numbers 44 or less using a special presentation of the flat plumbing basket surfaces. We find a complete classification theorem of links of the fla…

2014-12-25abs ↗pdf ↗

A flat plumbing basket is a Seifert surface consisting of a disk and bands contained in distinct pages of the disk open book decomposition of the 3-sphere. In this paper, we examine close connections between flat plumbing baskets and the contact structure supported by the open book. As an application we give lower boun…

2017-10-31abs ↗pdf ↗

News recommender systems are aimed to personalize users experiences and help them to discover relevant articles from a large and dynamic search space. Therefore, news domain is a challenging scenario for recommendations, due to its sparse user profiling, fast growing number of items, accelerated item's value decay, and…

2018-07-31abs ↗pdf ↗

Method calibrates basket options using rearranged samples from constituent processes.

problem Calibrate basket options with non-linear dependency structure.
method Propose a method to extract dependency structure from market data through systematic sampling rearrangement, then calibrate a local volatility model.
result Efficiently calibrates basket options with near-perfect accuracy.

A flat plumbing basket is a surface consisting a disk and finitely many bands which are contained in distinct pages of the trivial open book decomposition of S3\mathbf{S}^{3}. In this paper, we construct a Legendrian link from a flat plumbing basket, and we describe a relation among the self-linking number, the Thursto…

2017-09-26abs ↗pdf ↗

The paper solves the skewness problem in high-dimensional basket options.

problem Inconsistent skewness between individual stock options and basket options on an index.
method Developed an effective local volatility model and calibrated the basket to the index smile using a jump-diffusion model.
result The method resolves the skewness issue, matching the index smile in basket option prices.

Generative model prices basket options efficiently.

problem Real-time pricing of basket options with varying market inputs.
method Truncated path signatures and Mixture Density Networks (MDN) for learning the terminal density.
result The model produces small pricing errors and matches Monte Carlo simulations closely.

The study analyzes the differences between physical and risk-neutral correlation estimates for equity baskets.

problem Analyzing the differences between physical and risk-neutral correlation estimates for equity baskets.
method Assumed equicorrelation, reduced dimensionality, approximated ICS from implied volatilities, analyzed dynamics using dynamic semiparametric factor model.
result Proposed profitability improvement schemes based on implied correlation forecasts.

Word embeddings are a powerful approach for capturing semantic similarity among terms in a vocabulary. In this paper, we develop exponential family embeddings, a class of methods that extends the idea of word embeddings to other types of high-dimensional data. As examples, we studied neural data with real-valued observ…

2016-08-02abs ↗pdf ↗

Determinantal point processes (DPPs) are an elegant model for encoding probabilities over subsets, such as shopping baskets, of a ground set, such as an item catalog. They are useful for a number of machine learning tasks, including product recommendation. DPPs are parametrized by a positive semi-definite kernel matrix…

2016-08-15abs ↗pdf ↗

New formulas for pricing Asian and basket options using stochastic expansion.

problem Pricing Asian and basket options under time-dependent parameters.
method Stochastic Taylor expansion around a log-normal proxy model.
result Highly accurate approximations for Asian options and vanilla options with discrete dividends.

New approximations for Asian basket spread options using stochastic Taylor expansions.

problem Pricing Asian basket spread options under the Black-Scholes model.
method Stochastic Taylor expansion applied to a log-normal proxy model.
result Highly accurate approximations for Asian and spread options, without numerical integration.

System recommends workouts and predicts success rates using RNNs.

problem Promoting healthy lifestyles through personalized exercise recommendations.
method Two interconnected recurrent neural networks (RNNs) using historical workout data.
result Interconnected-RNN model predicts exercise success rates with improved accuracy.

Algorithm improves query recommendations with immediate user feedback.

problem Lack of adaptability to immediate user feedback in query recommendation algorithms.
method Augmented transformer-based causal language models with multi-armed bandit framework.
result Substantial improvement in per-round regret compared to state-of-the-art models.