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

Trend · papers per month

24497397 · Jun 202019922001200920172026
48 results for user departures

New bandit model accounts for user departures in recommender systems.

problem Capturing user departures in recommender systems with multi-armed bandits.
method Proposes a novel multi-armed bandit setup with two types of users and analyzes optimal and efficient algorithms.
result Achieves optimal and efficient learning algorithms for user types and reward probabilities.

We investigate a novel cluster-of-bandit algorithm CAB for collaborative recommendation tasks that implements the underlying feedback sharing mechanism by estimating the neighborhood of users in a context-dependent manner. CAB makes sharp departures from the state of the art by incorporating collaborative effects into …

2016-08-06abs ↗pdf ↗

We consider the problem of efficiently constructing cheap and novel round trip flight itineraries by combining legs from different airlines. We analyse the factors that contribute towards the price of such itineraries and find that many result from the combination of just 30% of airlines and that the closer the departu…

2018-12-04abs ↗pdf ↗

This study identifies RwD crash patterns on rural two-lane highways under different lighting conditions.

problem Insufficient investigation of RwD crashes under varying lighting conditions.
method Data mining using association rules mining (ARM) on crash database.
result Interesting crash patterns and risk factors identified under different lighting conditions.

This paper improves indoor positioning accuracy by deploying reference nodes to ensure Line-of-Sight.

problem Systematic bias errors in indoor positioning due to non-LoS propagation.
method Model indoor service area as a graph, partition into cliques for reference nodes, set minimum distance and angle parameters.
result Guaranteed LoS to reference nodes improves indoor positioning accuracy and precision.

Proposes a machine learning predictor for survey data.

problem Limited integration of machine learning in traditional surveys.
method Predictor supported by machine learning algorithms, analyzing departures from model assumptions.
result Machine learning predictors are a good alternative, even under small departures from model assumptions.

We develop a framework especially suited to the autocorrelation properties observed in financial times series, by borrowing from the physical picture of turbulence. The success of our approach as applied to high frequency foreign exchange data is demonstrated by the overlap of the curves in Figure (1), since we are abl…

1997-09-11abs ↗pdf ↗

This paper formulates a model of utility for a continuous time framework that captures the decision-maker's concern with ambiguity about both the drift and volatility of the driving process. At a technical level, the analysis requires a significant departure from existing continuous time modeling because it cannot be d…

2011-03-08abs ↗pdf ↗

As a consequence of the dependence experienced in loan portfolios, the standard binomial test which is based on the assumption of independence does not appear appropriate for validating probabilities of default (PDs). The model underlying the new rules for minimum capital requirements (Basle II) is taken as a point of …

2003-05-02abs ↗pdf ↗

AGCA approximates angular variation on the unit sphere, reducing extremal dependence problems to eigenanalysis.

problem Approximating angular variation in multivariate extremes.
method Anchored geodesic component analysis (AGCA) approximates angular variation by great subspheres constrained to pass through a chosen reference direction.
result AGCA finds concentrated tail directions in daily equity-portfolio losses, explaining about 91% of anchored variation.

Federated learning involves training statistical models over remote devices or siloed data centers, such as mobile phones or hospitals, while keeping data localized. Training in heterogeneous and potentially massive networks introduces novel challenges that require a fundamental departure from standard approaches for l…

2019-08-21abs ↗pdf ↗

Enhances conformal geometry in higher dimensions with infinite-dimensional algebra.

problem Finite-dimensional group of conformal transformations in higher dimensions.
method Derived deformation theory of ambitwistor space of complex null-geodesics.
result Infinite-dimensional dg-Lie algebra incorporating symmetries and conformal structure deformations.

We prove that the default times (or any of their minima) in the dynamic Gaussian copula model of Cr{é}pey, Jeanblanc, and Wu (2013) are invariance times in the sense of Cr{é}pey and Song (2017), with related invariance probability measures different from the pricing measure. This reflects a departure from the immersion…

2017-02-10abs ↗pdf ↗

Robust Bayesian models are appealing alternatives to standard models, providing protection from data that contains outliers or other departures from the model assumptions. Historically, robust models were mostly developed on a case-by-case basis; examples include robust linear regression, robust mixture models, and bur…

2015-10-17abs ↗pdf ↗

Study the topological information of map germs using Euler obstruction.

