New method optimizes resource allocation for uncertain tasks.
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.
Trend · papers per month
Hashing, or learning binary embeddings of data, is frequently used in nearest neighbor retrieval. In this paper, we develop learning to rank formulations for hashing, aimed at directly optimizing ranking-based evaluation metrics such as Average Precision (AP) and Normalized Discounted Cumulative Gain (NDCG). We first o…
A central problem in ranking is to design a ranking measure for evaluation of ranking functions. In this paper we study, from a theoretical perspective, the widely used Normalized Discounted Cumulative Gain (NDCG)-type ranking measures. Although there are extensive empirical studies of NDCG, little is known about its t…
Improved product recommendations using deep learning.
Top-N-Rank improves top N item recommendations in scalable recommender systems.
It is of increasing importance to develop learning methods for ranking. In contrast to many learning objectives, however, the ranking problem presents difficulties due to the fact that the space of permutations is not smooth. In this paper, we examine the class of rank-linear objective functions, which includes popular…
We investigate the problem of optimal dividend distribution for a company in the presence of regime shifts. We consider a company whose cumulative net revenues evolve as a Brownian motion with positive drift that is modulated by a finite state Markov chain, and model the discount rate as a deterministic function of the…
We consider a financial contract that delivers a single cash flow given by the terminal value of a cumulative gains process. The problem of modelling and pricing such an asset and associated derivatives is important, for example, in the determination of optimal insurance claims reserve policies, and in the pricing of r…
Perceptron is a classic online algorithm for learning a classification function. In this paper, we provide a novel extension of the perceptron algorithm to the learning to rank problem in information retrieval. We consider popular listwise performance measures such as Normalized Discounted Cumulative Gain (NDCG) and Av…
Proposes HBayes for hierarchical Bayesian recommendation learning.
Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.
This paper improves model robustness to underrepresented groups using ranking metrics and reweighting.
We study revenue optimization learning algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation for a good and seeks to maximize his cumulative discounted surplus. For this setting, first, we propose a novel algorithm that never decreases …
We introduce the logistic model of consumption growth, which captures a negative feedback loop preventing an unlimited growth of consumption due to finite biophysical resources of our planet. This simple dynamic model allows for derivation of the expression describing the declining long-term tail of a social discount c…
Paper characterizes minimax regret rates for online ranking with top-k feedback.
Study optimizes dividend payout and funding timing in risky financial scenarios.
Improved RL algorithm with linear MDPs for offline learning with partial data coverage.
In this paper we assume the insurance wealth process is driven by the compound Poisson process. The discounting factor is modelled as a geometric Brownian motion at first and then as an exponential function of an integrated Ornstein-Uhlenbeck process. The objective is to maximize the cumulated value of expected discoun…
Logarithmic regret achieved in Q-learning with positive gap.
Challenge identifies best-performing stocks over 6 months using financial predictors.
Overview of risk-sensitive Markov decision processes with Optimized Certainty Equivalent.
Study resolves duality gap in optimal consumption with random income termination.
Paper defines the payback period for nonconventional cash flows using axioms.
We consider an insurance entity endowed with an initial capital and a surplus process modelled as a Brownian motion with drift. It is assumed that the company seeks to maximise the cumulated value of expected discounted dividends, which are declared or paid in a foreign currency. The currency fluctuation is modelled as…
This paper concerns the dual risk model, dual to the risk model for insurance applications, where premiums are surplus-dependent. In such a model premiums are regarded as costs, while claims refer to profits. We calculate the mean of the cumulative discounted dividends paid until ruin, if the barrier strategy is applie…
New concept of Blackwell regret for reinforcement learning with sparse rewards.
We consider an individual or household endowed with an initial capital and an income, modeled as a deterministic process with a continuous drift rate. At first, we model the discounting rate as the price of a zero-coupon bond at zero under the assumption of a short rate evolving as an Ornstein-Uhlenbeck process. Then, …
We consider a two-dimensional optimal dividend problem in the context of two branches of an insurance company with compound Poisson surplus processes dividing claims and premia in some specified proportions. We solve the stochastic control problem of maximizing expected cumulative discounted dividend payments (among al…
New RL formulation for maximizing maximum reward in molecule generation.
Improved off-policy reinforcement learning by discounting and soft normalization.
A new KD model for collaborative filtering improves top-N recommendation performance.
DO-IQS recovers optimal stopping region from expert trajectories, addressing specific challenges.
Algorithm extracts deterministic PDFA from probabilistic models with improved performance.
The paper studies reward concentration in MDPs, covering asymptotic and non-asymptotic settings.
Many modern commercial sites employ recommender systems to propose relevant content to users. While most systems are focused on maximizing the immediate gain (clicks, purchases or ratings), a better notion of success would be the lifetime value (LTV) of the user-system interaction. The LTV approach considers the future…
Proposes efficient stochastic algorithms for optimizing NDCG with provable convergence guarantees.
In this study we prove the existence of statistical arbitrage opportunities in the Black-Scholes framework by considering trading strategies that consists of borrowing from the risk free rate and taking a long position in the stock until it hits a deterministic barrier level. We derive analytical formulas for the expec…
Deep neural networks decompose SDF into linear and nonlinear components.
Optimizes American option exercise timing with discounted Brownian bridge model.
2024 saw Bitcoin ETF approval, offering regulated exposure.
We illustrate a problem in the self-financing condition used in the papers "Funding beyond discounting: collateral agreements and derivatives pricing" (Risk Magazine, February 2010) and "Partial Differential Equation Representations of Derivatives with Counterparty Risk and Funding Costs" (The Journal of Credit Risk, 2…
The paper analyzes Q-learning in 2-player Markov games and provides gap-dependent logarithmic regret bounds.
Data science enhances knot theory by analyzing invariant relations.
In this paper we consider dividend problem for an insurance company whose risk evolves as a spectrally negative Lévy process (in the absence of dividend payments) when Parisian delay is applied. The objective function is given by the cumulative discounted dividends received until the moment of ruin when so-called barri…
Are large scale research programs that include many projects more productive than smaller ones with fewer projects? This problem of economy of scale is particularly relevant for understanding recent mergers in particular in the pharmaceutical industry. We present a quantitative theory based on the characterization of d…
In this paper, we study the optimal control problem for a company whose surplus process evolves as an upward jump diffusion with random return on investment. Three types of practical optimization problems faced by a company that can control its liquid reserves by paying dividends and injecting capital. In the first pro…
Probabilistic proof of smooth boundaries in optimal stopping problems.
Optimal exit strategies of CPT gamblers in unfair gambles