Metaheuristics optimize portfolios with pre-assignment and margin trading for better risk-adjusted returns.
problem Maximizing returns while minimizing risk in portfolio optimization.
method Incorporates pre-assignment constraints and margin trading strategies using Genetic Algorithms and Particle Swarm Optimization.
result Metaheuristic-based portfolio optimization yields superior risk-adjusted returns compared to traditional methods.
We show that if (T2,g) is a class A Lorentzian 2-torus with timelike poles, then there exists a Lipschitz foliation by complete future-directed timelike geodesics with any pre-assigned asymptotic direction in the interior of the stable time cone. This is done by constructing certain C1,1 solutions to…
We propose a new method for supervised learning, especially suited to wide data where the number of features is much greater than the number of observations. The method combines the lasso (ℓ1) sparsity penalty with a quadratic penalty that shrinks the coefficient vector toward the leading principal components of …
The article proposes a method to make valid insurance claim predictions without relying on specific models.
problem Prediction of insurance claims using statistical models can be unreliable due to model misspecification, selection effects, and lack of finite-sample validity.
method The article employs conformal prediction, a machine learning strategy that is model-free and tuning-parameter-free, ensuring finite-sample validity.
result The proposed method guarantees valid predictions at a pre-assigned coverage probability level and performs well in insurance applications, including meeting Solvency II requirements.
BRTR improves robust tensor completion with automatic rank detection.
problem Robust tensor completion from incomplete data with outliers.
method Bayesian robust tensor ring decomposition (BRTR) with variational Bayesian (VB) algorithm.
result Automatic detection of TR rank and improved performance over state-of-the-art methods.
In this paper we introduce a projection method for the space of probability distributions based on the differential geometric approach to statistics. This method is based on a direct L2 metric as opposed to the usual Hellinger distance and the related Fisher Information metric. We explain how this apparatus can be used…
Paper proposes GSSNMF for legal document classification and topic modeling.
problem Lack of methods that can both classify and model topics with guidance.
method Guided Semi-Supervised Non-negative Matrix Factorization (GSSNMF).
result Improves both classification accuracy and topic coherence.
Natural experiment dataset reveals inconsistent treatment effect estimators.
problem Inconsistent results from over 20 estimators on a new dataset.
method Created a benchmark to evaluate estimator accuracy, derived variance formula, introduced new estimator.
result Doubly robust estimators outperform others by orders of magnitude.
We consider the problem of variable selection in high-dimensional statistical models where the goal is to report a set of variables, out of many predictors X1,…,Xp, that are relevant to a response of interest. For linear high-dimensional model, where the number of parameters exceeds the number of samples $(p…
Multiple hypothesis testing is a core problem in statistical inference and arises in almost every scientific field. Given a set of null hypotheses H(n)=(H1,…,Hn), Benjamini and Hochberg introduced the false discovery rate (FDR), which is the expected proportion of false positives among rejected nu…
EDD uses entropy of distance distributions to cluster unlabeled data.
problem Challenges in clustering unlabeled high-dimensional data.
method EDD employs Shannon entropy to quantify distance distribution peaks.
result EDD detects varying degrees of clustering sensitivity.