problem Capturing topological information from map germs with complex singular spaces.
method Investigates the Euler obstruction and its relation to local Euler obstruction and Brasselet number.
result Relates Chern number to the number of cusps in a perturbed map-germ.

The paper analyzes how quantization affects the Fisher Information Matrix's dominant eigenvalue.

problem The impact of quantization on the Fisher Information Matrix's dominant eigenvalue.
method The study examines spectral perturbation of the empirical Fisher Information Matrix under in-distribution input and quantized parameter perturbations.
result A bound on the eigenvalue under quantization noise, showing it strictly exceeds the unperturbed value at leading order.

GUIDE-VAE generates user-guided data with improved realism and performance.

problem Generating data points for multi-user datasets while considering user information.
method Conditional generative model that integrates user embeddings and a pattern dictionary-based covariance composition.
result GUIDE-VAE outperforms conventional VAEs in multi-user settings, especially under data imbalance.

Hybrid approach combines user feedback and machine learning for predicting user satisfaction.

problem Measuring user satisfaction in large-scale conversational agent systems.
method Fusion of explicit user feedback and predictions from two machine-learned models trained on different data types.
result Hybrid approach significantly improves user satisfaction predictions.

Ensembles of neural networks (NNs) have long been used to estimate predictive uncertainty; a small number of NNs are trained from different initialisations and sometimes on differing versions of the dataset. The variance of the ensemble's predictions is interpreted as its epistemic uncertainty. The appeal of ensembling…

2018-11-27abs ↗pdf ↗

Empirical evidence suggests that even the most competitive markets are not strictly efficient. Price histories can be used to predict near future returns with a probability better than random chance. Many markets can be considered as {\it favorable games}, in the sense that there is a small probabilistic edge that smar…

1999-01-22abs ↗pdf ↗

CnGAN generates synthetic user preferences for non-overlapped users in cross-network recommender systems.

problem Cross-network recommender solutions ignore non-overlapped users, limiting their applicability.
method Multi-task learning, encoder-GAN architecture, user-based pairwise loss function.
result Generated user preferences improve recommendations for non-overlapped users, achieving superior performance.

New method detects and measures malicious users in recommendation algorithms.

problem Identifying and quantifying malicious user activity in recommendation systems.
method Probabilistic programming for a disentangled model of malicious and regular user behavior.
result Simulation-based measure for quantifying malicious user effects.

Traditional collaborative filtering (CF) based recommender systems tend to perform poorly when the user-item interactions/ratings are highly scarce. To address this, we propose a learning framework that improves collaborative filtering with a synthetic feedback loop (CF-SFL) to simulate the user feedback. The proposed …

2019-10-21abs ↗pdf ↗

A multi-user multi-armed bandit (MAB) framework is used to develop algorithms for uncoordinated spectrum access. The number of users is assumed to be unknown to each user. A stochastic setting is first considered, where the rewards on a channel are the same for each user. In contrast to prior work, it is assumed that t…

2018-07-02abs ↗pdf ↗

The paper proves optimal smoothness for certain Lagrangian graphs with specific Hölder continuity.

problem Optimal regularity for Hölder continuous Hamiltonian stationary Lagrangian graphs.
method Establishing smoothness conditions based on Hölder exponent and Lagrangian phase properties.
result Smoothness of graphs is achieved when Hölder exponent is strictly greater than 1/3 and Lagrangian phase is supercritical.

The paper tackles robust policy learning in multitask contextual bandits with adversarial users.

problem Learning optimal policies in multitask contextual bandits with a small fraction of adversarial users.
method Developed efficient robust mean estimators for both uni-variate and high-dimensional random variables.
result Lower bound of ildeΩ(min(S,A)α2/ε2) ildeΩ(\min(S,A) \cdot α^2 / ε^2) per-user interactions to learn an εε-optimal policy for good users.

In recommender systems, the user-item interaction data is usually sparse and not sufficient for learning comprehensive user/item representations for recommendation. To address this problem, we propose a novel dual-bridging recommendation model (DBRec). DBRec performs latent user/item group discovery simultaneously with…

2019-09-27abs ↗pdf ↗

Study personalizes user experience to maximize rewards with patience budget.

problem Maximizing rewards for a platform while respecting user patience.
method Proposes bandit algorithms for sequential choice with feedback models.
result Upper and lower bounds on regret of order O(N2/3)O(N^{2/3}) and Ω(N2/3)Ω(N^{2/3}).