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

Trend · papers per month

57113170226 · Jun 202019922001200920172026
48 results for threshold strategy

The paper considers an investment timing problem appearing in real options theory. Present values from an investment project are modeled by general diffusion process. We prove necessary and sufficient conditions under which an optimal investment time is induced by threshold strategy. We study also the conditions of opt…

2015-11-02abs ↗pdf ↗

Study fairness in ordinal regression using threshold models.

problem Fairness in ordinal regression predictions.
method Adapted fairness notions from fair ranking; use threshold model with scoring function and thresholds; apply binary classification for scoring function and local search for thresholds.
result Generalization guarantees on predictor error and fairness violation; effectiveness demonstrated in experiments.

The paper finds optimal threshold strategies for insurance companies with a positive terminal value at creeping ruin.

problem Optimizing dividend payments in an insurance company's surplus process with a positive terminal value at creeping ruin.
method Using fluctuation theory, the paper derives explicit formulas for the objective function and shows the optimality of threshold strategies.
result Threshold strategies are optimal for the dividend optimization problem under certain conditions.

The paper analyzes optimal dividend and capital injection strategies under time-inconsistent preferences.

problem Optimal dividend and capital injection strategies under time-inconsistent preferences.
method Diffusion risk model with general discount functions, weak equilibrium definition, HJB equation system.
result Explicit solutions and threshold types of optimal strategies derived under different discount functions.

We consider the problem of the optimal trading strategy in the presence of linear costs, and with a strict cap on the allowed position in the market. Using Bellman's backward recursion method, we show that the optimal strategy is to switch between the maximum allowed long position and the maximum allowed short position…

2012-03-27abs ↗pdf ↗

A new algorithm improves sample complexity for thresholding in Monte Carlo Tree Search.

problem Determining if the root node value of a tree is at least a given threshold.
method Developed a δ-correct sequential sampling algorithm based on the Track-and-Stop strategy.
result Ratio-based modification of D-Tracking strategy reduces sample complexity and computational cost.

The paper optimizes insurer's dividend, reinsurance, and capital injection strategies for two collaborating business lines.

problem Maximizing expected total dividend payments while managing risk and preventing ruin.
method Solving the problem using a closed-form value function for optimal strategies.
result Optimal strategies include threshold dividend payout, decreasing reinsured risk, and capital injection to prevent ruin.

Optimal dividend strategy with irreversible reinsurance constraints.

problem Maximizing dividends while adhering to ratcheting and irreversible reinsurance constraints.
method Modeling dividend and reinsurance levels as nondecreasing processes, solving Hamilton-Jacobi-Bellman equation.
result Threshold strategy is optimal for maximizing discounted dividends until ruin.

Paper shows equivalence between two dividend preference models.

problem Understanding investor and firm preferences for dividends.
method Formulated Epstein-Zin preference, proved equivalence with Maenhout's model.
result Robust dividend policy is equivalent to a threshold strategy based on surplus process.

Optimal threshold resetting reduces search time for multiple diffusive searchers.

problem Optimizing search time for multiple diffusive searchers in a one-dimensional space.
method Threshold resetting (TR) is introduced as an event-driven optimization strategy, coupling resetting to the internal dynamics of searchers.
result Optimal threshold distance uu significantly reduces mean first-passage time for N2N \geq 2 searchers, with a minimum at Nopt(u)N_{\mathrm{opt}}(u).

We study a specific \textit{combinatorial pure exploration stochastic bandit problem} where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and \textit{for a fixed time horizon}. We propose a parameter-free algorithm based on an original heuristic, and prove…

2016-05-27abs ↗pdf ↗

In this work, a heuristic as operational tool to estimate the lactate threshold and to facilitate its integration into the training process of recreational runners is proposed. To do so, we formalize the principles for the lactate threshold estimation from empirical data and an iterative methodology that enables experi…

2019-03-06abs ↗pdf ↗

We study optimal double stopping problems driven by a Brownian bridge. The objective is to maximize the expected spread between the payoffs achieved at the two stopping times. We study several cases where the solutions can be solved explicitly by strategies of threshold type.

2014-09-08abs ↗pdf ↗

We win EVA2025 by estimating extreme precipitation events using Peaks Over Thresholds and martingale testing.

problem Estimating the probability of extreme precipitation events with limited data.
method Modeling Peaks Over Thresholds with an exponential distribution and using martingale testing for evaluation.
result Our method outperforms other approaches in estimating extreme precipitation events.

Paper improves recommendation systems by optimizing sequence of items for clicks.

