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.

169,051 papers · 148 categories

Trend · papers per month

2.5%5.0%7.5%10.0% · Jan 199519922001200920172026
48 results for discounted cumulative gain

New method optimizes resource allocation for uncertain tasks.

problem Optimal resource allocation for uncertain tasks with limited capacity.
method Formulated as an assignment problem, optimized using learning to rank with net discounted cumulative gain.
result Achieves higher expected profit and precision compared to classification methods.

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…

2017-05-23abs ↗pdf ↗

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…

2013-04-24abs ↗pdf ↗

Top-N-Rank improves top N item recommendations in scalable recommender systems.

problem Improving top N item recommendations in scalable recommender systems.
method Proposes a novel list-wise Learning-to-Rank model optimizing a variant of DCG objective function, incorporating weights for implicit feedback.
result Significant improvement in ranking quality for top N recommendations.

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…

2011-06-09abs ↗pdf ↗

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…

2008-12-29abs ↗pdf ↗

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…

2007-10-15abs ↗pdf ↗

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…

2015-08-04abs ↗pdf ↗

Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.

problem Optimal stopping problems with finite-time horizon and state-dependent discounting.
method Linear diffusion process, time-homogeneous gain function, fine regularity properties, continuity and strict monotonicity proof.
result Proves continuity and strict monotonicity of the optimal stopping boundary under mild assumptions.

Improved RL algorithm with linear MDPs for offline learning with partial data coverage.

problem Efficient offline RL with linear MDPs under partial data coverage.
method Primal-dual algorithm with O(ε2)O(ε^{-2}) sample complexity.
result First computationally efficient algorithm with O(ε2)O(ε^{-2}) sample complexity for offline RL with linear MDPs under partial data coverage.

Challenge identifies best-performing stocks over 6 months using financial predictors.

problem Identifying the best performing stocks over a 6-month period.
method Analyzed financial predictors and semi-annual returns; used various models including neural networks and boosting algorithms.
result Top six participants used diverse approaches, showcasing varied solutions.

Overview of risk-sensitive Markov decision processes with Optimized Certainty Equivalent.

problem Optimizing decision-making under risk in Markov processes.
method Analyzes risk-sensitive criteria using Optimized Certainty Equivalent, including entropic risk and Conditional Value-at-Risk.
result Conditions for the existence of optimal policies and solution procedures are provided.

Paper defines the payback period for nonconventional cash flows using axioms.

problem Defining the payback period for nonconventional cash flows is challenging.
method Used axiomatic approach to define the payback period.
result The last break-even point of the project balance is the only definition consistent with 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…

2016-03-24abs ↗pdf ↗

New concept of Blackwell regret for reinforcement learning with sparse rewards.

problem Sparse rewards in long horizon MDPs.
method Formalization of myopic discount factors, value functions, and policies in terms of Blackwell optimality; introduction of Blackwell regret.
result Selecting a discount factor for zero Blackwell regret becomes arbitrarily hard in long horizon MDPs.

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, …

2016-03-31abs ↗pdf ↗

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…

2016-03-22abs ↗pdf ↗

New RL formulation for maximizing maximum reward in molecule generation.

problem Traditional RL frameworks do not fit real-world applications like drug discovery.
method Formulated a new objective function to maximize maximum reward, derived Bellman equation, introduced operators, and proved convergence.
result Achieved state-of-the-art results in molecule generation.

A new KD model for collaborative filtering improves top-N recommendation performance.

problem Challenges in applying KD to recommender models due to feedback sparsity and ambiguity.
method Proposes a new KD model (CD) for collaborative filtering, reformulating a loss function, using probabilistic rank-aware sampling, and developing training strategies.
result Outperforms state-of-the-art methods by 2.7-33.2% in hit rate (HR) and 2.7-29.1% in NDCG.

DO-IQS recovers optimal stopping region from expert trajectories, addressing specific challenges.

problem Recovering optimal stopping region from expert trajectories with unknown gain functions.
method Dynamics-Aware Offline Inverse Q-Learning incorporating temporal information and confidence-based oversampling.
result Demonstrated performance on real and artificial data, including optimal intervention for critical events.

Algorithm extracts deterministic PDFA from probabilistic models with improved performance.

problem Learning deterministic models from probabilistic ones with noise.
method Adapted L* algorithm for probabilistic settings, using conditional probabilities and local tolerance.
result Achieves better performance on WER and NDCG than spectral extraction of WFAs.

The paper studies reward concentration in MDPs, covering asymptotic and non-asymptotic settings.

problem Reward concentration in Markov Decision Processes (MDPs).
method Unified approach to reward concentration in MDPs, including asymptotic and non-asymptotic bounds.
result Rate-equivalent definitions of regret for learning policies.

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…

2017-02-23abs ↗pdf ↗

Proposes efficient stochastic algorithms for optimizing NDCG with provable convergence guarantees.

problem Efficient and provable stochastic methods for maximizing NDCG in deep learning models.
method Formulates novel compositional optimization problems, develops efficient stochastic algorithms with provable convergence guarantees, and proposes practical strategies.
result Stochastic algorithms with provable convergence guarantees for optimizing NDCG and its top-KK variant.

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…

2014-06-21abs ↗pdf ↗

Optimizes American option exercise timing with discounted Brownian bridge model.

problem Optimizing American option exercise timing under special market conditions.
method Modeling terminal price as a Brownian bridge with future information disclosure and discount factor inclusion.
result Characterization and numerical computation of optimal stopping boundary with discount factor.

The paper analyzes Q-learning in 2-player Markov games and provides gap-dependent logarithmic regret bounds.

problem Analyzing the cumulative regret of Nash Q-learning in 2-player turn-based stochastic Markov games.
method Proposed gap-dependent logarithmic upper bounds for cumulative regret in episodic tabular setting and discounted game setting.
result The proposed bounds match theoretical lower bounds up to a logarithmic term.

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…

2000-01-31abs ↗pdf ↗

Probabilistic proof of smooth boundaries in optimal stopping problems.

problem Continuous differentiability of time-dependent optimal boundaries in optimal stopping problems.
method Local probabilistic arguments for a wider range of conditions.
result First probabilistic proof of continuous differentiability under general conditions.

Optimal exit strategies of CPT gamblers in unfair gambles

problem Optimal exit strategies of gamblers with CPT preferences in games with strictly negative expected payoffs
method Formulating the problem as an optimal stopping problem on asymmetric random walks, applying geometric transformation, randomized strategies, and changing the decision variable
result The unfair problem in the infinite time horizon has finite values for a wide range of CPT parameter specifications