Classical scaling is shown to be optimal under various noisy conditions.
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.
Trend · papers per month
Hybrid quantum-classical method optimizes financial index tracking.
Investigates quantum vs classical portfolio optimization of 60 stocks.
Diffeologies unify infinite-dimensional geometry and PDEs, enhancing classical function spaces.
Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.
New classical algorithm outperforms quantum in neural network subnetwork selection.
Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is arguably one of the leading quantum algorithms that can outperform classical state-of-the-art methods in the near term. QAOA is a hybrid quant…
Quantum computing improves feature selection in machine learning.
LLMs struggle to optimize hyperparameters efficiently, but hybrid methods can improve performance.
The classical duality theory of Kantorovich and Kellerer for the classical optimal transport is generalized to an abstract framework and a characterization of the dual elements is provided. This abstract generalization is set in a Banach lattice with a order unit. The primal problem is given as the supremum o…
We study the structure of a simple dynamic optimization problem consisting of one state and one control variable, from a physicist's point of view. By using an analogy to a physical model, we study this system in the classical and quantum frameworks. Classically, the dynamic optimization problem is equivalent to a clas…
Quantum annealers aim at solving non-convex optimization problems by exploiting cooperative tunneling effects to escape local minima. The underlying idea consists in designing a classical energy function whose ground states are the sought optimal solutions of the original optimization problem and add a controllable qua…
The issue of constructing a risk minimizing hedge under an additional almost-surely type constraint on the shortfall profile is examined. Several classical risk minimizing problems are adapted to the new setting and solved. In particular, the bankruptcy threat of optimal strategies appearing in the classical risk minim…
Although optimization is the longstanding algorithmic backbone of machine learning, new models still require the time-consuming implementation of new solvers. As a result, there are thousands of implementations of optimization algorithms for machine learning problems. A natural question is, if it is always necessary to…
Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational …
Enhances financial risk quantification in classical models.
Random Function Descent improves optimization in high dimensions.
Optimal contracts are found for agents with quadratic effort costs.
D-Wave hybrid quantum-classical portfolio optimization shows classical decomposition is key, not quantum sampling.
Quantum computing speeds up linear regression training.
Portfolio turnpikes state that, as the investment horizon increases, optimal portfolios for generic utilities converge to those of isoelastic utilities. This paper proves three kinds of turnpikes. In a general semimartingale setting, the abstract turnpike states that optimal final payoffs and portfolios converge under …
Extends GENO framework for GPU optimization of constrained ML problems.
Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks. Here, we fill this gap of knowledge by developing a classical framework for networks based on finding an optimal trade-off between the information content of a…
VQAs use classical optimization to train quantum circuits, promising quantum advantage.
Quantum machine learning: Adiabatic quantum SVM outperforms classical methods.
Quantum algorithm speeds up nested expectation estimation by nearly quadratically.
Hybrid QNN-LSTM predicts financial stock market trends using quantum computing.
We address the statistical and optimization impacts of the classical sketch and Hessian sketch used to approximately solve the Matrix Ridge Regression (MRR) problem. Prior research has quantified the effects of classical sketch on the strictly simpler least squares regression (LSR) problem. We establish that classical …
Quantum circuits optimize financial portfolios faster than classical methods.
This study improves quantum classifiers by optimizing data preprocessing.
Two probability distributions and in second stochastic order can be coupled by a supermartingale, and in fact by many. Is there a canonical choice? We construct and investigate two couplings which arise as optimizers for constrained Monge-Kantorovich optimal transport problems where only supermartingales are al…
Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a smaller transmission rate. Here, we examine this procedure when the intermediate…
Optimization algorithm CoCo improves causal inference from diverse data.
AdaGrad fails to adapt to Hölder-smoothness in composite optimization problems.
We consider an incomplete market with a nontradable stochastic factor and a continuous time investment problem with an optimality criterion based on monotone mean-variance preferences. We formulate it as a stochastic differential game problem and use Hamilton-Jacobi-Bellman-Isaacs equations to find an optimal investmen…
Single tree outperforms random forest in testing accuracy.
A novel Bayesian optimization framework tackles multi-objective constrained problems.
In this work we investigate the optimal proportional reinsurance-investment strategy of an insurance company which wishes to maximize the expected exponential utility of its terminal wealth in a finite time horizon. Our goal is to extend the classical Cramer-Lundberg model introducing a stochastic factor which affects …
Optimal transportation distances are a fundamental family of parameterized distances for histograms. Despite their appealing theoretical properties, excellent performance in retrieval tasks and intuitive formulation, their computation involves the resolution of a linear program whose cost is prohibitive whenever the hi…
Bayesian Optimization using Gaussian Processes is a popular approach to deal with the optimization of expensive black-box functions. However, because of the a priori on the stationarity of the covariance matrix of classic Gaussian Processes, this method may not be adapted for non-stationary functions involved in the op…
End-to-end portfolio optimization using quantum annealing for financial decision problems.
We introduce a variant of Shepp's classical urn problem in which the optimal stopper does not know whether sampling from the urn is done with or without replacement. By considering the problem's continuous-time analog, we provide bounds on the value function and in the case of a balanced urn (with an equal number of ea…
Proposes momentum methods for Lie groups, improving on classical algorithms.
We propose a new objective function for finite-horizon episodic Markov decision processes that better captures Bellman's principle of optimality, and provide an expression for the gradient of the objective.
Pareto optimal centralized risk sharing with multiple agents
Despite the numerous advances, reinforcement learning remains away from widespread acceptance for autonomous controller design as compared to classical methods due to lack of ability to effectively tackle the reality gap. The reliance on absolute or deterministic reward as a metric for optimization process renders rein…
The present paper extends the classical second-order variational problem of Herglotz type to the more general context of the Euclidean sphere S^n following variational and optimal control approaches. The relation between the Hamiltonian equations and the generalized Euler-Lagrange equations is established. This problem…
We address a long-standing open problem in risk theory, namely the optimal strategy to pay out dividends from an insurance surplus process, if the dividend rate can never be decreased. The optimality criterion here is to maximize the expected value of the aggregate discounted dividend payments up to the time of ruin. I…