problem Improving recommendation systems robustness against bots and clicks.
method Minimizing pairwise ranking loss over sequences of items, with thresholds to prevent bot influence.
result The proposed algorithms converge and outperform existing methods in various ranking measures.

In this paper we study the optimal dividend problem for a company whose surplus process evolves as a spectrally positive Levy process. This model including the dual model of the classical risk model and the dual model with diffusion as special cases. We assume that dividends are paid to the shareholders according to ad…

2013-02-09abs ↗pdf ↗

New method learns sparse distributions by thresholding samples, improving performance and efficiency.

problem Sparse coding optimization in high-dimensional problems is computationally expensive and inefficient.
method Proposes a new variational sparse coding approach that learns sparse distributions by thresholding samples.
result Shows superior performance, statistical efficiency, and gradient estimation compared to other sparse distributions.

The paper solves a consumption-investment problem with state-dependent lower bounds.

problem A life-time consumption-investment problem with a state-dependent lower bound on consumption.
method Transformed the problem into a state-independent control problem to apply standard theory.
result Explicit optimal strategies provided for both homogeneous and non-homogeneous constraints.

Researchers calibrate an adaptive Farmer-Joshi model to recover stylized facts in financial markets.

problem Recovering stylized facts in financial markets using the Farmer-Joshi model.
method Calibrated an adaptive Farmer-Joshi model using genetic and Nelder-Mead algorithms, incorporating agent adaptation.
result The adaptive model recovers additional stylized facts, including auto-correlations and kurtosis, compared to the original model.

New auction design uses statistical learning to reduce costs and improve fairness.

problem Designing efficient multi-item auctions with reduced implementation costs and fairness.
method Nonparametric density estimation for credible intervals, two new strategies.
result Strategies consistently outperform alternative methods in revenue maximization and cost reduction.

In this work we propose a simple and easily parallelizable algorithm for multiway graph partitioning. The algorithm alternates between three basic components: diffusing seed vertices over the graph, thresholding the diffused seeds, and then randomly reseeding the thresholded clusters. We demonstrate experimentally that…

2014-06-15abs ↗pdf ↗

Study reveals efficient recovery of multi-modal signals via Bayesian methods and sequential learning.

problem Recovering multiple high-dimensional signals from correlated modalities.
method Bayesian Approximate Message Passing and Sequential Curriculum Learning.
result Sequential learning strategy optimally recovers weak signals in multi-modal settings.

Study evaluates three class imbalance techniques across diverse datasets.

problem Class imbalance in binary classification tasks.
method Synthetic Minority Over-sampling Technique (SMOTE), Class Weights tuning, Decision Threshold Calibration.
result Decision Threshold Calibration is the most consistently effective technique.

Time changes of noise level at Warsaw Stock Market are analyzed using a recently developed method basing on properties of the coarse grained entropy. The condition of the minimal noise level is used to build an efficient portfolio. Our noise level approach seems to be a much better tool for risk estimations than standa…

2005-03-31abs ↗pdf ↗

A cost-effective approach to label acquisition using active learning markets.

problem Improving model fitting and training for predictive analytics.
method Formalizing market clearing as an optimisation problem, integrating budget constraints and improvement thresholds, using two active learning strategies with distinct pricing mechanisms.
result Superior performance with fewer labels acquired compared to conventional methods.

Constant Proportion Portfolio Insurance (CPPI) is a strategy designed to give participation in a risky asset while protecting the invested capital. Some gap risk due to extreme events is often kept by the issuer of the product: a put option on the CPPI strategy is included in the product. In this paper we present a new…

2009-01-09abs ↗pdf ↗

This paper introduces a more efficient method for estimating level sets with a stopping criterion.

problem Efficiently estimating regions where a function exceeds a threshold without exhaustive evaluations.
method Acquisition strategy with a stopping criterion for εε-accurate level set estimation.
result The method satisfies εε-accuracy with a confidence level of 1δ1 - δ and guarantees on lower bounds of performance metrics.

We consider the valuation problem of an (insurance) company under partial information. Therefore we use the concept of maximizing discounted future dividend payments. The firm value process is described by a diffusion model with constant and observable volatility and constant but unknown drift parameter. For transformi…

2016-02-15abs ↗pdf ↗

The paper optimizes insurance strategies for two collaborating business lines.

problem Maximizing dividends and managing risk for two collaborating business lines.
method Closed-form solutions for optimal strategies, including dividend payout, reinsurance, and capital injection.
result Optimal strategies involve pure excess-of-loss reinsurance and transferring reserves to prevent ruin.