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.
We discuss the turnpike property for optimal investment and consumption problems. We find there exists a threshold value that determines the turnpike property for investment policy. The threshold value only depends on the Sharpe ratio, the riskless interest rate and the discount rate. We show that if utilities behave a…
We prove that within a certain threshold, the odd Betti numbers of any compact almost-hermitian manifold satisfying a degenerate Kähler condition are even, and the even Betti numbers are strictly positive.
problem The topology of Kähler manifolds is largely determined by the geometry due to its rigidity.
method We prove that within a certain threshold, the odd Betti numbers of any compact almost-hermitian manifold satisfying a degenerate Kähler condition are even, and the even Betti numbers are strictly positive.
result We prove that within a certain threshold, the odd Betti numbers of any compact almost-hermitian manifold satisfying a degenerate Kähler condition are even, and the even Betti numbers are strictly positive.
We consider a univariate semimartingale model for (the logarithm of) an asset price, containing jumps having possibly infinite activity (IA). The nonparametric threshold estimator of the integrated variance IV proposed in Mancini 2009 is constructed using observations on a discrete time grid, and precisely it sums up t…
We consider the problem of sparsity-constrained M-estimation when both explanatory and response variables have heavy tails (bounded 4-th moments), or a fraction of arbitrary corruptions. We focus on the k-sparse, high-dimensional regime where the number of variables d and the sample size n are related through $…
Large-scale non-convex sparsity-constrained problems have recently gained extensive attention. Most existing deterministic optimization methods (e.g., GraSP) are not suitable for large-scale and high-dimensional problems, and thus stochastic optimization methods with hard thresholding (e.g., SVRGHT) become more attract…
Warrants with stock price dependent threshold conditions give the right to buy specially issued stocks, if the performance of the stock price satisfies some requirements. Existence of these derivatives changes the price process of the underlying. We show that in the presence of such warrants one cannot assume that the …
Iterative hard thresholding (IHT) is a projected gradient descent algorithm, known to achieve state of the art performance for a wide range of structured estimation problems, such as sparse inference. In this work, we consider IHT as a solution to the problem of learning sparse discrete distributions. We study the hard…
This paper tackles fair Bayes-optimal classifiers under predictive parity, proving their limitations and proposing a new algorithm.
problem Ensuring fair Bayes-optimal classifiers under predictive parity, especially when group performance levels vary widely.
method Proving the limitations of fair Bayes-optimal classifiers under predictive parity and proposing a new adaptive thresholding algorithm, FairBayes-DPP.
result Fair Bayes-optimal classifiers under predictive parity may not hold if group performance levels vary widely, leading to within-group unfairness.
This paper aims at developing a new method by which to build a data-driven portfolio featuring a target risk-return. We first present a comparative study of recurrent neural network models (RNNs), including a simple RNN, long short-term memory (LSTM), and gated recurrent unit (GRU) for selecting the best predictor to u…
In active learning, the user sequentially chooses values for feature X and an oracle returns the corresponding label Y. In this paper, we consider the effect of feature noise in active learning, which could arise either because X itself is being measured, or it is corrupted in transmission to the oracle, or the o…
Iterative thresholding algorithms seek to optimize a differentiable objective function over a sparsity or rank constraint by alternating between gradient steps that reduce the objective, and thresholding steps that enforce the constraint. This work examines the choice of the thresholding operator, and asks whether it i…
Canary optimizes VaR-constrained RL problems with a conservative bound using Cantelli's inequality.
problem Optimizing reinforcement learning policies under VaR constraints in dense cost regimes.
method Employing Cantelli's inequality to create a conservative and smooth bound on VaR constraints based on moments of cost returns. Extending trust-region framework for worst-case bounds on policy improvement and constraint violation.
result Canary reliably satisfies VaR constraints with fewest violations and earliest permanent satisfaction, while maintaining reward competitiveness.
On a compact Kähler manifold, we introduce a notion of almost nonpositivity for the holomorphic sectional curvature, which by definition is weaker than the existence of a Kähler metric with semi-negative holomorphic sectional curvature. We prove that a compact Kähler manifold of almost nonpositive holomorphic sectional…
We consider in this paper a general two-sided jump-diffusion risk model that allows for risky investments as well as for correlation between the two Brownian motions driving insurance risk and investment return. We first introduce the model and then find the integro-differential equations satisfied by the Gerber-Shiu f…
Adaptive algorithm for outlier detection by balancing arm exploration and threshold estimation.
problem Identifying outliers in a set of rewards where the threshold is a function of all rewards.
method Adaptively updated confidence interval for the threshold based on previous rounds' estimates, balancing exploration of individual arms and the outlier threshold.
result Efficient algorithm with reduced sample complexity for outlier detection.
In this paper we studied about the wavelet identification of the thresholds and time delay for more general case without the constraint that the time delay is smaller than the order of the model. Here we composed an empirical wavelet from the SETAR (Self-Exciting Threshold Autoregressive) model and identified the thres…
In the work of Ammann, Dahl and Humbert it has turned out that the Yamabe invariant on closed manifolds is a bordism invariant below a certain threshold constant. A similar result holds for a spinorial analogon. These threshold constants are characterized through Yamabe-type equations on products of spheres with rescal…
Although the threshold network is one of the most used tools to characterize the underlying structure of a stock market, the identification of the optimal threshold to construct a reliable stock network remains challenging. In this paper, the concept of dynamic consistence between the threshold network and the stock ma…
New method trains neural networks with threshold activation functions efficiently.
problem Training neural networks with threshold activation functions is challenging due to zero gradients.
method We study weight decay regularized training problems of deep neural networks with threshold activations, showing they can be formulated as convex optimization problems.
result Regularized deep threshold network training problems can be formulated as standard convex optimization problems, paralleling the LASSO method.