Related papers: SmartDCA superiority
We study nonsmooth difference-of-convex programs whose subtracted convex term is a finite maximum of smooth convex functions. In this setting, standard DCA iterations may converge to critical points that are not directionally stationary,…
We proposed a novel dense line spectrum super-resolution algorithm, the DMRA, that leverages dynamical multi-resolution of atoms technique to address the limitation of traditional compressed sensing methods when handling dense point-source…
This study develops and analyzes an optimization model of smart contract adoption under bounded risk, linking structural theory with simulation and real-world validation. We examine how adoption intensity alpha is structurally pinned at a…
The DTW Barycenter Averaging (DBA) algorithm is a widely used algorithm for estimating the mean of a given set of point sequences. In this context, the mean is defined as a point sequence that minimises the sum of dynamic time warping…
Mid-cap companies, generally valued between \$2 billion and \$10 billion, provide investors with a well-rounded opportunity between the fluctuation of small-cap stocks and the stability of large-cap stocks. This research builds upon the…
Self-consistency (SC), a widely used decoding strategy for chain-of-thought reasoning, shows significant gains across various multi-step reasoning tasks but comes with a high cost due to multiple sampling with the preset size. Its variants,…
Smart beta, also known as strategic beta or factor investing, is the idea of selecting an investment portfolio in a simple rule-based manner that systematically captures market inefficiencies, thereby enhancing risk-adjusted returns above…
In this paper we consider the difference-of-convex (DC) programming problems, whose objective function is the difference of two convex functions. The classical DC Algorithm (DCA) is well-known for solving this kind of problems, which…
We consider the multi-period portfolio optimization problem with a single asset that can be held long or short. Due to the presence of transaction costs, maximizing the immediate reward at each period may prove detrimental, as frequent…
We study the problem of optimal long term portfolio selection with a view to beat a benchmark. Two kinds of objectives are considered. One concerns the probability of outperforming the benchmark and seeks either to minimise the decay rate…
The Dynamical Cluster Approximation (DCA) is modified to include disorder. The DCA incorporates non-local corrections to local approximations such as the Coherent Potential Approximation (CPA) by mapping the lattice problem with disorder,…
Centralized monetary policy, leading to persistent inflation, is often inconsistent, untrustworthy, and unpredictable. Algorithmic stablecoins enabled by blockchain technology are promising in solving this problem. Algorithmic stablecoins…
From natural language processing to vision, Scaled Dot Product Attention (SDPA) is the backbone of most modern deep learning applications. Unfortunately, its memory and computational requirements can be prohibitive in low-resource settings.…
Dual averaging and gradient descent with their stochastic variants stand as the two canonical recipe books for first-order optimization: Every modern variant can be viewed as a descendant of one or the other. In the convex regime, these…
This paper introduces the Lagrange Policy for Continuous Actions (LPCA), a reinforcement learning algorithm specifically designed for weakly coupled MDP problems with continuous action spaces. LPCA addresses the challenge of resource…
We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). Incremental variational inference is inspired by incremental EM and provides an alternative to stochastic variational inference. Incremental…
The Combined Algorithm Selection and Hyperparameters optimization (CASH) problem is one of the fundamental problems in Automated Machine Learning (AutoML). Motivated by the success of ensemble learning, recent AutoML systems build post-hoc…
We propose a new approach to perform the boosted difference of convex functions algorithm (BDCA) on non-smooth and non-convex problems involving the difference of convex (DC) functions. The recently proposed BDCA uses an extrapolation step…
Dynamic hedging is the practice of periodically transacting financial instruments to offset the risk caused by an investment or a liability. Dynamic hedging optimization can be framed as a sequential decision problem; thus, Reinforcement…
We use Fourier analysis to access risk in financial products. With it we analyze price changes of e.g. stocks. Via Fourier analysis we scrutinize quantitatively whether the frequency of change is higher than a change in (conserved) company…